Randomized Scheduling Algorithm for Queueing Networks

There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling policies for constrained queueing network models that arise in the context of emerging communication networks. Here, we consider two representative models. One, a model for the collection of wireless nodes communicating through a shared medium, that represents randomly varying number of packets in the queues at the nodes of networks. Two, a buffered circuit switched network model for an optical core of future Internet, to capture the randomness in calls or flows present in the network. The maximum weight scheduling policy proposed by Tassiulas and Ephremide in 1992 leads to a myopic and stable policy for the packet-level wireless network model. But computationally it is very expensive (NP-hard) and centralized. It is not applicable to the buffered circuit switched network due to the requirement of non-premption of the calls in the service. As the main contribution of this paper, we present a stable scheduling algorithm for both of these models. The algorithm is myopic, distributed and performs few logical operations at each node per unit time.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  J. Cheeger.  A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[3]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[4]  R. Getoor.  Transience and recurrence of Markov processes , 1980 .

[5]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

[6]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[7]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[8]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[9]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[10]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[11]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[12]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[13]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[14]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[15]  Peter Winkler,et al.  Mixing times , 1997, Microsurveys in Discrete Probability.

[16]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[17]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[18]  F. Martinelli.  Lectures on Glauber dynamics for discrete spin models , 1999 .

[19]  R. Ravikanth,et al.  Optical burst switching: a viable solution for terabit IP backbone , 2000 .

[20]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[21]  Paolo Giaccone,et al.  Randomized scheduling algorithms for high-aggregate bandwidth switches , 2003, IEEE J. Sel. Areas Commun..

[22]  S. Foss,et al.  AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS( Network Design, Control and Optimization) , 2004 .

[23]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[24]  Heriot-Watt University.  AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS , 2004 .

[25]  Ravi Montenegro,et al.  Mathematical Aspects of Mixing Times in Markov Chains , 2006, Found. Trends Theor. Comput. Sci..

[26]  Devavrat Shah,et al.  Optimal Scheduling Algorithms for Input-Queued Switches , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[27]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[28]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[29]  J. Dai,et al.  Asymptotic optimality of maximum pressure policies in stochastic processing networks. , 2008, 0901.2451.

[30]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[31]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.