T-Man: Gossip-based fast overlay topology construction
From MaRDI portal
Publication:838498
DOI10.1016/J.COMNET.2009.03.013zbMath1176.68020DBLPjournals/cn/JelasityMB09OpenAlexW2015195166WikidataQ59491510 ScholiaQ59491510MaRDI QIDQ838498
Márk Jelasity, Ozalp Babaoglu, Alberto Montresor
Publication date: 26 August 2009
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: http://www.cs.unibo.it/babaoglu/papers/pdf/comnet09.pdf
Related Items (8)
Unnamed Item ⋮ Trust-aware peer sampling: performance and privacy tradeoffs ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ On the uniformity of peer sampling based on view shuffling ⋮ Self-Optimised Tree Overlays Using Proximity-Driven Self-Organised Agents ⋮ Unnamed Item ⋮ Discovery Through Gossip ⋮ On Gossip and Populations
This page was built for publication: T-Man: Gossip-based fast overlay topology construction