Schedulability criterion and performance analysis of coordinated schedulers

IEEE/ACM Transactions on Networking

Volumn 13, Issue 2, 2005, Pages 276-287

  Li, Chengzhi ^a   Knightly, Edward W ^b  

^a The University of Texas at Arlington   (United States)

^b Rice University   (United States)

Author keywords

Coordinated multihop scheduling discipline; End to end delay; End to end schedulability criterion

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; TELECOMMUNICATION TRAFFIC;

COORDINATED MULTIHOP SCHEDULING DISCIPLINE; END-TO-END DELAY; END-TO-END SCHEDULABILITY CRITERION;

PACKET NETWORKS;

EID: 18844437319     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.845541     Document Type: Article

References (29)

1. M. Andrews, "Probabilistic end-to-end delay bounds for earliest deadline first scheduling," in Proc. IEEE INFOCOM, vol. 2, Tel Aviv, Israel, Mar. 2000, pp. 603-612.
2. M. Andrews and L. Zhang, "Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule," in Proc. IEEE INFOCOM, vol. 1, New York, Mar. 1999, pp. 380-388.
3. J. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 1087-1096, May 1998.
4. Z. Cao, Z. Wang, and E. Zegura, "Rainbow fair queueing: Fair band-width sharing without per-flow state," in Proc. IEEE INFOCOM, vol. 2, Tel Aviv, Israel, Mar. 2000, pp. 922-931.
5. C.-S. Chang, R. Cruz, J.-Y. Le Boudec, and P. Thiran, "A min, + system theory for constrained traffic regulation and dynamic service guarantees," IEEE/ACM Trans. Netw., vol. 10, no. 6, pp. 805-817, Dec. 2002,
6. T. Chen, J. Walrand, and D. Messerschmitt, "Dynamic priority protocols for packet voice," IEEE J. Select. Areas Commun., vol. 7, no. 5, pp. 632-643, Jun. 1989.
7. D. Clark, S. Shenker, and L. Zhang, "Supporting real-time applications in an integrated services packet network: Architecture and mechanisms," in Proc. ACM SIGCOMM, Baltimore, MD, Aug. 1992, pp. 14-26.
8. R. Cruz, "A calculus for network delay, parts I and II," IEEE Trans. Inform. Theory, vol. 37, no. l, pp. 114-141, Jan. 1991.
9. R. Cruz, "Quality of service guarantees in virtual circuit switched networks," IEEE J. Select. Areas Commun., vol. 13, no. 6, pp. 1048-1056, Aug. 1995.
10. C. Dovrolis and P. Ramanathan, "A case for relative differentiated services and the proportional differentiation model," IEEE Network, vol. 13, no. 5, pp. 26-35, Sep. 1999.
11. N. Figueira and J. Pasquale, "An upper bound on delay for the virtual clock service discipline," IEEE/ACM Trans. Netw., vol. 3, no. 4, pp. 399-408, Aug. 1995.
12. V. Firoiu, J. Kurose, and D. Towsley, "Efficient admission control for EDF schedulers," in Proc. IEEE INFOCOM, Kobe, Japan, Apr. 1997, pp. 310-317.
13. S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet network," IEEE/ACM Trans. Netw., vol. 3, no. 4, pp. 365-386, Aug. 1995.
14. L. Georgiadis, R. Guérin, and A. Parekh, "Optimal multiplexing on a single link: delay and buffer requirements," IEEE Trans. Inform. Theory, vol. 43, no. 5, pp. 1518-1535, Sep. 1997.
15. L. Georgiadis, R. Guérin, V. Peris, and K. Sivarajan, "Efficient network QoS provisioning based on per node traffic shaping," IEEE/ ACM Trans. Netw., vol. 4, no. 4, pp. 482-501, Aug. 1996.
16. C. Li and E. Knightly, "Coordinated multihop scheduling: a framework for end-to-end services," IEEE/ACM Trans. Netw., vol. 10, no. 6, pp. 776-789, Dec. 2002.
17. C. Li, A. Rahal, and W. Zhao, "Stability in ATM networks," in Proc. IEEE INFOCOM, Kobe, Japan, Apr. 1997, pp. 160-167.
18. J. Liebeherr, D. Wrege, and D. Ferrari, "Exact admission control for networks with bounded delay services," IEEE/ACM Trans. Netw., vol. 4, no. 6, pp. 885-901, Dec. 1996.
19. T. Nandagopal, N. Venkitaraman, R. Sivakumar, and V. Bharghavan, "Delay differentiation and adaptation in core stateless networks," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 421-430.
20. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: the single-node case," IEEE/ACM Trans. Netw., vol. 1, no. 3, pp. 344-357, Jun. 1993.
21. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: the multiple node case," IEEE/ACM Trans. Netw., vol. 2, no. 2, pp. 137-150, Apr. 1994.
22. H. Sariowan, R. Cruz, and G. Polyzos, "SCED: A generalized scheduling policy for guaranteeing quality-of-service," IEEE/ACM Trans. Netw., vol. 7, no. 5, pp. 669-684, Oct. 1999.
23. I. Stoica, S. Shenker, and H. Zhang, "Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high speed networks," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 33-46, Feb. 2003.
24. I. Stoica and H. Zhang, "Providing guaranteed services without per flow management," ACM SIGCOMM Comput. Commun. Rev., vol. 29, no. 4, pp. 81-94, Oct. 1999.
25. L. Tassiulas and L. Georgiadis, "Any work-conserving policy stabilizes the ring with spatial re-use," IEEE/ACM Trans. Netw., vol. 4, no. 2, pp. 205-208, Apr. 1996.
26. H. Zhang and D. Ferrari, "Rate-controlled service disciplines," J. High Speed Netw., vol. 3, no. 4, pp. 389-412, 1994.
27. L. Zhang, "Virtual clock: A new traffic control algorithm for packet switching networks," in Proc. ACM SIGCOMM, Philadelphia, PA, Sep. 1990, pp. 19-29.
28. Z. Zhang, Z. Duan, and Y. Hou, "Virtual time reference system: A unifying scheduling framework for scalable support of guaranteed services," IEEE J. Select. Areas Commun., vol. 18, no. 12, pp. 2684-2695, Dec. 2000.
29. K. Zhu, Y. Zhuang, and Y. Viniotis, "Achieving end-to-end delay bounds by EDF scheduling without traffic shaping," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, pp. 1493-1501.