Data structures and network algorithms
Data structures and network algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Scaling internet routers using optics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering
Computer Communications
Matching output queueing with a combined input/output-queued switch
IEEE Journal on Selected Areas in Communications
On the speedup required for work-conserving crossbar switches
IEEE Journal on Selected Areas in Communications
Packet-mode emulation of output-queued switches
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Experimental evaluation of a coarse-grained switch scheduler
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Congestion management for non-blocking clos networks
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
On guaranteed smooth switching for buffered crossbar switches
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of such systems has been difficult to predict in the presence of the extreme traffic conditions that can arise in the Internet. Recent work introduced distributed scheduling, to regulate the flow of traffic in such systems. This work demonstrated, using simulation and experimental measurements, that distributed scheduling can deliver robust performance for extreme traffic. Here, we show that distributed schedulers can be provably work-conserving for speedups of 2 or more. Two of the three schedulers we describe were inspired by previously published crossbar schedulers. The third has no direct counterpart in crossbar scheduling. In our analysis, we show that distributed schedulers based on blocking flows in small-depth acyclic flow graphs can be work-conserving, just as certain crossbar schedulers based on maximal bipartite matchings have been shown to be work-conserving. We also study the performance of practical variants of these schedulers when the speedup is less than 2, using simulation.