@article {Baddi2021373,
	title = {MSDN-GKM: Software Defined Networks Based Solution for Multicast Transmission with Group Key Management},
	journal = {Studies in Computational Intelligence},
	volume = {919},
	year = {2021},
	note = {cited By 0},
	pages = {373-396},
	abstract = {Multicast communication is an important requirement to support many types of applications, such as, IPTV, videoconferencing, group games. Recently this multicast applications type emerges fast, in one side more application provider proposed many applications, in other side Internet research community has proposed many different multicast routing protocols to support efficient multicast application. Therefore, the necessity of secure mechanism to provide the confidentiality and privacy of communications are more and more insistent. In current standardized IP multicast architecture, any host can join a multicast group, as source or receiver, without authentication, because no host identification information is maintained by routers, this situation leads clearly to many security risks issues. For security enhancement in multicast communication, in this paper an SDN based multicast solution with Group Key Management (GKM) approach was introduced. Our proposal solution, MSDN-GKM, includes many SDN modules to support multicast functions, group key generation, Group key exchange, storage, use, and keys replacement if any multicast group membership occurs. To prove the efficiency of our proposal solution a prototype is implemented in our SDN platform. The test-bed result proves that our proposal solution is greater to the traditional IP multicast proposed in the literature, which is reflected in two aspects: firstly, multicast metrics performance in terms of end-to-end delay, tree construction delay and delay variation. Secondly, the multicast group key management performance in terms of storage overhead and time processing. {\textcopyright} 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-57024-8_17},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097877454\&doi=10.1007\%2f978-3-030-57024-8_17\&partnerID=40\&md5=90fd04903bd123b46bd5571b000609a6},
	author = {Baddi, Y. and Anass, S. and Zkik, K. and Maleh, Y. and Mohammed, B. and El Kettani Mohamed Dafir, E.-C.}
}
@article {Sebbar2021355,
	title = {Secure Data Sharing Framework Based on Supervised Machine Learning Detection System for Future SDN-Based Networks},
	journal = {Studies in Computational Intelligence},
	volume = {919},
	year = {2021},
	note = {cited By 2},
	pages = {355-371},
	abstract = {Securing Data-sharing mechanism between Software Defined Networks (SDN) nodes represent one of the biggest challenges in SDN context. In fact, attackers may steal or perturb flows in SDN by performing several types of attacks such as address resolution protocol poisoning, main in the middle and rogue nodes attacks. These attacks are very harm full to SDN networks as they can be performed easily and passively at all SDN layers. Furthermore, data-sharing permit to an attacker to gather all sensitive flows and data from SDN architecture. In this chapter, we will propose a framework for secure data sharing that detect and stop intrusions in SDN context while ensuring authentication and privacy. To do so, we propose a defense mechanism that detect and reduce the risk of attacks based on advanced machine learning techniques. The learning and data pre-processing steps was performed by using a constructed data set dedicated to SDN context. The simulation results show that our framework can effectively and efficiently address sniffing attacks that can be detected and stopped quickly. Finally, we observe high accuracy with a low false-positive for attack detection. {\textcopyright} 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-57024-8_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097909334\&doi=10.1007\%2f978-3-030-57024-8_16\&partnerID=40\&md5=0d3b5f0a3c85d400bc35313dfe6f3009},
	author = {Sebbar, A. and Zkik, K. and Baddi, Y. and Boulmalf, M. and Ech-Cherif El Kettani, M.D.}
}
@article {Zemrane2020101,
	title = {Internet of Things Smart Home Ecosystem},
	journal = {Studies in Systems, Decision and Control},
	volume = {242},
	year = {2020},
	note = {cited By 15},
	pages = {101-125},
	abstract = {Internet of things is perceived today as a key opportunity for commercial development in different sectors of activities, the new IoT Smart home ecosystem, is based on a lot of sensors and actuators that can make life in the home more pleasant and more safety for its occupant, in this article we distinguish the communication protocols used in this IoT ecosystem, their modes of operation, and we analyze their performance. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	doi = {10.1007/978-3-030-22773-9_8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069766578\&doi=10.1007\%2f978-3-030-22773-9_8\&partnerID=40\&md5=8934d759b7be1ff526b641115522498d},
	author = {Zemrane, H. and Baddi, Y. and Hasbi, A.}
}
@article {Sebbar20205875,
	title = {MitM detection and defense mechanism CBNA-RF based on machine learning for large-scale SDN context},
	journal = {Journal of Ambient Intelligence and Humanized Computing},
	volume = {11},
	number = {12},
	year = {2020},
	note = {cited By 15},
	pages = {5875-5894},
	abstract = {Software defined network (SDN) is a promising new network abstraction that aims to improve and facilitate network management. Due to its centralized architecture and the lack of intelligence on the data plane, SDN suffers from many security issues that slows down its deployment. Man in the Middle (MitM) attack is considered as one of the most devastating attacks in an SDN context. In fact, MitM attack allows the attackers to capture, duplicate and spoof flows by targeting southbound interfaces and SDN nodes. Furthermore, it{\textquoteright}s very difficult to detect MitM attacks since it is performed passively at the SDN level. To reduce the impact of this attack, we generally set up security policies and authentication mechanisms. However, these techniques are not applicable for a large scale SDN architecture as they require complexes and static configurations and as they negatively influence on network performance. In this paper, we propose an intrusion detection and prevention framework by using machine learning techniques to detect and stop MitM attempts. To do so, we build a context-based node acceptance based on the random forest model (CBNA-RF), which helps to setting-up appropriate security policies and to automating defense operations on a large-scale SDN context. This mechanism can realize a quick and early detection of MitM attacks by automatically detecting malicious nodes without affecting performances. The evaluation of the proposed framework demonstrates that our model can correctly classify and detect malicious connections and nodes while keeping high accuracy and precision scores. {\textcopyright} 2020, Springer-Verlag GmbH Germany, part of Springer Nature.},
	keywords = {Authentication mechanisms, Centralized architecture, Decision trees, Defense operations, Intrusion detection, Intrusion detection and prevention, Machine learning, Machine learning techniques, Man-In-The-Middle (MITM) Attack, Network abstractions, Network architecture, Network security, Random forest modeling, Security systems},
	doi = {10.1007/s12652-020-02099-4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085987877\&doi=10.1007\%2fs12652-020-02099-4\&partnerID=40\&md5=cf120767ba875958e97b87ce22203057},
	author = {Sebbar, A. and Zkik, K. and Baddi, Y. and Boulmalf, M. and Kettani, M.D.E.-C.E.}
}
@article {Baddi2020245,
	title = {Msnd: Multicast software defined network based solution to multicast tree construction},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12293},
	year = {2020},
	note = {cited By 0},
	pages = {245-256},
	abstract = {Internet services provider propose increasingly numerous applications depend on multicast communication patterns, such as database synchronization, newsletter updates, video, and audio group streaming. In spite of, IP multicast is frequently suffered from scaling and instability, which causes internet provider administrators to avoid its utilization. While different multicast protocols in all layers, such as routing and switching, have been created by researchers and providers, through several years, to focus on security, congestion control, and scalability, our work aims to scale multicast regarding the number of supported multicast groups and sources in networks and multicast session. In this paper, we propose an SDN-based IP multicast tree construction module to support and deploy multicast communication-based services. To do so, we take advantage to compute multicast tree, in the centralized way, to achieve a dynamic tree construction algorithm that helps SDN controller to dynamically construct and adjust an optimal multicast tree in all multicast session. The experiments studies on the prototype and simulation system exhibit that our solution gives better performance contrasted with the traditional multicast tree construction algorithms, better also to SDN-based solution proposed in the literature, regarding multicast tree cost, delay, delay variation, and multicast tree construction delay. {\textcopyright} Springer Nature Switzerland AG 2020.},
	keywords = {Database synchronization, Forestry, Internet protocols, Internet services providers, Multicast communication, Multicast protocol, Multicast sessions, Multicast software, Multicast tree construction, Multicasting, Network security, Overlay networks, Simulation systems, Software defined networking, Trees (mathematics), Ubiquitous computing},
	doi = {10.1007/978-3-030-58008-7_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096412695\&doi=10.1007\%2f978-3-030-58008-7_20\&partnerID=40\&md5=f5004a1fb0f79381fe80ca313ad89b13},
	author = {Baddi, Y. and Sebbar, A. and Zkik, K. and Boulmalf, M. and El Kettani, M.D.E.-C.}
}
@article {Baddi2019255,
	title = {OSM-GKM optimal shared multicast-based solution for group key management in mobile IPv6},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {11028 LNCS},
	year = {2019},
	note = {cited By 0},
	pages = {255-269},
	doi = {10.1007/978-3-030-05529-5_17},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059959185\&doi=10.1007\%2f978-3-030-05529-5_17\&partnerID=40\&md5=2810614cfac2d08a325d997402510437},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {Baddi2018567,
	title = {Optimal Shared Multicast Tree Based Solution for Group Key Management in Mobile IPv6},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	volume = {2018-October},
	year = {2018},
	pages = {567-572},
	doi = {10.1109/CIST.2018.8596622},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061457715\&doi=10.1109\%2fCIST.2018.8596622\&partnerID=40\&md5=31bd74e9c9cd03787a33a8016a62e2ce},
	author = {Baddi, Y. and Kettani, M.D.E.-C.E.}
}
@conference {Baddi2015378,
	title = {Multiple active cores-based shared multicast tree for mobile IPv6 environment},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	volume = {2015-January},
	number = {January},
	year = {2015},
	note = {cited By 0},
	pages = {378-383},
	abstract = {Due to the progress of network multimedia technology, internet research community proposed many different multicast routing protocols to support efficient realtime multimedia application such as, IPTV, videoconferencing, group games. These applications require a multicast routing protocol in which packets arrive to multicast receivers with minimum delay and delay variation. These applications are more important with arrival of mobile IPv6 protocol with mobile receivers and sources with continuous access. Nevertheless, the design of multicast protocols does not take into account that group members may be mobile. Dynamic group members and sources can rapidly affect quality of both routing protocol scheme and multicast tree used. The key idea of this work is to make the handover of multicast members transparent and a quick recovery mechanism to maintain an optimal multicast tree, by using MACT-MIPv6 architecture based on multicast routing protocol with Shared Multiple Active Cores Multicast Tree to hide the mobility of mobile multicast members from the main multicast delivery tree. Simulation results show that good performance is achieved in terms of handoff latency, end-to-end delay, tree construction delay and others metrics. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/CIST.2014.7016650},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938069619\&doi=10.1109\%2fCIST.2014.7016650\&partnerID=40\&md5=c3eb443475201dc517bf26deec394308},
	author = {Baddi, Y. and Ech-Cherif El Kettani, M.D.}
}
@conference {Baddi2014106,
	title = {A fast dynamic multicast tree adjustment protocol for mobile IPv6},
	booktitle = {International Conference on Next Generation Networks and Services, NGNS},
	year = {2014},
	note = {cited By 0},
	pages = {106-113},
	abstract = {Internet research community has proposed many Different multicast routing protocols to support efficient multimedia application such as, IPTV, videoconferencing, group games. Nevertheless, these protocols have not been designed for mobile roaming members and sources, and has not been tested in wireless and mobile environment since they were developed for multicast parties whose members and sources are topologically stationary. Recently, as the performance of mobile hosts rapidly improves and the bandwidth of wireless access networks grows up, the expectation for mobile multimedia communication services including many-to-many communications such as video-conferencing begins a big necessary. Studying and solving multicast issues in the stationary multicast infrastructure has been largely studied in the literature. However, fewer efforts have been spent in the specific problems of mobile members and sources caused by the frequent change of membership and point of attachment. This paper addresses the issue of mobile Multicast routing by presenting a Fast Dynamic Multicast Tree Adjustment Protocol for Mobile IPv6 (FDMTA-MIPv6), an optimized multicast tree protocol is proposed to transform multicast tree into an optimal shared multicast tree routed at a selected RP. To estimate and evaluate our scheme, we implement simulation based in many metrics, simulation results show that good performance is achieved in terms of handoff latency, end-to-end delay, tree construction delay and others metrics. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/NGNS.2014.6990237},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84920023844\&doi=10.1109\%2fNGNS.2014.6990237\&partnerID=40\&md5=c0f4b32fad87f7e72e0ca4fce3e955c0},
	author = {Baddi, Y. and Ech-Chrif El Kettani, M.D.}
}
@article {Baddi2014253,
	title = {PIM-SM protocol with GRASP-RP selection algorithm based architecture to transparent mobile sources in multicast mobile IPv6 diffusion},
	journal = {Journal of Mobile Multimedia},
	volume = {9},
	number = {3-4},
	year = {2014},
	note = {cited By 1},
	pages = {253-272},
	abstract = {Due to the progress of network multimedia technology, Internet research community has proposed many Different multicast routing protocols to support efficient real-time multimedia application such as, IPTV, videoconferencing, group games. These applications require a multicast routing protocol in which packets arrive to multicast receptors within a minimum delay and delay variation. Nevertheless, these protocols does not take into account that group members may be mobile and have not been designed for mobile members and roaming sources, and has not been tested in wireless and mobile environment since they were developed for multicast parties whose members and sources are topologically stationary. Recently, as the performance of mobile hosts rapidly improves and the bandwidth of wireless access networks grows up, the expectation for mobile multimedia communication services including many-to-many communications begins a big necessary. Studying and solving multicast issues in the stationary multicast infrastructure has been largely studied in the literature. However, fewer efforts have been spent in the specific problems of mobile members and sources caused by the frequent change of membership and point of attachment. The main problematic of the multicast IP protocols in a Mobile IP environment is the frequent change of membership and members location, this can rapidly affect quality of both routing protocol scheme and multicast tree used, especially, the scenario of handover where a mobile source moves from attachment point in one sub-network to another one in another sub-network is challenging. A multicast source is identified by its Home Address HA. Since IP mobility implies acquisition of a new topologically Care-of-Address CoA at each handoff resulting in a change of identity of the multicast source, however, the established multicast routing states are always based on the home address of the mobile source. This paper addresses the issue of mobile Multicast routing by presenting a PIM-SM based architecture with a GRASP-RP selection algorithm. The key idea of this work is to make the handover of multicast sources transparent and avoid the reconstruction of the entire multicast-based tree, by using an architecture based in PIM-SM multicast distribution trees to hide the mobility of a mobile multicast source from the main multicast delivery tree. To estimate and evaluate our scheme, we implement simulation based in many metrics, simulation results show that good performance is achieved in terms of handoff latency, end-to-end delay, tree construction delay and others metrics. {\textcopyright} 2014 Rinton Press.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893725131\&partnerID=40\&md5=829e43ba7bb7aaf0bc54f08635084c12},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@article {Baddi20141271,
	title = {Qos-based parallel GRASP algorithm for RP selection in PIM-SM multicast routing and mobile IPV6},
	journal = {International Review on Computers and Software},
	volume = {9},
	number = {7},
	year = {2014},
	note = {cited By 2},
	pages = {1271-1281},
	abstract = {On account the progress of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast IP communication. These applications are more important with arrival of mobile IPv6 protocol with mobile members and require a multicast routing protocol which has packets arriving to members within a specified QoS guaranteed and a quick recovery mechanism. Multicast IP is a bandwidth-conserving technology that reduces traffic by simultaneously delivering a single stream of information to a group members. Internet research community has proposed many multicast routing protocols to support efficient multimedia application, expect that they were developed for multicast parties whose members are topologically stationary. The mobility of multicast receivers or senders may lead to serious problems, when a receiver or sender moves, the quality of full multicast tree may degrade hens multicast datagrams cannot be forwarded efficiently.D2V-RPM (delay and delay variation RP Manager) problem consist of choosing an optimal multicast router in the network as the root of the Shared RP Tree within a specified delay and delay variation bound, and recovering this RP if it{\textquoteright}s off optimal. This NP hard problem needs to be solved through a heuristic algorithm. In this paper we propose a new RP Management algorithm based on PGRAS Procedure. 2DV-PGRASP-RPM selects and recovers the RP by considering cost, delay and delay variation functions and can be easily integrated to bootstrap RP protocol used by PIM-SM protocol. Simulation results show that good performance is achieved in multicast cost. {\textcopyright} 2014 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84907817361\&partnerID=40\&md5=16f80129246fa69d8478a5ac9a1b72fb},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@article {Baddi20141,
	title = {QoS-VNS-CS: QoS constraints core selection algorithm based on variable neighborhood search algorithm},
	journal = {International Journal of Communication Networks and Information Security},
	volume = {6},
	number = {1},
	year = {2014},
	note = {cited By 0},
	pages = {1-10},
	abstract = {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 remain the most used multicast routing protocols; they propose to use a shared Core-based Tree CBT. This kind of tree provides efficient management of multicast path in changing group memberships, scalability and performance. The main problem concerning the construction of a shared tree is to determine the best position of the core. QoS-CS{\textquoteright}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 associated QoS constraints. 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 which needs to be solved through a heuristic algorithm: in this paper, we propose a new core Selection algorithm based on Variable Neighborhood Search algorithm and a 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.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84897534138\&partnerID=40\&md5=73da3067effb4bd61ade543527622d12},
	author = {Baddi, Y. and Kettani, M.D.-C.E.}
}
@conference {Baddi2013,
	title = {Key management for secure multicast communication: A survey},
	booktitle = {2013 National Security Days - 3eme Edition Des Journees Nationales de Securite, JNS3},
	year = {2013},
	note = {cited By 0},
	abstract = {Multicast IP communication is increasingly used as an efficient large-scale communication mechanism for one-to-many and many-to-many communication applications on the Internet. Success of such communication mode has required the development and integration of security mechanisms. The main problem in securing a multicast session is the key management group. Membership in a multicast group is dynamic, allowing hosts to enter and leave the multicast session without the permission or knowledge of other hosts making it susceptible to attack unless they are secured. This paper addresses issues relevant to implementing security for IP multicast networks including issues of group membership and key distribution, and principally, several keying architectures are evaluated and compared to determine their strengths and weaknesses. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/JNS3.2013.6595453},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884767620\&doi=10.1109\%2fJNS3.2013.6595453\&partnerID=40\&md5=f1f8418f0f0372885a1ac69ef47bb7f2},
	author = {Baddi, Y. and Ech-Cherif El Kettani, M.D.}
}
@conference {Baddi2013227,
	title = {Parallel GRASP algorithm with delay and delay variation for core selection in shared tree based multicast routing protocols},
	booktitle = {2013 3rd International Conference on Innovative Computing Technology, INTECH 2013},
	year = {2013},
	note = {cited By 0},
	pages = {227-232},
	abstract = {Many multicast routing protocols has proposed to support efficient multimedia application, PIM-SM and CBT protocols remain the most used multicast routing protocol; they propose using a Shared Tree ST to forward multicast packets. The prime problem concerning ST construction is to determine an optimal multicast router in the network as root; this problem is called Core selection. This problem influences the multicast routing tree structure, and therefore influences performances of the multicast session and multicast routing scheme. Determination of a best core position 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 Core selection algorithm based on Parallel GRAS Procedure and new CMP fitness function. 2DV-PGRASP-CR selects Core by considering cost, delay and delay variation functions and can be easily integrated to bootstrap RP protocol used by PIM-SM and CBT. Simulation results show that good performance is achieved in multicast cost. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/INTECH.2013.6653696},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84891138368\&doi=10.1109\%2fINTECH.2013.6653696\&partnerID=40\&md5=9b341b57a58b4588d41f81c4d3e960a7},
	author = {Baddi, Y. and Ech-Cherif El Kettani, M.D.}
}
@article {Baddi2013235,
	title = {Parallel GRASP algorithm with delay and delay variation for Rendezvous Point selection in PIM-SM multicast routing},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {57},
	number = {2},
	year = {2013},
	note = {cited By 2},
	pages = {235-243},
	abstract = {Many multicast routing protocols has proposed 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 root; this problem is called RP selection. This problem influences the multicast routing tree structure, and therefore influences performances of the multicast session and multicast routing scheme. Determination of a best RP position 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 GRAS 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} 2005 - 2013 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888107680\&partnerID=40\&md5=d338159536c87e716e7f7a98c0232757},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@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.}
}
@conference {Baddi2012,
	title = {D2V-VNS-RPS: Delay and delay variation constrained algorithm based on Variable Neighborhood Search algorithm for RP Selection problem in PIM-SM protocol},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458559},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874481974\&doi=10.1109\%2fICoCS.2012.6458559\&partnerID=40\&md5=8b28eeceffbaa5aff332a7611a7e3207},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {Baddi201221,
	title = {MC-PIM-SM: Multicast routing protocol PIM-SM with Multiple Cores Shared tree for mobile IPv6 environment},
	booktitle = {2nd International Conference on Innovative Computing Technology, INTECH 2012},
	year = {2012},
	note = {cited By 0},
	pages = {21-26},
	doi = {10.1109/INTECH.2012.6457753},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874453066\&doi=10.1109\%2fINTECH.2012.6457753\&partnerID=40\&md5=a220ba5d044562a1477822f4ee24446d},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@article {Baddi2012123,
	title = {PIM-SM protocol based architecture to transparent mobile sources in multicast mobile IPv6 diffusion},
	journal = {International Conference on Next Generation Networks and Services, NGNS},
	year = {2012},
	note = {cited By 0},
	pages = {123-130},
	doi = {10.1109/NGNS.2012.6656079},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894112218\&doi=10.1109\%2fNGNS.2012.6656079\&partnerID=40\&md5=d2105618aac81d52762377471c23d4e0},
	author = {Baddi, Y. and Ech-Chrif El Kettani, M.D.}
}
@article {Baddi2012429,
	title = {VND-CS: A Variable Neighborhood Descent Algorithm for Core Selection Problem in Multicast Routing Protocol},
	journal = {Communications in Computer and Information Science},
	volume = {293 PART 1},
	year = {2012},
	note = {cited By 0},
	pages = {429-443},
	doi = {10.1007/978-3-642-30507-8_37},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880475720\&doi=10.1007\%2f978-3-642-30507-8_37\&partnerID=40\&md5=e5e720a0f5591de6f04960b82124be10},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {Baddi2012595,
	title = {VNS-RP algorithm for RP selection in multicast routing protocol PIM-SM},
	booktitle = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012},
	year = {2012},
	note = {cited By 1},
	pages = {595-600},
	doi = {10.1109/ICMCS.2012.6320123},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869860517\&doi=10.1109\%2fICMCS.2012.6320123\&partnerID=40\&md5=4f285c9563e66243e62944313c2621c7},
	author = {Baddi, Y. and Ech-Chrif El Kettani, M.D.}
}
