To improve the scalability of multicast protocols, a simple yet novel technique, called the dynamic overlap tree path (DOTP), is proposed. According to the simulation results, the overall average forwarding state-table size can be reduced by ~30 %.
References
-
-
1)
-
Ballardie, A.: `Core based trees (CBT version 2) multicast routing protocol specification', RFC 2189, September 1997.
-
2)
-
Deering, S.E.: `Multicast routing in a datagram internetwork thesis', December 1991, PhD, Stanford University.
-
3)
-
Sheng, : `Dynamic overlap tree path', Technical report, 1998.
-
4)
-
Wei, L., Estrin, D.: `The trade-offs of multicast trees and algorithms', Proc. 1994 Int. Conf. Computer Communications networks, 12–14 September 1994.
-
5)
-
Tian, J., Neufeld, G.: `Forwarding state reduction for sparse mode multicast communication', IEEE INFOCOM 98, p. 711–719.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19990667
Related content
content/journals/10.1049/el_19990667
pub_keyword,iet_inspecKeyword,pub_concept
6
6