@article {Sebbar2022251,
	title = {BDA-enabler Architecture Based on Cloud Manufacturing: the Case of Chemical Industry},
	journal = {International Journal of Supply and Operations Management},
	volume = {9},
	number = {3},
	year = {2022},
	note = {cited By 0},
	pages = {251-263},
	abstract = {With the advent of cloud manufacturing (CM), alongside the maturity of specific development approaches and systems in the manufacturing industry, has led to the integration of these initiatives into Industry 4.0 to achieve higher performance. In fact, the implementation of Industry 4.0 is a real opportunity for the process industry around the world which is only at the very beginning of its deployment. However, the integration of cloud manufacturing requires the fully digitalization of industrial systems and the implementation of big data management process. Indeed, the lack of resources to handle the huge flows of data in transit and the lack of standards and interoperability is the biggest challenge to the large-scale adoption of smart manufacturing. To get around this problem, it is necessary to put in place management and analysis solutions for big data to facilitate data acquisition, process monitoring, anomaly detection and predictive and proactive maintenance. In addition, the implementation of a smart manufacturing architecture based on big data analytics (BDA) requires a lot of resources in terms of storage and computing power, which is not always available in an industrial context. Thus, it has become essential to offer suitable manufacturing models for the implementation of big data analysis services that meet the new requirements of the manufacturing sector. In this paper, a case study in one of the main African Phosphates Company will be presented. Thus, we will propose a BDA-enabler architecture based on Cloud manufacturing to identified digital opportunities and key benefits regarding performance management, production control and maintenance. The findings will help manufacturer to understand cloud manufacturing and big data analytics capabilities and take advantages from their potential and their digital opportunities to assess manufacturing process. {\textcopyright} 2022 Kharazmi University. All rights reserved.},
	doi = {10.22034/ijsom.2021.109150.2208},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85140920905\&doi=10.22034\%2fijsom.2021.109150.2208\&partnerID=40\&md5=22cf4ece941e282c346700fda9fe056e},
	author = {Sebbar, A. and Zkik, K. and Belhadi, A. and Benghalia, A. and Boulmalf, M. and Ech-Cherif El Kettani, M.D.}
}
@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 {El-Yahyaoui2019150,
	title = {Optimizations in fully homomorphic encryption},
	journal = {Lecture Notes in Networks and Systems},
	volume = {49},
	year = {2019},
	note = {cited By 0},
	pages = {150-166},
	doi = {10.1007/978-3-319-97719-5_11},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063268513\&doi=10.1007\%2f978-3-319-97719-5_11\&partnerID=40\&md5=d99d4c66a9844c9bde0bf03273bef13b},
	author = {El-Yahyaoui, A. and Ech-Cherif El Kettani, M.D.}
}
@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 {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.}
}
@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 {Ech-CherifElKettani200977,
	title = {GDCoS: A Group Dedicated Class of Service for QoS multicast provisioning in ISP communication networks},
	booktitle = {1st International Conference on Evolving Internet, INTERNET 2009},
	year = {2009},
	note = {cited By 1},
	pages = {77-82},
	doi = {10.1109/INTERNET.2009.19},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-71249105711\&doi=10.1109\%2fINTERNET.2009.19\&partnerID=40\&md5=dea3436aa5651978833ac72fb615248e},
	author = {Ech-Cherif El Kettani, M.D. and Khatib, A.}
}
