Proximity based peer-to-peer overlay networks (P3ON) with load distribution

Kunwoo Park, Sangheon Pack, Taekyoung Kwon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Construction of overlay networks without any consideration of real network topologies causes inefficient routing in peer-to-peer networks. This paper presents the design and evaluation of a proximity based peer-to-peer overlay network (P3ON). P3ON is composed of two-tier overlay rings. The high tier ring is a global overlay in which every node participates. Whereas, the low tier ring is a local overlay that consists of nodes in the same autonomous system (AS). Since the low tier ring consists of nearby nodes (in the same AS), the lookup latency can be significantly reduced if the first search within the low tier ring is successful. Also, to cope with skewness of load (of key lookup) distribution, P3ON effectively replicates the popular keys (and results) to neighbor nodes and neighbor ASs. Simulation results reveal that P3ON outperforms the existing ring-based P2P network in terms of lookup time and achieves relatively balanced load distribution.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages234-243
Number of pages10
Volume5200 LNCS
DOIs
Publication statusPublished - 2008 Dec 31
Event21st International Conference on Information Networking, ICOIN 2007 - Estoril, Portugal
Duration: 2007 Jan 232007 Jan 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5200 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other21st International Conference on Information Networking, ICOIN 2007
CountryPortugal
CityEstoril
Period07/1/2307/1/25

Fingerprint

Load Distribution
Overlay networks
Peer to peer networks
Overlay Networks
Peer-to-peer Networks
Proximity
Ring
Overlay
Topology
Vertex of a graph
Autonomous Systems
P2P Network
Skewness
Network Topology
Latency
Routing
Evaluation
Simulation

Keywords

  • Load distribution
  • Overlay network
  • Peer-to-peer
  • Proximity

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Park, K., Pack, S., & Kwon, T. (2008). Proximity based peer-to-peer overlay networks (P3ON) with load distribution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5200 LNCS, pp. 234-243). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5200 LNCS). https://doi.org/10.1007/978-3-540-89524-4-24

Proximity based peer-to-peer overlay networks (P3ON) with load distribution. / Park, Kunwoo; Pack, Sangheon; Kwon, Taekyoung.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5200 LNCS 2008. p. 234-243 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5200 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, K, Pack, S & Kwon, T 2008, Proximity based peer-to-peer overlay networks (P3ON) with load distribution. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5200 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5200 LNCS, pp. 234-243, 21st International Conference on Information Networking, ICOIN 2007, Estoril, Portugal, 07/1/23. https://doi.org/10.1007/978-3-540-89524-4-24
Park K, Pack S, Kwon T. Proximity based peer-to-peer overlay networks (P3ON) with load distribution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5200 LNCS. 2008. p. 234-243. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-89524-4-24
Park, Kunwoo ; Pack, Sangheon ; Kwon, Taekyoung. / Proximity based peer-to-peer overlay networks (P3ON) with load distribution. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5200 LNCS 2008. pp. 234-243 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ac1e1d30174340a3b6b94c10b17ffd61,
title = "Proximity based peer-to-peer overlay networks (P3ON) with load distribution",
abstract = "Construction of overlay networks without any consideration of real network topologies causes inefficient routing in peer-to-peer networks. This paper presents the design and evaluation of a proximity based peer-to-peer overlay network (P3ON). P3ON is composed of two-tier overlay rings. The high tier ring is a global overlay in which every node participates. Whereas, the low tier ring is a local overlay that consists of nodes in the same autonomous system (AS). Since the low tier ring consists of nearby nodes (in the same AS), the lookup latency can be significantly reduced if the first search within the low tier ring is successful. Also, to cope with skewness of load (of key lookup) distribution, P3ON effectively replicates the popular keys (and results) to neighbor nodes and neighbor ASs. Simulation results reveal that P3ON outperforms the existing ring-based P2P network in terms of lookup time and achieves relatively balanced load distribution.",
keywords = "Load distribution, Overlay network, Peer-to-peer, Proximity",
author = "Kunwoo Park and Sangheon Pack and Taekyoung Kwon",
year = "2008",
month = "12",
day = "31",
doi = "10.1007/978-3-540-89524-4-24",
language = "English",
isbn = "354089523X",
volume = "5200 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "234--243",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Proximity based peer-to-peer overlay networks (P3ON) with load distribution

AU - Park, Kunwoo

AU - Pack, Sangheon

AU - Kwon, Taekyoung

PY - 2008/12/31

Y1 - 2008/12/31

N2 - Construction of overlay networks without any consideration of real network topologies causes inefficient routing in peer-to-peer networks. This paper presents the design and evaluation of a proximity based peer-to-peer overlay network (P3ON). P3ON is composed of two-tier overlay rings. The high tier ring is a global overlay in which every node participates. Whereas, the low tier ring is a local overlay that consists of nodes in the same autonomous system (AS). Since the low tier ring consists of nearby nodes (in the same AS), the lookup latency can be significantly reduced if the first search within the low tier ring is successful. Also, to cope with skewness of load (of key lookup) distribution, P3ON effectively replicates the popular keys (and results) to neighbor nodes and neighbor ASs. Simulation results reveal that P3ON outperforms the existing ring-based P2P network in terms of lookup time and achieves relatively balanced load distribution.

AB - Construction of overlay networks without any consideration of real network topologies causes inefficient routing in peer-to-peer networks. This paper presents the design and evaluation of a proximity based peer-to-peer overlay network (P3ON). P3ON is composed of two-tier overlay rings. The high tier ring is a global overlay in which every node participates. Whereas, the low tier ring is a local overlay that consists of nodes in the same autonomous system (AS). Since the low tier ring consists of nearby nodes (in the same AS), the lookup latency can be significantly reduced if the first search within the low tier ring is successful. Also, to cope with skewness of load (of key lookup) distribution, P3ON effectively replicates the popular keys (and results) to neighbor nodes and neighbor ASs. Simulation results reveal that P3ON outperforms the existing ring-based P2P network in terms of lookup time and achieves relatively balanced load distribution.

KW - Load distribution

KW - Overlay network

KW - Peer-to-peer

KW - Proximity

UR - http://www.scopus.com/inward/record.url?scp=58049088286&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58049088286&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89524-4-24

DO - 10.1007/978-3-540-89524-4-24

M3 - Conference contribution

AN - SCOPUS:58049088286

SN - 354089523X

SN - 9783540895237

VL - 5200 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 234

EP - 243

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -