IJITCS Vol. 18, No. 3, 8 Jun. 2026
Cover page and Table of Contents: PDF (size: 937KB)
PDF (937KB), PP.28-44
Views: 0 Downloads: 0
Data Center (DC), Response Time, Optimization, PSO, Energy, Cost
Most of the existing data center allocation mechanisms contribute either user centric or service provider centric not for both ends but in reality, both have different objectives. For example, the objective of a user is minimization of cost, response time as well as processing time whereas the objective of service provider is to maximize the profit and processing time and minimization of response time, bandwidth, energy consumption and computing overhead with subject to effective resource utilization and load balancing. To address this challenge, this paper introduces a Cost Denigration-Based Data Center Allocation Policy (CD-BDAP) utilizing Particle Swarm Optimization (PSO), which simultaneously considers economic cost, response time, and energy consumption in the selection of data centers. In contrast to conventional PSO-based broker policies, CD-BDAP integrates a workload similarity-aware allocation strategy by calculating a dissimilarity index among user requests, thereby facilitating enhanced consolidation and energy efficiency. A weighted objective function is developed to balance user-centric metrics (cost and response time) with provider-centric metrics (profit and energy consumption), explicitly capturing their trade-offs. The proposed mechanism is assessed utilizing CloudAnalyst, which is constructed on CloudSim. The experimental results indicate that CD-BDAP achieves a reduction in VM cost, a decrease in response time, and an enhancement in energy efficiency, while simultaneously increasing the overall profit for service providers. The findings suggest that the integration of energy-aware cost modeling and workload similarity into PSO-based allocation can enhance both economic and performance efficiency in the selection of cloud data centers. The outcomes of CD-BDAP are compared with the existing PSO-based mechanisms and found enhanced performance.
Subash Chandra Tripathy, Suvendu Chandan Nayak, Rekah Sahu, "Cost Denigration Based Data Center Allocation Policy Using Modified Parallel PSO Optimization Technique for Multi-cloud Framework", International Journal of Information Technology and Computer Science(IJITCS), Vol.18, No.3, pp.28-44, 2026. DOI:10.5815/ijitcs.2026.03.03
[1]J. Son, A. V. Dastjerdi, R. N. Calheiros, and R. Buyya, “SLA-Aware and energy-efficient dynamic overbooking in SDN-based cloud data centers,” IEEE Trans. Sustain. Comput., vol. 2, no. 2, pp. 76–89, 2017.
[2]S. Zou, W. Ji, and J. Huang, “BTP: automatic identification and prediction of tasks in data center networks,” J. Cloud Comput., vol. 11, no. 1, pp. 36-54, 2022.
[3]A. Mulahuwaish, S. Korbel, and B. Qolomany, “Improving datacenter utilization through containerized service-based architecture,” J. Cloud Comput., vol. 11, no. 1, pp. 44-61, 2022.
[4]Tripathy, Niva, Sampa Sahoo, Suvendu Chandan Nayak, and Cheng-Chi Lee. "An efficient task offloading approach to reduce energy consumption in fog architecture." Computers and Electrical Engineering 128, pp. 1-18, 2025.
[5]Z. Zhou, J. Chang, Z. Hu, J. Yu, and F. Li, “A modified PSO algorithm for task scheduling optimization in cloud computing,” Concurr. Comput. , vol. 30, no. 24, pp. 1–11, 2018.
[6]Nayak, Suvendu Chandan, and Chitaranjan Tripathy. "Deadline based task scheduling using multi-criteria decision-making in cloud environment." Ain Shams Engineering Journal 9, no. 4, pp 3315-3324, 2018.
[7]E. Pacini, C. Mateos, and C. García Garino, “Distributed job scheduling based on Swarm Intelligence: A survey,” Comput. Electr. Eng., vol. 40, no. 1, pp. 252–269, 2014.
[8]D. Chaudhary and B. Kumar, “A New Balanced Particle Swarm Optimisation for Load Scheduling in Cloud Computing,” J. Inf. Knowl. Manag., vol. 17, no. 1, pp. 1-14, 2018.
[9]A. Ullah, N. M. Nawi, and S. Ouhame, Recent advancement in VM task allocation system for cloud computing: review from 2015 to2021, vol. 55, no. 3., Springer Netherlands, Pp. 426-447, 2022.
[10]Nayak, Suvendu Chandan, and Chitaranjan Tripathy. "Deadline sensitive lease scheduling in cloud computing environment using AHP." Journal of King Saud University-Computer and Information Sciences 30, no. 2, pp 152-163, 2018.
[11]Bhoi, Ashok Kumar, Manas Ranjan Kabat, Suvendu Chandan Nayak, and Gopinath Palai. "Renewable energy source based quality of service (QoS)-aware routing mechanism in cloud network." Wireless Networks 28, no. 4, pp. 1703-1718, 2022.
[12]S. H. H. Madni, M. S. A. Latiff, Y. Coulibaly, and S. M. Abdulhamid, “Recent advancements in resource allocation techniques for cloud computing environment: a systematic review,” Cluster Comput., vol. 20, no. 3, pp. 2489–2533, 2017.
[13]A. Kaur, P. Singh, R. Singh Batth, and C. Peng Lim, “Deep-Q learning-based heterogeneous earliest finish time scheduling algorithm for scientific workflows in cloud,” Softw. - Pract. Exp., no. December 2019, pp. 1–21, 2020.
[14]M. H. Kim, J. Y. Lee, S. A. Raza Shah, T. H. Kim, and S. Y. Noh, “Min-max exclusive virtual machine placement in cloud computing for scientific data environment,” J. Cloud Comput., vol. 10, no. 1, 2021.
[15]İ. Çağlar and D. T. Altılar, “Look-ahead energy efficient VM allocation approach for data centers,” J. Cloud Comput., vol. 11, no. 1, 2022.
[16]S. B. Suchintan Mishra, Arun Kumar Sangaiah,Manmath Narayan Sahoo, “Pareto‑optimal cost optimization for large scale cloud systems using joint allocation of resources,” J Ambient Intell Hum. Comput, 2019.
[17]L. Chen, Y. Guo, and X. Li, “Human Centered Computing - Second International Conference, {HCC} 2016, Colombo, Sri Lanka, January 7-9, 2016, Revised Selected Papers,” vol. 9567, pp. 34–46, 2016.
[18]S. Gharehpasha, M. Masdari, and A. Jafarian, Virtual machine placement in cloud data centers using a hybrid multi-verse optimization algorithm, vol. 54, no. 3. Springer Netherlands, 2021.
[19]X. Zeng, S. K. Garg, Z. Wen, P. Strazdins, A. Y. Zomaya, and R. Ranjan, “Cost efficient scheduling of MapReduce applications on public clouds,” J. Comput. Sci., vol. 26, pp. 375–388, 2018.
[20]A. Xu, Y. Yang, Z. Mi, and Z. Xiong, “Task scheduling algorithm based on PSO in cloud environment,” Proc. - 2015 IEEE 12th Int. Conf. Ubiquitous Intell. Comput. 2015 IEEE 12th Int. Conf. Adv. Trust. Comput. 2015 IEEE 15th Int. Conf. Scalable Comput. Commun. 20, pp. 1055–1061, 2016.
[21]J. Meshkati and F. Safi-Esfahani, “Energy-aware resource utilization based on particle swarm optimization and artificial bee colony algorithms in cloud computing,” J. Supercomput., vol. 75, no. 5, pp. 2455–2496, 2019.
[22]S. Mishra, M. N. Sahoo, A. Kumar Sangaiah, and S. Bakshi, “Nature-inspired cost optimisation for enterprise cloud systems using joint allocation of resources,” Enterp. Inf. Syst., no. 0123456789, 2019.
[23]J. P. B. Mapetu, Z. Chen, and L. Kong, “Low-time complexity and low-cost binary particle swarm optimization algorithm for task scheduling and load balancing in cloud computing,” Appl. Intell., vol. 49, no. 9, pp. 3308–3330, 2019.
[24]M. Abd Elaziz and I. Attiya, An improved Henry gas solubility optimization algorithm for task scheduling in cloud computing, vol. 54, no. 5. Springer Netherlands, 2021.
[25]J. Venkata Krishna, G. Apparao Naidu, and N. Upadhayaya, “A Lion-Whale optimization-based migration of virtual machines for data centers in cloud computing,” Int. J. Commun. Syst., vol. 31, no. 8, pp. 1–18, 2018.
[26]S. P. Praveen, K. T. Rao, and B. Janakiramaiah, “Effective Allocation of Resources and Task Scheduling in Cloud Environment using Social Group Optimization,” Arab. J. Sci. Eng., vol. 43, no. 8, pp. 4265–4272, 2018.
[27]H. M. Alkhashai and F. A. Omara, “An enhanced task scheduling algorithm on cloud computing environment,” Int. J. Grid Distrib. Comput., vol. 9, no. 7, pp. 91–100, 2016.
[28]A. Al-maamari and F. A. Omara, “Task Scheduling Using PSO Algorithm in Cloud Computing Environments,” Int. J. Grid Distrib. Comput., vol. 8, no. 5, pp. 245–256, 2015.
[29]I. Casas, J. Taheri, R. Ranjan, L. Wang, and A. Y. Zomaya, “GA-ETI: An enhanced genetic algorithm for the scheduling of scientific workflows in cloud environments,” J. Comput. Sci., vol. 26, pp. 318–331, 2018.
[30]A. M. Manasrah, T. Smadi, and A. ALmomani, “A Variable Service Broker Routing Policy for data center selection in cloud analyst,” J. King Saud Univ. - Comput. Inf. Sci., vol. 29, no. 3, pp. 365–377, 2017.
[31]A. S. A. Beegom and M. S. Rajasree, “Integer-PSO: a discrete PSO algorithm for task scheduling in cloud computing systems,” Evol. Intell., vol. 12, no. 2, pp. 227–239, 2019.
[32]C.-H. Lien, M. F. Liu, Y.-W. Bai, C. H. Lin, and M.-B. Lin, “Measurement by the Software Design for the Power Consumption of Streaming Media Servers,” no. May 2006, pp. 1597–1602, 2007.
[33]Bhoi, Ashok Kumar, Manas Ranjan Kabat, Suvendu Chandan Nayak, and Gopinath Palai. "Energy efficient task allocation and consolidation in multicast cloud network." Wireless Networks 28, no. 8, pp. 3349-3366, 2022.
[34]G. Zhao, “Cost-Aware Scheduling Algorithm Based on PSO in Cloud Computing Environment,” Int. J. Grid Distrib. Comput., vol. 7, no. 1, pp. 33–42, 2014.
[35]S. gaelle Mohamod, Kasim, “Council for Innovative Research,” J. Adv. Chem., vol. 10, no. 1, pp. 2146–2161, 2014.
[36]S. N. Sivanandam and P. Visalakshi, “Dynamic task scheduling with load balancing using parallel orthogonal particle swarm optimization,” Int. J. Bio-Inspired Comput., vol. 1, no. 4, pp. 276–286, 2009.
[37]S. Zhan and H. Huo, “Improved PSO-based task scheduling algorithm in cloud computing,” J. Inf. Comput. Sci., vol. 9, no. 13, pp. 3821–3829, 2012.
[38]A. June, “Research Paper on Optimized Utilization of Resources Using PSO and Improved Particle Swarm Optimization ( IPSO ) Algorithms in Cloud Computing,” vol. 2, no. 2, pp. 499–505, 2014.
[39]J. JU, W. BAO, Z. WANG, Y. WANG, and W. LI, “Research for the Task Scheduling Algorithm Optimization based on Hybrid PSO and ACO for Cloud Computing,” Int. J. Grid Distrib. Comput., vol. 7, no. 5, pp. 87–96, 2014.
[40]I. Casas, J. Taheri, R. Ranjan, and A. Y. Zomaya, “PSO-DS: a scheduling engine for scientific workflow managers,” J. Supercomput., vol. 73, no. 9, pp. 3924–3947, 2017.