Bi-Objective Resource Allocation for Cloud Service Providers: A Dichotomic Approach to Pareto Optimization

[1] S. Abdi, L. PourKarimi, M. Ahmadi, and F. Zargari, Cost minimization for bag-of-tasks workflows in a federation of clouds, The Journal of Supercomputing 74 (2018), no. 6, 2801–2822. https://doi.org/10.1007/s11227-018-2322-9

[2] N. Adelgren and A. Gupte, Branch-and-bound for biobjective mixed-integer linear programming, INFORMS J. Comput. 34 (2022), no. 2, 909–933.

[3] J. Bajo, F. De la Prieta, J.M. Corchado, and S. Rodríguez, A low-level resource allocation in an agent-based cloud computing platform, Applied Soft Computing 48 (2016), 716–728. https://doi.org/10.1016/j.asoc.2016.05.056

[4] J.F. Bérubé, M. Gendreau, and J.Y. Potvin, An exact ϵ-constraint method for biobjective combinatorial optimization problems: Application to the traveling salesman problem with profits, European J. Oper. Res. 194 (2009), no. 1, 39–50.
https://doi.org/10.1016/j.ejor.2007.12.014

[5] S. Chaisiri, B.S. Lee, and D. Niyato, Optimal virtual machine placement across multiple cloud providers, 2009 IEEE Asia-Pacific Services Computing Conference (APSCC), IEEE, 2009, pp. 103–110.

[6] S. Chaisiri, B.S. Lee, and D. Niyato, Optimization of resource provisioning cost in cloud computing, IEEE
transactions on services Computing 5 (2011), no. 2, 164–177. https://doi.org/10.1109/tsc.2011.7

[7] D. Chaudhary and B. Kumar, Cost optimized hybrid genetic-gravitational search algorithm for load scheduling in cloud computing, Applied Soft Computing 83 (2019), 105627. https://doi.org/10.1016/j.asoc.2019.105627

[8] R.D.C. Coutinho, L.M. Drummond, and Y. Frota, Optimization of a cloud resource management problem from a consumer perspective, European Conference on Parallel Processing, Springer, 2013, pp. 218–227.

[9] R.D.C. Coutinho, L.M. Drummond, Y. Frota, and D. de Oliveira, Optimizing virtual machine allocation for parallel scientific workflows in federated clouds, Future Generation Computer Systems 46 (2015), 51–68. https://doi.org/10.1016/j.future.2014.10.009

[10] M. Ehrgott, Multicriteria Optimization, vol. 491, Springer Science and Business Media, 2005.

[11] P. Fouilhoux, L. L´etocart, and Y. Zhang, A generic branch-and-cut algorithm for bi-objective binary linear programs, 2024. https://doi.org/10.48550/arXiv.2410.08722

[12] T.A.L. Genez, L.F. Bittencourt, and E.R.M. Madeira, Time-discretization for speeding-up scheduling of deadline-constrained workflows in clouds, Future Generation Computer Systems 107 (2020), 1116–1129. https://doi.org/10.1016/j.future.2017.07.061

[13] M. Masdari, S.S. Nabavi, and V. Ahmadi, An overview of virtual machine placement schemes in cloud computing, Journal of Network and Computer Applications 66 (2016), 106–127. https://doi.org/10.1016/j.jnca.2016.01.011

[14] C.A. Mattson, A.A. Mullur, and A. Messac, Smart pareto filter: Obtaining a minimal representation of multiobjective design space, Eng. Optim. 36 (2004), no. 6, 721–740. https://doi.org/10.1080/0305215042000274942

[15] D.R. Morrison, S.H. Jacobson, J.J. Sauppe, and E.C. Sewell, Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning, Discrete Optim. 19 (2016), 79–102. https://doi.org/10.1016/j.disopt.2016.01.005

[16] M. Noshy, A. Ibrahim, and H.A. Ali, Optimization of live virtual machine migration in cloud computing: A survey and future directions, Journal of Network and Computer Applications 110 (2018), 1–10. https://doi.org/10.1016/j.jnca.2018.03.002

[17] O.N. Oyelade, J.O. Agushaka, and A.E. Ezugwu, Evolutionary binary feature  selection using adaptive ebola optimization search algorithm for high-dimensional datasets, Plos One 18 (2023), no. 3, e0282812.

[18] C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Courier Corporation, 1998.

[19] S.N. Parragh and F. Tricoire, Branch-and-bound for bi-objective integer programming, INFORMS J. Comput. 31 (2019), no. 4, 805–822.

[20] T.P. Pham, J.J. Durillo, and T. Fahringer, Predicting workflow task execution time in the cloud using a two-stage machine learning approach, IEEE Transactions on Cloud Computing 8 (2020), no. 1, 256–268.

[21] A. Przybylski, X. Gandibleux, and M. Ehrgott, Two phase algorithms for the bi-objective assignment problem, European J. Oper. Res. 185 (2008), no. 2, 509–533. https://doi.org/10.1016/j.ejor.2006.12.054

[22] M.J. Rosa, C.G. Ralha, M. Holanda, and A.P. Araujo, Computational resource and cost prediction service for scientific workflows in federated clouds, Future Generation Computer Systems 125 (2021), 844–858. https://doi.org/10.1016/j.future.2021.07.030

[23] A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, vol. 24, Springer, 2003.

[24] L. Sun, H. Dong, F.K. Hussain, O.K. Hussain, and E. Chang, Cloud service selection: State-of-the-art and future research directions, Journal of Network and Computer Applications 45 (2014), 134–150. https://doi.org/10.1016/j.jnca.2014.07.019

[25] Y. Tian, L. Wang, S. Yang, J. Ding, Y. Jin, and X. Zhang, Neural networkbased dimensionality reduction for large-scale binary optimization with millions of variables, IEEE Transactions on Evolutionary Computation 29 (2024), no. 6. 2328--2342.   https://doi.org/10.1109/TEVC.2024.3400398

[26] E.L. Ulungu and J. Teghem, The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems, Found. Comput. Decis. Sci. 20 (1995), no. 2, 149–165.

[27] T. Vincent, F. Seipp, S. Ruzika, A. Przybylski, and X. Gandibleux, Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case, Computers and Operations Research 40
(2013), no. 1, 498–509.  https://doi.org/10.1016/j.cor.2012.08.003

[28] M. Vis´ee, J. Teghem, M. Pirlot, and E.L. Ulungu, Two-phases method and branch and bound procedures to solve the bi–objective knapsack problem, J. Global Optim. 12 (1998), no. 2, 139–155. https://doi.org/10.1023/A:1008258310679