Decentralized Reconfiguration of Multicast Trees on Faulty Networks

• Main Authors: Yao-Te Huang, 黃耀德
• Other Authors: Lih-Chyau wuu
• Format: Others
• Language: zh-TW
• Published: 1999
• Online Access: http://ndltd.ncl.edu.tw/handle/44291269474094645687

碩士 === 國立雲林科技大學 === 電子工程與資訊工程技術研究所 === 87 === In this paper, we propose a distributed reconfigruing multicast tree protocol. It is assumed that a multicast tree, which has the minimal total tree cost, exists originally, but due to some edges or processors fail, the tree is broken into several fragments. Our protocol reconstructs the multicast tree, instead of starting from scratch, keeping the original tree structure by distributed finding the nearest fragment to merge together. The protocol is distributed, it does not require knowledge of the complete network topology, and each node proceeds in three phases: changing colors, finding the shortest paths, and merging the fragments. The protocol terminates when the number of fragments becomes one and the message complexity is O(kd2(N-NT)+kdNT), where k is the number of fragments, d is the node average degree, N is the number of nodes in network, and NT is the number of tree nodes.