Instability of FIFO in the permanent sessions model at arbitrarily small network loads

ACM Transactions on Algorithms

Volumn 5, Issue 3, 2009, Pages

  Andrews, Matthew ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

FIFO scheduling; Network stability

Indexed keywords

FIFO SCHEDULING; FIRST-IN-FIRST-OUT; NETWORK LOAD; NETWORK STABILITY; SMALL NETWORKS;

SCHEDULING;

EID: 68549132412     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1541885.1541894     Document Type: Article

References (27)

1. ALVAREZ, C., BLESA, M., AND SERNA, M. 2004. A characterization of universal stability in the adversarial queueing model. SIAM J. Comput. 34, 1, 41-66.
2. ANDREWS, M. 2004. Instability of FIFO in session-oriented networks. J. Algor. 50, 2, 232-245.
3. ANDREWS, M., AWERBUCH, B., FERNÁNDEZ, A., KLEINBERG, J., LEIGHTON, T., AND LIU, Z. 2001. Universal stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48, 1, 39-69.
4. ANDREWS, M., FERNÁNDEZ, A., HARCHOL- BALTER, M., LEIGHTON, T., AND ZHANG, L. 2000. General dynamic routing with per-packet delay guarantees of O(distance + 1/session rate). SIAM J. Comput. 30, 5, 1594-1623.
5. BHATTACHARJEE, R., GOEL, A., AND LOTKER, Z. 2004. Instability of FIFO at arbitrarily low rates in the adversarial queueing model. SIAM J. Comput. 34, 2, 318-332.
6. BOUDEC, J.-Y. L., AND THIRAN, P. 2001. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer.
7. BRAMSON, M. 1994a. Instability of FIFO queueing networks. Ann. Appl. Probab. 4, 2, 414-431.
8. BRAMSON, M. 1994b. Instability of FIFO queueing networks with quick service times. Ann. Appl. Probab. 4, 3, 693-718.
9. BRAMSON, M. 1996. Convergence to equilibria for fluid models of FIFO queueing networks. Queue. Syst. 22, 5-45.
10. CHARNY, A., AND BSOUDEC, J.-Y. L. 2000. Delay bounds in a network with aggregate scheduling. In Proceedings of the 1st International Workshop on Quality of Future Internet Services.
11. CLARK, D., SHENKER, S., AND ZHANG, L. 1992. Supporting real-time applications in an integrated services packet network: Architecture and mechanism. In Proceedings of ACM SIGCOMM. 14-26.
12. CRUZ, R. L. 1991. A calculus for network delay, Part II: Network analysis. IEEE Trans. Inf. Theory 37, 132-141.
13. DIAZ, J., KOUKOPOULOS, D., NIKOLETSEAS, S., SERNA, M., SPIRAKIS, P., AND THILIKOS, D. 2001. Stability and nonstability of the FIFO protocol. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures. 48-52.
14. ECHAGUE, J., CHOLVI, V., AND FERNANDEZ, A. 2003. Universal stability results for low rate adversaries in packet switched networks. IEEE Commun. Lett. 7, 12.
15. ELWALID, A., AND MITRA, D. 1999. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. In Proceedings of IEEE INFOCOM, 1220-1230.
16. GAMARNIK, D. 1998. Stability of adversarial queues via fluid models. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science. 60-70.
17. GEORGIADIS, L., GUÉRIN, R., AND PAREKH, A. 1997. Optimal multiplexing on a single link: Delay and buffer requirements. IEEE Trans. Inf. Theory 43, 5, 1518-1535.
18. GEORGIADIS, L., GUÉRIN, R., PERIS, V., AND SIVARAJAN, K. 1996. Efficient network QoS provisioning based on per node traffic shaping. In Proceedings of IEEE INFOCOM, 102-110.
19. KOUPOULOS, D., NIKOLETSEAS, N., AND SPIRAKIS, P. 2001. The range of stability for heterogeneous and FIFO queueing networks. In Electronic Colloquium on Computational Complexity.
20. LIEBEHERR, J., WREGE, D., AND FERRARI, D. 1996. Exact admission control for networks with a bounded delay service. IEEE/ACM Trans. Netw. 4, 6, 885-901.
21. LOTKER, Z., PATT-SHAMIR, B., AND ROSEN, A. 2002. New stability results for adversarial queueing. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures. 192-199.
22. PAREKH, A. K., AND GALLAGER, R. G. 1994. A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case. IEEE/ACM Trans. Netw. 2, 2, 137-150.
23. SEIDMAN, T. I. 1994. 'First come, first served' can be unstable! IEEE Trans. Autom. Control 39, 2166-2171.
24. STILIADIS, D. 1996. Traffic schedulinginpacket-switched networks: Analysis design and implementation. Ph.D. thesis, UCSC.
25. WREGE, D., AND LIEBEHERR, J. 1997. A near-optimal packet scheduler for QoS networks. In Proceedings of IEEE INFOCOM.
26. ZHANG, H. 1995. Service disciplines for guaranteed performance service in packet-switching networks. Proc. IEEE.
27. ZHANG, Z.-L., DUAN, Z., AND HOU, T. 2001. Fundamental tradeoffs in aggregate packet scheduling. In Proceedings of the 9th International Conference on Network Protocols.