Protocol Independent Multicast Research Articles

HPIM‐DM: A fast and reliable dense‐mode multicast routing protocol

AbstractThe Hard‐state Protocol Independent Multicast—Dense Mode (HPIM‐DM) multicast routing protocol is proposed. HPIM‐DM is a hard‐state version of PIM‐DM that overcomes its poor convergence times and lack of resilience to replay attacks. Like PIM‐DM, HPIM‐DM is meant for dense networks and supports its operation on a unicast routing protocol and reverse path forwarding. However, routers maintain sense of the multicast trees at all times, allowing fast reconfiguration in the presence of network failures or unicast route changes. This is achieved by (i) keeping information on all upstream neighbours from which multicast data can be received, (ii) ensuring the reliable transmission and sequencing of control messages, and (iii) synchronizing the routing information immediately when a new router joins the network. The correctness of the protocol was extensively validated using model checking and logical reasoning. The protocol was fully implemented in Python, and the implementation is publicly available. Finally, we show both theoretically and experimentally that HPIM‐DM has much better convergence times than PIM‐DM.

Pengukuran Performa Algoritma Kendali Kongesti Active Queue Manajemen (AQM) Pada Jaringan Backbone Multicast Berbasis Protocol Multicast PIM-DM

UDP is a data transmission protocol on the Internet that allows data to be sent in realtime and become a development base of various services such as IPTV, VOIP, VOD, and video conferencing. The multicast network was a solution to provide better service to many public needs with the concept of simplicity and efficiency. Dense traffic situation triggering a packet loss and delay that not tolerated by some services, especially multimedia streaming service, while UDP does not guarantee the quality of service so that the necessary traffic management method that serves as a traffic controller to the congestion in the network. This study analyzes the performance of technology based on Active Queue Management (AQM) congestion control in a multicast backbone network based on Protocol Independent Multicast – Dense Multicast using Droptail, Deficit Round Robin (DRR), and Random Early Detection (RED) algorithm, which is simulated using NS2. The simulation results show that the congestion control algorithm, DRR provides the best performance with a balanced value of mean delay, mean throughput, and the mean loss. RED is a congestion control algorithm which has the best queue management mechanism but not able to suppress the mean loss in each scenario tested because RED has a small amount of buffer size, Droptail not an appropriate algorithm for multicast networks implemented in, the absence of an interrupt mechanism trigger data services will have a tendency towards a particular data packet.

The new Multicast Repair (M‐REP) IP fast reroute mechanism

SummaryThe network convergence time may take hundreds of milliseconds or more. Since this repair performance may be unsatisfactory, IP fast reroute (IPFRR) approaches have been developed to decrease the network convergence time and minimize traffic loss. These IPFRR mechanisms are usually based on the proactive precomputation of a backup path before a failure occurs. Once a failure is detected, the router running IPFRR will immediately use this backup path in response to the failure, rather than computing a replacement path only after a failure has occurred. The computation of an alternative path in many IPFRR mechanisms requires that the computing node (router) knows the exact network topology. In this paper, we present a new IPFRR mechanism called the multicast repair (M‐REP) IPFRR mechanism, which provides an advanced fast reroute technique for Internet service providers‘ (ISP‘s) core networks. The M‐REP IPFRR mechanism is based on IP multicast and utilizes Protocol Independent Multicast – Dense Mode (PIM‐DM) with the modification of an internal reverse path forwarding (RPF) check. The M‐REP IPFRR mechanism does not depend on any particular routing protocol type (distance‐vector or link‐state) and requires less system resources because of its precomputation‐less character but still provides immediate reaction to failure.

A New IPTV Multicast Fast Reroute Method

<p align="justify"><span>This document proposes an IP multicast fast convergence method based on differentiating primary and backup PIM</span><span>(</span><span>Protocol Independent Multicast</span><span>)</span><span> join. The multicast stream is only sent along one of the multicast primary and backup path, which enables the efficient multicast delivery under both normal and abnormal conditions. The Single stream FRR</span><span>(</span><span>Fast Re-Route</span><span>)</span><span> solution has the</span><span> </span><span>advantages of implementing fast multicast protection and of avoiding double multicast bandwidth occupation in both normal and abnormal situations.</span></p>

Optimization of IPv6 Protocol Independent Multicast-Sparse Mode Multicast Routing Protocol based on Greedy Rendezvous Point Selection Algorithm

