Paper
24 October 2005 A fair and bandwidth-guaranteed scheduling algorithm for buffered crossbar switches
Author Affiliations +
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yang Xu, Beibei Wu, Wei Li, Wenjie Li, and Bin Liu "A fair and bandwidth-guaranteed scheduling algorithm for buffered crossbar switches", Proc. SPIE 6011, Performance, Quality of Service, and Control of Next-Generation Communication and Sensor Networks III, 60110O (24 October 2005); https://doi.org/10.1117/12.631053
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Switches

Computer simulations

Astatine

Chaos

Lithium

Networks

Computing systems

Back to Top