Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Greedy primal-dual algorithm for dynamic resource allocation in complex networks
Queueing Systems: Theory and Applications
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Control Techniques for Complex Networks
Control Techniques for Complex Networks
Scheduling policies for single-hop networks with heavy-tailed traffic
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Throughput optimality of delay-driven maxweight scheduler for a wireless system with flow dynamics
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the flow-level dynamics of a packet-switched network
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling in multichannel wireless networks with flow-level dynamics
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
IEEE/ACM Transactions on Networking (TON)
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
On the Connection-Level Stability of Congestion-Controlled Communication Networks
IEEE Transactions on Information Theory
Dynamic server allocation to parallel queues with randomly varying connectivity
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
MaxWeight scheduling has gained enormous popularity as a powerful paradigm for achieving queue stability and maximum throughput in a wide variety of scenarios. The maximum-stability guarantees however rely on the fundamental premise that the system consists of a fixed set of flows with stationary ergodic traffic processes. In the present paper we examine networks where the population of active flows varies over time, as flows eventually end while new flows occasionally start. We show that MaxWeight policies may fail to provide maximum stability due to persistent inefficient spatial reuse. The intuitive explanation is that these policies tend to serve flows with large backlogs, even when the resulting spatial reuse is not particularly efficient, and fail to exploit maximum spatial reuse patterns involving flows with smaller backlogs. These results indicate that instability of MaxWeight scheduling can occur due to spatial inefficiency in networks with fixed transmission rates, which is fundamentally different from the inability to fully exploit time-varying rates shown in prior work. We discuss how the potential instability effects can be countered by spatial traffic aggregation, and describe some of the associated challenges and performance trade-offs.