Adaptive Load Sensing and Rebalancing for Distributed File System in Cloud Environment
DOI:
https://doi.org/10.51983/ajcst-2014.3.2.1734Keywords:
fi le system, Cloud, Chunk server, RebalanceAbstract
Large scale distributed systems such as cloud computing applications are becoming very common. These applications come with increasing challenges on how to transfer and where to store and compute data. This system presents an innovative idea in cloud computing. In a giant cloud we are able to add thousands of nodes together. The main aim is to allot files to those nodes while not creating significant load to any of the nodes, for that files square measure partitioned off into completely different modules. Another objective is to cut back the network inconsistencies and network traffic attributable to the unbalancing of hundreds. The reduction of network inconsistency can result in maximization of network information measure in order that so many numerous such a big amount of, such a giant amount of, such a lot of large applications will run in it. Because of ability to quantify property, we are able to add, delete, update new nodes in order that it supports heterogeneousness of the system. To enhance the potential of nodes we tend to use Distributed fi le system in Cloud Computing Applications.
References
Andersen, D. "Resilient overlay networks." Master’s thesis, Department of EECS, MIT, May 2001. [Online]. Available: http://nms.lcs.mit.edu/projects/ron/.
Bakker, A., Amade, E., Ballintijn, G., Kuz, I., Verkaik, P., Van Der Wijk, I., Van Steen, M., and Tanenbaum, A. "The Globe distribution network." In Proc. 2000 USENIX Annual Conf. (FREENIX Track) (San Diego, CA, June 2000), pp. 141-152.
Chen, Y., Edler, J., Goldberg, A., Gottlieb, A., Sobti, S., and Yianilos, P. "A prototype implementation of archival intermemory." In Proceedings of the 4th ACM Conference on Digital libraries (Berkeley, CA, Aug. 1999), pp. 28-37.
Clarke, I. "A distributed decentralized information storage and retrieval system." Master’s thesis, University of Edinburgh, 1999.
Clarke, I., Sandberg, O., Wiley, B., and Hong, T. W. "Freenet: A distributed anonymous information storage and retrieval system." In Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability (Berkeley, California, June 2000). [Online]. Available: http://freenet.sourceforge.net.
Dabek, F., Brunskill, E., Kaashoek, M. F., Karger, D., Morris, R., Stoica, I., and Balakrishnan, H. "Building peer-to-peer systems with Chord, a distributed location service." In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (Elmau/Oberbayern, Germany, May 2001), pp. 71-76.
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. "Wide-area cooperative storage with CFS." In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP ‘01) (To appear; Banff, Canada, Oct. 2001).
Druschel, P., and Rowstron, A. "Past: Persistent and anonymous storage in a peer-to-peer networking environment." In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001) (Elmau/Oberbayern, Germany, May 2001), pp. 65-70.
FIPS 180-1. "Secure Hash Standard." U.S. Department of Commerce/ NIST, National Technical Information Service, Springfi eld, VA, Apr. 1995.
Gnutella. [Online]. Available: http://gnutella.wego.com/.
Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., and Panigrahy, R. "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web." In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, TX, May 1997), pp. 654-663.
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. "OceanStore: An architecture for global-scale persistent storage." In Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000) (Boston, MA, November 2000), pp. 190-201.
Lewin, D. "Consistent hashing and random trees: Algorithms for caching in distributed networks." Master’s thesis, Department of EECS, MIT, 1998. Available at the MIT Library, http://thesis.mit.edu/.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 The Research Publication
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
