A semi-structured overlay network for large-scale peer-to-peer systems

Authors:
Kousaku Kimura;Satoshi Amamiya;Tsunenori Mine;Makoto Amamiya
Affiliations:
Faculty, Graduate School of ISEE., Kyushu University, Nishiku, Fukuoka, Japan;Faculty, Graduate School of ISEE., Kyushu University, Nishiku, Fukuoka, Japan;Faculty, Graduate School of ISEE., Kyushu University, Nishiku, Fukuoka, Japan;Faculty, Graduate School of ISEE., Kyushu University, Nishiku, Fukuoka, Japan
Venue:
AP2PC'08 Proceedings of the 7th international conference on Agents and Peer-to-Peer Computing
Year:
2008

Citing 8
Cited 0

Freenet: a distributed anonymous information storage and retrieval system

International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
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
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
P-tree: a p2p index for resource discovery applications

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
An adaptive proximity route selection scheme in DHT-Based peer to peer systems

PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (P2P) communication and computing frameworks are important for constructing robust large-scale distributed systems. Overlay network systems use distributed hash-table (DHT) to provide scalable and efficient node search capabilities. However, the DHT-based method has a problem for the maintenance cost of dynamically changing large-scale-network, in which nodes are frequently joining and leaving. This paper proposes a novel technique of P2P communication path management. The proposed technique devises a robust semi-structured overlay network called Ordered Tree with Tuft (OTT for short). OTT provides not only efficient node searching, but also low-cost self-maintenance capabilities for the dynamically changing network. In this method, joining and leaving of a node are managed in O(1) with high probability. Furthermore, the proposed OTT-based technique can find and construct a path shorter than that on the normal ordered tree, by setting up bypass links between remote nodes on OTT.