Analysis of a switching fabric employing direct interconnection networks

Abstract

A k-ary n-cube direct interconnection structure is originally introduced and developed in the context of massively parallel computer (MPC) architectures. In recent years, with the development of VLSI (very large scale integration) technology and requirements of high performance Internet routers/switches, the k-ary n-cube interconnection network is considered to build Terabit routers. Analysis model for three-dimensional torus is presented as switch cores of Internet routes. Delay/throughput characteristics are measured with four different routing algorithms, buffer length and scale of fabric. Also a new algorithm Ladder is presented. All simulation experiments are done on OPNET. Results show that this architecture can build high performance routers. Compared to other routing algorithms, Ladder has better performance.