Forming of the Multicast tree with the best root considered as center selection problem (typically classified as NP-complete type). Alternatively called center Rendezvous Point (RP) due to the direct impact on the multicast routing protocol in terms of the performance. This research article introduces a new compound solution for multicast RP selection called Greedy based RP Selection Algorithm (GRPSA) to select the best RP for PIM-SM multicast routing protocol in IPv6 multicast domain based on Fitness or cost criteria supported by Dijkstra algorithm. The paperwork passes through two phases. First, MATLAB phase used for GRPSA implementation assisted by Fitness calculation to select the best RP called Native-RP. The second phase investigates the performance of GRPSA using QoS metrics compared to another candidate RPs. Validated using the GNS3 emulator for the core IPv6 multicast network and realized using UDP streaming data sourced from Jperf traffic generator via virtual machines at the network edges. The multicast technology implements a very high-efficiency point-to-multipoint data transmission over IP networks (IPv4 and IPv6). The results show GRPSA-RP performs better than other possible RPs by 25.2%, 25.3%, 46.2% and 62.9%, in terms of data received, bandwidth, jitter and loss respectively on average.

Algorithmic Support of Optimization of Multicast Data Transmission in Networks with Dynamic Routing

This article describes the optimization process for the multicast tree in the networks with dynamic traffic routing, which is based on the channel state and evaluates each channel. The problem of constructing a multicast connections tree on graphs is formalized. The possibility of improving the existing algorithms by selecting certain rendezvous points, as well as the algorithm for reducing the cost of the multicast routing tree are analysed. Simulation of tree construction was made in accordance with the family of Protocol-Independent Multicast protocols and the proposed algorithm. A critical analysis of the simulation results and comparative evaluation of uniformity of loading data channel at multicast routing are carried out.

Lightweight PIM—a new multicast routing protocol

SUMMARYMulticast holds out great promise to significantly reduce network load between the sender and a group of receivers by delivering a single data stream to many recipients. Protocol‐Independent Multicast (PIM) Sparse Mode and its variant PIM Source‐Specific Multicast (PIM SSM) are the most widely used IP multicast protocols. Protocols offer low latency data delivery capabilities with relatively high reliability and are characterized by large signaling overhead. This article presents a new multicast protocol, called Lightweight PIM (LPIM), tackling the main problem hindering widespread usage of IP multicast protocols, which is a large volume of signaling traffic. Given the existing usability of the PIM family protocols, a decision was made to base the new LPIM protocol on PIM SSM. The improvements used in LPIM lead to a considerable reduction of state data and signaling messages required by LPIM as compared with PIM SSM. Similar to its predecessor, LPIM is capable of handling large groups, although with significantly lower overhead. Copyright © 2012 John Wiley & Sons, Ltd.

Performance of Video Conferencing using Protocol Independent Multicast Routing with Core failure

conferencing is now widely used both in wired and wireless network. Quality of Service (QoS) depends upon the efficient utilization of the network bandwidth. Internet Protocol (IP) multicasting is simultaneous transmission of data to multiple destination. IP multicast uses one-to-many technique, wherein a single packet is sent to multiple destinations in a multicast group identified by a single IP destination group address. Core failure is a serious issue in multicast networks with the QOS diminishing even if alternative routes are available. This paper investigates the performance of streaming data which require stringent QOS using unicast and multicast communication with Protocol Independent Multicasting - Sparse Mode (PIM-SM) . An intermediate core is failed and the performance of the network measured. Results obtained show the degradation due to core failure affects the QOS for streaming data.

Comparison and Analysis of PIMDM and BST Multicasting Network over Drop Tail Queuing Technology

The paper contrast a Multicasting network using PIM-DM (Protocol Independent Multicast - Dense Mode) with BST (BiDirectional Shared Tree) protocol using NS2. The networking topology is well analyzed for two sources and drop of data packet and throughput is recorded and drawn. The simulation results mark the decrease in drop out packets for BST by 55.88235% on node 0 and some increase in drop out packets at node 1.

Cross-layer failure restoration of IP multicast with applications to IPTV

Recent applications such as broadcast TV distribution over an IP network require that stringent QoS constraints, such as low latency and loss be met. Streaming content in IPTV is typically delivered to distribution points on an IP backbone using IP multicast, in particular Protocol Independent Multicast (PIM). Local restoration from link failures using MPLS or layer-2 Fast Reroute (FRR) is a proven technique to achieve rapid failure restoration. Link-based FRR creates a pseudo-wire or tunnel in parallel to the IP adjacencies; thus, single link failures are transparent to the Interior Gateway Protocol (IGP) such as OSPF. Although one may choose the back-up path’s IGP link weights appropriately to avoid traffic overlap during any single physical link failure, multiple failures may still cause packet loss because of (a) congestion resulting from overlap of an active FRR path with the multicast tree, (b) congestion resulting from overlap of two active FRR paths, or (c) a hit resulting from an OSPF reconvergence after the failure of a link in an active FRR path. We present a cross-layer restoration approach that combines both FRR-based restoration for single link failures and “hitless” (i.e., without loss) PIM tree reconfiguration algorithms to prevent traffic overlap when multiple failures occur. We demonstrate the efficacy of our schemes through simulations. The average recovery time on double failures can be reduced from more than 10s to only approximately 100 ms with our enhancements.

