On stability region and delay performance of linear-memory randomized scheduling for time-varying networks

Authors:
Mahdi Lotfinezhad;Ben Liang;Elvino S. Sousa
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada;Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada;Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 13
Cited 0

Convergence rates for Markov chains

SIAM Review
Distributed Fair Resource Allocation in Cellular Networks in the Presence of Heterogeneous Delays

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
User-level performance of channel-aware scheduling algorithms in wireless data networks

IEEE/ACM Transactions on Networking (TON)
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the complexity of scheduling in wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
Distributed approximate matching

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Convergence of proportional-fair sharing algorithms under general conditions

IEEE Transactions on Wireless Communications
Scheduling and performance limits of networks with constantly changing topology

IEEE Transactions on Information Theory
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks

IEEE Journal on Selected Areas in Communications
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Throughput optimal scheduling policies in general require the solution of a complex and often NP-hard optimization problem. Related literature has shown that in the context of time-varying channels, randomized scheduling policies can be employed to reduce the complexity of the optimization problem but at the expense of a memory requirement that is exponential in the number of data flows. In this paper, we consider a linear-memory randomized scheduling policy (LM-RSP) that is based on a pick-and-compare principle in a time-varying network with N one-hop data flows. For general ergodic channel processes, we study the performance of LM-RSP in terms of its stability region and average delay. Specifically, we show that LM-RSP can stabilize a fraction of the capacity region. Our analysis characterizes this fraction as well as the average delay as a function of channel variations and the efficiency of LM-RSP in choosing an appropriate schedule vector. Applying these results to a class of Markovian channels, we provide explicit results on the stability region and delay performance of LM-RSP.