An adaptive index allocation scheme for reliable data retrieval and provision in peer-to-peer networks

Authors:
Atsushi Ito;Tomoyuki Ohta;Kouichi Mitsukawa;Yoshiaki Kakuda
Affiliations:
KDDI Corporation, Chiyoda-ku, Tokyo, Japan;Hiroshima City University, Asa-Minami-Ku, Hiroshima, Japan;Hiroshima City University, Asa-Minami-Ku, Hiroshima, Japan;Hiroshima City University, Asa-Minami-Ku, Hiroshima, Japan
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 4
Cited 1

A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
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
Improving Search in Peer-to-Peer Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)

The state of peer-to-peer simulators and simulations

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

File-sharing Peer-to-Peer systems are effective for autonomous data retrieval and provision over the networks. However, the previous data retrieval schemes such as Gnutella and Local Indices have bad performance and large overhead. In order to solve these drawbacks, this paper proposes an adaptive scheme for data retrieval and provision, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.