Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Operational cost minimization of distributed data centers through the provision of fair request rate allocations while meeting different user SLAs

dc.contributor.authorXu, Zichuan
dc.contributor.authorLiang, Weifa
dc.date.accessioned2015-05-25T05:08:06Z
dc.date.available2015-05-25T05:08:06Z
dc.date.issued2015-03-06
dc.date.updated2015-12-10T11:08:55Z
dc.description.abstractData centers as computing infrastructures for cloud services have been growing in both number and scale. However, they usually consume enormous amounts of electricity that incur high operational costs of cloud service providers. Minimizing these operational costs thus becomes one main challenge in cloud computing. In this paper, we study the operational cost minimization problem in a distributed cloud computing environment that not only considers fair request rate allocations among web portals but also meets various Service Level Agreements (SLAs) between users and the cloud service provider, with an objective to maximize the number of user requests admitted while keeping the operational cost minimized, by exploiting the electricity diversity. To this end, we first propose an adaptive operational cost optimization framework that incorporates time-varying electricity prices and dynamic user request rates. We then devise a fast approximation algorithm with a provable approximation ratio for the problem, by utilizing network flow techniques. Finally, we evaluate the performance of the proposed algorithm through experimental simulations, using real-life electricity price data sets. Experimental results demonstrate that the proposed algorithm is very promising, and the solution obtained is nearly optimal.
dc.identifier.issn1389-1286en_AU
dc.identifier.urihttp://hdl.handle.net/1885/13580
dc.publisherElsevier
dc.rights© 2015 Elsevier B.V.
dc.sourceComputer Networks
dc.subjectOperational cost minimization
dc.subjectFair request rate allocation
dc.subjectService Level Agreements
dc.subjectDistributed data centers
dc.subjectElectricity price diversity
dc.subjectApproximation algorithm
dc.titleOperational cost minimization of distributed data centers through the provision of fair request rate allocations while meeting different user SLAs
dc.typeJournal article
dcterms.dateAccepted2015-02-16
local.bibliographicCitation.lastpage75
local.bibliographicCitation.startpage59
local.contributor.affiliationXu, Z., Research School of Computer Science, The Australian National Universityen_AU
local.contributor.affiliationLiang, W., Research School of Computer Science, The Australian National Universityen_AU
local.contributor.authoruidu4990040en_AU
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.absfor080503 - Networking and Communications
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationa383154xPUB1670
local.identifier.citationvolume83
local.identifier.doi10.1016/j.comnet.2015.02.028en_AU
local.identifier.scopusID2-s2.0-84925400866
local.publisher.urlhttp://www.elsevier.com/en_AU
local.type.statusPublished Versionen_AU

Downloads

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
884 B
Format:
Item-specific license agreed upon to submission
Description:
abcd