A stochastic process on the hypercube with applications to peer-to-peer networks

DOI10.1145/780542.780626zbMath1192.68018OpenAlexW2108386843MaRDI QIDQ3581257

Vijay V. Vazirani, Eran Halperin, Richard M. Karp, Micah Adler

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780626

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Optimal cover time for a graph-based coupon collector process ⋮ Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks ⋮ Choosing a random peer in Chord ⋮ Problems and results in extremal combinatorics. II ⋮ Proper distance in edge-colored hypercubes ⋮ Tight bounds for the cover time of multiple random walks ⋮ Scalable and dynamic quorum systems ⋮ Discovery Through Gossip ⋮ Multiple choice tries and distributed hash tables ⋮ Using theorem proving to verify expectation and variance for discrete random variables

This page was built for publication: A stochastic process on the hypercube with applications to peer-to-peer networks