Randomized scheduling algorithm for queueing networks

Annals of Applied Probability

Volumn 22, Issue 1, 2012, Pages 128-171

  Shah, Devavrat ^a   Shin, Jinwoo ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Aloha; Buffered circuit switched network; Mixing time; Scheduling; Slowly varying Markov chain; Stability; Wireless medium access

Indexed keywords

EID: 84866522993     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/11-AAP763     Document Type: Article

References (34)

1. ASMUSSEN, S. (2003). Applied Probability and Queues: Stochastic Modelling and Applied Probability, 2nd ed. Applications of Mathematics (New York) 51. Springer, New York. MR1978607
2. CHEEGER, J. (1970). A lower bound for the smallest eigenvalue of the Laplacian. In Problems in Analysis (Papers Dedicated to Salomon Bochner, 1969) 195-199. Princeton Univ. Press, Princeton, NJ. MR0402831
3. DAI, J. G. and LIN, W. (2008). Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probab. 18 2239-2299. MR2473656
4. DAI, J. G. and PRABHAKAR, B. (2000). The throughput of switches with and without speedup. In Proceedings of IEEE INFOCOM 556-564. Institute of Electrical and Electronics Engineers, Tel-Aviv, Israel.
5. DIACONIS, P. and STROOCK, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 36-61. MR1097463
6. DIMAKIS, A. and WALRAND, J. (2006). Sufficient conditions for stability of longest-queuefirst scheduling: Second-order properties using fluid limits. Adv. in Appl. Probab. 38 505- 521. MR2264955 (Pubitemid 44057301)
7. DYER, M., FRIEZE, A. andKANNAN, R. (1991). A random polynomial-time algorithm for approximating the volume of convex bodies. J. Assoc. Comput. Mach. 38 1-17. MR1095916
8. FOSS, S. and KONSTANTOPOULOS, T. (2004). An overview of some stochastic stability methods. J. Oper. Res. Soc. Japan 47 275-303. MR2174067 (Pubitemid 40239685)
9. GEORGII, H.-O. (1988). Gibbs Measures and Phase Transitions. de Gruyter Studies in Mathematics 9. de Gruyter, Berlin. MR0956646
10. GIACCONE, P., PRABHAKAR, B. and SHAH, D. (2003). Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE Journal on Selected Areas in Communications High-performance Electronic Switches/routers for High-speed Internet 21 546-559.
11. HASTINGS, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57 97-109.
12. HORN, R. A. and JOHNSON, C. R. (1985). Matrix Analysis. Cambridge Univ. Press, Cambridge. MR0832183
13. JERRUM, M. and SINCLAIR, A. (1993). Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput. 22 1087-1116. MR1237164
14. JIANG, L., SHAH, D., SHIN, J. and WALRAND, J. (2010). Distributed random access algorithm: Scheduling and congesion control. IEEE Trans. Inform. Theory 56 6182-6207.
15. KELLY, F. P. (1991). Loss networks. Ann. Appl. Probab. 1 319-378. MR1111523
16. LOVÁSZ, L. andWINKLER, P. (1998). Mixing times. In Microsurveys in Discrete Probability (Princeton, NJ, 1997) (D. Aldous and J. Propp, eds.). DIMACS Series in Discrete Mathematics and Theoretical Computer Science 41 85-133. Amer. Math. Soc., Providence, RI. MR1630411
17. MARTINELLI, F. (1999). Lectures on Glauber Dynamics for Discrete Spin Models. Lectures on Probability Theory and Statistics (Saint-Flour, 1997). Lecture Notes in Math. 1717 93-191. Springer, Berlin.
18. MCKEOWN, N. (1999). iSLIP: A scheduling algorithm for input-queued switches. IEEE Transactions on Networking 7 188-201.
19. MCKEOWN, N., ANANTHARAM, V. and WALRAND, J. (1996). Achieving 100% throughput in an input-queued switch. In Proceedings of IEEE INFOCOM 296-302. Institute of Electrical and Electronics Engineers, San Francisco, CA.
20. METROPOLIS, N., ROSENBLUTH, A. W., ROSENBLUTH, M. N., TELLER, A. H. and TELLER, E. (1953). Equations of state calculations by fast computing machines. J. Chem. Phys. 21 1087-1092.
21. MEYN, S. P. and TWEEDIE, R. L. (1993). Markov Chains and Stochastic Stability. Springer, London. MR1287609
22. MODIANO, E., SHAH, D. and ZUSSMAN, G. (2006). Maximizing throughput in wireless network via gossiping. In Proceedings of ACM SIGMETRICS/Performance. Association for Computing Machinery, Saint-Malo, France.
23. MONTENEGRO, R. and TETALI, P. (2006). Mathematical aspects of mixing times in Markov chains. Found. Trends Theor. Comput. Sci. 1 x+121. MR2341319
24. RAJAGOPALAN, S., SHAH, D. and SHIN, J. (2009). Network adiabatic theorem: An efficient randomized protocol for contention resolution. In Proceedings ACM SIGMETRICS/ Performance 133-144. Association for Computing Machinery, Seattle, WA.
25. SHAH, D. andWISCHIK, D. J. (2006). Optimal scheduling algorithm for input queued switch. In Proceeding of IEEE INFOCOM. IEEE, Barcelona, Catalunya, Spain.
26. SHAH, D. and WISCHIK, D. J. (2007). Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse. Available at http://arxiv.org/ abs/1004.1995.
27. SINCLAIR, A. (1993). Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, Boston, MA. MR1201590
28. STOLYAR, A. L. (2004). Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14 1-53. MR2023015 (Pubitemid 41449251)
29. TASSIULAS, L. (1998). Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE INFOCOM 2 533-539. IEEE, San Francisco, CA.
30. TASSIULAS, L. and BHATTACHARYA, P. P. (2000). Allocation of interdependent resources for maximal throughput. Stoch. Models 16 27-48. MR1742516
31. TASSIULAS, L. and EPHREMIDES, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Control 37 1936-1948. MR1200609
32. TREVISAN, L. (2001). Non-approximability results for optimization problems on bounded degree instances. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing 453-461 (electronic). ACM, New York. MR2120346 . (Pubitemid 32865760)
33. VERMA, S., CHASKAR, H. and RAVIKANTH, R. (2000). Optical burst switching: A viable solution for terabit ip backbone. IEEE Network 14 48-53.
34. Microsoft research lab. Self organizing neighborhood wireless mesh networks. http://research.microsoft.com/mesh/.