Extensions to OSPF for tunnel multicasting

We extend an existing multicast routing protocol, multicast extension to OSPF (MOSPF), to achieve tunnel multicasting. The extension is as follows. Tunneling is introduced for supporting tunnel multicasting, which aims at reducing the protocol overhead associated with MOSPF. Simulation results show that the extension can reduce protocol overhead significantly without affecting the per-destination shortest path characteristics of a resulting tree or introducing any extra control overhead.

[1]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[2]  Reuven Cohen,et al.  Restricted dynamic Steiner trees for scalable multicast in datagram networks , 1998, TNET.

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

[4]  Reuven Cohen,et al.  A unicast-based approach for streaming multicast , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Christian E. Hopps,et al.  Analysis of an Equal-Cost Multi-Path Algorithm , 2000, RFC.

[6]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[7]  H. T. Mouftah,et al.  A destination-driven shortest path tree algorithm , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM.

[10]  Charles E. Perkins,et al.  IP Encapsulation within IP , 1996, RFC.