An Adaptive Peer-Sampling Protocol for Building Networks of Browsers

Abstract : Peer-sampling protocols constitute a fundamental mechanism for a number of large-scale distributed applications. The recent introduction of WebRTC facilitated the deployment of decentralized applications over a network of browsers. However, deploying existing peer-sampling protocols on top of We-bRTC raises issues about their lack of adaptiveness to sudden bursts of popularity over a network that does not manage addressing or routing. Spray is a novel random peer-sampling protocol that dynamically , quickly, and efficiently self-adapts to the network size. Our experiments show the flexibility of Spray and highlight its efficiency improvements at the cost of small overhead. We embedded Spray in a real-time decentralized editor running in brow-sers and ran experiments involving up to 600 communicating web browsers. The results demonstrate that Spray significantly reduces the network traffic according to the number of participants and saves bandwidth.
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download
Contributor : Davide Frey <>
Submitted on : Thursday, October 19, 2017 - 6:25:02 PM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM
Long-term archiving on : Saturday, January 20, 2018 - 3:36:28 PM



Brice Nédelec, Julian Tanke, Pascal Molli, Achour Mostefaoui, Davide Frey. An Adaptive Peer-Sampling Protocol for Building Networks of Browsers. World Wide Web, Springer Verlag, In press, 21 (3), pp.629-661. ⟨10.1007/s11280-017-0478-5⟩. ⟨hal-01619906⟩



Record views


Files downloads