Multicast routing in heterogeneous wireline/wireless environments

We present the BTLA (base tree link augmentation) multicast routing infrastructure for heterogeneous wireless/wireline networks. BTLA has two goals: (a) to reduce the latency and overhead of joins, leaves, and handoffs in regions that experience high group dynamics and mobility, and (b) to optimize the multicast tree for stable regions that do not experience frequent group dynamics. The BTLA consists of two components: (a) pre-computed minimum height spanning trees of the multicast network called base trees that are used to generate and update multicast trees with low latency and overhead under dynamic network conditions, and (b) link augmentation-based optimization of the multicast tree using additional links in the multicast network that are not a part of the base tree, in order to reduce the size of the multicast tree. The BTLA uses the base tree approach in dynamic regions and refines it with the link augmentation approach in stable regions. Initial performance evaluation shows that the BTLA is able to effectively support multicast communication involving both static and mobile hosts.

[1]  John Moy,et al.  Multicast routing extensions for OSPF , 1994, CACM.

[2]  Stephen E. Deering,et al.  Hierarchical distance-vector multicast routing for the MBone , 1995, SIGCOMM '95.

[3]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[4]  P KompellaVachaspathi,et al.  Multicast routing for multimedia communication , 1993 .

[5]  Michalis Faloutsos,et al.  Optimal distributed algorithm for minimum spanning trees revisited , 1995, PODC '95.

[6]  T. Ballardie Core Based Tree (CBT) , 1993, SIGCOMM 1993.

[7]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[8]  Mark Handley,et al.  Session directories and scalable Internet multicast address allocation , 1998, SIGCOMM '98.

[9]  V. Jacobson,et al.  Protocol Independent Multicast (PIM), Sparse Mode Protocol Specification , 1994 .

[10]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[11]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[12]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.

[13]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, ESA.

[14]  Hwa-Chun Lin,et al.  VTDM-a dynamic multicast routing algorithm , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[15]  ComputingEnvironmentsTae,et al.  A Multicast Routing Algorithm for Mobile , 1999 .

[16]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[17]  B. R. Badrinath,et al.  IP multicast extensions for mobile internetworking , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[18]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .