Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 1999, Pages 380-388

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY BOUND; DELAY GUARANTEE; END TO END DELAY; HIGH-SPEED; HOP COUNT; SCHEDULING DISCIPLINE; WEIGHTED FAIR QUEUEING;

SCHEDULING; MATHEMATICAL MODELS; QUEUEING THEORY; RESOURCE ALLOCATION;

HIGH SPEED NETWORKS; PACKET NETWORKS;

HIGH-SPEED NETWORKS;

EID: 0032685899     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.749305     Document Type: Conference Paper

References (27)

1. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, 1(3):344 - 357, 1993.
2. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case. IEEE/ACM Transactions on Networking, 2(2):137 - 150, 1994.
3. M. Andrews, A. Fernández, M. Harchol-Balter, T. Leighton, and L. Zhang. Dynamic packet routing with per-packet delay guarantees of 0(distance + 1/session rate). In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 294 - 302, Miami Beach, FL, October 1997.
4. D. Ferrari and D. Verma. A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 8(3):368 - 379. April 1990.
5. D. Verma, H. Zhang, and D. Ferrari. Guaranteeing delay jitter bounds in packet switching networks. In Proceedings of Tricomm'91, Chapel Hill, NC, April 1991.
6. L. Geoigiadis, R. Guérin, and A. Parekh. Optimal multiplexing on a single link: delay and buffer requirements. IEEE Transactions on Information Theory, 43(5):1518 - 1535, September 1997.
7. J. Liebeherr, D. Wrege, and D. Ferrari. Exact admission control for networks with a bounded delay service. IEEE/ACM Transactions on Networking, 4(6):885 - 901, December 1996.
8. D. Wrege and J. Liebeherr. A near-optimal packet scheduler for QoS networks. In Proceedings of IEEE INFOCOM'97, 1997.
9. L. Georgiadis, R. Guérin, V. Peris, and K. Sivarajan. Efficient network QoS provisioning based on per node traffic shaping. In Proceedings of IEEE INFOCOM'96, pages 102 - 110, 1996.
10. P. Goyal, S. Lam, and H. Vin. Determining end-to-end delay bounds in heterogeneous networks. In Proceedings of the Fifth International Workshop on Network and Operating System Support for Digital Audio and Video, pages 287 - 298, Durham, NH, April 1995.
11. P. Goyal and H. Vin. Generalized guaranteed rate scheduling algorithms: A framework. Technical Report TR-95-30, University of Texas, Austin, September 1995.
12. D. Clark, S. Shenker, and L. Zhang. Supporting real-time applications in an integrated services packet network: Architecture and mechanism. In Proceedings of ACMSIGCOMM'92, pages 14-26, August 1992.
13. D. Yates, J. Kurose, D. Towsley, and M. Hluchyj. On per-session end-to-end delay distributions and the call admission problem for real time applications with QOS requirements. In Proceedings of ACM SIGCOMM'93, pages 2-12, 1993.
14. S. J. Golestani. A framing strategy for congestion management. IEEE Journal on Selected Areas in Communications, 9(7):1064 - 1077, September 1991.
15. S. J. Golestani. Congestion-free communication in high-speed packet networks. IEEE Transactions on Communications, 39(12):1802 - 1812, December 1992.
16. M. Grossglauser and S. Keshav. On CBR service. In Proceedings of IEEE INFOCOM'96, pages 129 - 136, 1996.
17. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-shop scheduling in 0(congestion + dilation) steps. Combinatorial, 14(2): 167 -186, 1993.
18. F. T. Leighton, B. M. Maggs, and A. W. Richa. Fast algorithms for finding 0(congestion + dilation) packet routing schedules. Technical report CMU-CS-96-152, Carnegie Mellon University, 1996.
19. Y. Rabani and E. Tardos. Distributed packet switching in arbitrary networks. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, May 1996.
20. R. Ostrovsky and Y. Rabani. Local control packet switching algorithm. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, May 1997.
21. S. Keshav. An engineering approach to computer networking. Addison Wesley, Reading, MA, 1997.
22. H. Zhang. Service disciplines for guaranteed performance service in packet-switching networks. In Proceedings of IEEE, October 1995.
23. R. L. Cruz. A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory, pages 114 - 131, 1991.
24. R. L. Cruz. A calculus for network delay. Part II: Network analysis. IEEE Transactions on Information Theory, pages 132-141, 1991.
25. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Journal of Internetworking: Research and Experience, 1:3 - 26, 1990.
26. A. Banerjea, D. Ferrari, B. Mah, M. Moran, D. Verma, and H. Zhang. The Tenet real-time protocol suite: Design, implementation, and experiences. IEEE/ACM Transactions on Networking, 4(1):1 - 11, February 1996.
27. D. Stiliadis. Traffic scheduling in packet-switched networks: analysis design and implementation. PhD thesis, UCSC, 1996.