loading...
Circular window control schemes in fast packet switches
Las Vegas, Nevada, USA September 20-September 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCCN.1995.540109Fourth International Conference on Co ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yann-Hang Lee, Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
R. Chow, Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
S.E. Cheung, Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
Abstract: In this paper, we investigate a scheduling algorithm, called circular window control (CWC) scheme, for packet switch fabrics. The scheme is simple and efficient. It uses a fixed length window with circular transmission sequences to minimize possible switch and output contentions. The scheme can attain a maximal throughput of 100%; in nonblocking switches as well as banyan-based blocking switches. The performance analyses and simulation results of the CWC scheme an also presented.
Index Terms:
packet switching; circular window control scheme; fast packet switches; scheduling algorithm; packet switch fabrics; fixed length window; circular transmission sequences; contentions minimisation; maximal throughput; nonblocking switches; banyan-based blocking switches; performance analysis; simulation results; queueing
Citation:
Yann-Hang Lee, R. Chow, S.E. Cheung, "Circular window control schemes in fast packet switches," icccn, pp.0116, Fourth International Conference on Computer Communications and Networks (ICCCN '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.