Abstract
In this paper, abstractions for describing resource requests and physical resources of data centers are chosen. A mathematical model of a data center is developed; this model provides an opportunity for describing a wide class of data center architectures. In terms of this model, a mathematical formulation of the resource allocation problem is given that admits migration of virtual machines and replication of data storage elements. Resource allocation algorithms for data centers with a unified scheduler for all types of resources, algorithms for data centers with specific schedulers for each type of resources, and similar algorithms from the OpenStack platform are compared; the comparison results are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Pepple, Deploying OpenStack (O’Reilly, Sebastopol, 2011).
A. Amies, H. Sluiman, Q. G. Tong, et al., Developing and Hosting Applications on the Cloud (IBM Press, Boston, 2012).
B. Urgaonkar, A. L. Rosenberg, and P. Shenoy, “Application placement on a cluster of servers,” Int. J. Foundations Comput. Sci. 18, 1023–1041 (2007).
D. Bein, W. Bein, and S. Venigella, “Cloud storage and online bin packing,” in Proc. of the 5th Int. Symp. on Intelligent Distributed Computing (IDC, Delft, 2011), pp. 63–68.
S. Nagendram, J. V. Lakshmi, D. V. Rao, et al., “Efficient resource scheduling in data centers using MRIS,” Indian J. Comput. Sci. Eng. 2 (2011).
E. Arzuaga and D. R. Kaeli, “Quantifying load imbalance on virtualized enterprise servers,” in Proc. of the First Joint WOSP/SIPEW Int. Conf. on Performance Engineering. San Josa, Calif.: ACM, 235–242 (2010).
M. Mishra and A. Sahoo, “On theory of VM placement: Anomalies in existing methodologies and their mitigation using a novel vector based approach,” in IEEE Int. Conf. on Cloud Computing (CLOUD) (IEEE Press, Washington, DC, 2011).
J. F. Botero, X. Hesselbach, A. Fischer, et al., “Optimal mapping of virtual networks with hidden hops,” Telecommun. Syst. 51, 273–282 (2012).
M. Yu, Y. Yi, J. Rexford, et al., “Rethinking virtual network embedding: Substrate support for path splitting and migration,” ACM SIGCOMM Comput. Commun. Rev. 38(2), 17–29 (2008).
J. Lischka and H. Karl, “A virtual network mapping algorithm based on subgraph isomorphism detection,” in Proc. of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures, Barcelona, 2009, pp. 81–88.
Y. Zhu and M. H. Ammar, “Algorithms for assigning substrate network resources to virtual network components,” in 25th Int. Conf. on Computer Communications (INFOCOM), Barcelona, 2006, pp. 1–12.
N. M. M. K. Chowdhury, M. R. Rahman, and R. Boutaba, “Virtual network embedding with coordinated node and link mapping,” in 28th Int. Conf. on Computer Communications (INFOCOM), Barcelona, 2009, pp. 783–791.
X. Cheng, S. Sen, Z. Zhongbao, et al., “Virtual network embedding through topology-aware node ranking,” ACM SIGCOMM Comput. Commun. Rev. 41(2), 38–47 (2011).
M. Korupolu, A. Singh, and B. Bamba, “Coupled placement in modern data centers,” in IEEE Int. Symp. on Parallel & Distributed Processing (IPDPS, New York, 2009), pp. 1–12.
A. Singh, M. Korupolu, and D. Mohapatra, “Server-storage virtualization: Integration and load balancing in data centers,” in Proc. of the ACM/IEEE Conf. on Supercomputing, 2008, (IEEE Press, Austin, 2008), pp. 1–12.
J. W. Jiang, L. Tian, H. Sangtae, et al., Joint VM Placement and Routing for Data Center Traffic Engineering,” in 31st Int. Conf. on Computer Communications (INFOCOM), Orlando, 2012, pp. 2876–2880.
M. Al-Fares, A. Loukissas, and A. A. Vahdat, “Commodity data center network architecture,” ACM SIGCOMM Comput. Commun. Rev. 38(4), 63–74 (2008).
P. M. Vdovin, I. A. Zotov, V. A. Kostenko, et al., “Data center resource allocation problem and approaches to its solution,” in VII Moscow Int. Conf. on Operations Research (ORM2013) (Vychisl. Tsentr Ross. Akad. Nauk, Moscow, 2013), Vol. 2, pp. 30–32.
D. Eppstein, “Finding the k shortest paths,” SIAM J. Comput. 28, 652–673 (2006).
V. A. Kostenko and A. V. Plakunov, “An algorithm for constructing single machine schedules based on ant colony approach,” J. Comput. Syst. Sci. Int. 52, 928–937 (2013).
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, New Jersey, 1993).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © P.M. Vdovin, I.A. Zotov, V.A. Kostenko, A.V. Plakunov, R.L. Smelyanskiy, 2014, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2014, No. 5, pp. 71–83.
Rights and permissions
About this article
Cite this article
Vdovin, P.M., Zotov, I.A., Kostenko, V.A. et al. Comparing various approaches to resource allocation in data centers. J. Comput. Syst. Sci. Int. 53, 689–701 (2014). https://doi.org/10.1134/S1064230714040145
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230714040145