A randomized algorithm for the joining protocol in dynamic distributed networks

DOI10.1016/j.tcs.2008.06.049zbMath1160.68002OpenAlexW1973367602MaRDI QIDQ952446

Ralf Klasing, Tomasz Radzik, Colin Cooper

Publication date: 12 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.049

zbMATH Keywords

random walksrandomized algorithmdynamic networkrandom graph processoverlay networkjoining protocolpeer to peer networksself repairing networks

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12)

Related Items (2)

Memory Efficient Anonymous Graph Exploration ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks

Uses Software

• Chord

Cites Work

• The tail of the hypergeometric distribution
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Paths in graphs
• Viceroy
• Analysis of the evolution of peer-to-peer systems
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A randomized algorithm for the joining protocol in dynamic distributed networks