A unifying service discipline for providing rate-based guaranteed and fair queuing services based on the Timed Token protocol
Tóm tắt
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.
Từ khóa
#Telecommunication traffic #Quality of service #Bandwidth #Traffic control #Delay #Communication system traffic control #Protocols #Processor scheduling #Computational complexity #SwitchesTài liệu tham khảo
golestani, 1994, A Self-Clocked Fair Queueing Scheme for Broadband Applications, Proc IEEE INFOCOM '94, 636, 10.1109/INFCOM.1994.337677
figueira, 1995, Leave-in-Time: A New Service Discipline for Real-Time Communications in a Packet-Switching Network, Proc ACM SIGCOMM 1995, 207, 10.1145/217391.217433
10.1109/INFCOM.1996.497885
10.1109/90.649569
10.1109/12.926157
stea, 1999, Progettazione e Valutazione delle Prestazioni di un Algoritmo di Allocazione delle Risorse per una Rete di Calcolatori
sprunt, 1989, Aperiodic Task Scheduling for Hard Real-Time Systems, J Real-Time Systems, 1, 27, 10.1007/BF02341920
10.1109/90.234856
zhang, 1998, The Worst-Case Scenario for Transmission of Synchronous Traffic in an FDDI Network
zhang, 1994, Timing Properties of the Timed Token Protocol
10.1109/90.392393
10.1016/S1389-1286(01)00312-7
10.1109/90.502236
heinanen, 1999, Assured Forwarding PHB Group, 10.17487/rfc2597
10.1109/90.649568
blake, 1998, An Architecture for Differentiated Services, 10.17487/rfc2475
jacobson, 1999, An Expedited Forwarding PHB, 10.17487/rfc2598
10.1109/5.469298
braden, 1994, Integrated Services in the Internet Architecture: An Overview, 10.17487/rfc1633
stoica, 1997, On the Duality between Resource Reservation and Proportional Share Resource Allocation, Multimedia Computing and Networking 1997 Proc, 207, 10.1117/12.264293
stoica, 1995, Earliest Eligible Virtual Deadline First: A Flexible and Accurate Mechanism for Proportional Share Resource Allocation
breslau, 2000, Endpoint Admission Control: Architectural Issues and Performance, Proc ACM SIGCOMM 2000, 10.1145/347057.347400
1999, Traffic Management Specification Version 4 1
1987, FDDI Token Ring Media Access Control
sevcik, 1987, Cycle Time Properties of the FDDI Token Ring Protocol, IEEE Trans Software Eng, 13, 376
grow, 1982, A Timed Token Protocol for Local Area Networks, Proc Electro '82 Token Access Protocols
10.1109/32.57628
10.1016/S0166-5316(96)90037-1
10.1109/REAL.1992.242663
10.1109/INFCOM.1998.659665
10.1109/12.272433