Dynamic Load Balancing Using Gossip Protocol Including Automated Negotiation
- 1Anna University Chennai, Final M.E CSE, Dhanalakshmi Srinivasan Engineering College, Perambalur, IN
- 2Anna University Chennai, Assistant Professor, Department of CSE, Dhanalakshmi Srinivasan Engineering College, Perambalur, IN
A decentralized design whereby the component of the middleware run on every processing node of the cloud environment. At present, if the client is requesting the service to the cloud service provider, the resource is allocated only if the requested resource currently available in it. Otherwise it must wait, hear the gossip protocol used to spread the status information from the server to the cloud tenant. But the waiting time exceeds, traffic increases and also the customer satisfaction get lost. At present the gossip protocol is used for the request forwarding and using dynamic load balancing algorithm to dynamically balance the load to treat all the machines equally and the PTN mechanisms are used to increase the customer satisfaction. Because the resource allocation is not successful without the customer satisfaction, for that tradeoff algorithm and the concession making algorithm is used. This will be efficient for the cloud providers to minimize the cost of accessing the cloud application. In the future make the resource allocations are made efficient in all kinds of bandwidth available.
Conclusion
The cloud service provider allocates the resource to the client if the client made the request through the public internet. The efficient adaptation to the load changes and scalability of the middleware of the middleware layer in terms of both the number of machines in the cloud is identified. Every cloud tenant is treated equally so that the load is distributed among all consumers.
The efficiency of resource allocation is based on customer satisfaction. PTN mechanisms are used for providing the service level agreement between the cloud service provider and the user. By providing the negotiation, the customer satisfaction gets increased.
References
- L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web caching and Zipf-like distributions: evidence and implications,” in Proc. 1999 Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 126
- G. Cybenko, “Dynamic load balancing for distributed memory multiprocessors,” J.Parallel and Distrib. Computing, vol. 7, no. 2, pp. 279–301, 1989.
- D. Carrera, M. Steinder, I. Whalley, J. Torres, and E. Ayguade, “Utility based placement of dynamic web applications with fairness goals,” in 2008 IEEE Network Operations and Management Symposium.
- Fetahi Wuhib, Rolf Stadler, and Mike Spreitzer, “ A Gossip Protocol for Dynamic Resource Management in Large Cloud Environment ” IEEE Transactions on Network and Service Management, vol. 9, no. 2, June 2012.
- R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM J.Applied Mathematics, vol. 17, no. 2, pp. pp. 416–429, 1969.
- M. Jelasity, A. Montresor, and O. Babaoglu, “Gossip-based aggregation in large dynamic networks,” ACM Trans. Computer Syst., vol. 23, no. 3,pp. 219–252, 2005.
- E. Loureiro, P. Nixon, and S. Dobson, “Decentralized utility maximization for adaptive management of shared resource pools,” in 2009 International Conference on Intelligent Networking and Collaborative Systems.
- C. Tang, M. Steinder, M. Spreitzer, and G. Pacifici, “A scalable application placement controller for enterprise data centers,” in 2007 International Conference on World Wide Web.
- S. Voulgaris, D. Gavidia, and M. van Steen, “CYCLON: inexpensive membership management for unstructured p2p overlays,” J. Network and Systems Management, vol. 13, no. 2, pp. 197–217, 2005.
- 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.
Keywords: Dynamic load balancing, gossip protocols, Price and Time Slot Negotiation (PTN), concession algorithm, tradeoff algorithm, cloud computing
Citation: Gowthami*,Gowri Saranya,Gowthami,Gowri Saranya ( 2013), Dynamic Load Balancing Using Gossip Protocol Including Automated Negotiation. , 1(2): 1-4
Received: 01/06/2024; Accepted: 01/06/2024;
Published: 01/06/2024
Edited by:
Mr.ERES JOURNALS