Aucune description disponible pour cet axe de recherche.
Description
Membres
Publications
-
2025Ahmed Yosreddin Samti, Ines Ben Jaafar, Issam Nouaouri, Patrick Hirsh
A Novel NSGA-III-GKM++ Framework for Multi-Objective Cloud Resource Brokerage Optimization
June 2025 Mathematics 13(13):2042, 2025
Résumé
Cloud resource brokerage is a fundamental challenge in cloud computing, requiring the efficient selection and allocation of services from multiple providers to optimize performance, sustainability, and cost-effectiveness. Traditional approaches often struggle with balancing conflicting objectives, such as minimizing the response time, reducing energy consumption, and maximizing broker profits. This paper presents NSGA-III-GKM++, an advanced multi-objective optimization model that integrates the NSGA-III evolutionary algorithm with an enhanced K-means++ clustering technique to improve the convergence speed, solution diversity, and computational efficiency. The proposed framework is extensively evaluated using Deb–Thiele–Laumanns–Zitzler (DTLZ) and Unconstrained Function (UF) benchmark problems and real-world cloud brokerage scenarios. Comparative analysis against NSGA-II, MOPSO, and NSGA-III-GKM demonstrates the superiority of NSGA-III-GKM++ in achieving high-quality tradeoffs between performance and cost. The results indicate a 20% reduction in the response time, 15% lower energy consumption, and a 25% increase in the broker’s profit, validating its effectiveness in real-world deployments. Statistical significance tests further confirm the robustness of the proposed model, particularly in terms of hypervolume and Inverted Generational Distance (IGD) metrics. By leveraging intelligent clustering and evolutionary computation, NSGA-III-GKM++ serves as a powerful decision support tool for cloud brokerage, facilitating optimal service selection while ensuring sustainability and economic feasibility.
-
2023Mouna Karaja, Abir Chaabani, Ameni Azzouz, Lamjed Ben Said
Dynamic bag-of-tasks scheduling problem in a heterogeneous multi-cloud environment: a taxonomy and a new bi-level multi-follower modeling
Journal of Supercomputing,1-38,, 2023
Résumé
Since more and more organizations deploy their applications through the cloud, an increasing demand for using inter-cloud solutions is noticed. Such demands could inherently result in overutilization of resources, which leads to resource starvation that is vital for time-intensive and life-critical applications. In this paper, we are interested in the scheduling problem in such environments. On the one hand, a new taxonomy of criteria to classify task scheduling problems and resolution approaches in inter-cloud environments is introduced. On the other hand, a bi-level multi-follower model is proposed to solve the budget-constrained dynamic Bag-of-Tasks (BoT) scheduling problem in heterogeneous multi-cloud environments. In the proposed model, the upper-level decision maker aims to minimize the BoT’ makespan under budget constraints. While each lower-level decision maker minimizes the completion time of tasks it received. Experimental results demonstrated the outperformance of the proposed bi-level algorithm and revealed the advantages of using a bi-level scheme with an improvement rate of 32%, 29%, and 21% in terms of makespan for the small, medium, and big size instances, respectively.
Mouna Karaja, Abir Chaabani, Ameni Azzouz, Lamjed Ben SaidDynamic bag-of-tasks scheduling problem in a heterogeneous multi-cloud environment: a taxonomy and a new bi-level multi-follower modeling
J Supercomput 79, 17716–17753 (2023), 2023
Résumé
Since more and more organizations deploy their applications through the cloud, an increasing demand for using inter-cloud solutions is noticed. Such demands could inherently result in overutilization of resources, which leads to resource starvation that is vital for time-intensive and life-critical applications. In this paper, we are interested in the scheduling problem in such environments. On the one hand, a new taxonomy of criteria to classify task scheduling problems and resolution approaches in inter-cloud environments is introduced. On the other hand, a bi-level multi-follower model is proposed to solve the budget-constrained dynamic Bag-of-Tasks (BoT) scheduling problem in heterogeneous multi-cloud environments. In the proposed model, the upper-level decision maker aims to minimize the BoT’ makespan under budget constraints. While each lower-level decision maker minimizes the completion time of tasks it received. Experimental results demonstrated the outperformance of the proposed bi-level algorithm and revealed the advantages of using a bi-level scheme with an improvement rate of 32%, 29%, and 21% in terms of makespan for the small, medium, and big size instances, respectively.
-
2022Mouna Karaja, Abir Chaabani, Ameni Azzouz, Lamjed Ben Said
Efficient bilevel multi-objective approach for budget-constrained dynamic Bag-of-Tasks scheduling problem in heterogeneous multi-cloud environment
Applied Intelligence, 1-29, 2022
Résumé
Bag-of-Tasks is a well-known model that processes big-data applications supporting embarrassingly parallel jobs with independent tasks. Scheduling Bag-of-Tasks in a dynamic multi-cloud environment is an NP-hard problem that has attracted a lot of attention in the last years. Such a problem can be modeled using a bi-level optimization framework due to its hierarchical scheme. Motivated by this issue, in this paper, an efficient bi-level multi-follower algorithm, based on hybrid metaheuristics, is proposed to solve the multi-objective budget-constrained dynamic Bag-of-Tasks scheduling problem in a heterogeneous multi-cloud environment. In our proposed model, the objective function differs depending on the scheduling level: The upper level aims to minimize the makespan of the whole Bag-of-Tasks under budget constraints; while each follower aims to minimize the makespan and the execution cost of tasks belonging to the Bag-of-Tasks. Since multiple conflicting objectives exist in the lower level, we propose an improved variant of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) called Efficient NSGA-II (E-NSGA-II), applying a recently proposed quick non-dominated sorting algorithm (QNDSA) with quasi-linear average time complexity. By performing experiments on proposed synthetic datasets, our algorithm demonstrates high performance in terms of makespan and execution cost while respecting budget constraints. Statistical analysis validates the outperformance of our proposal regarding the considering metrics.
Mouna Karaja, Abir Chaabani, Ameni Azzouz, Lamjed Ben SaidEfficient bi-level multi objective approach for budget-constrained dynamic Bag-of-Tasks scheduling problem in heterogeneous multi-cloud environment.
Appl Intell 53, 9009–9037 (2023), 2022
Résumé
Bag-of-Tasks is a well-known model that processes big-data applications supporting embarrassingly parallel jobs with independent tasks. Scheduling Bag-of-Tasks in a dynamic multi-cloud environment is an NP-hard problem that has attracted a lot of attention in the last years. Such a problem can be modeled using a bi-level optimization framework due to its hierarchical scheme. Motivated by this issue, in this paper, an efficient bi-level multi-follower algorithm, based on hybrid metaheuristics, is proposed to solve the multi-objective budget-constrained dynamic Bag-of-Tasks scheduling problem in a heterogeneous multi-cloud environment. In our proposed model, the objective function differs depending on the scheduling level: The upper level aims to minimize the makespan of the whole Bag-of-Tasks under budget constraints; while each follower aims to minimize the makespan and the execution cost of tasks belonging to the Bag-of-Tasks. Since multiple conflicting objectives exist in the lower level, we propose an improved variant of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) called Efficient NSGA-II (E-NSGA-II), applying a recently proposed quick non-dominated sorting algorithm (QNDSA) with quasi-linear average time complexity. By performing experiments on proposed synthetic datasets, our algorithm demonstrates high performance in terms of makespan and execution cost while respecting budget constraints. Statistical analysis validates the outperformance of our proposal regarding the considering metrics.
-
2021Mouna Karaja, Meriem Ennigrou, Lamjed Ben Said
Solving Dynamic Bag-of-Tasks Scheduling Problem in Heterogeneous Multi-cloud Environment Using Hybrid Bi-Level Optimization Model.
In: Abraham A., Hanne T., Castillo O., Gandhi N., Nogueira Rios T., Hong TP. (eds) Hybrid Intelligent Systems. HIS 2020. Advances in Intelligent Systems and Computing, vol 1375. Springer, Cham., 2021
Résumé
Task scheduling problem has attracted a lot of attention since it plays a key role to improve the performance of any distributed system. This is again more challenging, especially for multi-cloud computing environment, mainly based on the nature of the multi-cloud to scale dynamically and due to heterogeneity of resources which add more complexity to the scheduling problem. In this paper, we propose, for the first time, a new Hybrid Bi-level optimization model named HB-DBoTSP to solve the Dynamic Bag-of-Tasks Scheduling Problem (DBoTSP) in heterogeneous multi-cloud environment. The proposed model aims to minimize the makespan and the execution cost while taking into consideration budget constraints and guaranteeing load balancing between Cloud’s Virtual Machines. By performing experiments on synthetic data sets that we propose, we demonstrate the effectiveness of the algorithm.
-
2020Mouna Karaja, Meriem Ennigrou, Lamjed Ben Said
Budget-constrained dynamic Bag-of-Tasks scheduling algorithm for heterogeneous multi-cloud environment
2020 International Multi-Conference on: “Organization of Knowledge and Advanced Technologies” (OCTA), Tunis, Tunisia, pp. 1-6., 2020
Résumé
Cloud computing has reached huge popularity for delivering on-demand services on a pay-per-use basis over the internet. However, since the number of cloud users evolves, multi-cloud environment has been introduced where clouds are interconnected in order to satisfy customers’ requirements. Task scheduling in such environments is very challenging mainly due to the heterogeneity of resources. In this paper, a budget-constrained dynamic Bag-of-Tasks scheduling algorithm for heterogeneous multi-cloud environment is proposed. By performing experiments on synthetic data sets that we propose, we demonstrate the effectiveness of the algorithm in terms of makespan.
BibTeX
@article{karaja2023dynamic, title={Dynamic bag-of-tasks scheduling problem in a heterogeneous multi-cloud environment: a taxonomy and a new bi-level multi-follower modeling}, author={Karaja, Mouna and Chaabani, Abir and Azzouz, Ameni and Ben Said, Lamjed}, journal={The Journal of Supercomputing}, volume={79}, number={15}, pages={17716--17753}, year={2023}, publisher={Springer} }
BibTeX
@article{karaja2023efficient, title={Efficient bi-level multi objective approach for budget-constrained dynamic Bag-of-Tasks scheduling problem in heterogeneous multi-cloud environment}, author={Karaja, Mouna and Chaabani, Abir and Azzouz, Ameni and Ben Said, Lamjed}, journal={Applied Intelligence}, volume={53}, number={8}, pages={9009--9037}, year={2023}, publisher={Springer} }
BibTeX
A. Samti, I.Ben Jaafar, I.Nouaouri and P. Hirsch, A Novel NSGA-III-GKM++ Framework for Multi-Objective Cloud Resource Brokerage Optimization, Mathematics 13(13):2042, June 2025.
BibTeX
@INPROCEEDINGS{9151737,
author={Karaja, Mouna and Ennigrou, Meriem and Said, Lamjed Ben},
booktitle={2020 International Multi-Conference on: “Organization of Knowledge and Advanced Technologies” (OCTA)},
title={Budget-constrained dynamic Bag-of-Tasks scheduling algorithm for heterogeneous multi-cloud environment},
year={2020},
volume={},
number={},
pages={1-6},
keywords={Cloud computing;Task analysis;Dynamic scheduling;Bot (Internet);Scheduling algorithms;Heuristic algorithms;Bag-of-Tasks scheduling;budget-constrained;makespan;multi-cloud environment},
doi={10.1109/OCTA49274.2020.9151737}}
BibTeX
@InProceedings{10.1007/978-3-030-73050-5_17,
author= »Karaja, Mouna
and Ennigrou, Meriem
and Said, Lamjed Ben »,
editor= »Abraham, Ajith
and Hanne, Thomas
and Castillo, Oscar
and Gandhi, Niketa
and Nogueira Rios, Tatiane
and Hong, Tzung-Pei »,
title= »Solving Dynamic Bag-of-Tasks Scheduling Problem in Heterogeneous Multi-cloud Environment Using Hybrid Bi-Level Optimization Model »,
booktitle= »Hybrid Intelligent Systems »,
year= »2021″,
publisher= »Springer International Publishing »,
address= »Cham »,
pages= »171–180″,
isbn= »978-3-030-73050-5″
}
BibTeX
TY – JOUR
AU – Karaja, Mouna
AU – Chaabani, Abir
AU – Azzouz, Ameni
AU – Ben Said, Lamjed
PY – 2023
DA – 2023/04/01
TI – Efficient bi-level multi objective approach for budget-constrained dynamic Bag-of-Tasks scheduling problem in heterogeneous multi-cloud environment
JO – Applied Intelligence
SP – 9009
EP – 9037
VL – 53
IS – 8
AB – Bag-of-Tasks is a well-known model that processes big-data applications supporting embarrassingly parallel jobs with independent tasks. Scheduling Bag-of-Tasks in a dynamic multi-cloud environment is an NP-hard problem that has attracted a lot of attention in the last years. Such a problem can be modeled using a bi-level optimization framework due to its hierarchical scheme. Motivated by this issue, in this paper, an efficient bi-level multi-follower algorithm, based on hybrid metaheuristics, is proposed to solve the multi-objective budget-constrained dynamic Bag-of-Tasks scheduling problem in a heterogeneous multi-cloud environment. In our proposed model, the objective function differs depending on the scheduling level: The upper level aims to minimize the makespan of the whole Bag-of-Tasks under budget constraints; while each follower aims to minimize the makespan and the execution cost of tasks belonging to the Bag-of-Tasks. Since multiple conflicting objectives exist in the lower level, we propose an improved variant of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) called Efficient NSGA-II (E-NSGA-II), applying a recently proposed quick non-dominated sorting algorithm (QNDSA) with quasi-linear average time complexity. By performing experiments on proposed synthetic datasets, our algorithm demonstrates high performance in terms of makespan and execution cost while respecting budget constraints. Statistical analysis validates the outperformance of our proposal regarding the considering metrics.
SN – 1573-7497
UR – https://doi.org/10.1007/s10489-022-03942-1
DO – 10.1007/s10489-022-03942-1
ID – Karaja2023
ER –
BibTeX
TY – JOUR
AU – Karaja, Mouna
AU – Chaabani, Abir
AU – Azzouz, Ameni
AU – Ben Said, Lamjed
PY – 2023
DA – 2023/10/01
TI – Dynamic bag-of-tasks scheduling problem in a heterogeneous multi-cloud environment: a taxonomy and a new bi-level multi-follower modeling
JO – The Journal of Supercomputing
SP – 17716
EP – 17753
VL – 79
IS – 15
AB – Since more and more organizations deploy their applications through the cloud, an increasing demand for using inter-cloud solutions is noticed. Such demands could inherently result in overutilization of resources, which leads to resource starvation that is vital for time-intensive and life-critical applications. In this paper, we are interested in the scheduling problem in such environments. On the one hand, a new taxonomy of criteria to classify task scheduling problems and resolution approaches in inter-cloud environments is introduced. On the other hand, a bi-level multi-follower model is proposed to solve the budget-constrained dynamic Bag-of-Tasks (BoT) scheduling problem in heterogeneous multi-cloud environments. In the proposed model, the upper-level decision maker aims to minimize the BoT’ makespan under budget constraints. While each lower-level decision maker minimizes the completion time of tasks it received. Experimental results demonstrated the outperformance of the proposed bi-level algorithm and revealed the advantages of using a bi-level scheme with an improvement rate of 32%, 29%, and 21% in terms of makespan for the small, medium, and big size instances, respectively.
SN – 1573-0484
UR – https://doi.org/10.1007/s11227-023-05341-w
DO – 10.1007/s11227-023-05341-w
ID – Karaja2023
ER –