Optimality of a Simple Replica Placement Strategy for Chord Peer-to-Peer Networks

Jichiang TSAI; Jain-Shing LIU; Tien-Yu CHANG

doi:10.1587/transcom.2016EBP3078

Optimality of a Simple Replica Placement Strategy for Chord Peer-to-Peer Networks

Jichiang TSAI, Jain-Shing LIU, Tien-Yu CHANG

Full Text Views

0

Share
Cite this

Summary :

Peer-to-peer (P2P) overlay networks are widely employed in distributed systems. The number of hops required by a node to locate an object is the fundamental search cost of a P2P network. Creating replicas can efficiently reduce the cost of object search, so how to deploy replicas to reduce the cost as much as possible is a critical problem of P2P networks. In the literature, most existing replica placement strategies arrange replicas at nodes near the one containing the considered object. In this paper, we formally demonstrate that for a complete Chord P2P network and many non-complete Chord ones, due to their deterministic structures, we can allocate replicas to nodes closest to the target in the identifier space to maximize the reduction in the total number of hops required by all nodes to reach a copy of the object during the search heading to the target node.

Publication: IEICE TRANSACTIONS on Communications Vol.E100-B No.4 pp.557-565

Publication Date: 2017/04/01

Publicized: 2016/11/02

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2016EBP3078

Type of Manuscript: PAPER

Category: Network

Authors

Jichiang TSAI
  National Chung Hsing University
Jain-Shing LIU
  Providence University
Tien-Yu CHANG
  National Chung Hsing University

Keyword

P2P networks, replica placements, Chord networks

Cite this

Copy

Jichiang TSAI, Jain-Shing LIU, Tien-Yu CHANG, "Optimality of a Simple Replica Placement Strategy for Chord Peer-to-Peer Networks" in IEICE TRANSACTIONS on Communications, vol. E100-B, no. 4, pp. 557-565, April 2017, doi: 10.1587/transcom.2016EBP3078.
Abstract: Peer-to-peer (P2P) overlay networks are widely employed in distributed systems. The number of hops required by a node to locate an object is the fundamental search cost of a P2P network. Creating replicas can efficiently reduce the cost of object search, so how to deploy replicas to reduce the cost as much as possible is a critical problem of P2P networks. In the literature, most existing replica placement strategies arrange replicas at nodes near the one containing the considered object. In this paper, we formally demonstrate that for a complete Chord P2P network and many non-complete Chord ones, due to their deterministic structures, we can allocate replicas to nodes closest to the target in the identifier space to maximize the reduction in the total number of hops required by all nodes to reach a copy of the object during the search heading to the target node.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.2016EBP3078/_p

Copy

@ARTICLE{e100-b_4_557,
author={Jichiang TSAI, Jain-Shing LIU, Tien-Yu CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimality of a Simple Replica Placement Strategy for Chord Peer-to-Peer Networks},
year={2017},
volume={E100-B},
number={4},
pages={557-565},
abstract={Peer-to-peer (P2P) overlay networks are widely employed in distributed systems. The number of hops required by a node to locate an object is the fundamental search cost of a P2P network. Creating replicas can efficiently reduce the cost of object search, so how to deploy replicas to reduce the cost as much as possible is a critical problem of P2P networks. In the literature, most existing replica placement strategies arrange replicas at nodes near the one containing the considered object. In this paper, we formally demonstrate that for a complete Chord P2P network and many non-complete Chord ones, due to their deterministic structures, we can allocate replicas to nodes closest to the target in the identifier space to maximize the reduction in the total number of hops required by all nodes to reach a copy of the object during the search heading to the target node.},
keywords={},
doi={10.1587/transcom.2016EBP3078},
ISSN={1745-1345},
month={April},}

Copy

TY - JOUR
TI - Optimality of a Simple Replica Placement Strategy for Chord Peer-to-Peer Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 557
EP - 565
AU - Jichiang TSAI
AU - Jain-Shing LIU
AU - Tien-Yu CHANG
PY - 2017
DO - 10.1587/transcom.2016EBP3078
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2017
AB - Peer-to-peer (P2P) overlay networks are widely employed in distributed systems. The number of hops required by a node to locate an object is the fundamental search cost of a P2P network. Creating replicas can efficiently reduce the cost of object search, so how to deploy replicas to reduce the cost as much as possible is a critical problem of P2P networks. In the literature, most existing replica placement strategies arrange replicas at nodes near the one containing the considered object. In this paper, we formally demonstrate that for a complete Chord P2P network and many non-complete Chord ones, due to their deterministic structures, we can allocate replicas to nodes closest to the target in the identifier space to maximize the reduction in the total number of hops required by all nodes to reach a copy of the object during the search heading to the target node.
ER -