A distributed P2P network based on increasing reliability and scalability for internet applications

Authors:
Ben-Jye Chang;Chao-Shu Chen;Ying-Hsin Liang;Hong-Da Lin
Affiliations:
Chaoyang University of Technology, Taichung, Taiwan, R.O.C.;Chaoyang University of Technology, Taichung, Taiwan, R.O.C.;Nan-Kai Institute of Technology, Nantou, Taiwan, R.O.C.;Chaoyang University of Technology, Taichung, Taiwan, R.O.C.
Venue:
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Year:
2006

Citing 7
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
A Distributed Approach to Solving Overlay Mismatching Problem

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Location Awareness in Unstructured Peer-to-Peer Systems

IEEE Transactions on Parallel and Distributed Systems
A novel state cache scheme in structured P2P systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose an efficient, distributed, reliable P2P networks for this purpose, which is called hand-in-hand (HIH) P2P network. First, HIH adopts distributed index servers with unique individual ID as logical ring nodes for storing and managing the file sharing information. Second, HIH adopts a consistent hashing to hash the sharing filename as a seed and maps the seed to a corresponding index server. The consistent hashing achieves some advantages including, scalable, providing a fast, unique file hashing, and load balancing among all index servers. Finally, the data synchronization with backup mechanism and a logical ring structure are proposed for increasing node reliability and data integrity when some index servers may fail abnormally or leave suddenly in such a distributed P2P network. Numerical results indicate that the proposed distributed P2P network, HIH, outperforms other approaches in average number of lost seeds under various failure rates of index server and different number of index servers, and routing information overhead. Furthermore, HIH yields very competitive reliability overhead as comparing with other approaches. Finally, the optimal number of preceding nodes for each index server in HIH is also analyzed and induced it to three.