A randomized algorithm for the joining protocol in dynamic distributed networks

DOI10.1016/J.TCS.2008.06.049zbMATH Open1160.68002OpenAlexW1973367602MaRDI QIDQ952446FDOQ952446

Authors: Colin Cooper, Ralf Klasing, Tomasz Radzik 

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

Recommendations

• Distributed computation in dynamic networks via random walks
• Fast distributed computation in dynamic networks via random walks
• Distributed computation in dynamic networks
• Information spreading in dynamic networks under oblivious adversaries
• Lower bounds on information dissemination in dynamic networks

zbMATH Keywords

randomized algorithmrandom walksdynamic networkrandom graph processoverlay networkjoining protocolpeer to peer networksself repairing networks

Mathematics Subject Classification ID

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

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Paths in graphs
• The tail of the hypergeometric distribution
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Viceroy, a scalable and dynamic emulation of the butterfly
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of the evolution of peer-to-peer systems
• Title not available (Why is that?)
• Sampling regular graphs and a peer-to-peer network
• Title not available (Why is that?)

Cited In (3)

• On dynamic network security: a random decentering algorithm on graphs
• Memory Efficient Anonymous Graph Exploration
• On verifying and maintaining connectivity of interval temporal networks

Uses Software

• Chord

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952446)