A Dynamic Index Allocation Scheme for Data Retrieval and Provision in Peer-to-Peer Networks
Summary :
File-sharing Peer-to-Peer systems are effective for autonomous data retrieval and provision over the networks. However, the early data retrieval schemes such as Gnutella and Local Indices have low performance and large overhead. In order to solve weakness of early schemes, this paper proposes a dynamic scheme for data retrieval and provision, in which indices are adaptively allocated in appropriate nodes 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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.9 pp.2336-2346
- Publication Date
- 2006/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.9.2336
- Type of Manuscript
- Special Section PAPER (Special Section on Networking Technologies for Overlay Networks)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Atsushi ITO, Tomoyuki OHTA, Kouichi MITSUKAWA, Yoshiaki KAKUDA, "A Dynamic Index Allocation Scheme for Data Retrieval and Provision in Peer-to-Peer Networks" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 9, pp. 2336-2346, September 2006, doi: 10.1093/ietcom/e89-b.9.2336.
Abstract: File-sharing Peer-to-Peer systems are effective for autonomous data retrieval and provision over the networks. However, the early data retrieval schemes such as Gnutella and Local Indices have low performance and large overhead. In order to solve weakness of early schemes, this paper proposes a dynamic scheme for data retrieval and provision, in which indices are adaptively allocated in appropriate nodes 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.9.2336/_p
Copy
@ARTICLE{e89-b_9_2336,
author={Atsushi ITO, Tomoyuki OHTA, Kouichi MITSUKAWA, Yoshiaki KAKUDA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Dynamic Index Allocation Scheme for Data Retrieval and Provision in Peer-to-Peer Networks},
year={2006},
volume={E89-B},
number={9},
pages={2336-2346},
abstract={File-sharing Peer-to-Peer systems are effective for autonomous data retrieval and provision over the networks. However, the early data retrieval schemes such as Gnutella and Local Indices have low performance and large overhead. In order to solve weakness of early schemes, this paper proposes a dynamic scheme for data retrieval and provision, in which indices are adaptively allocated in appropriate nodes 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.},
keywords={},
doi={10.1093/ietcom/e89-b.9.2336},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - A Dynamic Index Allocation Scheme for Data Retrieval and Provision in Peer-to-Peer Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2336
EP - 2346
AU - Atsushi ITO
AU - Tomoyuki OHTA
AU - Kouichi MITSUKAWA
AU - Yoshiaki KAKUDA
PY - 2006
DO - 10.1093/ietcom/e89-b.9.2336
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2006
AB - File-sharing Peer-to-Peer systems are effective for autonomous data retrieval and provision over the networks. However, the early data retrieval schemes such as Gnutella and Local Indices have low performance and large overhead. In order to solve weakness of early schemes, this paper proposes a dynamic scheme for data retrieval and provision, in which indices are adaptively allocated in appropriate nodes 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.
ER -
English
