ABSTRACT
We implemented a distributed, peer-to-peer file system in Java using the Chord protocol for efficient location of files stored across a network. Chord is a distributed key lookup technique that scales logarithmically with an increase in the number of storage nodes. Initially, we discovered problems with the Chord algorithms, and prototyped corrections to verify the changes. To implement the file sharing system, a Sockets-based messaging framework was implemented in Java, using command line interfaces and an FTP-like file push/pull semantics. The file system enables distributed peers to present a virtual single directory to users while sharing file load across different platforms. Using the application, we verified the claimed messaging performance of the basic Chord algorithm to be close to Mlog(N) behavior in an average case. The algorithms were modified to do locally-optimal balanced node joins, and experiments showed a 20% improvement in load balancing fairness over the standard, unbalanced algorithms.
TABLE OF CONTENT
TITLE PAGE
CERTIFICATION
APPROVAL
DEDICATION
ACKNOWLEDGEMENT
ABSTRACT
TABLE OF CONTENT
CHAPTER ONE
1.0INTRODUCTION
1.1STATEMENT OF PROBLEM
1.2PURPOSE OF STUDY
1.3AIMS AND OBJECTIVES
1.4SCOPE/DELIMITATIONS
1.5LIMITATIONS/CONSTRAINTS
1.6DEFINITION OF TERMS
CHAPTER TWO
2.0LITERATURE REVIEW
CHAPTER THREE
3.0METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM
3.1 METHODOLOGIES FOR FACT-FINDING
3.2DISCUSSIONS
CHAPTER FOUR
4.0FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM
4.1FUTURES
4.2IMPLICATIONS
4.3CHALLENGES
CHAPTER FIVE
5.0RECOMMENDATIONS, SUMMARY AND CONCLUSION
5.1RECOMMENDATION
5.2SUMMARY
5.3CONCLUSION
5.4REFERENCES