Data structures and network algorithms
Data structures and network algorithms
| Hi-index | 0.00 |
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability and on average delay for single switches. However, recent research has demonstrated that most of these scheduling algorithms do not guarantee stability for networks of switches. Most of the research that treats networks of switches proposes switching policies that require coordination among the single switches. The problem to find distributed scheduling policies that guarantee the stability of a network of switches has so far only been investigated for a policy based on a computationally very complex maximum weight matching algorithm. In this paper, we investigate distributed scheduling algorithms of low complexity that belong to the classes of maximal weight matching algorithms, p-maximal weight matching algorithms for switch architectures based on a space-division multiplexing extension, and MNCM algorithms. For these scheduling algorithms, we prove the stability of networks of input-queued switches where all switches deploy the same scheduling policy. We also show that networks of input-queued switches in which specific classes of different switching policies are deployed simultaneously at different switches are stable.