This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queuing Services Based on the Timed Token Protocol
September 2002 (vol. 51 no. 9)
pp. 1011-1025

Abstract—Multiservice networks face the challenge of managing several traffic classes simultaneously. Service disciplines devised for multiservice networks therefore need to be flexible, i.e., able to provide different types of service, in order to accommodate different traffic classes efficiently. In this paper, we present and analyze an innovative Timed Token Service Discipline (TTSD, which has been given Patent Application No. TO2000A001000) which is able to schedule both rate-guaranteed and best-effort traffic simultaneously at a feasible computational complexity. The service paradigm approximated by TTSD is unveiled by means of a fluid-flow analysis and proven to be different from the well-known Generalized Processor Sharing. We then describe the TTSD properties, deriving minimum rate guarantees and delay bounds for leaky-bucket constrained traffic, both in a single node and in a multinode environment. Furthermore, algorithms for selecting the TTSD parameters in order to achieve a prespecified rate and delay guarantees are proposed.

[1] “FDDI Token Ring Media Access Control,” ANSI Standard X3.139, 1987.
[2] R.M. Grow, “A Timed Token Protocol for Local Area Networks,” Proc. Electro '82, Token Access Protocols, May 1982.
[3] K.C. Sevcik and M.J. Johnson,“Cycle time properties of the FDDI token ring protocol,” IEEE Trans. Software Engineering, pp. 376-385, 1987.
[4] J.P.C. Blanc and L. Lenzini, “Analysis of Communication Systems with Timed Token Protocols Using the Power-Series Algorithm,” Performance Evaluation, vol. 27, no. 28, pp. 391-409, Nov. 1996.
[5] A. Valenzano, P. Montuschi, and L. Ciminiera, “Some Properties of Timed Token Medium Access Protocols,” IEEE Trans. Software Eng., vol. 16, no. 8, pp. 858-869, Aug. 1990.
[6] 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.
[7] B. Chen,G. Agrawal,, and W. Zhao,“Optimal synchronous capacity allocation for hard real-time communicationswith the timed token protocol,” Proc. Real-Time Systems Symp., pp. 198-207, Dec. 1992.
[8] 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.
[9] S. Zhang and A. Burns, “Timing Properties of the Timed Token Protocol,” technical report, Dept. of Computer Science, Univ. of York, Mar. 1994.
[10] S. Zhang and E.S. Lee, “The Worst-Case Scenario for Transmission of Synchronous Traffic in an FDDI Network,” technical report, Center for Comm. Systems Research, Univ. of Cambridge, U.K., Nov. 1998.
[11] C.-C. Han, K.G. Shin, and C.-J. Hou, “Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol,” IEEE Trans. Computers, vol. 50, no. 5, pp. 414-431, May 2001.
[12] G. Stea, “Progettazione e Valutazione delle Prestazioni di un Algoritmo di Allocazione delle Risorse per una Rete di Calcolatori,” Laurea thesis (in Italian), Univ. of Pisa, Dec. 1999.
[13] B. Sprunt, L. Sha, and J.P. Lehoczky, “Aperiodic Task Scheduling for Hard Real-Time Systems,” J. Real-Time Systems, vol. 1, pp. 27-60, June 1989.
[14] 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.
[15] S.J. Golestani, A Self-Clocked Fair Queueing Scheme for Broadband Applications Proc. IEEE INFOCOM, pp. 636-646, June 1994.
[16] N.R. Figueira and J. Pasquale, “Leave-in-Time: A New Service Discipline for Real-Time Communications in a Packet-Switching Network,” Proc. ACM SIGCOMM, pp. 207-218, Oct. 1995.
[17] J. Bennett and H. Zhang, “$\big. WF^2Q\bigr.$: Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM 96, pp. 120-128, Mar. 1996.
[18] 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.
[19] F. Toutain, “Decoupled Generalized Processor Sharing: A Fair Queuing Principle for Adaptive Multimedia Applications,” Proc. 17th IEEE Infocom '98, Mar.-Apr. 1998.
[20] L. Breslau, E. Knightly, S. Shenker, I. Stoica, and H. Zhang, “Endpoint Admission Control : Architectural Issues and Performance,” Proc. ACM SIGCOMM '00, Aug. 2000.
[21] The ATM Forum, Traffic Management Specification, Version 4.1, Mar. 1999.
[22] I. Stoica, H. Abdel-Wahab, and K. Jeffay, “On the Duality between Resource Reservation and Proportional Share Resource Allocation,” Multimedia Computing and Networking 1997 Proc., pp. 207-214, Feb. 1997.
[23] I. Stoica and H. Abdel-Wahab, “Earliest Eligible Virtual Deadline First: A Flexible and Accurate Mechanism for Proportional Share Resource Allocation,” Technical Report TR-95 22, Old Dominion Univ., Nov. 1995.
[24] H. Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,” Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.
[25] R. Braden, D. Clark, and S. Shenker, “Integrated Services in the Internet Architecture: An Overview,” RFC 1633, The Internet Soc., June 1994.
[26] 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.
[27] V. Jacobson, K. Nichols, and K. Poduri, “An Expedited Forwarding PHB,” RFC 2598, The Internet Soc., June 1999.
[28] J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski, “Assured Forwarding PHB Group,” RFC 2597, The Internet Soc., June 1999.
[29] J. Bennett and H. Zhang, Hierarchical Packet Fair Queueing Algorithms IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 675-689, Oct. 1997.
[30] A. Johnson and K. Mackenzie,"Pattern Matching in Reconfigurable Logic for Packet Classification," Proc. Int'l Conf. Compilers, Architectures and Synthesis for Embedded Systems (CASES 01), ACM Press, 2001, pp. 126-130.
[31] 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 Network,” Computer Networks, vol. 39, no. 4, pp. 363-384, July 2002.

Index Terms:
Packet scheduling, Quality of Service, GPS, Timed Token Protocol.
Citation:
Luciano Lenzini, Enzo Mingozzi, Giovanni Stea, "A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queuing Services Based on the Timed Token Protocol," IEEE Transactions on Computers, vol. 51, no. 9, pp. 1011-1025, Sept. 2002, doi:10.1109/TC.2002.1032622
Usage of this product signifies your acceptance of the Terms of Use.