Krishnendu Roy
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.
- H. J. Chao and B. Liu. High Performance Switches and Routers. Wiley-IEEE Press, USA, 2007. Google Scholar
Digital Library
- C. Fraleigh, S. Moon, B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, and S. C. Diot. Packet-level traffic measurements from the sprint ip backbone. Network, IEEE, 17(6):6--16, December 2003. Google ScholarDigital Library
- S. Iyer and N. McKeown. Maximum size matchings and input queued switches. In 40th Annual Allerton Conf. on Communication, Control, and Computing, 2002.Google Scholar
- P. Kelsen. Optimal parallel algorithm for maximal matching. Information Processing Letters, 52(4):223--228, 1994. Google ScholarDigital Library
- E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan. Bounds on average delays and queue size averages and variances in input-queued cell-based switches. In IEEE INFOCOM, 2001.Google ScholarCross Ref
- X. Li and I. Elhanany. Stability of frame-based maximal weight matching algorithms with reconfiguration delays. In Workshop on High Performance Switching and Routing, May 2005.Google Scholar
- N. McKeown. The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Transactions on Networking, 7(2):188--201, 1999. Google ScholarDigital Library
- S. Mneimneh, V. Sharma, and K. Y. Siu. Switching using parallel input-output queued switches with no speedup. IEEE/ACM Transactions on Networking, 10(5):653--665, 2002. Google ScholarDigital Library
- M. J. Neely, E. Modiano, and Y. S. Cheng. Logarithmic delay for n x n packet switches under the crossbar constraint. IEEE/ACM Transactions on Networking, 15(3):3--9, June 2007. Google ScholarDigital Library
Index Terms
- Input-queued switches with logarithmic delay: necessary conditions and a reconfigurable scheduling algorithm
Recommendations
Frame-Based Packet-Mode Scheduling for Input-Queued Switches
Most packet scheduling algorithms for input-queued switches operate on fixed-sized packets known as cells. In reality, communication traffic in many systems such as Internet runs on variable-sized packets. Motivated by potential savings of segmentation ...
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches
Input-queued (IQ) switches overcome the scalability problem suffered by output-queued switches. In order to provide differential quality of services (QoS), we need to efficiently schedule a set of incoming packets so that every packet can be transferred ...
A logarithmic scheduling algorithm for high speed input-queued switches
Throughput of input queued switches using FIFOs is limited due to the Head of Line blocking (HoL) problem. Using VOQs at inputs and a proper scheduling algorithm, near 100% throughput can be achieved. Scaling in terms of number of ports and line rates ...
Comments