Improving Scalability with the Use of the Overlay Multicast Protocol (OMP)

Demands to increase network usage efficiency and scalability do exist. IP and overlay multicast provide multicasting services by enabling data to be sent to several recipients simultaneously over a network. Although MPLS, a high performance method for forwarding packets, has many benefits, implementation of multicast on MPLS still suffers from IP multicast limitations. This paper proposes the Overlay Multicast Protocol (OMP) in which the overlay approach is applied on MPLS networks to improve the scalability of multicasting. Comparisons of OMP with Protocol Independent Multicast-Sparse Mode and Protocol Independent Multicast-Source Specific Multicast are presented, showing improved scalability when using OMP.

PIA-SM: multicast based IPv6 anycast routing protocol

Today, the use of anycast address is quite limited. One of the reasons is that there is no routing protocol providing a global anycasting service. In this paper we design and implement a new anycast routing protocol called PIA-SM (Protocol Independent Anycast Sparse Mode). We focus on PIM-SM (Protocol Independent Multicast Sparse Mode), which is one of multicast routing protocols available now, to develop an anycast routing protocol, because anycast and multicast have many similar properties. We modified PIM-SM based on differences between multicast and anycast. We next describe the technical issues to be solved in the implementation of PIA-SM. We also show some experimental results to demonstrate PIA-SM, and verify that PIA-SM enables routers to forward an anycast packet to an appropriate node of multiple candidate nodes.

PIM-DM 멀티캐스트에서 그룹 가입 지연시간에 대한 성능 모의 실험

One of the remarkable problems in PIM-DM (Protocol Independent Multicast - Dense Mode) is the join latency time, increasing for specific periods. The reason of this problem is proved to the confusion of flooding prune message and leave prune message. We propose a new solution to this problem, reducing the average join latency by 37.4%, and prove the proposed solution by network simulation.

Rendezvous point relocation in protocol independent multicast - sparse mode

Protocol independent multicast - sparse mode is the most widely used multicast routing architecture. It builds a shared distribution tree centered at a rendezvous point and then builds source-specific trees for those sources whose data rate warrants it. Current implementations of the protocol decide on the rendezvous point administratively, which leads to congestion and delays. An attractive solution would be dynamic relocation of the rendezvous point depending on the members of the multicast group. We present a rendezvous point calculation and relocation mechanism for protocol independent multicast -sparse mode. Simulation of the proposed mechanisms is used to demonstrate the effectiveness of the proposals.

Adaptive core selection and migration method for multicast routing in mobile ad hoc networks

Several multicast protocols such as Protocol Independent Multicast (PIM) (Deering et al., 1996) and Core-Based Trees (CBT) (Ballardie et al., 1993) use the notion of group-shared trees. The reason is that construction of minimal-cost tree spanning all members of the multicast group is expensive, hence these protocols use a core-based group-shared tree to distribute packets from all the sources. A core-based tree is a shortest-path tree rooted at some core node. The core node is also referred to as a center node or a rendezvous point. Core nodes may be chosen from some preselected set of nodes or some heuristics may be employed to select core nodes. We present distributed core selection and migration protocols for mobile ad hoc networks with dynamically changing network topology. Most protocols for core selection in static networks are not suitable for ad hoc networks, since these algorithms depend on knowledge of entire network topology, which is not available or is too expensive to maintain in an ad hoc network with dynamic topology. The proposed core location method is based on the notion of median node of the current multicast tree instead of the median node of the entire network. The rationale is that the mobile ad hoc network graphs are in general sparse and, hence, the multicast tree is a good approximation of the entire network for the current purpose. Our adaptive distributed core selection and migration method uses the fact that the median of a tree is equivalent to the centroid of that tree. The significance of this observation is due to the fact that the computation of a tree's centroids does not require any distance information. Mobile ad hoc networks have limited bandwidth which needs to be conserved. Hence, we use the cost of multicast tree as the sum of weights of all the links in the tree, which signifies the total bandwidth consumed for multicasting a packet. We compare the cost of shortest-path tree rooted at the tree median, Cost/sub TM/, with the cost of shortest-path tree rooted at the median of the graph, Cost/sub GM/, which requires complete topology information to compute. A network graph model for generating random ad hoc mobile networks is developed to perform this comparison. The simulation results show that for large size networks, the ratio Cost/sub TM//Cost/sub GM/ lies between 0.8 to 1.2 for different multicast groups. Further, as the size of the multicast group increases the ratio approaches 1.

A Self‐Adaptive Load Balanced Internet Multicast Routing Protocol

