Scalable multicast tree construction for wide area networks
Klinker, James Eric.
Shukla, Shridhar B.
MetadataShow full item record
In this thesis, we address the problem of multicast tree construction with guaranteed 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.
Showing items related by title, author, creator and subject.
Lundy, Gilbert M.; Tipici, H. Alphan (IEEE, 1994-10);In recent years the emergence of optical fiber and its correspondingly high data rates have led to the development of much higher speed networks, both locally and over the long haul. These developments led to the design ...
Stone, Steven Walter (Monterey, California. Naval Postgraduate School, 1996-06);The current Distributed Interactive Simulations (DIS) Protocol has a limited ability to support real time, simulated engagements of more than 1000 entities because of its excessive use of network resources. It also lacks ...
Raghuram, Devalla (Monterey, California. Naval Postgraduate School, 1992-09);A group membership protocol ensures agreement and consistent commit actions among group members to maintain a sequence of identical group views in spite of continuous changes, either voluntary or otherwise, in processors' ...