The week's pick
Random Articles
Reseach Article
Resource Management in Large Cloud Environment using Tattle Protocol
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 102 - Number 5 |
| Year of Publication: 2014 |
| Authors: S.buvana, K.sumithra, R.somasundaram |
10.5120/17813-8642
|
S.buvana, K.sumithra, R.somasundaram . Resource Management in Large Cloud Environment using Tattle Protocol. International Journal of Computer Applications. 102, 5 ( September 2014), 33-36. DOI=10.5120/17813-8642
Abstract
Distributed computing is a term, which includes virtualization, conveyed processing, systems administration, programming and web administrations. A cloud comprises of a few components, for example, customers, server farm and appropriated servers. It incorporates deficiency tolerance, high accessibility, versatility, adaptability, lessened overhead for clients, decreased expense of proprietorship, on interest administrations and so forth. Distributed computing convey the registering as an administrations whereby offer assets, programming, data by means of Internet which are gotten to by the program. The business programming and information are put away in server at Remote Location (CLOUD), Cloud processing gives the sorts of administrations that are Infrastructure, Software, and stage as administrations. Tattle Protocol is successful convention for the element burden adjust in the disseminated framework and consistently execute methodology info & yield process. Assets allotment arrangements are processed by conventions. Our commitment incorporates illustrating disseminated middle ware structural planning and showing one of its key components: a tattle convention that guarantees reasonable asset assignment among destinations/applications, powerfully adjusts the portion to load progressions and scales both in the amount of physical machines and locales/applications. The convention constantly executes on dynamic, neighborhood include and does not require worldwide synchronization, as other proposed tattle conventions. The protocol continuously executes on dynamic, local input and does not require global synchronization, as other proposed tattle protocols.
References
- D. Carrera, M. Steinder, I. Whalley, J. Torres, and E. Ayguade, "Utilitybased placement of dynamic web applications with fairness goals," in 2008 IEEE Network Operations and Management Symposium.
- C. Adam and R. Stadler, "Service middleware for self-managing largescale systems," IEEE Trans. Network and Service Management, vol. 4, no. 3, pp. 50–64, Apr. 2008.
- F. Wuhib, M. Dam, and R. Stadler, "A tattleing protocol for detecting global threshold crossings," IEEE Trans. Network and Service Management, vol. 7, no. 1, pp. 42–57, Mar. 2010.
- Y. Yazir, C. Matthews, R. Farahbod, S. Neville, A. Guitouni, S. Ganti,and Y. Coady, "Dynamic resource allocation in computing cloudsusing distributed multiple criteria decision analysis," in 2010 IEEEInternational Conference on Cloud Computing.
- G. Cybenko, "Dynamic load balancing for distributed memory multiprocessors,"J. Parallel and Distrib. Computing, vol. 7, no. 2, pp. 279–301,1989.
- . F. Wuhib, R. Stadler, and M. Spreitzer, "Tattle-based resource managementfor cloud environments," in 2010 International Conference onNetwork and Service Management.
- M. Jelasity, A. Montresor, and O. Babaoglu, "Tattle-based aggregationin large dynamic networks," ACM Trans. Computer Syst. , vol. 23, no. 3, pp. 219–252, 2005.
- G. Pacifici, W. Segmuller, M. Spreitzer, and A. Tantawi, ?Dynamic estimation of CPU demand of web traffic,? in valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools. New York, NY, USA: ACM, 2006, p. 26.
- A. Demers, D. Green, C. Hauser, W. Irish, J. Larson, ?Epidemic algorithms for replicated database maintenance,? In proc. the 6th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 10 - 12, 1987
- C. Isci, J. E. Hanson, I. Whalley, M. Steinder, and J. O. Kephart. Runtime Demand Estimation for Effective Dynamic Resource Management. In NOMS'10, pages 381–388, 2010.
- J. Famaey, W. De Cock, T. Wauters, F. De Turck, B. Dhoedt, and P. Demeester, ?A latency-aware algorithm for dynamic service placement in large-scale overlays,? in 2009 International Conference on Integrated Network Management.
- A. Ghodsi, S. El-Ansary, S. Krishnamurthy, and S. Haridi, ?A Selfstabilizing Network Size Estimation Gossip Algorithm for Peer-to-Peer Systems,? SICS Technical Report T2005:16, 2005.
- D. Kempe, A. Dobra and J. Gehrke, ?Gossip-Based Computation of Aggregate Information,? In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), Cambridge, MA, USA, October 11-14, 2003.
- Lei Lu, Hui Zhang, ?Untangling Mixed Information to Calibrate Resource Utilization in Virtual Machines? in ICAC'11, June 14–18, 2011, Karlsruhe, Germany
- Fetahi Wuhib, Rolf Stadler and Mike Spreitzer, ? A Gossip Protocol for Dynamic Resource Management in Large Cloud Environments? IEEE Trans. Network and Service Management, vol. 9, no. 2, pp. 213-225, June 2012.
Index Terms
Keywords