Improving the performance of input-queued ATM packet switches
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
Queueing Systems: Theory and Applications - Polling models
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
Balanced sequences and optimal routing
Journal of the ACM (JACM)
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
Optimal Allocation Sequences of Two Processes Sharing aResource
Discrete Event Dynamic Systems
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
Optimal Open-Loop Control of Vacations, Polling and Service Assignment
Queueing Systems: Theory and Applications
Guaranteed scheduling for switches with configuration overhead
IEEE/ACM Transactions on Networking (TON)
On guaranteed smooth scheduling for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Packet-mode emulation of output-queued switches
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Minimizing internal speedup for performance guaranteed switches with optical fabrics
IEEE/ACM Transactions on Networking (TON)
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
Achieving high throughput in input-queued switches has been found to be difficult, especially when traffic is nonuniform in the sense that different inputs have very different cell generation rates. We show that for general arrival processes, 100% throughput can be achieved with a simple algorithm that is very easy to implement.We consider a switch in which in each time slot, at most one cell may be transmitted from each input, and at most one cell may be received at each output. Cells that are destined for output j arrive at input i according to a stationary and ergodic process, and arrivals are queued at the input. The problem is to decide which inputs are to transmit to which outputs in each time slot in order to maximize throughput. Necessary conditions for stability are that the total arrival rate to each input must be less than 1, and the total arrival rate destined to each output must be less than 1. We propose a simple scheduling algorithm and show that with this algorithm the necessary conditions for stability are also sufficient.