Open Access Open Access  Restricted Access Subscription or Fee Access

Dynamic Resource Allocation in Large Cloud Environments using Gossip Protocol

J. Jayasakthi, Dr.S. Thirunirai Senthil

Abstract


Cloud computing is a term, which involves virtualization, distributed computing, networking, software and web services. A cloud consists of several elements such as clients, datacenter and distributed servers. It includes fault tolerance, high availability, scalability, flexibility, reduced overhead for users, reduced cost of ownership, on demand services etc. Gossip Protocol is effective protocol for the dynamic load balance in the distributed system and continuously execute process input & output process. Gossip protocol ensures fair resource allocation among sites/applications; it dynamically adapts the allocation to load changes and scales both in the number of physical machines and sites/applications. Gossip protocol avoids the resource allocation problem as that of dynamically maximizing the cloud utility under CPU and memory constraints. 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.

Keywords


Cloud Computing, Resource Allocation, Gossip Protocols, Distributed Management.

Full Text:

PDF

References


M. Jelasity, A. Montresor, and O. Babaoglu, “Gossip-based aggregationin large dynamic networks,” ACM Trans. Computer Syst., vol. 23, no. 3, pp. 219–252, 2005.

M. Jelasity, A. Montresor, and O. Babaoglu, “T-Man: gossip-based fast overlay topology construction,” Computer Networks, vol. 53, no. 13, pp. 2321–2339, 2009.

F. Wuhib, R. Stadler, and M. Spreitzer, “Gossip-based resource management for cloud environments,” in 2010 International Conference on Network and Service Management.

F. Wuhib, M. Dam, R. Stadler, and A. Clem, “Robust monitoring of network-wide aggregates through gossiping,” IEEE Trans. Network and Service Management, vol. 6, no. 2, pp. 95–109, June 2009.

F. Wuhib, M. Dam, and R. Stadler, “A gossiping protocol for detecting global threshold crossings,” IEEE Trans. Network and Service Management, vol. 7, no. 1, pp. 42–57, Mar. 2010.

R. Yanggratoke, F. Wuhib, and R. Stadler, “Gossip-based resource allocation for green computing in large clouds,” in 2011 International Conference on Network and Service Management.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.