Aggregated Multicast for Scalable QoS Multicast Provisioning

07/2001; DOI: 10.1007/3-540-45400-4_20
Source: CiteSeer

ABSTRACT IP multicast suffers from scalability problem with the number of concurrently active multicast groups, while scalability of QoS multicast is even further from being solved. In this paper, we propose an approach to reduce multicast forwarding state and provision multicast with QoS guarantees. In our approach, multiple groups are forced to share a single delivery tree. We discuss the advantages and some implementation issues of our approach, and conclude that it is feasible and promising. We then describe how to use our approach to provision scalable QoS multicast. Finally, we define metrics to quantify state reduction and use simulations to show how our scheme achieves state reduction. These initial simulation results suggest that our method can reduce multicast state significantly.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: With the growth of the number of network applications, it has been found a few years ago that the bandwidth was a bottleneck. Multicast has been developed to spare the bandwidth by sending ecien tly copies of a message to several des- tinations. Although many research has been done on multicast, its deployment on the Internet is still an issue. This is due mainly to the number of multicast forwarding states and to the control explosion when there are several concur- rent multicast groups. Indeed, in the current multicast model, the number of multicast forwarding states is proportional to the number of multicast groups. As the number of groups is expected to grow tremendously, the number of for- warding states will also be huge, which will slow down the routing and saturate the routers memory. Additionnaly, the number of control messages required to maintain the forwarding states will grow in the same manner. This scalability issue has to be solved before multicast can be deployed over the Internet. Tree aggregation is a recent proposition that greatly reduces both the number of multicast forwarding states and the number of control messages required to maintain them. To achieve this reduction, tree aggregation forces several groups to share the same multicast tree. In this way, the number of multicast forwarding states depends on the number of trees, not on the number of groups.
    NETWORKING 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006, Proceedings; 01/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: The main question of aggregated Multicast is how to match group to tree perfectly. In this paper, we present a new group-tree matching algorithm which is based on group-member matched group-tree matching algorithm, and here it is called GTBA algorithm. It is presented on the base of analyzing and concluding the traditional group-tree matching algorithms' advantages and disadvantages. The GTBA algorithm can realize the multicast trees merging in the presence of saving the network bandwidth resources. Due to the dynamic of Multicast, the GTBA algorithm can achieve refresh the forwarding table quickly and consequently improves the forwarding efficiency in the network. Finally, we prove that the validity of the GTBA algorithm by simulation.
    Multimedia Information Networking and Security, International Conference on. 01/2009; 2:57-60.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Multicast tree aggregation is an efficient proposition that can solve the multicast forwarding state scalability problem. Existing works on tree aggregation have focused on developing and simulating protocols that build trees dynamically. However, the underlying problem of the impact of the tree construction algorithm on the performance of the protocols remains untouched. In this paper, we propose a study on the number of trees that need to be configured in a domain depending on the tree construction algorithm. We ran extensive simulations on several real domains and with different tree construction algorithms. Our results show that for a given set of multicast groups, even when this set includes all the possible groups, the number of trees that need to be configured is small. This allows a network administrator to configure off-line all these trees in order to maintain a stable set of trees and to have knowledge of the routes used by the multicast packets. Knowing the set of all the possible trees is also useful to determine the best subset to configure and to give an upper bound of the number of different trees.
    Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006; 01/2006


Available from