A self-stabilizing Hashed Patricia Trie

T. Knollmann, C. Scheideler, Information and Computation (2021).

Download
No fulltext has been uploaded.
Journal Article | Published | English
Abstract
While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys.
Publishing Year
Journal Title
Information and Computation
Article Number
104697
ISSN
LibreCat-ID

Cite this

Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. 2021. doi:10.1016/j.ic.2021.104697
Knollmann, T., & Scheideler, C. (2021). A self-stabilizing Hashed Patricia Trie. Information and Computation. https://doi.org/10.1016/j.ic.2021.104697
@article{Knollmann_Scheideler_2021, title={A self-stabilizing Hashed Patricia Trie}, DOI={10.1016/j.ic.2021.104697}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2021} }
Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 2021. https://doi.org/10.1016/j.ic.2021.104697.
T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, 2021.
Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2021, doi:10.1016/j.ic.2021.104697.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar