Key Features:

- No of Pages: 37

- No of Chapters: 05

Buy Now

Introduction:

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.0 INTRODUCTION

1.1 STATEMENT OF PROBLEM

1.2 PURPOSE OF STUDY

1.3 AIMS AND OBJECTIVES

1.4 SCOPE/DELIMITATIONS

1.5 LIMITATIONS/CONSTRAINTS

1.6 DEFINITION OF TERMS



CHAPTER TWO

2.0 LITERATURE REVIEW



CHAPTER THREE

3.0 METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM

3.1 METHODOLOGIES FOR FACT-FINDING

3.2 DISCUSSIONS



CHAPTER FOUR

4.0 FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM

4.1 FUTURES

4.2 IMPLICATIONS

4.3 CHALLENGES



CHAPTER FIVE

5.0 RECOMMENDATIONS, SUMMARY AND CONCLUSION

5.1 RECOMMENDATION

5.2 SUMMARY

5.3 CONCLUSION

5.4 REFERENCES

Introduction

The introduction of this research is only available in the paid version.