Multicast Communications in Symmetric Networks
碩士 === 國立成功大學 === 資訊工程研究所 === 89 === In this thesis we propose a new Hamiltonian cycle model to exploit the feature of the symmetric networks. Based on this model two efficient multicast routing algorithms, uniform multicast routing algorithm and fixed multicast routing algorithm, are dev...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/41023842154309699727 |
| Summary: | 碩士 === 國立成功大學 === 資訊工程研究所 === 89 === In this thesis we propose a new Hamiltonian cycle model to exploit the feature of the symmetric networks. Based on this model two efficient multicast routing algorithms, uniform multicast routing algorithm and fixed multicast routing algorithm, are developed. These multicast routing algorithms allow the multicast communication to utilize the channels uniformly in order to balance the path length of the message worms, making the multicasting more efficient in the symmetric networks. Then the Hamiltonian cycle model is mapped to torus and star networks. Thus the messages can be multicasted in these two networks using uniform and fixed multicast routing algorithms. The simulation results are also given to show the performance of these two multicast routing algorithms on the 2D/3D torus networks and the 6-star network. These two multicast routing algorithms do perform significantly faster multicasting than the Hamiltonian path based schemes on the symmetric networks. Besides providing the efficient multicast communication, the Hamiltonian cycle model only needs two sets of the virtual channels to avoid the deadlock. The Hamiltonian cycle model is really an efficient and economic strategy for multicasting in the symmetric networks.
Overview of Some Background Knowledge
Hamiltonian Cycle Model
Multicast Routing Algorithms
Hamiltonian Cycle Model in Torus and Star Networks
Performance Study
Conculsions and Future Work
|
|---|