DocumentCode
1904883
Title
Byte-focal: a practical load balanced switch
Author
Shen, Yanming ; Jiang, Shi ; Panwar, Shivendra S. ; Chao, H. Jonathan
Author_Institution
Dept. of Electr. & Comput. Eng., Polytech. Univ. Brooklyn, New York, NY, USA
fYear
2005
fDate
12-14 May 2005
Firstpage
6
Lastpage
12
Abstract
Recently, a novel switch architecture, the load balanced (LB) switch proposed by C.S. Chang et al. (2000, 2002) opened a new avenue for designing a large-capacity packet switch. The load balanced switch consists of two stages. First, a load-balancing stage spreads arriving packets equally among all linecards. Then, a forwarding stage transfers packets from the linecards to their final output destination. The load balanced switch does not need any centralized scheduler and can achieve 100% throughput under a broad class of traffic distributions. However, the load balanced switch may cause packets at the output port to be out of sequence. Several schemes have been proposed to tackle the out-of-sequence problem of the load balanced switch. However, they are either too complex to implement, or introduce a large additional delay. In this paper, we present a practical load balanced switch, called the byte-focal switch, which uses packet-by-packet scheduling to significantly improve the delay performance over switches of comparable complexity.
Keywords
packet switching; resource allocation; scheduling; byte-focal switch; comparable complexity; delay performance; forwarding stage; large-capacity packet switch; linecards; load balanced switch; out-of-sequence problem; packet-by-packet scheduling; Added delay; Chaos; Computer architecture; Internet; Memory management; Packet switching; Scheduling algorithm; Switches; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Switching and Routing, 2005. HPSR. 2005 Workshop on
Print_ISBN
0-7803-8924-7
Type
conf
DOI
10.1109/HPSR.2005.1503184
Filename
1503184
Link To Document