VNS-RP algorithm for RP selection in multicast routing protocol PIM-SM

Baddi, Youssef; Kettani, Mohamed Dafir Ech-Chrif El

doi:10.1109/icmcs.2012.6320123

Cited by 12 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We cite also our recent algorithms VNS-RP [17] and VND-CS [18] based in VNS [19] and VND [20] heuristics successively. All these algorithms select Rendezvous Point RP based in basic heuristics and do not consider QoS constraints.…”

Section: A Rp Selection Without Qos Constraintsmentioning

confidence: 98%

“…Tabu Search algorithm for RP selection (TRPSA) [17] is a distributed Rendezvous Point selection algorithm, based on dynamic meta-heuristic Tabu Search TS algorithms proposed first by Glover [18] to solve combinatorial optimization problems in PIM-SM protocol [3]. This algorithm tries to find a local solution after a certain finite number of iterations.…”

Section: A Rp Selection Without Qos Constraintsmentioning

confidence: 99%

“…In this paper we adapt our first algorithm VNS-RP [17] to act as a local search algorithm. First proposed by Mladenovic and Hansen, the basic idea of VNS algorithm is a systematic change of an arbitrarily chosen neighborhoods, which vary in size.…”

Section: Local Search Phasementioning

confidence: 99%

See 2 more Smart Citations

Parallel Greedy Randomized Adaptive Search Procedure with Delay and Delay Variation for RP Selection in PIM-SM Multicast Routing

Baddi

Dafi²,

Kettani³

2013

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications

Self Cite

View full text Add to dashboard Cite

Multicast IP is a Green Technology; it's a bandwidthconserving technology that reduces traffic by simultaneously delivering a single stream of information to multicast group members. Internet research community has proposed many Different multicast routing protocols to support efficient multimedia application, PIM-SM protocol remains the most used multicast routing protocol; they propose using a Shared Rendezvous Point Tree SRPT to forward multicast packets. The prime problem concerning SRPT construction is to determine an optimal multicast router in the network as a root; this problem is called Rendezvous point RP selection. This selection influences the form of the multicast routing tree, and therefore influences performances of the multicast session and multicast routing scheme. Determination of a best position of the Rendezvous Point is an NP complete problem, first proposed by Wall, which needs to be solved with a heuristic algorithm. In this paper we propose a new RP selection algorithm based on Parallel Greedy Randomized Adaptive Search Procedure. 2DV-PGRASP-RP selects RP by considering cost, delay and delay variation functions and can be easily integrated to bootstrap RP protocol used by PIM-SM. Simulation results show that good performance is achieved in multicast cost. 2DV-PGRASP-RP; PIM-SM; Multicast IP; SRPT; RP; GRASP; BootStrap RP

show abstract

Section: A Rp Selection Without Qos Constraintsmentioning

confidence: 98%

Section: A Rp Selection Without Qos Constraintsmentioning

confidence: 99%

See 1 more Smart Citation

Parallel Greedy Randomized Adaptive Search Procedure with Delay and Delay Variation for RP Selection in PIM-SM Multicast Routing

Baddi

Dafi²,

Kettani³

2013

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…According to the type of multicast tree established, multicast routing protocols can be categorized as Source-Based Tree (SBT) or Shared Tree (ST) based ones [6]. Since the SBT establishes a shortest path tree for each source in the multicast group, routers need to maintain a multicast flow state for each source.…”

Section: Introductionmentioning

confidence: 99%

An Identifier and Locator Decoupled Multicast Approach (ILDM) Based on ICN

Wang

2021

Applied Sciences

View full text Add to dashboard Cite

Many bandwidth-intensive applications (such as online live, online games, etc.) are more suitable for using multicast to transmit information. Due to the advantages in scalability, Shared Tree (ST) is more suitable for large-scale deployment than Source-Based Tree (SBT). However, in ST-based multicast, all multicast sources need to send multicast data to a center node called a core, which will lead to core overload and traffic concentration. Besides, most existing multicast protocols use the shortest path between the source or the core and each receiver to construct the multicast tree, which will result in traffic overload on some links. In this paper, we propose an Identifier and Locator Decoupled Multicast approach (ILDM) based on Information-Centric Networking (ICN). ILDM uses globally unique names to identify multicast services. For each multicast service, the mapping between the multicast service name and the addresses of multicast tree nodes is stored in the Name Resolution System (NRS). To avoid core overload and traffic aggregation, we presented a dynamic core management and selection mechanism, which can dynamically select a low-load core for each multicast service. Furthermore, we designed a path state-aware multicast tree node selection mechanism to achieve traffic load balancing by using low-load links more effectively. Experimental results showed that our proposed multicast approach outperformed some other multicast methods in terms of core load, number of join requests, link load, traffic concentration, and routing state.

show abstract

“…Selecting an optimal core node or rendezvous point is an NP‐complete problem, and many methods have been proposed to tackle it. ()…”

Section: Introductionmentioning

confidence: 99%

Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing

Harutyunyan

Terzian

2017

Int J Communication

View full text Add to dashboard Cite

Multicast communication constrained by end-to-end and interdestination delay variation is known as delay and delay variation-bounded multicast. These constraints are salient for real-time multicast communications. In this paper, we propose a directional core selection algorithm for core selection and delay variation-bounded multicast tree generation. Another algorithm, based on k-shortest paths, is proposed to further decrease the interdestination delay variation of the trees generated by directional core selection. We also propose the dynamic version of both algorithms that respond to dynamic join and leave requests to the ongoing multicast session by reorganizing the tree and avoiding session disruption. Simulations show that the proposed algorithms surpass existing algorithms in end-to-end delay, interdestination delay variation, execution time, and failure probability.

show abstract

VNS-RP algorithm for RP selection in multicast routing protocol PIM-SM

Cited by 12 publications

References 18 publications

Parallel Greedy Randomized Adaptive Search Procedure with Delay and Delay Variation for RP Selection in PIM-SM Multicast Routing

Parallel Greedy Randomized Adaptive Search Procedure with Delay and Delay Variation for RP Selection in PIM-SM Multicast Routing

An Identifier and Locator Decoupled Multicast Approach (ILDM) Based on ICN

Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing

Contact Info

Product

Resources

About