DocumentCode
1905169
Title
High-performance variable-length packet scheduling algorithm for IP traffic
Author
Moon, Sung-Ho ; Sung, Dan Keun
Author_Institution
Dept. of Electron. Eng. & Comput. Sci., KAIST, Daejeon, South Korea
Volume
4
fYear
2001
fDate
2001
Firstpage
2666
Abstract
A high-performance variable-length packet scheduling algorithm is proposed for efficiently accommodating IP traffic in input. queued crossbar switches. It uses a rotating priority(round-robin) arbitration and a masking operation for variable-length packets. This algorithm achieves 100% throughput with a single iteration for uniform IP traffic and performs better in terms of packet latency and similar cell latency, compared with the well-known iSLIP cell-level scheduling algorithm
Keywords
delays; packet switching; protocols; queueing theory; scheduling; telecommunication traffic; IP traffic; high-performance packet scheduling; input queued crossbar switches; masking operation; packet latency; rotating priority arbitration; round-robin arbitration; similar cell latency; throughput; uniform traffic; variable-length packet scheduling; Communication switching; Delay; Fabrics; High speed optical techniques; Moon; Optical packet switching; Optical switches; Packet switching; Scheduling algorithm; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-7206-9
Type
conf
DOI
10.1109/GLOCOM.2001.966258
Filename
966258
Link To Document