DocumentCode
1706460
Title
A robust switch architecture for bursty traffic
Author
Minkenberg, Cyriel ; Engbersen, Ton ; Colmant, Michel
Author_Institution
Zurich Res. Lab., IBM Res., Ruschlikon, Switzerland
fYear
2000
fDate
6/22/1905 12:00:00 AM
Firstpage
207
Lastpage
214
Abstract
A novel way of building switch system architectures, based on the combination of an output-buffered switch with input queues that sort arriving packets on a per-output-port basis, is proposed that has a scheduling complexity of O(N). Simulation results to demonstrate the high and robust performance achieved with the proposed system architecture are presented, and a practical implementation is outlined
Keywords
buffer storage; queueing theory; scheduling; telecommunication switching; telecommunication traffic; arriving packet; bursty traffic; input queues; output-buffered switch; per-output-port sorting; performance; robust switch architecture; scheduling complexity; simulation; Bandwidth; Buildings; Hardware; Packet switching; Processor scheduling; Random access memory; Robustness; Switches; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Broadband Communications, 2000. Proceedings. 2000 International Zurich Seminar on
Conference_Location
Zurich
Print_ISBN
0-7803-5977-1
Type
conf
DOI
10.1109/IZSBC.2000.829253
Filename
829253
Link To Document