AbstractThe prevailing Internet has brought many novel network applications. These applications often involve the interactions among multiple members in a single session. For example, the images and voices of the lecturer in distance learning must be transmitted to multiple destinations at the same time on demand. The status and opinions of any participant should also be transmitted to each other in a video conferencing for the interactivity of conversations. Without suitable protocol supports from the underlying networks, these applications may be costly and infeasible. One of the important protocol supports is the capability of multicasting, sending a single data packet to a set of receivers that are members of a multicast group. In the past, there are four well‐known Internet multicast routing protocols: DVMRP (Distance Vector Multicast Routing Protocol), MOSPF (Multicast extensions to Open Shortest Path First), CBT (Core‐Based Tree), and PIM (Protocol Independent Multicast). In this paper, based on PIM, we propose a new multicast routing protocol called SEAL‐PIM (SElf‐Adaptive and Load balanced PIM). The new protocol reduces the PIM message and resource overhead and balances the traffic load in the network by rearranging the links of routing and the locations of the group rendezvous points to adapt to the current distribution of group members. Finally, simulations are done to compare our algorithm with the original PIM scheme. The results indicate that the performance improvement is good.

A comparison of the Internet multicast routing protocols

The exploding Internet has brought many novel network applications. These include teleconferencing, interactive games, the voice/video phone, real-time multimedia playing, distributed computing, web casting, and so on. One of the specific characteristics of these applications is that all involve interactions among multiple members in a single session. Unlike the traditional one-to-one message transmission (unicasting), if the underlying networks provide no suitable protocol supports, these applications may be costly and infeasible to implement. Multicasting is one technique proposed to efficiently distribute datagrams to a set of interested group members on the interconnected networks. In this article, we survey the multicast routing protocols on the Internet today. Four well-known multicast routing protocols, Distance Vector Multicast Routing Protocol (DVMRP), Multicast extensions to OSPF (MOSPF), Core Based Tree multicast routing protocol (CBT), and Protocol Independent Multicast routing protocol (PIM), are introduced. Different protocols have different design concepts and use different techniques to delivery datagrams and each has its special functions and properties. We provide a succinct explanation of their features. The advantages and weaknesses of these Internet protocols are also examined and compared in detail by several protocol characteristics.

Policy tree multicast routing

Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scales poorly towards larger, wide-area networks. PIM-SM (Protocol-independent Multicast - Sparse Mode) has been introduced as a simple, flexible and scalable concept for Internet-wide multicasting. Yet, PIM's efficiency potential (like that of alternative wide-area multicast concepts) can only be fully exploited if it is based on Reverse Path Forwarding (RPF), a low-cost mechanism, which however does not select prescribed delivery paths if link parameters or routing policies are asymmetric. This paper presents an extension to protocols like PIM-SM, called Policy Tree Multicast Routing (PTMR). This concept leads to multicast delivery trees which, even under asymmetric conditions, readily comply with imposed macroscopic policies and moreover enable support of shortest path and QoS criteria. PTMR gives no consideration to how the policy-sensitive paths have been established; they may be imposed by the network itself but also by providers, recipients and even sources. PTMR amends the PIM-SM mechanism with a macroscopic control layer which marks (pegs) domain border routers on policy-sensitive forward paths. In a given domain, a pegged ingress border router is then joined by local group members as well as by its child pegs. This results in optimally fusing transit paths into local distribution trees. PTMR performance and policy control potential are restricted primarily: by the congestion of control messages at the multicast sources, introduced by source-originating tree construction; by the possible extent of policy-sensitive path aggregation; and by the intra-domain (transit) delivery conditions. PTMR is a single-layer protocol, appending PIM-SM with a policy dedicated delivery mode. Ist primary design target is to forward multicast traffic in accordance with any underlying multicast-relevant routing, including comprehensive policy routing. In comparison, Border Gateway Multicast Protocol (BGMP) is a proposal for an intra-domain MR protocol based on BGP-type routing, which focuses on fusing heterogenous multicast routing domains and which allows ASs to control multicast transit traffic.

Distributed center-location algorithms

Recent multicast routing protocol proposals such as protocol independent multicast (PIM) and core-based trees (CBT) have been based on the notion of group-shared trees. Since construction of a minimal-cost tree spanning for all members of a group is difficult, they rely on center-based trees and distribute packets from all sources over a single shortest-path tree rooted at some center. PIM and CBT provisionally use administrative selection or simple heuristics for locating the center of a group but do not preclude the use of other methods that provide an ordered list of centers. Other previously proposed heuristics typically require knowledge of the complete network topology, a requirement which is not always practical for a distributed problem such as Internet routing. We investigate the problem of finding a good center in a distributed fashion, study various heuristics for automating center selection, and examine their applicability to real-world networks. We also propose several new algorithms which we feel to be more practical than existing methods. We present simulation results on hierarchical and nonhierarchical networks showing that of the methods potentially feasible in the Internet multicast backbone, ours offer the best results in terms of cost and delay, and they incur low overhead.

The PIM architecture for wide-area multicast routing

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 receiver-initiated 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.