DocumentCode
2501917
Title
Practical Algorithms of Bandwidth Regulation for Rate-Based Switching
Author
Wang, Yi ; He, Si-Min ; Zhao, You-Jian ; Zheng, Qiang ; Gao, Wen
Author_Institution
Chinese Acad. of Sci., Beijing
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
2483
Lastpage
2487
Abstract
A rate-based switch fabric called smoothed buffer crossbar has been proposed in our recent work. It can provide 100% rate-guaranteed service with only a two-cell buffer at each crosspoint, and can also support best-effort service with an additional bandwidth regulator. However, the widely used max- flow model for bandwidth regulation is neither scalable nor of 100% throughput. In order to evaluate the performance of bandwidth regulator, we first introduce the 100% ideal throughput measurement in this paper. Then we prove that the total arrival average (TAA) algorithm has got this property, which does not happen in the max-flow allocation. Then an O(N) algorithm called proportion scaling allocation (PSA) is presented. Simulations reveal that PSA can deliver nearly 100% throughput even in a frequently changing traffic pattern. As a comparison, both theoretical and experimental evidences are given to show the inefficiency of the max-flow model.
Keywords
bandwidth allocation; telecommunication services; telecommunication switching; bandwidth regulation; ideal throughput measurement; max-flow allocation; proportion scaling allocation; rate-based switch fabric; rate-based switching; rate-guaranteed service; smoothed buffer crossbar; total arrival average algorithm; Bandwidth; Computers; Delay; Fabrics; Multiplexing; Regulators; Scheduling; Switches; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.472
Filename
4411382
Link To Document