The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2009 vol.58)
pp: 260-274
Deng Pan , Florida International University, Miami
Yuanyuan Yang , State University of New York, Stony Brook
ABSTRACT
Buffered crossbar switches are a special type of crossbar switches. In such a switch, besides normal input queues and output queues, a small buffer is associated with each crosspoint. Due to the introduction of crosspoint buffers, output and input contention is eliminated, and the scheduling process for buffered crossbar switches is greatly simplified. Moreover, since different input ports and output ports work independently, the switch can easily schedule and transmit variable length packets. Compared with fixed length packet scheduling, variable length packet scheduling has some unique advantages: higher throughput, shorter packet latency, and lower hardware cost. In this paper, we present a fast and practical scheduling scheme for buffered crossbar switches called Localized Independent Packet Scheduling (LIPS). With LIPS, an input port or output port makes scheduling decisions solely based on the state information of its local crosspoint buffers, i.e., the crosspoint buffers where the input port sends packets to or the output port retrieves packets from. The localization feature makes LIPS suitable for a distributed implementation and thus highly scalable. Since no comparison operation is required in LIPS, scheduling arbiters can be efficiently implemented using priority encoders, which can make arbitration decisions quickly in hardware. Another advantage of LIPS is that each crosspoint needs only L (the maximum packet length) buffer space, which minimizes the hardware cost of the switches. We theoretically analyze the performance of LIPS and, in particular, prove that LIPS achieves 100 percent throughput for any admissible traffic with speedup of two. We also discuss in detail the implementation architecture of LIPS and analyze the packet transmission timing in different scenarios. Finally, simulations are conducted to verify the analytical results and measure the performance of LIPS.
INDEX TERMS
Buffered crossbar switches, packet scheduling, 100 percent throughput, priority encoders.
CITATION
Deng Pan, Yuanyuan Yang, "Localized Independent Packet Scheduling for Buffered Crossbar Switches", IEEE Transactions on Computers, vol.58, no. 2, pp. 260-274, February 2009, doi:10.1109/TC.2008.140
REFERENCES
[1] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” Proc. ACM SIGCOMM '89, vol. 19, no. 4, pp. 3-12, Sept. 1989
[2] M. Shreedhar and G. Varghese, “Efficient Fair Queuing Using Deficit Round Robin,” IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375-385, June 1996.
[3] D. Pan and Y. Yang, “Credit Based Fair Scheduling for Packet Switched Networks,” Proc. IEEE INFOCOM '05, pp. 843-854, Mar. 2005.
[4] T. Anderson, S. Owicki, J. Saxe, and C. Thacker, “High-Speed Switch Scheduling for Local-Area Networks,” ACM Trans. Computer Systems, vol. 11, no. 4, pp. 319-352, Nov. 1993.
[5] N. McKeown, “The iSLIP Scheduling Algorithm for Input-Queued Switches,” IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-201, 1999.
[6] H.J. Chao, “Saturn: A Terabit Packet Switch Using Dual Round-Robin,” IEEE Comm. Magazine, vol. 8, no. 12, pp. 78-84, Dec. 2000.
[7] N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, “Achieving 100 Percent Throughput in an Input Queued Switch,” IEEE Trans. Comm., vol. 47, no. 8, pp. 1260-1267, 1999.
[8] J.G. Dai and B. Prabhakar, “The Throughput of Data Switches with and without Speedup,” Proc. IEEE INFOCOM '00, vol. 2, pp. 556-564, Mar. 2000.
[9] D. Pan and Y. Yang, “Pipelined Two Step Iterative Matching Algorithms for CIOQ Crossbar Switches,” Proc. ACM/IEEE Symp. Architectures for Networking and Comm. Systems (ANCS'05), Oct. 2005.
[10] M.J. Karol, M.J. Hluchyj, and S.P. Morgan, “Input versus Output Queueing on a Space-Division Packet Switch,” IEEE Trans. Comm., vol. 35, pp. 1347-1356, 1987.
[11] N. McKeown, “A Fast Switched Backplane for a Gigabit Switched Router,” Business Comm. Rev., vol. 27, no. 12, 1997.
[12] J. Turner, “Strong Performance Guarantees for Asynchronous Crossbar Schedulers,” Proc. IEEE INFOCOM '06, Apr. 2006.
[13] J. Xu and R. Lipton, “On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms,” Proc. ACM SIGCOMM '02, Aug. 2002.
[14] M. Morris Mano, Digital Design, third ed. Prentice Hall, Aug. 2001.
[15] I. Stoica and H. Zhang, “Exact Emulation of an Output Queueing Switch by a Combined Input Output Queueing Switch,” Proc. Sixth IEEE/IFIP Int'l Workshop Quality of Service (IWQoS '98), pp.218-224, 1998.
[16] S.-T. Chuang, A. Goel, N. McKeown, and B. Prabhkar, “Matching Output Queueing with a Combined Input Output Queued Switch,” Proc. IEEE INFOCOM '99, pp. 1169-1178, 1999.
[17] D. Stephens and H. Zhang, “Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture,” Proc. IEEE INFOCOM '98, pp. 282-290, Mar. 1998.
[18] R. Rojas-Cessa, E. Oki, Z. Jing, and H.J. Chao, “CIXB-1: Combined Input-Once-Cell-Crosspoint Buffered Switch,” Proc. IEEE Workshop High Performance Switching and Routing (HPSR '01), July 2001.
[19] R. Rojas-Cessa, E. Oki, and H.J. Chao, “CIXOB-k: Combined Input-Crosspoint-Output Buffered Packet Switch,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '01), Nov. 2001.
[20] G. Kornaros, “BCB: A Buffered Crossbar Switch Fabric Utilizing Shared Memory,” Proc. Ninth EUROMICRO Conf. Digital System Design (DSD '06), pp. 180-188, Aug. 2006.
[21] L. Mhamdi and M. Hamdi, “MCBF: A High-Performance Scheduling Algorithm for Buffered Crossbar Switches,” IEEE Comm. Letters, vol. 7, no. 9, pp. 451-453, Sept. 2003.
[22] X. Zhang and L. Bhuyan, “An Efficient Scheduling Algorithm for Combined-Input-Crosspoint-Queued (CICQ) Switches,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '04), Nov. 2004.
[23] S. He, S. Sun, H. Guan, Q. Zheng, Y. Zhao, and W. Gao, “On Guaranteed Smooth Switching for Buffered Crossbar Switches,” IEEE/ACM Trans. Networking, vol. 16, no. 3, June 2008.
[24] M. Lin and N. McKeown, “The Throughput of a Buffered Crossbar Switch,” IEEE Comm. Letters, vol. 9, no. 5, pp. 465-467, May 2005.
[25] L. Mhamdi and M. Hamdi, “Output Queued Switch Emulation by a One-Cell-Internally Buffered Crossbar Switch,” Proc. IEEE Global Telecommunications Conf. (GLOBECOM '03), vol. 7, pp. 3688-3693, Dec. 2003.
[26] S. Chuang, S. Iyer, and N. McKeown, “Practical Algorithms for Performance Guarantees in Buffered Crossbars,” Proc. IEEE INFOCOM '05, Mar. 2005.
[27] B. Magill, C. Rohrs, and R. Stevenson, “Output-Queued Switch Emulation by Fabrics with Limited Memory,” IEEE J. Selected Areas in Comm., vol. 21, no. 4, pp. 606-615, May 2003.
[28] M. Katevenis, G. Passas, D. Simos, I. Papaefstathiou, and N. Chrysos, “Variable Packet Size Buffered Crossbar (CICQ) Switches,” Proc. IEEE Int'l Conf. Comm. (ICC '04), vol. 2, pp.1090-1096, June 2004.
[29] M. Katevenis and G. Passas, “Variable-Size Multipacket Segments in Buffered Crossbar (CICQ) Architectures,” Proc. IEEE Int'l Conf. Comm. (ICC '05), May 2005.
[30] ftp://download.intel.com/products/processor/ xeondc54kprod brief.pdf, 2008.
[31] L. Mhamdi, C. Kachris, and S. Vassiliadis, “A Reconfigurable Hardware Based Embedded Scheduler for Buffered Crossbar Switches,” Proc. 14th ACM/SIGDA Int'l Symp. Field Programmable Gate Arrays (FPGA '06), pp. 143-149, Feb. 2006.
[32] I. Papaefstathiou, G. Kornaros, and N. Chrysos, “Using Buffered Crossbars for Chip Interconnection,” Proc. 17th Great Lakes Symp. VLSI, pp. 90-95, Mar. 2007.
[33] K. Yoshigoe, K. Christensen, and A. Jacob, “The RR/RR CICQ Switch: Hardware Design for 10-Gbps Link Speed,” Proc. 22nd IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '03), pp. 481-485, Apr. 2003.
[34] J. Hopcroft and R. Karp, “An $N^{5/2}$ Algorithm for Maximum Matching in Bipartite Graphs,” SIAM J. Computing, vol. 2, no. 4, pp. 225-231, Dec. 1973.
[35] R. Tarjan, “Data Structures and Network Algorithms,” Proc. CBMS-NSF Regional Conf. Series in Applied Math., Dec. 1983.
[36] S. Ramabhadran and J. Pasquale, “Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay,” Proc. ACM SIGCOMM '03, pp. 239-250, Aug. 2003.
463 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool