Input-queued switches with logarithmic delay: necessary conditions and a reconfigurable scheduling algorithm

Authors:
Krishnendu Roy;Ramachandran Vaidyanathan;Jerry L. Trahan
Affiliations:
Louisiana State University, Baton Rouge, LA;Louisiana State University, Baton Rouge, LA;Louisiana State University, Baton Rouge, LA
Venue:
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Year:
2008

Citing 6
Cited 0

An optimal parallel algorithm for maximal matching

Information Processing Letters
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Switching using parallel input-output queued switches with no speedup

IEEE/ACM Transactions on Networking (TON)
High Performance Switches and Routers

High Performance Switches and Routers
Logarithmic delay for N × N packet switches under the crossbar constraint

IEEE/ACM Transactions on Networking (TON)
Packet-level traffic measurements from the Sprint IP backbone

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Typically, a scheduling algorithm for an n x n packet switch with a crossbar as the data fabric divides time into slots, each of duration tp sufficient to transmit a packet. If a scheduling round requires tr tp time, then the switch can transmit multiple packets, up to s = ⌊tr/tp⌋, between each mapped input-output pair under the current mapping. If s = 1, there exists a frame-based scheduling algorithm with Θ(log n) delay. For uniform random traffic, we establish that the delay is Ω(n) for any s 1, hence, s = 1 is the only case where a Θ(log n) delay is achievable. Given the importance of achieving a low s, it is imperative to develop extremely fast scheduling algorithms (that reduce tr) on a mesh-based structure (corresponding to the crossbar topology of the switch). We present results for a fast scheduling algorithm that runs on a mesh-of-trees topology that can be overlaid on the crossbar switching fabric.