D2V-VNS-RPS: Delay and delay variation constrained algorithm based on Variable Neighborhood Search algorithm for RP Selection problem in PIM-SM protocol

Baddi, Youssef; Kettani, Mohamed Dâfir Ech-Cherif El

doi:10.1109/icocs.2012.6458559

Cited by 2 publications

(9 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These parameters must be optimized from all sources to each multicast member. Unlike the first work (D2V-VNS-RPS [38]) we introduce in this work the MODE and fitness functions: MODE function [36] is used to know the location of core and a fitness function to measure the potential cost, delay and delay variation, this function is an enhanced version of the CMP function [36], [37]. The MODE function is presented in formula ( 9) and can take 5 values: I) if the candidate core is one source, II) if one destination node exist in the path between the candidate core and one source, III) if one source exist in the path between the candidate core and one destination node, IV) if II and III, and V) otherwise, where U !…”

Section: Fitness Functionmentioning

confidence: 82%

“…To demonstrate the performance of this algorithm (QoS-VNS-CS), we compare it with the following algorithms, including, Tabu RP selection (TRPS) [37], DDVCA [6], AKC [36] and D2V-VNS-RPS [38]. The main objective of our algorithm is to reduce delay and delay variation; therefore, we start the simulation results by comparing these two metrics.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Also TRSPA [35] doesn't overcome this limitation because it just selects a local optimal node which may not generate an optimal delay and delay-variation-based multicast tree in all topology networks. The last core selection algorithm proposed by Baddi and El Kettani [38] is D2V-VNS-RPS: this algorithm, proposed as an extension to BootStrap RP in PIM-SM [3] protocol, uses VNS algorithm with a simple cost function to select one router as Rendezvous Point RP; this function tries to select the best router in terms of delay and delay variation using VNS algorithm to evaluate the solution after each iteration. Therefore, this algorithm is restricted only to selecting the best Rendezvous Point node whiteout caring in the Rendezvous Point position, which may not generate an optimal delay and delay-variation based multicast tree in many cases.…”

Section: Core Selection Based On Qos Constraintsmentioning

confidence: 99%

See 2 more Smart Citations

QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm

Baddi

Kettani²

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

Within the development of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast communication. Multicast IP routing is an important topic, covering both theoretical and practical interest in different networks layers. In network layer, there are several multicast routing protocols using multicast routing trees different in the literature. However PIM-SM and CBT protocols remains the most used multicast routing protocols; they propose using a shared Core-based Tree CBT. This kind of tree provides efficient management of multicast path in changing group memberships, scalability and performance. The prime problem concerning construction of a shared tree is to determine the best position of the core. QoS-CS’s problem (QoS constraints core Selection) consists in choosing an optimal multicast router in the network as core of the Shared multicast Tree (CBT) within specified QoS constraints associated. The choice of this specific router, called RP in PIM-SM protocol and core in CBT protocol, affects the structure of multicast routing tree, and therefore influences performances of both multicast session and routing scheme. QoS-CS is an NP complete problem need to be solved through a heuristic algorithm, in this paper, we propose a new core Selection algorithm based on Variable Neighborhood Search algorithm and new CMP fitness function. Simulation results show that good performance is achieved in multicast cost, end-to-end delay, tree construction delay and others metrics.

show abstract

Section: Fitness Functionmentioning

confidence: 82%

Section: Simulation Resultsmentioning

confidence: 99%

Section: Core Selection Based On Qos Constraintsmentioning

confidence: 99%

See 1 more Smart Citation

QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm

Baddi

Kettani²

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

show abstract

“…To reduce multicast cost and end-to-end delay, VNS-RP is proposed based on VNS heuristic algorithm [6]. D2V-VNS-RPS algorithm is proposed based on VNS heuristic algorithm, which selects the RP router by considering tree cost, delay, and delay variation [31]. A static core selection approach that uses distance vector routing (DVR) as the unicast routing protocol is presented [32].…”

Section: Related Work 21 Ip Multicastmentioning

confidence: 99%

“…Since the mapping of MSEID2 was not stored in NRS, NRS returned the Enable-state candidate core NA2 (arrow 28) and added the mapping of MSEID2 and NA2. After receiver3 joined the multicast service MSEID2, Router2 forwarded the multicast packets to receiver3 based on MSEID2 (arrows [29][30][31]. Compared with PIM-SM, ILDM could effectively avoid core overload by using NRS to dynamically allocate a low-load core to each multicast service.…”

Section: Comparison Of Ildm and Pim-smmentioning

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

D2V-VNS-RPS: Delay and delay variation constrained algorithm based on Variable Neighborhood Search algorithm for RP Selection problem in PIM-SM protocol

Cited by 2 publications

References 29 publications

QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm

QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm

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

Contact Info

Product

Resources

About