| Summary: | 碩士 === 國立中興大學 === 資訊科學研究所 === 89 === Multicast is an important communication operation in many parallel applications. As the demand for point-to-multipoint services grows, it becomes increasingly important to incorporate multicast capability.
This article explores the problem of efficiently multicasting packets on the multistage interconnection networks in accordance with a given set of multicast communications. The multistage interconnection networks (MINs) with N inputs and N outputs of 2 X 2 switches. The multistage interconnection networks construction with wraparound connections lead us to propose a new scheme for nonblocking packet multicast. Previous approaches use a cascade of various MINs to multicast packets in a finite number of steps. Some others use single MINs to recycle and copy packets repeatedly until the multicast is done. Our proposed scheme exhibits a different approach from the previous ones, yet possessing many desirable features of theirs.. It is capable of accomplishing any multiple multicast in two finite passes. The first pass replicate individual packets simultaneously. Then the second pass routes these packets to the destinations. We demonstrate that paths created in the two passes are all link-disjoint so that nonblocking multicast is achieved.
This thesis consists of two parts. Part I serves as an introduction. Part II includes primary theorems and the proposed network structures. Part I consists of chapters 1 through 3. Chapter 1 provides an overview of this thesis. In chapter 2, we explore the characteristics of MIN and describe a network model. Chapter 3 introduces fundamental properties, network architectures and routing algorithms of MIN in the form of Baseline and Omega network. Part II consists of chapters 4 through 6. We introduce some preliminaries in chapter 4. Chapter 5 presents the main body of the proposed network structures. Finally, chapter 6 gives the conclusion and the future works of this thesis work.
|
|---|
