MaxWeight Versus BackPressure: Routing and Scheduling in Multichannel Relay Networks

摘要

We study routing and scheduling algorithms for relay-assisted, multichannel downlink wireless networks [e.g., orthogonal frequency-division multiplexing (OFDM)-based cellular systems with relays]. Over such networks, while it is well understood that the BackPressure algorithm is stabilizing (i.e., queue lengths do not become arbitrarily large), its performance (e.g., delay, buffer usage) can be poor. In this paper, we study an alternative—the MaxWeight algorithm—variants of which are known to have good performance in a single-hop setting. In a general relay setting, however, MaxWeight is not even stabilizing (and thus can have very poor performance). In this paper, we study an iterative MaxWeight algorithm for routing and scheduling in downlink multichannel relay networks. We show that, surprisingly, the iterative MaxWeight algorithm can stabilize the system in several large-scale instantiations of this setting (e.g., general arrivals with full-duplex relays, bounded arrivals with half-duplex relays). Furthermore, using both many-channel large-deviations analysis and simulations, we show that iterative MaxWeight outperforms the BackPressure algorithm from a queue-length/delay perspective.