HOL-EDD: a flexible service scheduling scheme for ATM networks
- 23 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 647-654
- https://doi.org/10.1109/infcom.1996.493360
Abstract
The salient properties of a work-consemhg, Tate-based service scheduling scheme for ATM networks, called the Head-of-the-Line Earliest Due Date (HOL-EDD), are described. The major feature of HOL-EDD is that it does not use cell stamping. Instead, it uses an integer decision variable for each VC to schedule cells for transmission. It is shown that the EOL-EDD has a connectionist implementation of O(1) computational complexity. The flexibility of the scheme is shown by generalizing it to schedule the CBR, ABR and UBR service classes.Keywords
This publication has 9 references indexed in Scilit:
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- ATM switching node design based on a versatile traffic descriptorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A connectionist implementation of the VCQ ATM switchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Virtual spacing for flexible traffic controlInternational Journal of Communication Systems, 1994
- Methodologies for bandwidth allocation, transmission scheduling, and congestion avoidance in broadband ATM networksComputer Networks and ISDN Systems, 1993
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Comparison of rate-based service disciplinesACM SIGCOMM Computer Communication Review, 1991
- VirtualClockACM Transactions on Computer Systems, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991