Stability and Instability of the MaxWeight Policy

Published Online:https://doi.org/10.1287/moor.2020.1106

References

  • [1] Andrews M, Zhang L (2003) Achieving stability in networks of input-queued switches. IEEE/ACM Trans. Networking 11(5):848–857.Google Scholar
  • [2] Baharian G, Tezcan T (2011) Stability analysis of parallel server systems under longest queue first. Math. Methods Oper. Res. 74(2):257–279.Google Scholar
  • [3] Billingsley P (1999) Convergence of Probability Measures (Wiley, New York).CrossrefGoogle Scholar
  • [4] Bramson M (2008) Stability of queueing networks. Probability Surveys 5:169–345.Google Scholar
  • [5] Bramson M, D’Auria B, Walton N (2017) Proportional switching in first-in, first-out networks. Oper. Res. 65(2):496–513.Google Scholar
  • [6] Bramson M, D’Auria B, Walton N (2019) Addendum to “Stability and instability of the MaxWeight policy”. Preprint, https://arxiv.org/abs/1909.10825.Google Scholar
  • [7] Bramson M, D’Auria B, Walton N (2020) Simulation algorithms for “Stability and instability of the MaxWeight policy“. https://github.com/brdauria/simulation_of_unstable_MaxWeigth_networks.Google Scholar
  • [8] Dai J (1995) On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probabilities 5(1):49–77.CrossrefGoogle Scholar
  • [9] Dimakis A, Walrand J (2006) Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits. Adv. Appl. Probability 38(2):505–521.Google Scholar
  • [10] Georgiadis L, Neely MJ, Tassiulas L (2006) Resource allocation and cross-layer control in wireless networks. Found. Trends Netw. 1(1):1–144.Google Scholar
  • [11] Jiang L, Walrand J (2010) Scheduling and congestion control for wireless and processing networks. Synthesis Lectures Comm. Networks 3(1):1–156.CrossrefGoogle Scholar
  • [12] Kelly F, Yudovina E (2014) Stochastic Networks, vol. 2 (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • [13] Lu SH, Kumar P (1991) Distributed scheduling based on due dates and buffer priorities. IEEE Trans. Automatic Control 36(12):1406–1416.CrossrefGoogle Scholar
  • [14] McKeown N, Mekkittikul A, Anantharam V, Walrand J (1999) Achieving 100% throughput in an input-queued switch. IEEE Trans. Comm. 47(8):1260–1267.CrossrefGoogle Scholar
  • [15] Neely MJ (2010) Stochastic network optimization with application to communication and queueing systems. Synthesis Lectures Comm. Networks 3(1):1–211.CrossrefGoogle Scholar
  • [16] Pedarsani R, Walrand J (2016) Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling. J. Appl. Probability 53(2):421–433.Google Scholar
  • [17] Robert P (2013) Stochastic networks and queues. Rozovskii B, Yor M, eds. Stochastic Modelling and Applied Probability (Springer, Berlin), XVII, 399.Google Scholar
  • [18] Rybko A, Stolyar A (1992) Ergodicity of stochastic processes describing the operation of open queueing networks. Problemy Peredachi Inform. 28(3):3–26.Google Scholar
  • [19] Shah D, Wischik D (2011) Fluid models of congestion collapse in overloaded switched networks. Queueing Systems 69(2):121–143.CrossrefGoogle Scholar
  • [20] Srikant R, Ying L (2013) Communication Networks: An Optimization, Control, and Stochastic Networks Perspective (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • [21] Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automatic Control 37(12):1936–1948.CrossrefGoogle Scholar
  • [22] Tassiulas L, Ephremides A (1993) Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Inform. Theory 39(2):466–478.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.