DocumentCode
3424014
Title
Cell scheduling for ATM switch with two priority classes
Author
Pao, Derek C W ; Lam, S.P.
Author_Institution
Dept. of Electron. Eng., City Univ. of Hong Kong, Kowloon, Hong Kong
fYear
1998
fDate
26-29 May 1998
Firstpage
86
Lastpage
90
Abstract
The flexibility of ATM allows it to support various types of applications with diversified quality of service (QoS) requirements. We broadly classified these services into the delay sensitive (DS) class and the loss sensitive (LS) class. The scheduling problem for two priority classes is much more complex than the single priority class counterpart. The scheduling algorithm is required to satisfy two conflicting requirements (i) maintain the cell delay of DS traffic within an acceptable range by giving it a higher transmission priority; and (ii) minimize the cell loss probability of LS traffic. A good scheduling algorithm for a single priority class may not perform well when applied to two priority classes scheduling. We present a reservation based scheduling approach that can handle the QoS requirements of both the DS class and LS class effectively
Keywords
asynchronous transfer mode; buffer storage; delays; iterative methods; packet switching; queueing theory; scheduling; telecommunication traffic; ATM switch; QoS; cell delay; cell loss probability; cell scheduling; delay sensitive traffic; input buffering; lookahead reservation based scheduling; loss sensitive traffic; packet switching; parallel iterative matching; quality of service; queueing theory; scheduling algorithm; simulation; transmission priority; two priority classes; Application software; Asynchronous transfer mode; Delay effects; Propagation losses; Quality of service; Scheduling algorithm; Switches; Traffic control; Video compression; Videoconference;
fLanguage
English
Publisher
ieee
Conference_Titel
ATM Workshop Proceedings, 1998 IEEE
Conference_Location
Fairfax, VA
ISSN
1098-7789
Print_ISBN
0-7803-4874-5
Type
conf
DOI
10.1109/ATM.1998.675129
Filename
675129
Link To Document