A Scalable Core Migration Protocol for Dynamic Multicast Tree

• Main Authors: Ting-Yuan Wang, 王鼎允
• Other Authors: Shing-Tsaan Huang
• Format: Others
• Language: en_US
• Published: 2000
• Online Access: http://ndltd.ncl.edu.tw/handle/50276672958573901921

碩士 === 國立清華大學 === 資訊工程學系 === 88 === Over the year, researchers have proposed the core based trees (CBT) and protocol independent multicasting (PIM) protocols to route multicast data on Internet. Some previously proposed heuristics for locating the Core of a group typically require knowledge of the complete network topology, a requirement that is not always practical for a distributed problem such as Internet routing. Recently, many researchers have proposed distributed algorithms for locating the Core of a group. Although knowledge of the network topology is not explicitly assumed, some knowledge such as information of sources/members is necessary for computing the metric such as average tree cost or maximum end-to-end delay to find the best location of the group''s Core such that multicasting efficiently. We proposed a scalable distributed protocol that can be used to migrate Core to near-optimal location for dynamic multicast tree, and allow the Core to migrate efficiently when the multicast tree is expanded or shrunken. In our protocol, information of overall members is distributed among local Agents; the Core only maintains information of Agents of the group. Also, only the Agents participate Core selection. Therefore, the proposed protocol reduces the runtime overhead and message overhead while computing Core migration.