Fault tolerant interleaved switching fabrics for scalable high-performance routers

IEEE Transactions on Parallel and Distributed Systems

Volumn 18, Issue 12, 2007, Pages 1727-1739

  He, Rongsen ^a   Delgado Frias, José G ^a  

^a WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

I Cubeout network; Interleaved switching fabrics; Multistage interconnection network (MIN); RAIF (Redundant Array of Independent Fabrics)

Indexed keywords

COMPUTER SIMULATION; FAULT TOLERANCE; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; PACKET NETWORKS; SCALABILITY;

I-CUBEOUT NETWORK; INTERLEAVED SWITCHING FABRICS; MULTISTAGE INTERCONNECTION NETWORK; REDUNDANT ARRAY OF INDEPENDENT FABRICS (RAIF);

ROUTING PROTOCOLS;

EID: 36348982717     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2007.1109     Document Type: Article

References (31)

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. See, "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 (2n - 1)-Stage Shuffle-Exchange Networks," SIAM J. Computing, vol. 32, no. 3, pp. 557-585, 2003.
13. V.E. Boneš, 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. 2N) - 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. 2N 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.