Delay bounds for approximate maximum weight matching algorithms for input queued switches
- 25 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1024-1031
- https://doi.org/10.1109/infcom.2002.1019350
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Achieving 100% throughput in an input-queued switchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Linear complexity algorithms for maximum throughput in radio networks and input queued switchesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The throughput of data switches with and without speedupPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient randomized algorithms for input-queued switch schedulingIEEE Micro, 2002
- Load balanced Birkhoff–von Neumann switches, part I: one-stage bufferingComputer Communications, 2002
- Bounds on average delays and queue size averages and variances in input-queued cell-based switchesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- The iSLIP scheduling algorithm for input-queued switchesIEEE/ACM Transactions on Networking, 1999
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networksIEEE Transactions on Automatic Control, 1992
- Input Versus Output Queueing on a Space-Division Packet SwitchIEEE Transactions on Communications, 1987
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982