Instability of FIFO in session-oriented networks

Journal of Algorithms

Volumn 50, Issue 2, 2004, Pages 232-245

  Andrews, Matthew ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL PATH ANALYSIS; SCHEDULING; SERVERS; STABILITY CRITERIA; SYSTEMS ANALYSIS;

CONSTANT RATE; SESSION-ORIENTED NETWORKS; STATIC PATHS; TIME INTERVAL;

QUEUEING NETWORKS;

EID: 1442313003     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00096-8     Document Type: Article

References (28)

1. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, Z. Liu, Universal stability results and performance bounds for greedy contention-resolution protocols, J. ACM 48 (2001) 39-69.
2. M. Andrews, A. Fernández, M. Harchol-Balter, T. Leighton, L. Zhang, General dynamic routing with per-packet delay guarantees of O(distance + 1/session rate), SIAM J. Comput. 30 (5) (2000) 1594-1623.
3. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, D.P. Williamson, Adversarial queueing theory, J. ACM 48 (1) (2001) 13-38.
4. M. Bramson, Instability of FIFO queueing networks, Ann. Appl. Probab. 4 (2) (1994) 414-431.
5. M. Bramson, Instability of FIFO queueing networks with quick service times, Ann. Appl. Probab. 4 (3) (1994) 693-718.
6. M. Bramson, Convergence to equilibria for fluid models of FIFO queueing networks, Queueing Systems 22 (1996) 5-45.
7. D. Clark, S. Shenker, L. Zhang, Supporting real-time applications in an integrated services packet network: Architecture and mechanism, in: Proceedings of ACM SIGCOMM '92, August 1992, pp. 14-26.
8. R.L. Cruz, A calculus for network delay, Part I: Network elements in isolation, IEEE Trans. Inform. Theory 37 (1991) 114-131.
9. R.L. Cruz, A calculus for network delay, Part II: Network analysis, IEEE Trans. Inform. Theory 37 (1991) 132-141.
10. J. Dai, J. Hasenbein, J. Vande Vate, Stability of a three-station fluid network, Queueing Systems 33 (1999) 293-325.
11. V. Dumas, A multiclass network with non-linear, non-convex, non-monotonic stability conditions, Queueing Systems 25 (1997) 1-43.
12. A. Elwalid, D. Mitra, Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes, in: Proceedings of IEEE INFOCOM '99, March 1999, pp. 1220-1230.
13. U. Feige, Nonmonotonic phenomena in packet routing, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, May 1999, pp. 583-591.
14. D. Gamarnik, Stability of adversarial queues via fluid models, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, November 1998, pp. 60-70.
15. L. Georgiadis, R. Guérin, A. Parekh, Optimal multiplexing on a single link: delay and buffer requirements, IEEE Trans. Inform. Theory 43 (5) (1997) 1518-1535.
16. L. Georgiadis, R. Guérin, V. Peris, K. Sivarajan, Efficient network QoS provisioning based on per node traffic shaping, in: Proceedings of IEEE INFOCOM '96, Palo Alto, CA, 1996, 1996, pp. 102-110.
17. F.P. Kelly, Networks of queues with customers of different types, J. Appl. Probab. 12 (1975) 542-554.
18. F.P. Kelly, Reversability and Stochastic Networks, Wiley, New York, 1979.
19. J. Liebeherr, D. Wrege, D. Ferrari, Exact admission control for networks with a bounded delay service, IEEE/ACM Trans. Networking 4 (6) (1996) 885-901.
20. S.H. Lu, P.R. Kumar, Distributed scheduling based on due dates and buffer priorities, IEEE Trans. Automat. Control 36 (12) (1991) 1406-1416.
21. A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Trans. Networking 1 (3) (1993) 344-357.
22. A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case, IEEE/ACM Trans. Networking 2 (2) (1994) 137-150.
23. S. Rybko, A. Stolyar, Ergodicity of stochastic processes describing the functioning of open queueing networks, Problems Inform. Transmission 28 (1992) 199-220.
24. T.I. Seidman, First come, first served' can be unstable!, IEEE Trans. Automat. Control 39 (1994) 2166-2171.
25. D. Stiliadis, Traffic scheduling in packet-switched networks: analysis, design and implementation, PhD thesis, UCSC, 1996.
26. J. Turner, New directions in communications, or Which way to the information age?, IEEE Commun. Magazine 24 (1986) 8-15.
27. D. Wrege, J. Liebeherr, A near-optimal packet scheduler for QoS networks, in: Proceedings of IEEE INFOCOM '97, 1997.
28. H. Zhang, Service disciplines for guaranteed performance service in packet-switching networks, in: Proceedings of IEEE, October 1995.