A Gossip Protocol for Dynamic ResourceManagement in Large Cloud Environments
2012 (English)In: IEEE Transactions on Network and Service Management, ISSN 1932-4537, Vol. 9, no 2, 213-225 p.Article in journal, Editorial material (Refereed) Published
We address the problem of dynamic resource management for a large-scale cloud environment. Our contribution includes outlining a distributed middleware architecture and presenting one of its key elements: a gossip protocol that (1) ensures fair resource allocation among sites/applications, (2) dynamically adapts the allocation to load changes and (3) scales both in the number of physical machines and sites/applications. We formalize the resource allocation problem as that of dynamically maximizing the cloud utility under CPU and memory constraints. We first present a protocol that computes an optimalsolution without considering memory constraints and prove correctness and convergence properties. Then, we extend that protocol to provide an efficient heuristic solution for the complete problem, which includes minimizing the cost for adapting an allocation. The protocol continuously executes on dynamic, local input and does not require global synchronization, as other proposed gossip protocols do. We evaluate the heuristic protocol through simulation and find its performance to be well-aligned with our design goals.
Place, publisher, year, edition, pages
IEEE Communications Society, 2012. Vol. 9, no 2, 213-225 p.
cloud computing, distributed management, resource allocation, gossip protocols
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-94129DOI: 10.1109/TNSM.2012.031512.110176ScopusID: 2-s2.0-84862121652OAI: oai:DiVA.org:kth-94129DiVA: diva2:525386
FunderICT - The Next Generation
© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
QC 201206112012-06-112012-05-072013-04-11Bibliographically approved