@conference { ISI:000371484600066,
	title = {Multiple Active Cores-based Shared Multicast Tree for mobile IPv6 environment},
	booktitle = {2014 THIRD IEEE INTERNATIONAL COLLOQUIUM IN INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}14)},
	series = {Colloquium in Information Science and Technology},
	year = {2014},
	note = {3rd IEEE International Colloquium on Information Science and Technology (CIST), Tetouan, MOROCCO, OCT 20-22, 2014},
	pages = {378-383},
	publisher = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	organization = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	abstract = {Due to the progress of network multimedia technology, internet research community 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 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.},
	isbn = {978-1-4799-5979-2},
	issn = {2327-185X},
	author = {Baddi, Youssef and El Kettani, Mohamed Dafir Ech-Cherif},
	editor = {ElMohajir, M and AlAchhab, M and Chahhou, M}
}
@conference { ISI:000327787500001,
	title = {Key Management for Secure Multicast Communication: A Survey},
	booktitle = {2013 NATIONAL SECURITY DAYS (JNS3)},
	year = {2013},
	note = {3rd National Security Days (JNS), Mohammed V Souissi Unvi, Rabat, MOROCCO, APR 26-27, 2013},
	publisher = {Assoc Marocaine ConfiAnace Numerique; Ecole Nationale Superieure Informatique \& Analyse Syst; Informat Secur Res Team; IEEE Morocco Sect; Bank Al Maghrib; Natl Ctr Sci \& Technol Res},
	organization = {Assoc Marocaine ConfiAnace Numerique; Ecole Nationale Superieure Informatique \& Analyse Syst; Informat Secur Res Team; IEEE Morocco Sect; Bank Al Maghrib; Natl Ctr Sci \& Technol Res},
	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.},
	isbn = {978-1-4799-0324-5},
	author = {Baddi, Youssef and Ech-Cherif El Kettani, Mohamed Dafir}
}
@conference { ISI:000331174400078,
	title = {Parallel Greedy Randomized Adaptive Search Procedure with Delay and Delay Variation for RP Selection in PIM-SM Multicast Routing},
	booktitle = {2013 EIGHTH INTERNATIONAL CONFERENCE ON BROADBAND, WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS (BWCCA 2013)},
	year = {2013},
	note = {8th IEEE International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA), Univ Technol Compiegne, Compiegne, FRANCE, OCT 28-30, 2013},
	pages = {481-487},
	publisher = {IEEE; IEEE Comp Soc},
	organization = {IEEE; IEEE Comp Soc},
	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.},
	isbn = {978-0-7695-5093-0},
	doi = {10.1109/BWCCA.2013.84},
	author = {Baddi, Youssef and Dafir, Mohamed and El Kettani, Ech-Cherif},
	editor = {Barolli, L and Xhafa, F and Nace, D and Bouabdallah, A and Enokido, T and Yeo, SS}
}
@conference { ISI:000324984400066,
	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 (ICCS12)},
	year = {2012},
	note = {1st International Conference on Complex Systems (ICCS), Agadir, MOROCCO, NOV 05-06, 2012},
	pages = {387-392},
	abstract = {Due to the progress of network multimedia technology, a majority of real-time multimedia applications need multicast communication to transmit information. These applications require a multicast routing protocol in which packets arrive to multicast receptors within a specified QOS guaranteed. D2V-RPS{\textquoteright}s problem (delay and delay variation RP Selection) consists in choosing an optimal multicast router in the network as the root of the Shared multicast Tree (ST) within a specified delay and delay variation associated. The choice of this specific router, called RP in PIM-SM protocol, is the main problem concerning the construction of multicast tree; this choice affects the structure of multicast routing tree, and therefore influences performances of both multicast session and routing scheme. The determination of a best position of the RP within a specified delay and delay variation associated is an NP complete problem: it needs to be solved through a heuristic algorithm. In this paper, we propose a new RP Selection algorithm based on Variable Neighborhood Search algorithm, which based on a systematic neighborhood changing. D2V-VNS-RPS algorithm selects the RP router by considering tree cost, delay and delay variation. Simulation results show that good performance is achieved.},
	isbn = {978-1-4673-4766-2},
	author = {Baddi, Youssef and Ech-Cherif El Kettani, Mohamed Dafir},
	editor = {Essaaidi, M and Nemiche, M}
}
@conference { ISI:000325229700005,
	title = {MC-PIM-SM: multicast routing protocol PIM-SM with Multiple Cores Shared Tree for mobile IPv6 environment},
	booktitle = {2012 SECOND INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING TECHNOLOGY (INTECH)},
	year = {2012},
	note = {2nd International Conference on Innovative Computing Technology (INTECH), Casablanca, MOROCCO, SEP 18-20, 2012},
	pages = {21-26},
	publisher = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	organization = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	abstract = {Internet research community has proposed many different multicast routing protocols to support efficient multimedia application such as, IPTV, videoconferencing, group games. Nevertheless, the design of all these protocols does not take into account that group members may be mobile. Indeed, with the arrival of Mobile IPv6 by IETF providing mobile users with continuous access, group members in the network are very dynamic affecting on the 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 avoid the reconstruction of the entire multicast-based tree, by using an architecture MC-PIM-SM based in PIM-SM multicast routing protocol with Multiple Cores Shared 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.},
	isbn = {978-1-4673-2679-7},
	author = {Baddi, Youssef and Ech-Chrif El Kettani, Mohamed Dafir}
}
@conference { ISI:000310353000111,
	title = {VNS-RP algorithm for RP selection in multicast routing protocol PIM-SM},
	booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2012},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012},
	pages = {595-600},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Covering both theoretical and practical interest in different networks layers, multicast routing remains an important topic. In network layer, there are several multicast routing protocols using different multicast routing trees in the literature. However PIM-SM and CBT protocols remains the most used multicast routing protocols; they propose using a shared tree (ST). 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 root. Selection of the core (in CBT protocol) or Rendezvous Point RP (in PIM-SM protocol) affects directly both structure of multicast tree and routing scheme performances of multicast session accordingly. This paper proposes a multicast RP selection algorithm based on VNS search. This algorithm selects the RP router with systematic change of arbitrarily chosen neighborhoods by considering both cost and delay functions. Simulation results show that good performance is achieved in terms of multicast cost, end-to-end delay, tree construction delay and others metrics.},
	isbn = {978-1-4673-1520-3},
	author = {Baddi, Youssef and Ech-Chrif El Kettani, Mohamed Dafir},
	editor = {Essaaidi, M and Zaz, Y}
}
