doi:10.1016/j.peva.2007.06.019
Copyright © 2007 Elsevier Ltd All rights reserved.
A distributed switch scheduling algorithm
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
Petar Momčilovića, 
aDepartment of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48105, United States
Available online 29 June 2007.
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.
Keywords: Cross-bar switch; Distributed scheduling; Randomized algorithm
Fig. 1. The structure of a virtual output queued switch. Packets are queued at inputs based on their destinations. Each input and output can be connected to at most one output and input, respectively, at the same time.
Fig. 2. An example of how a matching is build in the case V12>V32>V33>V11>V21>0 and all other Vij’s are equal to 0. The first timer expires at t1=V12, the second at t2=V32 and so on. When a timer expires, the input is connected to the output only if such a connection is feasible — non-feasible connections are shown with dashed lines.
This work was supported by the National Science Foundation under grant CNS-0643213.