Fair resource allocation using gossip protocol and merging cloud

In this project, we give an optimal solution for resource allocation problem and an efficient heuristic for the load balancing problem. Objective is to create a decentralized system to allocate resource dynamically in cloud to avoid the demand for resources. Cloud tenant running a collection of virtual appliances that are hosted on the cloud infrastructure, with services provided to end users through the public Internet. In large-scale, dynamic, fully distributedsystems constructing and maintaining a topology is a highly non-trivial problem. In this paper we identify topology management as an abstract service, independent of application or function, and propose a gossipbased scheme called T-MAN for the construction of a large class of different topologies. The topology is defined by a ranking function which can be based on any appropriate property of components, including geographical location, semantic proximity, bandwidth, or simply on an abstract, pre-defined topology overran ID space like a ring or a torus. A gossip protocol is a style of computer-to-computer communication protocol used for easily access the data in network. Modern distributed systems often use gossip protocols to solve problems because it allocates the resource in network for user access data to avoid delay.