High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON)
The effects of temporary sessions on network performance
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Throughput Region of Finite-Buffered Networks
IEEE Transactions on Parallel and Distributed Systems
Adversarial Multiple Access Channel with Individual Injection Rates
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On tracking the behavior of an output-queued switch using an input-queued switch
IEEE/ACM Transactions on Networking (TON)
The robustness of stability under link and node failures
Theoretical Computer Science
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Job scheduling for maximal throughput in autonomic computing systems
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Packet scheduling across networks of switches
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
On the interaction between TCP-like sources and throughput-efficient scheduling policies
Performance Evaluation
| Hi-index | 0.00 |
Recent research has generated many interesting results on scheduling input-queued switches. However, most of this work focuses on a single switch in isolation. In this paper, we study the problem of scheduling a network of input-queued switches. We consider the Longest-Queue-First and Longest-Port-First scheduling policies that are stable for a single switch, and show that they can be unstable even for a fixed traffic pattern in a simple network of eight input-queued switches. Moreover, this result holds regardless of how the traffic sharing the same port-pair is scheduled at each switch. On the positive side, we present a policy, Longest-in-Network, that is stable in networks of input-queued switches. This result holds even if the traffic pattern is allowed to change over time.