Universal stability results for low rate adversaries in packet switched networks

In this work, we consider a generalized version of the adversarial model and study the universal stability (stability in any network) of scheduling policies under low load rates. We show that any work-conserving policy is universally stable at any load rate r<(1/d), where d is the largest number of links crossed by any packet. We also show that system-wide time priority policies are universally stable at any load rate r<(1/(d-1)).

[1]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

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

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

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

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

[6]  Jean-Yves Le Boudec,et al.  Delay Bounds in a Network with Aggregate Scheduling , 2000, QofIS.

[7]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[8]  Paul G. Spirakis,et al.  The Range of Stability for Heterogeneous and FIFO Queueing Networks , 2001, Electron. Colloquium Comput. Complex..

[9]  Baruch Awerbuch,et al.  Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.

[10]  Yiwei Thomas Hou,et al.  Fundamental trade-offs in aggregate packet scheduling , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[11]  Don Towsley,et al.  Theories and models for Internet quality of service , 2002, Proc. IEEE.

[12]  Boaz Patt-Shamir,et al.  New stability results for adversarial queuing , 2002, SPAA '02.

[13]  Paul G. Spirakis,et al.  FIFO is Unstable at Arbitrarily Low Rates , 2003, Electron. Colloquium Comput. Complex..

[14]  Ashish Goel,et al.  Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model , 2004, SIAM J. Comput..

[15]  Yiwei Thomas Hou,et al.  Fundamental trade-offs in aggregate packet scheduling , 2005, IEEE Transactions on Parallel and Distributed Systems.

[16]  P. Spirakis,et al.  FIFO is Unstable at Arbitrarily Low Rates ( Even in Planar Networks ) ∗ , .