Suzaku: A Churn Resilient and Lookup-Efficient Key-Order Preserving Structured Overlay Network

Kota ABE; Yuuichi TERANISHI

doi:10.1587/transcom.2018EBT0001

Suzaku: A Churn Resilient and Lookup-Efficient Key-Order Preserving Structured Overlay Network

Kota ABE, Yuuichi TERANISHI

Full Text Views

0

Cite this

Summary :

A key-order preserving structured overlay network is a class of structured overlay network that preserves, in its structure, the order of keys to support efficient range queries. This paper presents a novel key-order preserving structured overlay network “Suzaku”. Similar to the conventional Chord^#, Suzaku uses a periodically updated finger table as a routing table, but extends its uni-directional finger table to bi-directional, which achieves ⌈log₂ n⌉-1 maximum lookup hops in the converged state. Suzaku introduces active and passive bi-directional finger table update algorithms for node insertion and deletion. This method maintains good lookup performance (lookup hops increase nearly logarithmically against n) even in churn situations. As well as its good performance, the algorithms of Suzaku are simple and easy to implement. This paper describes the principles of Suzaku, followed by simulation evaluations, in which it showed better performance than the conventional networks, Chord^# and Skip Graph.

Publication: IEICE TRANSACTIONS on Communications Vol.E102-B No.9 pp.1885-1894

Publication Date: 2019/09/01

Publicized: 2019/03/05

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2018EBT0001

Type of Manuscript: PAPER

Category: Network

Authors

Kota ABE
Osaka City University,National Institute of Information and Communications Technology
Yuuichi TERANISHI
National Institute of Information and Communications Technology,Osaka University

Keyword

peer-to-peer systems, key-order preserving structured overlay network, churn resilience

Cite this

Copy

Kota ABE, Yuuichi TERANISHI, "Suzaku: A Churn Resilient and Lookup-Efficient Key-Order Preserving Structured Overlay Network" in IEICE TRANSACTIONS on Communications, vol. E102-B, no. 9, pp. 1885-1894, September 2019, doi: 10.1587/transcom.2018EBT0001.
Abstract: A key-order preserving structured overlay network is a class of structured overlay network that preserves, in its structure, the order of keys to support efficient range queries. This paper presents a novel key-order preserving structured overlay network “Suzaku”. Similar to the conventional Chord^#, Suzaku uses a periodically updated finger table as a routing table, but extends its uni-directional finger table to bi-directional, which achieves ⌈log₂ n⌉-1 maximum lookup hops in the converged state. Suzaku introduces active and passive bi-directional finger table update algorithms for node insertion and deletion. This method maintains good lookup performance (lookup hops increase nearly logarithmically against n) even in churn situations. As well as its good performance, the algorithms of Suzaku are simple and easy to implement. This paper describes the principles of Suzaku, followed by simulation evaluations, in which it showed better performance than the conventional networks, Chord^# and Skip Graph.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBT0001/_p

Copy

@ARTICLE{e102-b_9_1885,
author={Kota ABE, Yuuichi TERANISHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Suzaku: A Churn Resilient and Lookup-Efficient Key-Order Preserving Structured Overlay Network},
year={2019},
volume={E102-B},
number={9},
pages={1885-1894},
abstract={A key-order preserving structured overlay network is a class of structured overlay network that preserves, in its structure, the order of keys to support efficient range queries. This paper presents a novel key-order preserving structured overlay network “Suzaku”. Similar to the conventional Chord^#, Suzaku uses a periodically updated finger table as a routing table, but extends its uni-directional finger table to bi-directional, which achieves ⌈log₂ n⌉-1 maximum lookup hops in the converged state. Suzaku introduces active and passive bi-directional finger table update algorithms for node insertion and deletion. This method maintains good lookup performance (lookup hops increase nearly logarithmically against n) even in churn situations. As well as its good performance, the algorithms of Suzaku are simple and easy to implement. This paper describes the principles of Suzaku, followed by simulation evaluations, in which it showed better performance than the conventional networks, Chord^# and Skip Graph.},
keywords={},
doi={10.1587/transcom.2018EBT0001},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - Suzaku: A Churn Resilient and Lookup-Efficient Key-Order Preserving Structured Overlay Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1885
EP - 1894
AU - Kota ABE
AU - Yuuichi TERANISHI
PY - 2019
DO - 10.1587/transcom.2018EBT0001
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2019
AB - A key-order preserving structured overlay network is a class of structured overlay network that preserves, in its structure, the order of keys to support efficient range queries. This paper presents a novel key-order preserving structured overlay network “Suzaku”. Similar to the conventional Chord^#, Suzaku uses a periodically updated finger table as a routing table, but extends its uni-directional finger table to bi-directional, which achieves ⌈log₂ n⌉-1 maximum lookup hops in the converged state. Suzaku introduces active and passive bi-directional finger table update algorithms for node insertion and deletion. This method maintains good lookup performance (lookup hops increase nearly logarithmically against n) even in churn situations. As well as its good performance, the algorithms of Suzaku are simple and easy to implement. This paper describes the principles of Suzaku, followed by simulation evaluations, in which it showed better performance than the conventional networks, Chord^# and Skip Graph.
ER -