2019

• Service Placement in Fog Computing Using Constraint Programming. Farah Ait Salaht, Frédéric Desprez, Adrien Lebre and Charles Prud'homme. IEEE SCC, 2019.

2017

• Analysis of performance and energy consumption in the cloud. Mehdi Kandi, Farah Ait Salaht, Hind Castel-Taleb, Emmanuel Hyon. 14th European Performance Engineering Workshop (EPEW), 2017.
• Stochastic Bounds for Switched Bernoulli Batch arrivals observed through measurements. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. 24th International Conference ASMTA, 2017.
• Compromis entre énergie et performance dans le cloud. K. Kandi, F. Aït-Salaht, H. Castel-Taleb et E. Hyon. Rencontres Francophones Cores, 2017.
• Calcul des seuils optimaux d'une politique à hysteresis pour un modèle de cloud.K. Kandi, F. Aït-Salaht, H. Castel-Taleb et E. Hyon. 18ème Congrès ROADEF, 2017.

2016

• Performance analysis of a queue by combining stochastic bounds, real traffic traces and histograms. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. The Computer Journal. DOI 10.1093/comjnl/bxw032, 2016.
• Bounding aggregations on phase-type arrivals for performance analysis of cloud. Farah Ait Salaht, Hind Castel-Taleb. The IEEE Computer Society's MASCOTS 2016 Proceeding, September 2016.
• Stochastic Bounds and Histograms for Active Queues Management and Networks Analysis. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. The 23rd International Conference on Analytical & Stochastic Modelling Techniques & Applications (ASMTA) Proceeding, August 2016.
• Stochastic bounds on performance of finite capacity queues in tandem. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. European Conference on Queueing Theory, July 2016.
• Performance analysis of clouds with phase-type arrivals. Farah Ait Salaht and Hind Castel-Taleb. 1ères Rencontres Francophones sur la Conception de Protocoles, l'Evaluation de Performance et l'Expérimentation des Réseaux de Communication (CoRes 2016), May 2016, Bayonne, France.
• Politique optimale d'activation et désactivation des serveurs dans un modèle de cloud computing. Farah Ait Salaht, Emmanuel Hyon et Hind Castel-Taleb. 17ème Conférence ROADEF, February 2016, Compiègne, France.
• Bornes stochastiques sur les mesures de performance pour des réseaux de files d'attente en tandem. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. 11ème Atelier en Evaluation de Performances, March 2016.

2015

• Bounding aggregations on bulk arrivals for performance analysis of clouds. Farah Ait Salaht and Hind Castel-Taleb. IEEE Trans. ACS/IEEE International Conference on Computer Systems and Applications (AICCSA), November 2015.
• Stochastic Bounding Models for Performance Analysis of Clouds. Farah Ait Salaht and Hind Castel-Taleb. Computer and Information Technology (CIT/IUCC/DASC/PICom), pages 603-610, October 2015.
• The threshold based queueing system with hysteresis for performance analysis of clouds. Farah Ait Salaht and Hind Castel-Taleb. Computer, Information and Telecommunication Systems (CITS), pages 1-5, June 2015.
• Smoothing the input process in a batch queue. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Thierry Mautor and Nihal Pekergin. 30th International Symposium on Computer and Information Sciences (ISCIS), pages 223-232, September 2015.

2014

• Chaînes de Markov Incomplètement spécifiées : analyse par comparaison stochastique et application à l'évaluation de performance des réseaux. Farah Ait Salaht. PhD thesis Université de Versailles St-Quentin, October 2014.
• Approche par bornes stochastiques et histogrammes pour l'analyse de performance des réseaux. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. 10ème Atelier en Evaluation de Performances (AEP), June 2014.
• Bornes sur les histogrammes et équation de Loynes pour l'analyse rapide d'une file FIFO. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. 15ème Congrès ROADEF, February 2014.

2013

• A Bounding Histogram Approach for Network Performance Analysis. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. High Performance Computing and Communications (HPCC 2013), pages 458-465, Zhangjiajie, China, November 2013. Best paper award.
• Modeling networks and active queues management with stochastic bounds and histograms. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. 7th International Workshop on Verification and Evaluation of Computer and Communication Systems (VeCoS 2013), Florence, Ital, November 2013.
• Computing bounds of the MTTF for a set of Markov Chains. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. 28th International Symposium on Computer and Information Sciences (ISCIS 2013), pages pp 67-76, Paris, France, October 2013.
• Stochastic Bounds and Histograms for Network Performance Analysis. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. 10th European Performance Engineering Workshop (EPEW 2013), pages 13-27, Venice, Italy, September 2013.
• Une approche combinant bornes stochastiques, traces et histogrammes pour l'analyse de performance des réseaux. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. Journal Européen des Système Automatisés, Modélisation des Systèmes Réactifs (MSR 2013), 47(1-3):165-179, May 2013.

2012

• Accuracy vs. Complexity : the stochastic bound approach.Accuracy vs. Complexity : the stochastic bound approach.. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. In Proceedings of the 11th International Workshop on Disrete Event Systems (WODES 2012), pages 343-348, Guadalajara, Mexico, October 2012.
• Computing entry-wise bounds of the steady-state distribution of a set of Markov Chains. Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. In Proceedings of the 27th International Symposium on Computer and Information Sciences (ISCIS 2012), pages 115-122, Paris, France, October 2012.