Cycle Time Properties Of The FDDI Token Ring Protocol
IEEE Transactions on Software Engineering
Some Properties of Timed Token Medium Access Protocols
IEEE Transactions on Software Engineering
IEEE/ACM Transactions on Networking (TON)
Selection of timed token protocol parameters to guarantee message deadlines
IEEE/ACM Transactions on Networking (TON)
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Endpoint admission control: architectural issues and performance
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol
IEEE Transactions on Computers
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol
IEEE Transactions on Computers
Earliest Eligible Virtual Deadline First : A Flexible and Accurate Mechanism for Proportional Share Resource Allocation
On the Duality between Resource Reservation and Proportional Share Resource Allocation
On the Duality between Resource Reservation and Proportional Share Resource Allocation
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Design and Performance Analysis of the Generalized Timed Token Service Discipline
IEEE Transactions on Computers
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
IEEE/ACM Transactions on Networking (TON)
Bandwidth and latency analysis of modified deficit round robin scheduling algorithms
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Hierarchical resource allocation for robust in-home video streaming
Journal of Systems and Software
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol
Computer Standards & Interfaces
| Hi-index | 14.98 |
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.