MPLS-based Multicast Shared Trees

Proceedings of the International MultiConference of …, 2008

Abstract—Due to the increasing multicast applications and high desire for its deployment, it seems that any new technology should support multicast. However, Mpls (Multiprotocol Label Switching) technology which enhances IP packet forwarding capability by using layer 2 ...

2009

An algorithm for computing alternate multicast trees in packet transport networks is proposed in this paper. The algorithm efficiently computes multiple sub-optimal tree candidates for a given multicast service request. The algorithm builds on the widely used computation of ordered loopless shortest paths and can be applied to any connected network topology. Simulation experiments obtained for a multiprotocol label switching (MPLS) network are presented to evaluate the effectiveness and performance of the algorithm.

Photonic Network Communications, 2010

Multicasting applications such as multimedia conferencing, online multiplayer interactive games, and distance learning are becoming increasingly popular. With multiprotocol label switching, Internet protocol networks can offer quality of service and traffic engineering capabilities. This article introduces several approaches for multisource multicast sessions in the context of IP over WDM networks and evaluates their performance in terms of blocking probability, time complexity, and memory consumption. Our simulation study shows that among all the approaches, the newly proposed approach, known as one Bidirectional Tree with Just enough bandwidth reserved on each link of the tree, achieves the best overall performance.

36th Annual Simulation Symposium, 2003., 2003

Multicast and MPLS are two complementary technologies. Merging these two technologies where multicast trees are constructed over MPLS networks will enhance performance and present an efficient solution for multicast scalability and control overhead problems. In this paper 1 , we present a simulator for multicast routing over an MPLS network where we choose PIM-SM (source specific tree) as the multicast routing protocol. A simulator for multicast routing over MPLS network is an original idea since this kind of simulator never existed before and it will help researchers to simulate and evaluate their MPLS multicast related techniques.

2009

From a technology perspective, the Internet performs a gigantic role in communication, compelling the Internet Protocol (IP) to be famous. The approach of modern applications requires Quality of Service (QoS) guarantee with multicast support being unavailable in the legacy network. Multi Protocol Label Switching (MPLS), providing traffic engineering and QoS capability support in IP network, and Protocol Independent Multicast-Sparse Mode (PIM-SM), using two modes of multicast transmission to adapt with network requirement, are the leader in their firm. To combine these two technologies provides an opportunity for service provider to distribute new services from their contemporary network. This work is focusing on the fabrication of multicasting support framework using PIM-SM in MPLS domain. The simulation is used to verify the framework and illustrate its performance competence. Based on the simulation results, Shortest-Path Tree (SPT) multicast transmission offers the best performance, tradingoff with the size of state database in each router. RP-rooted shared Tree (RPT) multicast achieves the suitable performance in the case that state database size needs to be concerned. Furthermore, bandwidth sharing problem can be eliminated using Connection-Oriented with QoS guarantee in MPLS network for the premium services.

IEEE/ACM Transactions on Networking, 1996

The purpose of multicast routing is to reduce the communication costs for applications that send the same data to multiple recipients. Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or membership report information are occasionally sent over many links that do not lead to receivers or senders, respectively. We have developed a multicast routing architecture that efficiently establishes distribution trees across wide area internets, where many groups will be sparsely represented. Efficiency is measured in terms of the router state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our protocol independent multicast (PIM) architecture: a) maintains the traditional IP multicast service model of receiverinitiated membership, b) supports both shared and source-specific (shortest-path) distribution trees, c) is not dependent on a specific unicast routing protocol, and d) uses soft-state mechanisms to adapt to underlying network conditions and group dynamics. The robustness, flexibility, and scaling properties of this architecture make it well-suited to large heterogeneous internetworks.

2004

Conventional delivery mechanisms for many-to-many multicast services consider either a single shared tree or a source rooted trees approach. These two mechanisms complement each other in terms of performance and protocol complexity. In this paper, we describe a design that uses multiple shared trees that would provide a balance between these two extreme approaches. Our proposal works at the application layer so as to enable instant deployment in the Internet. We discuss several alternative designs to realise the multiple shared trees model, and we have chosen a mesh-first approach where multiple trees are derived from a mesh overlay topology. The design is scalable as each participating node only needs to maintain a small volume of routing information. In addition, it is robust as the mesh topology provides alternate paths between the members.

Computer Communications, 2000

The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum path length bounds for each receiver. The PLC algorithm can be implemented as a distributed algorithm, can tradeoff end-to-end delay and bandwidth consumption, and can be implemented for polynomial time execution. Analysis and simulation show that (a) the PLC algorithm generates multicast trees which consume less bandwidth than those generated by the SPT algorithm while guaranteeing the same shortest path length and (b) consume less bandwidth than trees generated by the Greedy algorithm with only a moderate increase in path length. The PLC algorithm is more flexible and has a lower cost than a combined SPT and Greedy algorithm.

Proceedings 1997 International Conference on Network Protocols, 1997

The IP-multicast architecture i s extended with addressing information along multicast routing trees that permits more eficient and sophisticated multicast routing options and encourages communication and cooperation between IP and higher-layer protocols. The Addressable Internet Multicast (AIM) architecture is introduced that enables sources to restrict the delivery of packets to a subset of the receivers in a multicast group on a per-packet basis, permits receivers to listen to subsets of sources on a subscription basis, provides nearest-host routing, and allows higher-layer protocols to place packets into application-defined logical streams, so that hosts may direct the multicast routing of packets based on application-defined contexts. In addition, the Reliable Multicast Architecture (RMA) i s introduced to support end-toend reliable multicasting using heterogeneous reliable multicast protocols and providing acknowledgment trees implicitly, thereby eliminating the ACK implosion problem and allowing NAK-avoidance algorithms to work within local groups.

In this paper we have further elaborated MPLS multicasting under the specific graph (graceful) labeling with the use of specific multicast tree topology called caterpillar which is next higher topological structure other than the path; that is a central concept in the IP unicast routing. The use of caterpillar as the multicast tree has been analyzed and compared with the other tree topologies under the new measure of the multicast network metric. We have applied graceful label distributions to the links of the spanning caterpillars associated to the autonomous sub-networks (AN) that involved in the multicasting. The labeling algorithm proposed uniquely assigns link labels based on the node numbering which in turn enables to give a sharp estimate to the time-to-live parameter, optimal selection of RP (rendezvous points) of multicast caterpillar topology to nodes in the ANs by transmitting of 'graceful code' in the form of sequence of (n-2) node numbers. The graceful code for the caterpillar has revealed an efficient method (G-trace) of the reconstruction of multicast tree topology which in turn to be used for maintability and for the other purposes in the management site.