The Folded Hypercube ATM Switches

Abstract

Over the past few years, many high performance asynchronous transfer mode (ATM) switches have been proposed. The majority of these switches have high performance but also high hardware complexity. Therefore, there is a need for switch designs with low complexity and high performance. This research proposes three new ATM switches based on the folded hypercube network (FHC). The performance of the three architectures are studied using a network model and simulation. The major performance parameters measured are the cell loss rate and cell delay time through the switch under uniform, normal, and bursty traffic patterns. To guarantee faster switching of time-sensitive cells, the routing algorithm of the three switches uses a priority scheme that gives higher precedence to the time-sensitive cells. Also, an output buffer controller is designed to manage the buffers in a fair manner. The three proposed switch architectures have lower complexity while providing equivalent or better switching performance compared to other more complex ATM switches described in the literature. This research shows a new approach to designing ATM switches by using the FHC as the switching fabric for the first time instead of using the crossbar, multi-path, or Banyan-based switching fabrics.iii DedicationsAfter a long and painful fight against cancer, my grandfather passed away on Christmas Eve, 1999.He deeply wanted to, but was not able to see me receive the doctorate degree. I was blessed to receive his continual love and support for me. I hope he is looking down on me from heaven feeling proud.This dissertation is dedicated to my grandfather, Wookyu Park, in his loving memory.

Star Structure Connectivity of Folded hypercubes and Augmented cubes

“…In recent years, much of the work has been focused on structure connectivity of hypercube and its variants (see, for example, [9, 12-14, 18, 22]). The n-dimensional folded hypercube F Q n is a highly symmetric graph as a underlying topology of several parallel systems, such as ATM Switches [17], PM21 networks [8] and 3D-FolH-NOC network [4]. In [1], we showed that κ(F Q…”

A New Approach For Optimal MIMD Queueless Routing Of Omega and Inverse-Omega Permutations On Hypercubes

“…The partition of π in dimension 3 is realised by the perfect matching Γ=(0, 1,2,11,4,13,14,7,8,9,10,3,12,5,6,11) induced by the boldfaced "1" of Table 5. Table 5.…”

“…To illustrate, let's consider π= (14,7,0,13,2,11,4,1,8,3,9,10,12,15,6,5) which is the inverse of the permutation (2,7,4,9,6,15,14,1,8,10,11,5,12,3,0,13). It can be easily verified that the routing paths of π by successive moves in dimension 0 of the suitable messages are the ones given in Table 7.…”

“…They have also been used as a means of interconnecting and extending switching matrices in ATM cross connects [3] or proposed as a model for new ATM switches with low complexity and high performance [4]. Nowadays, they continue to be an attractive solution for multicore processor IN [5].…”

On g-extra connectivity of folded hypercubes

“…More importantly, several parallel systems, such as, ATM switches [19,20], PM21 networks [16], and 3D-FolH-DOC networks [10], have used the folded hypercubes as underlying topologies.…”