loading...
A High-Performance Scheduling Algorithm Based on Packet Sto
Beijing, China November 27-November 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SKG.2005.14First International Conference on Sem ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jing Qu, National Digital Switching System Engineering, Zhengzhou, Henan, P.R. China
Ximing Hu, National Digital Switching System Engineering, Zhengzhou, Henan, P.R. China
Peng Yi, National Digital Switching System Engineering, Zhengzhou, Henan, P.R. China
Xingming Zhang, National Digital Switching System Engineering, Zhengzhou, Henan, P.R. China
Binqiang Wang, National Digital Switching System Engineering, Zhengzhou, Henan, P.R. China
The Combined Input-Crosspoint-Queued (CICQ) crossbar switch is becoming very attractive for the design of high performance routers due to the unique features it offers. A plethora of distributed scheduling algorithms with low complexities have been proposed for this architecture. However, the size of Crosspoint Buffer (CB) is limited in a single chip by today?s ASIC technology. In this paper, we propose a novel scheduling scheme named the Exceed Threshold First Round Robin (ETFRR) which aims at reducing buffer size of CB. This scheme can reduce the Packet loss ratio and improve packet storage ratio efficiently.
Citation:
Jing Qu, Ximing Hu, Peng Yi, Xingming Zhang, Binqiang Wang, "A High-Performance Scheduling Algorithm Based on Packet Sto," skg, pp.44, First International Conference on Semantics, Knowledge and Grid (SKG'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions