A fair and bandwidth-guaranteed scheduling algorithm for buffered crossbar switches
Lists
Only you see this
Abstract
Buffered crossbar switch is becoming attractive due to its feature of distributed scheduling, which makes the scheduler more scalable than that in an un-buffered crossbar switch. However, previous researches on buffered crossbar switches mainly aimed at improving the throughput and cell delay performance, scarcely at the fairness and bandwidth guarantee. In this paper, we discuss the necessities of providing bandwidth guarantee in buffered crossbar switches, and propose a novel RR_MCF algorithm. RR_MCF uses a simple round robin policy at input scheduling, and a most credit first policy at output scheduling. By given a predetermined reserved bandwidth matrix, simulations show RR_MCF could provide good bandwidth guarantee for each flow, even with the presence of ill-behaved flows.
BibTeX
@inproceedings{xu2005fair,
author = {Yang Xu and Beibei Wu and Wei Li and Wenjie Li and Bin Liu},
title = {{A fair and bandwidth-guaranteed scheduling algorithm for buffered crossbar switches}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2005},
doi = {10.1117/12.631053},
}Loading related content...