Protocol Independent Multicast-sparse Mode Research Articles

Design and Implementation of a Central-Controllable and Secure Multicast System Based on Universal Identifier Network

With the rapid increase of network users and services, the breadth and depth of Internet have greatly changed. The mismatch between current network requirements and original network architecture design has spurred the evolution or revolution of Internet to remedy this gap. Lots of research projects on future network architecture have been launched, in which Universal Identifier Network (UIN) architecture that is based on the identifier/location separation, access/core separation and control/forwarding separation can provide better mobility, security and reliability. On the other hand, the demand of group communication has increased due to the fine-grained network services and successive booming of new applications such as IoT (Internet of Things). Most of current multicast schemes are based on the open group model with open group membership (multicast only care the multicast group state, not the group member) and open access to send/receive multicast data, which are beneficial to multicast routing for its simplification. However, the open group membership makes the group member management difficult to be realized, and open access may result in lots of security vulnerabilities such as Denial of service (DoS), eavesdropping and masquerading, which make deployment more difficult. Therefore, in this paper we propose a Central-Controllable and Secure Multicast (CCSM) system based on the UIN architecture, and redesign the multicast service procedures including registration, join/leave, multicast routing construction and update with objective to achieve better mobility support, security, scalability and controllable. More specifically, we design a new group management scheme to perform the multicast members join/leave with authentication and a central-controllable multicast routing scheme to provide a secure way to set up multicast entries on routers. The CCSM inherits the characteristics of UIN in terms of mobility and security, and it can provide the centralized multicast routing computation and distributes the multicast routing into forwarders. We compare CCSM with Protocol Independent Multicast-Sparse Mode (PIM-SM), and the results show that CCSM reduces the multicast join delay, and performs better than PIM-SM in term of reconstruction cost under low multicast density.

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.

End to End Delay Improvement in Heterogeneous Multicast Network using Genetic Optimization

Problem statement: Multicast is a concept of group communication which refers to transmitting the same data or messages from a source to multiple destinations in the network. This one-to-many group communication is a generalization of the concepts of one-to-one unicast and one-to-all broadcast. To deliver data from the sender to all receivers efficiently, routing plays an important role in multicast communication. In QoS multicast, every receiver must receive the data within their own specified QoS constraints. This becomes challenging especially if the network is a heterogeneous network made up of wired and wireless devices. Approach: This study investigates the performance of Protocol Independent Multicast-Sparse Mode (PIM-SM) protocol in a heterogeneous network running an video conferencing application and proposes an enhanced routing protocol using Genetic Optimizing techniques to improve QOS parameters in the wireless part. Results and Conclusion: Extensive simulations were carried out using the proposed technique and existing PIM-SM. The proposed optimization technique not only improves the throughput of the network but also decreased the end to end delay.

New Approach to Inter-domain Multicast Protocols

IPTV broadcast channels and video content distribution are increasingly saturating network paths. New solutions based on inter-domain multicast protocols could contribute to the enhancement of multimedia content distribution over the Internet. The aim of this paper is to propose new capabilities for an existing inter-domain multicast protocol, the Protocol Independent Multicast-Sparse Mode. We describe the modified protocol and analyze its behavior using newly developed tools based on an open-source software simulator. The resulting protocol does not require topology information, which is advantageous for easier deployment. In addition, the adopted solution avoids inherent problems with inter-domain multicast routing, such as multiple paths and path asymmetries.

Arranging multicast forwarding table in class sequence in ternary-cam for line-speed lookup

PIM-SM (Protocol Independent Multicast-Sparse Mode) is a main multicast routing protocol in the IPv6 (Internet Protocol version 6). It can use either a shared tree or a shortest path tree to deliver data packets, consequently the multicast IP lookup engine requires, in some cases, two searches to get a correct lookup result according to its multicast forwarding rule, and it may result in a new requirement of doubling the lookup speed of the lookup engine. The ordinary method to satisfy this requirement in TCAM (Ternary Content Addressable Memory) based lookup engines is to exploit parallelism among multiple TCAMs. However, traditional parallel methods always induce more resources and higher design difficulty. We propose in this paper a novel approach to solve this problem. By arranging multicast forwarding table in class sequence in TCAM and making full use of the intrinsic characteristic of the TCAM, our approach can get the right lookup result with just one search and a single TCAM, while keeping the hardware of lookup engine unchanged. Experimental results have shown that the approach make it possible to satisfy forwarding IPv6 multicast packets at the full link rate of 20 Gb/s with just one TCAM with the current TCAM chip.

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.

Topology-aware overlay multicast over IP multicast networks

Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM), a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router’s support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.

Traffic Engineered Multicast Content Delivery Without MPLS Overlay

Multicast traffic engineering (TE) has recently attracted significant attention given the emergence of point-to-multipoint multimedia content delivery over the Internet. Existing multicast resource provisioning solutions tend to use explicit-routing based TE with multiprotocol label switching (MPLS) tunnels. In this paper, we shift away from this overlay approach and address native IP multicast traffic engineering based on link state routing protocols. The objective is that, through plain protocol independent multicast-sparse mode (PIM-SM) shortest path routing with optimized multitopology IGP (MT-IGP) link weights, the resulting multicast trees are geared towards minimal consumption of bandwidth resources. We apply genetic algorithms (GA) to the calculation of optimized MT-IGP link weights that specifically cater for engineered PIM-SM routing with statistical bandwidth guarantees in multimedia content delivery. Our evaluation results show that GA-based multicast traffic engineering consumes significantly less bandwidth in comparison to conventional IP approaches while also exhibiting higher service availability

