Aggregated Multicast for Scalable QoS Multicast Provisioning

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


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
    • "The AM protocol (Aggregated Multicast) was proposed in [1], [2]. In AM, a centralized entity called the tree manager is in charge of matching groups to labels and informing the border routers of this matching. "
    [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.
    Full-text · Conference Paper · Nov 2006
  • Source
    • "The tree aggregation idea is proposed by Gerla et al. in [6]. Instead of having one tree per group, several groups are aggregated to the same tree within a domain. "
    [Show abstract] [Hide abstract]
    ABSTRACT: IP multicast is not widely deployed yet over Internet. This is mainly due to the forwarding entries scalability and control explosion problems. In this paper, we propose an algorithm called STA (Scalable Tree Aggregation) which reduces the number of trees by allowing several groups to be aggregated to the same tree: the less trees, the less forwarding entries and the less control messages to maintain trees. STA performs faster aggregations than previous aggregation algorithms by evaluating fewer trees for each group, while keeping the same performance. We show the scalability and the fastness of STA by extensive simulations and we compare its performance to the previous algorithm.
    Full-text · Conference Paper · Feb 2005
  • Source
    • "More forwarding state entries means more memory requirement, and slower forwarding process. This is perhaps the main scalability problem with IP multicast when the number of simultaneous active groups grows[7]. IP Multicasting and QoS are closely related, since most applications that are suited for multicasting, normally, desire QoS support. "
    [Show abstract] [Hide abstract]
    ABSTRACT: IP Multicasting suffers from state scalability as the number of concurrently active multicast groups increases, since it requires a router to keep forwarding state for every multicast tree passing through it. In multicast provisioning in a Diff_Serv domain the condition is even worse, since, in addition to multicast state, the requested PHB for each group need to be kept at the routers. In this paper we present an architecture called Differentiated Services-aware-Aggregated Multicast (DSAM), and we examine how we can use aggregated multicast to support multicasting in a Diff_Serv supported MPLS network. Proposed group-tree mapping algorithm, takes into account the PHB requirement for each group and can find a proper aggregated tree. DSAM is scalable and reduces multicast state and processing and control overheads in the core routers.
    Preview · Article ·
Show more