Scalable Multicast Tree Construction For Wide Area Networks

摘要

In this thesis, we address the problem of multicast tree construction withguaranteed quality of service (QoS) in networks with asymmetric link costs. We describe a protocol to locate distribution centers for an interaction based on network load and participant location. We then describe the protocol for constructing a shared tree around the selected center. We compare the quality of the resultant trees on large hypothetical networks with that of source based trees. Additional comparisons are made with other multicast techniques such as Protocol Independent Multicasting (PIM) and Core Based Trees (CBT). Our results show that the shared trees built using our approach represent a significant improvement over other techniques when the network topology contains a large degree of asymmetry in link cost. This makes our approach the most general of all other techniques proposed to date.