The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A réseau superposé structuré préservant l'ordre des clés est une classe de réseau superposé structuré qui préserve, dans sa structure, l'ordre des clés pour prendre en charge des requêtes de plage efficaces. Cet article présente un nouveau réseau de superposition structuré préservant l'ordre des clés « Suzaku ». Semblable à l'accord conventionnel#, Suzaku utilise une table de doigts périodiquement mise à jour comme table de routage, mais étend sa table de doigts unidirectionnelle en bidirectionnelle, ce qui permet d'obtenir ⌈log2 n⌉-1 sauts de recherche maximum dans l’état convergé. Suzaku introduit des algorithmes de mise à jour de table de doigts bidirectionnels actifs et passifs pour l'insertion et la suppression de nœuds. Cette méthode maintient de bonnes performances de recherche (les sauts de recherche augmentent de manière presque logarithmique par rapport à n) même dans des situations de désabonnement. En plus de ses bonnes performances, les algorithmes de Suzaku sont simples et faciles à mettre en œuvre. Cet article décrit les principes de Suzaku, suivis d'évaluations par simulation, dans lesquelles il a montré de meilleures performances que les réseaux conventionnels, Chord# et Sauter le graphique.
Kota ABE
Osaka City University,National Institute of Information and Communications Technology
Yuuichi TERANISHI
National Institute of Information and Communications Technology,Osaka University
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.
Copier
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 “<I>Suzaku</I>”. 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 ⌈log2 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
Copier
@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 “<I>Suzaku</I>”. 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 ⌈log2 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},}
Copier
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 “<I>Suzaku</I>”. 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 ⌈log2 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 -