A distributed switch scheduling algorithm

Authors:
Petar Momčilović
Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48105, United States
Venue:
Performance Evaluation
Year:
2007

Citing 7
Cited 0

Faster scaling algorithms for general graph matching problems

Journal of the ACM (JACM)
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Trajectory sampling for direct traffic observation

IEEE/ACM Transactions on Networking (TON)
An Implementable Parallel Scheduler for Input-Queued Switches

IEEE Micro
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Randomized scheduling algorithms for high-aggregate bandwidth switches

IEEE Journal on Selected Areas in Communications
On the stability of local scheduling policies in networks of packet switches with input queues

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The maximum weight matching algorithm is a high-performance scheduling algorithm for cross-bar switches. It is known that it performs optimally under heavy loads. However, its centralized nature and high computational complexity limit the algorithm's applicability. This paper presents a randomized algorithm for distributed switch scheduling that is capable of delivering high throughput.