Share Email Print
cover

Proceedings Paper

A fair and bandwidth-guaranteed scheduling algorithm for buffered crossbar switches
Author(s): Yang Xu; Beibei Wu; Wei Li; Wenjie Li; Bin Liu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 25 October 2005
PDF: 12 pages
Proc. SPIE 6011, Performance, Quality of Service, and Control of Next-Generation Communication and Sensor Networks III, 60110O (25 October 2005); doi: 10.1117/12.631053
Show Author Affiliations
Yang Xu, Tsinghua Univ. (China)
Beibei Wu, Tsinghua Univ. (China)
Wei Li, Tsinghua Univ. (China)
Wenjie Li, Tsinghua Univ. (China)
Bin Liu, Tsinghua Univ. (China)


Published in SPIE Proceedings Vol. 6011:
Performance, Quality of Service, and Control of Next-Generation Communication and Sensor Networks III
Mohammed Atiquzzaman; Sergey I. Balandin, Editor(s)

© SPIE. Terms of Use
Back to Top