An Efficient Cloud Data Center Allocation to the Source of Requests
Open Access
- 1 July 2020
- journal article
- research article
- Published by IGI Global in Journal of Organizational and End User Computing
- Vol. 32 (3), 23-36
- https://doi.org/10.4018/joeuc.2020070103
Abstract
A Cloud data center is a network of virtualized resources, namely virtualized servers. They provision on-demand services to the source of requests ranging from virtual machines to virtualized storage and virtualized networks. The cloud data center service requests can come from different sources across the world. It is desirable for enhancing Quality of Service (QoS), which is otherwise known as a service level agreement (SLA), an agreement between cloud service requester and cloud service consumer on QoS, to allocate the cloud data center closest to the source of requests. This article models a Cloud data center network as a graph and proposes an algorithm, modified Breadth First Search where the source of requests assigned to the Cloud data centers based on a cost threshold, which limits the distance between them. Limiting the distance between Cloud data centers and the source of requests leads to faster service provisioning. The proposed algorithm is tested for various graph instances and is compared with modified Voronoi and modified graph-based K-Means algorithms that they assign source of requests to the cloud data centers without limiting the distance between them. The proposed algorithm outperforms two other algorithms in terms of average time taken to allocate the cloud data center to the source of requests, average cost and load distribution.Keywords
This publication has 16 references indexed in Scilit:
- A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modelingTransportation Research. Part E, Logistics and Transportation Review, 2014
- Heuristics for migration with consolidation of ensembles of Virtual MachinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Stratus: Load Balancing the Cloud for Carbon Emissions ControlIEEE Transactions on Cloud Computing, 2013
- Graph based k-means clusteringSignal Processing, 2012
- A Greedy Heuristic and Its Variants for Minimum Capacitated Dominating SetCommunications in Computer and Information Science, 2012
- Discrete Partitioning and Coverage Control for Gossiping RobotsIEEE Transactions on Robotics, 2011
- Multiple criteria facility location problems: A surveyApplied Mathematical Modelling, 2010
- Facility Location with Dynamic Distance FunctionsJournal of Combinatorial Optimization, 1998
- How to Allocate Network CentersJournal of Algorithms, 1993
- Graph Theory with ApplicationsPublished by Springer Science and Business Media LLC ,1976