Publication 2004 Issue No. 7 - July Abstract - Design and Performance Analysis of the Generalized Timed Token Service Discipline
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Luciano Lenzini Articles by Enzo Mingozzi Articles by Giovanni Stea
Design and Performance Analysis of the Generalized Timed Token Service Discipline
July 2004 (vol. 53 no. 7)
pp. 879-891
 ASCII Text x Luciano Lenzini, Enzo Mingozzi, Giovanni Stea, "Design and Performance Analysis of the Generalized Timed Token Service Discipline," IEEE Transactions on Computers, vol. 53, no. 7, pp. 879-891, July, 2004.
 BibTex x @article{ 10.1109/TC.2004.28,author = {Luciano Lenzini and Enzo Mingozzi and Giovanni Stea},title = {Design and Performance Analysis of the Generalized Timed Token Service Discipline},journal ={IEEE Transactions on Computers},volume = {53},number = {7},issn = {0018-9340},year = {2004},pages = {879-891},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.28},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Design and Performance Analysis of the Generalized Timed Token Service DisciplineIS - 7SN - 0018-9340SP879EP891EPD - 879-891A1 - Luciano Lenzini, A1 - Enzo Mingozzi, A1 - Giovanni Stea, PY - 2004KW - Quality of serviceKW - packet schedulingKW - weighted fair queuingKW - dual class paradigmKW - timed token protocol.VL - 53JA - IEEE Transactions on ComputersER -

Abstract—Multiservice networks will host heterogeneous applications, requiring different qualities of service (QoS), the coexistence of which can be efficiently accounted by employing scheduling algorithms which are capable of providing different QoS simultaneously. In a previous work, we defined a reference Dual-Class (DC) paradigm, according to which rate-guaranteed flows are restrained from using more than their minimum guaranteed rate in the presence of backlogged best-effort flows and the latter share all the remaining capacity according to predetermined weights. The Timed Token Service Discipline (TTSD), which applies at the output link of a switch the same rules used to control medium access by the Timed Token Protocol, was also introduced and analyzed therein. It was proven that TTSD shares most of the capacity which is not strictly needed by the rate-guaranteed flows among the best-effort ones, thus achieving one of the goals of the DC paradigm. However, in TTSD, best-effort flows can only share the available capacity equally. In this paper, we take into account the issue of differentiating the capacity sharing among the best-effort flows: We define a Generalized TTSD (GTTSD) in which the latter actually share capacity according to predefined weights in a weighted fair queuing service discipline. Formal analysis and simulation results show that GTTSD closely approximates the DC paradigm.

[1] L. Lenzini, E. Mingozzi, and G. Stea, A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queueing Services Based on the Timed Token Protocol IEEE Trans. Computers, vol. 51, no. 9, Sept. 2002.
[2] L. Lenzini, E. Mingozzi, and G. Stea, A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queuing Services Based on the Timed Token Protocol technical report, Pisa, Feb. 2002.
[3] L. Lenzini, E. Mingozzi, and G. Stea, Packet Timed Token Service Discipline: A Scheduling Algorithm Based on the Dual-Class Paradigm for Providing QoS in Integrated Services Networks Computer Networks, no. 39, pp. 363-384, July 2002.
[4] A. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
[5] S.J. Golestani, A Self-Clocked Fair Queueing Scheme for Broadband Applications Proc. IEEE INFOCOM, pp. 636-646, June 1994.
[6] H. Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,” Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.
[7] J. Bennett and H. Zhang, “$\big. WF^2Q\bigr.$: Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM 96, pp. 120-128, Mar. 1996.
[8] P. Goyal, H.M. Vin, and H. Cheng, Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 690-704, Oct. 1997.
[9] J. Bennett and H. Zhang, Hierarchical Packet Fair Queueing Algorithms IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 675-689, Oct. 1997.
[10] S. Suri, G. Varghese, and G. Chandranmenon, “Leap Forward Virtual Clock: An O(log log N) Queuing Scheme with Guaranteed Delays and Throughput Fairness,” Proc. IEEE INFOCOM, Apr. 1997.
[11] D. Saha, S. Mukherjee, and S.K. Tripathi, Carry-Over Round Robin: A Simple Cell Scheduling Mechanism for ATM Networks IEEE/ACM Trans. Networking, vol. 6, no. 6, pp. 779-796, Dec. 1998.
[12] D. Stiliadis and A. Varma, Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms IEEE/ACM Trans. Networking, vol. 6, pp. 675-689, Oct. 1998.
[13] S.-C. Tsao and Y.-D. Lin, Pre-Order Deficit Round Robin: A New Scheduling Algorithm for Packet Switched Networks Computer Networks, vol. 35, pp. 287-305, Feb. 2001.
[14] G. Chuanxiong, SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks Proc. ACM SIGCOMM '01, pp. 211-222, 2001.
[15] FDDI Token Ring Media Access Control ANSI Standard X3.139, 1987.
[16] R.M. Grow, A Timed Token Protocol for Local Area Networks Proc. Electro '82, Token Access Protocols, paper 17/3, May 1982.
[17] K.C. Sevcik and M.J. Johnson, Cycle Time Properties of the FDDI Token Ring Protocol IEEE Trans. Software Eng., vol. 13, no. 3, pp. 376-385, Mar. 1987.
[18] G. Agrawal,B. Chen,W. Zhao,, and S. Davari,“Guaranteeing synchronous message deadlines with the timed token mediumaccess control protocol,” IEEE Trans. Computers, vol. 43, no. 3, pp. 327-339, Mar. 1994.
[19] M. Hamdaoui and P. Ramanathan, “Selection of Timed Token Parameters to Guarantee Message Deadlines,” IEEE/ACM Trans. Networking, vol. 3, no. 3, pp. 340-351, June 1995.
[20] S. Zhang and A. Burns, Timing Properties of the Timed Token Protocol technical report, Dept. of Computer Science, Univ. of York, 1994.
[21] D. Dykeman and W. Bux,“Analysis and tuning of the FDDI media access control protocol,” IEEE J. Selected Areas in Comm., vol. 6, no. 6, pp. 997-1,010, July 1988.
[22] J. Pang and F.A. Tobagi,“Throughput analysis of a timer controlled token passing protocol underheavy load,” IEEE Trans. Computers, vol. 37, no. 7, pp. 694-702, July 1989.
[23] M. Tangemann, Timer Threshold Dimensioning and Overload Control in FDDI Networks Proc. IEEE INFOCOM '92, pp. 363-371, 1992.
[24] R.J. Schwarz and B. Friedland, Linear Systems, chapter 12, pp. 416-422. McGraw-Hill, 1965.
[25] ns-2 simulator, available at:http://www.isi.edu/nsnamns/, 2004.
[26] The ATM Forum, Traffic Management Specification, Version 4.1, Mar. 1999.
[27] R. Braden, D. Clark, and S. Shenker, Integrated Services in the Internet Architecture: An Overview, , RFC 1633, The Internet Soc., June 1994.
[28] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An Architecture for Differentiated Services RFC 2475, The Internet Soc., Dec. 1998.
[29] A. Francini, F.M. Chiussi, R.T. Clancy, K.D. Drucker, and N.E. Idirene, Enhanced Weighted Round Robin Schedulers for Accurate Bandwidth Distribution in Packet Networks Computer Networks, vol. 37, pp. 561-578, Nov. 2001.