This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault Tolerant Interleaved Switching Fabrics For Scalable High-Performance Routers
December 2007 (vol. 18 no. 12)
pp. 1727-1739
Scalable high performance routers and switches are required to provide a larger number of ports, higher throughput, and good reliability. Most of today’s routers and switches are implemented using single crossbar as the switched fabric. The single crossbar complexity increases at O(N2) in terms of crosspoint number, which might become unacceptable for scalability as the port number (N) increases. A delta class self-routing multistage interconnection network (MIN) with the complexity of O(N ? log2N) has been widely used in the ATM switches. However, the reduction of the crosspoint number results in considerable internal blocking. A number of scalable methods have been proposed to solve this problem. One of them uses more stages with recirculation architecture to reroute the deflected packets, which greatly increase the latency. In this paper, we propose an interleaved multistage switching fabrics architecture and assess its throughput with an analytical model and simulations. We compare this novel scheme with some previous parallel architectures and show its benefits. From extensive simulations under different traffic patterns and fault models, our interleaved architecture achieves better performance than its counterpart of single panel fabric. Our interleaved scheme achieves speedups (over the single panel fabric) of 3.4 and 2.25 under uniform and hot-spot traffic patterns, respectively at maximum load (p=1). Moreover, the interleaved fabrics show great tolerance against internal hardware failures.

[1] N. McKeown, “A Fast Switched Backplane for a Gigabit Switched Router,” http://tiny-tera.stanford.edu/~nickm/papers cisco_ fasts_wp.pdf, Dec. 1997.
[2] 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.
[3] N. McKeown, “The iSLIP Scheduling Algorithm for Input-Queued Switches,” IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-200, Apr. 1999.
[4] L.R. Goke and G.J. Lipovski, “Banyan Networks for Partitioning Processor Systems,” Proc. First Ann. Symp. Computer Architecture, pp. 21-28, Dec. 1973.
[5] D. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Computers, vol. 24, no. 12, pp. 1145-1155, Dec. 1975.
[6] C.-L. Wu and T.-Y. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 29, no. 8, pp. 694-702, Aug. 1980.
[7] M.C. Pease, “The Indirect Binary n-Cube Microprocessor Array,” IEEE Trans. Computers, vol. 26, no. 5, pp. 458-473, May 1977.
[8] J.H. Patel, “Performance of Processor-Memory Interconnections for Multiprocessors,” IEEE Trans. Computers, vol. 30, no. 10, pp.771-780, Oct. 1981.
[9] C.-L. Wu and T.-Y. Feng, “The Universality of the Shuffle-Exchange Network,” IEEE Trans. Computers, vol. 30, no. 5, pp. 324-332, May 1981.
[10] T.-Y. Feng and S.-W. Seo, “A New Routing Algorithm for a Class of Rearrangeable Networks,” IEEE Trans. Computers, vol. 43, no. 11, pp. 1,270-1,280, Nov. 1994.
[11] M.K. Kim, H. Yoon, and S.R. Maeng, “On the Correctness of Inside-Out Routing Algorithm,” IEEE Trans. Computers, vol. 46, no. 7, pp. 820-823, July 1997.
[12] H. Çam, “Rearrangeability of $(2{\rm n} - 1){\hbox{-}}{\rm{Stage}}$ Shuffle-Exchange Networks,” SIAM J. Computing, vol. 32, no. 3, pp. 557-585, 2003.
[13] V.E. Beneš, Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.
[14] D.C. Opferman and N.T. Tsao-Wu, “On a Class of Rearrangeble Switching Networks, Part I: Control Algorithm,” Bell System Technical J., vol. 50, no. 5, pp. 1579-1600, May-June 1971.
[15] G. Lev, N. Pippenger, and L.G. Valiant, “A Fast Parallel Algorithm for Routing in Permutation Networks,” IEEE Trans. Computers, vol. 30, no. 2, pp. pp. 93-100, Feb. 1981.
[16] D. Nassimi and S. Sahni, “Parallel Algorithm to Set Up the Beneš Permutation Network,” IEEE Trans. Computers, vol. 31, no. 2, pp.148-154, Feb. 1982.
[17] K.Y. Lee, “On the Rearrangeability of $2(\log_{2}{\rm N}) - 1$ Stage Permutation Networks,” IEEE Trans. Computers, vol. 34, no. 5, pp. 412-425, May 1985.
[18] H. Çam and J.A.B. Fortes, “Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 7, pp. 733-741, July 1999.
[19] S. Bassi, M. Decina, P. Giacomazzi, and A. Pattavina, “Multistage Shuffle Networks with Shortest Path and Deflection Routing for High Performance ATM Switching: The Open-Loop Shuffleout,” IEEE Trans. Comm., vol. 42, no. 10, pp. 2881-2889, Oct. 1994.
[20] M. Decina, P. Giacomazzi, and A. Pattavina, “Multistage Shuffle Networks with Shortest Path and Deflection Routing for High Performance ATM Switching: The Closed-Loop Shuffleout,” IEEE Trans. Comm., vol. 42, no. 11, pp. 3034-3044, Nov. 1994.
[21] N.-F. Tzeng, “Multistage-Based Switching Fabrics for Scalable Routers,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 4, pp. 304-318, Apr. 2004.
[22] N. Ni and L.N. Bhuyan, “Fair Scheduling in Internet Routers,” IEEE Trans. Computers, vol. 51, no. 6, pp. 686-701, June 2002.
[23] C.P. Kruskal and M. Snir, “The Performance of Multistage Interconnection Networks for Multiprocessors,” IEEE Trans. Computers, vol. 32, no. 12, pp. 1091-1098, Dec. 1983.
[24] A. Pattavina, Switching Theory: Architecture and Performance in Broadband ATM Networks. Wiley, 1998.
[25] C.-T. Lea, “${\rm{Multi}}{\hbox{-}}\log_{2}{\rm N}$ Networks and Their Applications in High-Speed Electronic and Photonic Switching Systems,” IEEE Trans. Comm., vol. 38, no. 10, pp. 1740-1749, Oct. 1990.
[26] S. Iyer and N. McKeown, “Analysis of the Parallel Packet Switch Architecture,” IEEE/ACM Trans. Networking, vol. 11, no. 2, pp. 314-324, Apr. 2003.
[27] S. Iyer and N. McKeown, “Making Parallel Packet Switches Practical,” Proc. IEEE INFOCOM, vol. 3, pp. 1680-1687, 2001.
[28] S. Chuang, A. Goel, N. McKeown, and B. Prabhakar, “Matching Output Queueing with a Combined Input/Output-Queued Switch,” IEEE J. Selected Areas in Comm., vol. 17, no. 6, pp. 1030-1039, June 1999.
[29] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 2003.
[30] K. Constantinides et al., “BulletProof: A Defect Tolerant CMP Switch Architecture,” Proc. Int'l Symp. High-Performance Computer Architecture (HPCA '06), pp. 5-16, Feb. 2006.
[31] D.A. Patterson, G.A. Gibson, and R.H. Katz, “A Case for Redundant Arrays of Inexpensive Disks (RAID),” Proc. ACM SIGMOD, pp. 109-116, June 1988.

Index Terms:
Interleaved switching fabrics, multistage interconnection network (MIN), RAIF (Redundant Array of Independent Fabrics), I-Cubeout network, ,
Citation:
Rongsen He, Jos? G. Delgado-Frias, "Fault Tolerant Interleaved Switching Fabrics For Scalable High-Performance Routers," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 12, pp. 1727-1739, Dec. 2007, doi:10.1109/TPDS.2007.1109
Usage of this product signifies your acceptance of the Terms of Use.