라우팅 테이블의 크기를 고려한 랑데부 라우터 선정 알고리즘

공유형 트리(Shared Tree)를 구성하여 멀티캐스트 서비스를 제공하는 CBT(Core Based Tree)와 PIM-SM(Protocol Independent Multicast-sparse Mode) 프로토콜에서는 랑데부 라우터(RP: Rendezvous Point)의 위치에 따라 전체 네트워크의 효율성이 결정된다. 본 논문에서는 멀티 캐스트 데이터 전송을 위하여 필요한 라우팅 테이블의 크기(테이블 내 entries의 수)를 최소화하고, 소스-멤버 사이의 비용을 일정한 범위 내로 관리할 수 있는 새로운 RP 선정 알고리즘을 제안한다. 성능분석 결과, 비용만을 고려하는 기존의 방법에 비하여 총비용은 5.37%, 라우팅 테이블의 크기는 13.35%까지 줄일 수 있음을 알 수 있다. Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

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.

Scalable Architecture and Evaluation for Multiparty Conferencing Over Satellite Links

This paper describes the architecture of a proposed multiparty conferencing system for satellites. Different conferencing models are discussed and compared. A session initiation protocol (SIP)-based conference signaling model and an extension to protocol-independent multicast sparse mode that supports quality-of-service (QoS) in DiffServ networks are proposed, as particularly suitable for multiparty conferencing applications over satellite links. The paper also presents key issues and potential solutions of scalable QoS multicast services for multiparty conferences over satellite. End-to-end QoS parameters for voice and video are measured and analyzed on a prototype.

Efficient Support of IP Multicast in the Next Generation of GEO Satellites

Satellites are expected to have an important role in providing the Internet protocol (IP) multicast service to complementing next-generation terrestrial networks. In this paper, we focus on the deployment of IP multicast over the next generation of digital video broadcasting-based geosynchronous earth orbit satellites supporting multiple spot beams and on-board switching technologies. We propose a new encapsulation scheme optimized for IP multicast, which has two distinct modes enabling two alternative on-board switching approaches: the self-switching and the label-switching. We also detail a set of mechanisms and protocols for ground stations, as well as for the on-board processor to allow an efficient multicast forwarding in this type of environment, while reducing the load of control and data messages in the satellite segment, and building efficient multicast delivery trees reaching only the spot beams containing at least one member of the corresponding multicast session. To integrate satellite links in the terrestrial Internet, we present satellite multicast adaptation protocol (SMAP), a protocol which is implemented in satellite stations to process incoming protocol independent multicast-sparse mode (PIM-SM) messages sent by terrestrial nodes to the satellite system. SMAP helps to update the tables required for the mapping between IP packets and MPEG-2 data segments, their switching on board the satellite, and their filtering at the satellite receivers.

Extensions to MPLS Networking for Enhanced Multiplatform Multicasting Services

Abstract This paper addresses the required extensions to the MultiProtocol Label Switching (MPLS) [1] signaling protocols (i.e., Resource Reservation Protocol [2] with Traffic Engineering extensions (RSVP-TE) [3] and Label Distribution Protocol (LDP) [4]) to support effective MPLS network multicasting functionalities for various Internet protocol (IP) based multicasting routing algorithms, such as, Distance Vector Multicasting Routing Protocol (DVMRP), Multicast Extensions for Open Shortest Path First (MOSPF), Protocol Independent Multicast-Dense Mode (PIM-DM), Protocol Independent Multicast-Sparse Mode (PIM-SM), and Core Based Tree (CBT). The multicasting extensions for MPLS networking proposed in this paper will not only enable the MPLS networking layer to support full multicasting services corresponding to the IP based multicasting algorithms, but will also enable the traffic engineering (TE) advantages of MPLS to support the multicasting operations [1].

Dynamic DR election for generating the multicast tree in PIM‐SM

AbstractIn IP multicast streaming, PIM‐SM (protocol independent multicast sparse‐mode) is now becoming the mainstream. However, it may happen that the optimal tree cannot be generated, depending on the location of the DR (designated router, which is the router used to generate the tree and so on when there are multiple PIM‐SM routers in the segment) in some special topology. The means of handling such a situation is described only ambiguously in the PIM‐SM specification. Consequently, various problems now arise in implementation. This paper considers the dynamic determination of a DR that can generate the optimal tree even in such a special topology, and proposes a new additional protocol. Tree generation for various topologies is examined for the proposed method and the existing implementation, and it is shown that the proposed method is effective for any existing topology. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(4): 65–72, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.10105

RPIM-SM: extending PIM-SM for RP relocation

The protocol independent multicast-sparse mode (PIM-SM) protocol establishes core-base tree to forward multicast datagrams in a network. In PIM-SM, the core or rendezvous point (RP) of a group is determined at each multicast router by hashing a group address, i.e. a class-D IP address, to one of the candidate RPs. The hash function is characterized by its ability to evenly and uniquely choose the core for a group and remains insensitive to the geographic distribution of the group members and the sources. However, it may result in a multicast tree with high cost.This study presents a relocation mechanism, which is extension to PIM-SM, in which RP could be relocated periodically. When a new RP is found, the original RP informs all members to re-join to the new RP. Simulation results indicate that the extended version, RPIM-SM, reduces about 20% tree cost than PIM-SIM when the group size is medium. Moreover, comparing RPIM-SM with the optimal core-based tree reveals that they have less than 5% difference in tree cost. Furthermore, an increase of the number of candidate RPs brings RPIM-SM even closer to the optimal core-based tree. Results in this study demonstrate that relocation improve the performance of PIM-SM.

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.