Maximum elastic scheduling of virtual machines in general graph cloud data center networks

被引：0
作者：
Qwareeq Y. [1 ]
Sawwan A. [1 ]
Wu J. [1 ]
机构：
[1] Center for Networked Computing, Science Education and Research Center (SERC), Temple University, Philadelphia, PA
来源：
Cyber-Physical Systems | 2024年 / 10卷 / 03期
基金：
美国国家科学基金会;
关键词：
Cloud; data centre networks (DCNs); elasticity; maximum flow; optimisation;
D O I：
10.1080/23335777.2023.2301106
中图分类号：
学科分类号：
摘要：
In this research, we pioneer a novel method to evaluate the maximum admissible load (MAL) for virtual machines (VMs) in physical machines (PMs) in data centre networks (DCNs), without restricting DCN topologies. This unique approach simplifies the issue into a single-source, multiple-sink maximum flow problem. It also resolves the maximum elastic scheduling problem by determining the optimal load for consistent growth without reassigning tasks. An effective strategy for these challenges is introduced and validated through extensive simulations. © 2024 Informa UK Limited, trading as Taylor & Francis Group.
引用
收藏
页码：283 / 301
页数：18
相关论文
共 29 条
  • [1] A Mann Z., Allocation of virtual machines in cloud data centers—a survey of problem models and optimization algorithms, ACM Comput Surveys, 48, 1, pp. 1-34, (2015)
  • [2] Saif M.A.N., Niranjan S., Al-Ariki H.D.E., Efficient autonomic and elastic resource management techniques in cloud environment: taxonomy and analysis, Wireless Networks, 27, 4, pp. 2829-2866, (2021)
  • [3] Wu J., Lu S., Zheng H., On maximum elastic scheduling of virtual machines for cloud-based data center networks, 2018 IEEE International Conference on Communications (ICC), pp. 1-6, (2018)
  • [4] Li K., Wu J., Blaisse A., Elasticity-aware virtual machine placement for cloud datacenters, 2013 IEEE 2nd International Conference on Cloud Networking (CloudNet), pp. 99-107, (2013)
  • [5] Duffield N.G., Goyal P., Greenberg A., Et al., A flexible model for resource management in virtual private networks, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 95-108, (1999)
  • [6] Kumar A., Rastogi R., Silberschatz A., Et al., Algorithms for provisioning virtual private networks in the hose model, IEEE/ACM Trans Networking, 10, 4, pp. 565-578, (2002)
  • [7] Lacki J., Nussbaum Y., Sankowski P., Et al., Single source–all sinks max flows in planar digraphs, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 599-608, (2012)
  • [8] Ford L.R., Fulkerson D.R., Flows in networks, Flows in networks, (2015)
  • [9] Dinic E., Algorithm for solution of a problem of maximum flow in a network with power estimation, Soviet Math Doll, 11, 5, pp. 1277-1280, (1970)
  • [10] Edmonds J., Karp R.M., Theoretical improvements in algorithmic efficiency for network flow problems, J ACM, 19, 2, pp. 248-264, (1972)
123