loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-icns'05)
An Efficient Round-Robin Algorithm for Combined Input-Crosspoint-Queued Switches
Papeete, Tahiti
October 23-October 28
ISBN: 0-7695-2450-8
Yanfeng Zheng, ,Chinese Academy of Sciences, Beijing, China
Chun Shao, Graduate School of Chinese Academy of Sciences, Beijing
The combined input-crosspoint-queued (CICQ) crossbar switch is becoming attractive because of the simplicity of scheduling. Although the previously proposed round-robin algorithms achieves 100% throughput asymptotically under uniform Bernoulli i.i.d. traffic, these algorithms do not have a satisfactory performance under nonuniform traffic. In this paper, we propose a dual round-robin algorithm for a CICQ switch with one-cell crosspoint buffers. With our algorithm, each input arbiter is associated with dual round-robin pointers. Unlike the previously proposed algorithms, the new algorithm has distinctive roundrobin pointer updating rules which are efficient to cope with nonuniform traffic patterns. Extensive simulations show that our algorithm achieves nearly 100% throughput and low average delay under uniform and a broad class of nonuniform traffic patterns.
Citation:
Yanfeng Zheng, Chun Shao, "An Efficient Round-Robin Algorithm for Combined Input-Crosspoint-Queued Switches," icas-icns, pp.2, Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-icns'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.