End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms

IEEE/ACM Transactions on Networking

Volumn 13, Issue 5, 2005, Pages 1188-1201

  Sun, Wei ^a   Shin, Kang G ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Aggregate scheduling; End to end (e2e) delay bounds; Token bucket model; Traffic aggregation

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION TRAFFIC;

END-TO-END (E2E) DELAY BOUNDS; TOKEN BUCKET MODEL; TRAFFIC AGGREGATES;

INTERNET;

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

References (35)

1. R. Braden, D. Clark, and S. Shenker, "Integrated Services in the Internet Architecture: An Overview," IETF, RFC 1633, June 1994.
2. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. IEEE, vol. 83, no. 10, pp. 1374-1396, Oct. 1995.
3. S. Blake et al., "An Architecture for Differentiated Services," IETF, RFC 2475, Dec. 1998.
4. B. Davie et al., "An Expedited Forwarding PHB (Per-Hop Behavior)," IETF, RFC 3246, Mar. 2002.
5. A. Charny and J.-Y. Le Boudec, "Delay bounds in a network with aggregate scheduling," in Proc. QoffS, Oct. 2000, pp. 1-13.
6. F. Baker et al., "Aggregation of RSVP for IPv4 and IPv6 Reservation,", RFC 3175, Sep. 2001.
7. J. Ehrensberger, "Resource demand of aggregated resource reservations," in Proc. ECUMN, Oct. 2000, pp. 56-61.
8. O. Schelén and S. Pink, "Aggregating resource reservation over multiple routing domains," in Proc. IEEE IWQoS, May 1998, pp. 29-32.
9. A. Terzis, L. Zhang, and E. L. Hahne, "Reservations for aggregate traffic: Experiences from an RSVP tunnels implementation," in Proc. IEEE IWQoS, May 1998, pp. 23-25.
10. B.-K. Choi et al., "Scalable QoS guaranteed communication services for real-time applications," in Proc. IEEE ICDCS, Apr. 2000, pp. 180-187.
11. H. Fu and E. W. Knightly, "Aggregation and scalable QoS: A performance study" in Proc. IEEE IWQoS, June 2001, pp. 39-50.
12. S. Berson and S. Vincent, "Aggregation of internet integrated services state," in Proc. IEEE IWQoS, May 1998, pp. 26-28.
13. H. Zhang and S. Keshav, "Comparison of rate-based service disciplines," in Proc. ACM SIGCOMM, Aug. 1991, pp. 113-121.
14. T. Li and Y. Rekhter, "A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE)," IETF, RFC 2430, Oct. 1998.
15. J. A. Cobb, "Preserving quality of service guarantees in spite of flow aggregation," in Proc. IEEE ICNP, Oct. 1998, pp. 90-97.
16. J. A. Cobb, "Preserving quality of service guarantees in spite of flow aggregation," IEEE/ACM Trans. Netw., vol. 10, no. 1, pp. 43-53, Feb. 2002.
17. P. Goyal, S. S. Lam, and H. M. Vin, "Determining end-to-end delay bounds in heterogeneous networks," in Proc. NOSSDAV, Apr. 1995, pp. 287-298.
18. D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," IEEE/ACM Trans. Netw., vol. 6, no. 4, pp. 611-624, Aug. 1998.
19. 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 Trans. Netw., vol. 1, no. 3, pp. 344-357, Jun. 1993.
20. L. Zhang, "Virtual clock: A new traffic control algorithm for packet-switched networks," ACM Trans. Computer Syst., vol. 9, no. 2, pp. 101-124, May 1991.
21. W. Sun and K. G. Shin, "End-to-End Delay Bounds for Traffic Aggregates Under Guaranteed Rate Scheduling Algorithms," Dept. Elect. Eng. Comput. Sci., Univ. of Michigan, Ann Arbor, Tech. Rep. CSE-TR-484-03, 2003.
22. S. Vutukury and J. Garcia-Luna-Aceves, "A scalable architecture for providing deterministic guarantees," in Proc. IEEE IC3N, Oct. 1999, pp. 534-539.
23. J. C. R. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," in Proc. ACM SIGCOMM, Aug. 1996, pp. 143-156.
24. J. C. R. Bennett and H. Zhang, "WF2Q: Worst-case fair weighted fair queueing," in Proc. IEEE INFOCOM, Mar. 1996, pp. 120-128.
25. J.-Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 1087-1096, May 1998.
26. H. Zhang and D. Ferrari, "Rate-controlled service disciplines," J. High Speed Networks, vol. 3, no. 4, pp. 389-412, 1994.
27. S. Keshav, An Engineering Approach to Computer Networking. Reading, MA: Addison Wesley, 1997.
28. K. Dolzer, W. Payer, and M. Eberspächer, "A simulation study on traffic aggregation in multi-service networks," in Proc. IEEE Conf. High Performance Switching and Routing, Jun. 2000, pp. 157-165.
29. ns2 Simulator [Online]. Available: http://www.isi.edu/nsnam/ns/
30. A. Popescu, "Traffic Self-Similarity," Blekinge Institute of Technology, Karlskrona, Sweden, white paper, 1999.
31. R. Jain, The Art of Computer Systems Performance Analysis. New York: Wiley, 1991.
32. F. Fitzek and M. Reisslein, "MPEG-4 and H.263 video traces for network performance evaluation," IEEE Network, vol. 15, no. 6, pp. 40-54, Nov./Dec. 2001.
33. J. L. Rexford, A. G. Greenberg, and P. G. Bonomi, "Hardware-efficient fair queueing architectures for high-speed networks," in Proc. IEEE INFOCOM, Mar. 1996, pp. 638-646.
34. J. C. R. Bennett, D. C. Stephens, and H. Zhang, "High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks," in Proc. IEEE ICNP, Oct. 1997, pp. 7-14.
35. J. Schmitt et al., "Aggregation of guaranteed service flows," in Proc. IEEE IWQoS, Jun. 1999, pp. 147-155.