Logarithmic delay for N × N packet switches under the crossbar constraint

Authors:
Michael J. Neely;Eytan Modiano;Yuan-Sheng Cheng
Affiliations:
Department of Electrical Engineering, University of Southern California, Los Angeles, CA;Department of Aeronautics and Astronautics and The Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical Engineering, University of Southern California, Los Angeles, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2007

Citing 7
Cited 15

Data networks

Data networks
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Scheduling nonuniform traffic in a packet-switching system with small propagation delay

IEEE/ACM Transactions on Networking (TON)
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the stability of input-queued switches with speed-up

IEEE/ACM Transactions on Networking (TON)
Multicast traffic in input-queued switches: optimal scheduling and maximum throughput

IEEE/ACM Transactions on Networking (TON)
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

Frame-aggregated concurrent matching switch

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Input-queued switches with logarithmic delay: necessary conditions and a reconfigurable scheduling algorithm

Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks

IEEE/ACM Transactions on Networking (TON)
Node weighted scheduling

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic

IEEE/ACM Transactions on Networking (TON)
Workload optimality in switches without arrivals

ACM SIGMETRICS Performance Evaluation Review
Traffic scheduling for frame length minimization in OFDMA based systems

Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Throughput-delay tradeoff for hierarchical cooperation in ad hoc wireless networks

IEEE Transactions on Information Theory
The concurrent matching switch architecture

IEEE/ACM Transactions on Networking (TON)
Optimal scaling of average queue sizes in an input-queued switch: an open problem

Queueing Systems: Theory and Applications
Optimal queue-size scaling in switched networks

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Modeling towards incremental early analyzability of networked avionics systems using virtual integration

ACM Transactions on Embedded Computing Systems (TECS)
Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound

Real-Time Systems
Low-complexity scheduling algorithms for multichannel downlink wireless networks

IEEE/ACM Transactions on Networking (TON)
Queueing system topologies with limited flexibility

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.06

Visualization

Abstract

We consider the fundamental delay bounds for scheduling packets in an N × N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at leastO(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the best known delay bound for packet switches, and is the first analytical proof that sublinear delay is achievable in a packet switch with random inputs.