Title :
HOL-EDD: a flexible service scheduling scheme for ATM networks
Author :
Vishnu, M. ; Mark, J.W.
Author_Institution :
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
Abstract :
The salient properties of a work-conserving, rate-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 HOL-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 :
asynchronous transfer mode; computational complexity; queueing theory; scheduling; telecommunication congestion control; telecommunication networks; telecommunication services; telecommunication traffic; ABR service; ATM networks; CBR service; HOL-EDD; UBR service; computational complexity; connection admission control; connectionist implementation; flexible service scheduling; head of the line earliest due date; integer decision variable; queueing theory; rate based service scheduling; virtual connection; work conserving scheduling; Bandwidth; Delay; Dynamic scheduling; Equations; Ink; Sections; Telecommunication traffic; Upper bound; Virtual colonoscopy;
Conference_Titel :
INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-8186-7293-5
DOI :
10.1109/INFCOM.1996.493360
