@conference {Baddi2013481,
	title = {Parallel greedy randomized adaptive search procedure with delay and delay variation for RP selection in PIM-SM multicast routing},
	booktitle = {Proceedings - 2013 8th International Conference on Broadband, Wireless Computing, Communication and Applications, BWCCA 2013},
	year = {2013},
	note = {cited By 0},
	pages = {481-487},
	abstract = {Multicast IP is a Green Technology; it{\textquoteright}s a bandwidth-conserving 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. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/BWCCA.2013.84},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893319627\&doi=10.1109\%2fBWCCA.2013.84\&partnerID=40\&md5=1231676fd3d0433f293d5cb3f587e98f},
	author = {Baddi, Y. and Ech-Cherif El Kettani, M.D.}
}
