HOL-EDD: a flexible seirvice scheduling scheme for ATM networks

Authors:
M. Vishnu;J. W. Mark
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Year:
1996

Citing 4
Cited 2

VirtualClock: a new traffic control algorithm for packet-switched networks

ACM Transactions on Computer Systems (TOCS)
Comparison of rate-based service disciplines

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Methodologies for bandwidth allocation, transmission scheduling, and congestion avoidance in broadband ATM networks

Computer Networks and ISDN Systems

Design and analysis of low-power access protocols for wireless and mobile ATM networks

Wireless Networks
QLWFQ: A Queue Length Based Weighted Fair Queueing Algorithm in ATM Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Quantified Score

Hi-index	0.00

Visualization

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.