Viceroy
From MaRDI portal
Publication:5170879
DOI10.1145/571825.571857zbMath1292.68015OpenAlexW1970564778WikidataQ56851182 ScholiaQ56851182MaRDI QIDQ5170879
David Ratajczak, Dahlia Malkhi, Moni Naor
Publication date: 25 July 2014
Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/571825.571857
Related Items (29)
Scalable percolation search on complex networks ⋮ D2B: A de Bruijn based content-addressable network ⋮ Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs ⋮ Survey of DHT topology construction techniques in virtual computing environments ⋮ Psu: a novel low-latency constant-degree overlay network ⋮ The price of validity in dynamic networks ⋮ Corona: a stabilizing deterministic message-passing skip list ⋮ Möbius-deBruijn: the product of Möbius cube and deBruijn digraph ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ HD tree: A novel data structure to support multi-dimensional range query for P2P networks ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Concurrent maintenance of rings ⋮ Peer counting and sampling in overlay networks based on random walks ⋮ HyperTree for self-stabilizing peer-to-peer systems ⋮ F-Chord: Improved uniform routing on Chord ⋮ Re-Chord: a self-stabilizing chord overlay network ⋮ Maintaining the Ranch topology ⋮ Choosing a random peer in Chord ⋮ A randomized algorithm for the joining protocol in dynamic distributed networks ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ SKY: efficient peer-to-peer networks based on distributed Kautz graphs ⋮ Scalable and dynamic quorum systems ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks ⋮ Multiple choice tries and distributed hash tables ⋮ Investigating the existence and the regularity of logarithmic Harary graphs ⋮ Estimating network size from local information ⋮ SKIP + ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
This page was built for publication: Viceroy
