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

Kousaku Kimura, Satoshi Amamiya, Tsunenori Mine, Makoto Amamiya

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

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.

Original languageEnglish
Title of host publicationAgents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers
Pages83-94
Number of pages12
Volume6573 LNAI
DOIs
Publication statusPublished - Sep 3 2012
Event8th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2009 - Budapest, Hungary
Duration: May 11 2009May 11 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6573 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2009
CountryHungary
CityBudapest
Period5/11/095/11/09

Fingerprint

Peer-to-peer Systems
Overlay networks
Overlay Networks
Large-scale Systems
Joining
Communication
Ordered Trees
Vertex of a graph
Costs
Table
Maintenance
Peer-to-peer (P2P)
Shortest path
Distributed Systems
Path
Computing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kimura, K., Amamiya, S., Mine, T., & Amamiya, M. (2012). A semi-structured overlay network for large-scale peer-to-peer systems. In Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers (Vol. 6573 LNAI, pp. 83-94). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6573 LNAI). https://doi.org/10.1007/978-3-642-31809-2_8

A semi-structured overlay network for large-scale peer-to-peer systems. / Kimura, Kousaku; Amamiya, Satoshi; Mine, Tsunenori; Amamiya, Makoto.

Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers. Vol. 6573 LNAI 2012. p. 83-94 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6573 LNAI).

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

Kimura, K, Amamiya, S, Mine, T & Amamiya, M 2012, A semi-structured overlay network for large-scale peer-to-peer systems. in Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers. vol. 6573 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6573 LNAI, pp. 83-94, 8th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2009, Budapest, Hungary, 5/11/09. https://doi.org/10.1007/978-3-642-31809-2_8
Kimura K, Amamiya S, Mine T, Amamiya M. A semi-structured overlay network for large-scale peer-to-peer systems. In Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers. Vol. 6573 LNAI. 2012. p. 83-94. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-31809-2_8
Kimura, Kousaku ; Amamiya, Satoshi ; Mine, Tsunenori ; Amamiya, Makoto. / A semi-structured overlay network for large-scale peer-to-peer systems. Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers. Vol. 6573 LNAI 2012. pp. 83-94 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0608e3fd64fd484b90199f4d7d9324fc,
title = "A semi-structured overlay network for large-scale peer-to-peer systems",
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.",
author = "Kousaku Kimura and Satoshi Amamiya and Tsunenori Mine and Makoto Amamiya",
year = "2012",
month = "9",
day = "3",
doi = "10.1007/978-3-642-31809-2_8",
language = "English",
isbn = "9783642318085",
volume = "6573 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "83--94",
booktitle = "Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers",

}

TY - GEN

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

AU - Kimura, Kousaku

AU - Amamiya, Satoshi

AU - Mine, Tsunenori

AU - Amamiya, Makoto

PY - 2012/9/3

Y1 - 2012/9/3

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-642-31809-2_8

DO - 10.1007/978-3-642-31809-2_8

M3 - Conference contribution

SN - 9783642318085

VL - 6573 LNAI

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

SP - 83

EP - 94

BT - Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers

ER -