Fair Scheduling for Input Buffered Switches

Authors:
Nan Ni;Laxmi N. Bhuyan
Affiliations:
IBM Corporation, Austin, TX 78758, USA;Computer Science and Engineering, University of California, Riverside, CA 92521, USA
Venue:
Cluster Computing
Year:
2003

Citing 0
Cited 2

Bandwidth guaranteed multicast scheduling for virtual output queued packet switches

Journal of Parallel and Distributed Computing
Distributed WFQ scheduling converging to weighted max-min fairness

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Input buffered switch architecture has become attractive for implementing high performance switches for workstation clusters. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative Fair Scheduling (iFS) scheme for input buffered switches that supports fair bandwidth distribution among the flows and achieves asymptotically 100% throughput. We then apply the idea of fair scheduling to switches with multicasting capability and propose an mFS scheme which allocates bandwidth to various flows according to their reservations. We show that mFS produces throughput comparable to the existing schemes while distributing the bandwidth as per the given reservations. Extensive simulation results are presented to validate the effectiveness of our proposed schemes.