Conference Paper

Forwarding state reduction for sparse mode multicast communication

Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC
DOI: 10.1109/INFCOM.1998.665093 Conference: INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Volume: 2
Source: IEEE Xplore

ABSTRACT Reducing forwarding state overhead of multicast routing protocols
is an important issue towards a scalable global multicast solution. We
propose a new approach, dynamic tunnel multicast, which utilizes
dynamically established tunnels on unbranched links of a multicast
distribution tree to eliminate unnecessary multicast forwarding states.
Analysis and simulation results show promising reduction in the state
overhead of sparse mode multicast routing protocols

0 Bookmarks
 · 
62 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Many applications in the current Internet follow the multicast paradigm, not the unicast one that has traditionally ruled the design of TCP/IP. These applications are, therefore, required to construct overlay networks for multicasting, which unfortunately offers too little efficiency to support the immanent emergence of trillions of groups. IP multicast, which is the natural implementation of the multicast paradigm, has not been deployed widely. Though recent years have seen several alternatives, we still have no clear direction for future networks that provide the multicast functionality efficiently. The aim of this paper is to indicate the most promising research direction on the multicast forwarding plane of future networks. Through intensive analysis, we conclude that packet-driven forwarding (source routing) has several advantages over traditional table-driven forwarding including IP multicast.
    01/2010;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates routing algorithms that compute paths along which combined unicast and multicast traffic can be forwarded altogether, i.e., over the same path. For this purpose, the concept of AnyTraffic group is introduced that defines a set of nodes capable to process both unicast and multicast traffic received from the same (AnyTraffic) tree. The resulting scheme is referred to as AnyTraffic routing. This paper defines a heuristic algorithm to accommodate the AnyTraffic group and to find the proper set of branch nodes of the tree. The algorithm supports dynamic changes of the leaf node set during multicast session lifetime by adapting the corresponding tree upon deterioration threshold detection. Studies are performed for both static and dynamic traffic scenarios to i) determine the dependencies of the algorithm (node degree, clustering coefficient and group size); and ii) evaluate its performance under dynamic conditions. Initial results show that the AnyTraffic algorithm can successfully handle dynamic requests while achieving considerable reduction of forwarding state consumption with small increase in bandwidth utilization compared to the Steiner Tree algorithm.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The tussle in IP multicast, where different enablers have interests that are adverse to each other, has led to a halt in inter-provider multicast deployment and created a situation in which enabling inter-domain multicast routing is considered a deterrent for network providers. This paper presents ODMT (On-demand Inter-domain Multicast Tun-neling), an on-demand inter-provider multicast tunneling that is autonomous in operation and manageable through its definable policy control. In the architectural design, we propose a new approach of enabling inter-provider multicast by decoupling the control-plane and forwarding-plane. Focusing on the control-plane without changing the forwarding-plane, our solution changes the traditional open multicast service model into a more manageable service model in inter-domain multicast operation, hence it eases the Internet-wide multicast deployment.
    Journal of Information Processing 04/2012; 20(2):347-357.

Preview (2 Sources)

Download
0 Downloads
Available from