DocumentCode
342490
Title
Bounded latency scheduling scheme for ATM cells
Author
Dolev, Shlomi ; Kesselman, A.
Author_Institution
Dept. of Math. & Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
fYear
1999
fDate
1999
Firstpage
273
Lastpage
277
Abstract
Scheduling ATM cells schemes for an (optical) ATM switch can dramatically influence the performance of the ATM communication network. We present an efficient scheduling that is based on perfect bipartite matching. The algorithm ensures fairness, providing a guaranteed latency bound for each arriving cell
Keywords
asynchronous transfer mode; optical switches; queueing theory; scheduling; telecommunication traffic; ATM cells; communication network; fairness; guaranteed latency bound; optical switch; perfect bipartite matching; performance; scheduling scheme; Asynchronous transfer mode; Bipartite graph; Communication switching; Delay; Optical buffering; Optical fiber networks; Optical switches; Scheduling algorithm; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1999. Proceedings. IEEE International Symposium on
Conference_Location
Red Sea
Print_ISBN
0-7695-0250-4
Type
conf
DOI
10.1109/ISCC.1999.780828
Filename
780828
Link To Document