Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

We investigate the stability of packet routing policies in adversarial queueing networks. We provide a simple classification of networks which are stable under any greedy scheduling policy. We show that a network is stable if and only if the underlying undirected connected graph contains at most two edges. We also propose a simple and distributed policy which is stable in an arbitrary adversarial queueing network even for the critical value of the arrival rate r = 1. Finally, a simple and checkable network flow-type load condition is formulated for adaptive adversarial queueing networks, and a policy is proposed which achieves stability under this new load condition. This load condition is a relaxation of the integral network flow-type condition considered previously in the literature.

[1]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[2]  Leandros Tassiulas,et al.  Any work-conserving policy stabilizes the ring with spatial reuse , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[3]  M. Bramson.  Instability of FIFO Queueing Networks , 1994 .

[4]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[5]  Allan Borodin,et al.  Adversarial queueing theory , 1996, STOC '96.

[6]  Leandros Tassiulas,et al.  Any work-conserving policy stabilizes the ring with spatial re-use , 1996, TNET.

[7]  Baruch Awerbuch,et al.  Universal stability results for greedy contention-resolution protocols , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[8]  Maury Bramson,et al.  Convergence to equilibria for fluid models of FIFO queueing networks , 1996, Queueing Syst. Theory Appl..

[9]  Aravind Srinivasan,et al.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria , 1997, STOC '97.

[10]  Panayiotis Tsaparas,et al.  Stability in adversarial queueing theory , 1997 .

[11]  Rafail Ostrovsky,et al.  Adaptive packet routing for bursty adversarial traffic , 1998, STOC '98.

[12]  David Gamarnik.  Stability of adversarial queues via fluid models , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  David Gamarnik,et al.  Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing , 1999, J. Algorithms.

[14]  Ashish Goel.  Stability of networks and protocols in the adversarial queueing model for packet routing , 1999, SODA '99.

[15]  Lisa Zhang,et al.  The effects of temporary sessions on network performance , 2000, SODA '00.

[16]  Matthew Andrews,et al.  Instability of FIFO in session-oriented networks , 2000, SODA '00.

[17]  David Gamarnik.  Using fluid models to prove stability of adversarial queueing networks , 2000, IEEE Trans. Autom. Control..

[18]  David Gamarnik.  On deciding stability of scheduling policies in queueing systems , 2000, SODA '00.