Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/6824
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Martin, J.P. | |
dc.contributor.author | Kandasamy, A. | |
dc.contributor.author | Chandrasekaran, K. | |
dc.date.accessioned | 2020-03-30T09:46:12Z | - |
dc.date.available | 2020-03-30T09:46:12Z | - |
dc.date.issued | 2018 | |
dc.identifier.citation | Advances in Intelligent Systems and Computing, 2018, Vol.667, , pp.61-73 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/6824 | - |
dc.description.abstract | Cloud computing is one of the most sought-after technologies today. Beyond a shadow of doubt, the number of clients opting for Cloud is increasing. This steers the complexity of the management of the Cloud computing environment. In order to serve the demands of customers, Cloud providers are resorting to more resources. Relying on a single managing element to coordinate the entire pool of resources is no more an efficient solution. Therefore, we propose to use a hierarchical approach for autonomic management. The problem that we consider here is to determine the nodes at which we have to place the Autonomic Managers (AMs), in order to ease the management process and minimize the cost of communication between the AMs. We propose a graph-theory-based model using Connected Dominating Set (CDS) that allows to determine an effective placement of AMs in different Data Centers (DCs), and, their collaboration with the Global Manager (GM). The approach considers the construction of domination sets and then, distributing the control of the dominees among the dominators. � 2018, Springer Nature Singapore Pte Ltd. | en_US |
dc.title | Toward efficient autonomic management of clouds: A CDS-based hierarchical approach | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.