Skip to Main content Skip to Navigation
Conference papers

Efficient and Secure Decentralized Network Size Estimation

Nathan Evans 1 Bartlomiej Polot 2 Christian Grothoff 2 
2 Free Secure Network Systems Group
TUM - Technische Universität Munchen - Université Technique de Munich [Munich, Allemagne]
Abstract : The size of a Peer-to-Peer (P2P) network is an important parameter for performance tuning of P2P routing algorithms. This paper introduces and evaluates a new efficient method for participants in an unstructured P2P network to establish the size of the overall network. The presented method is highly efficient, propagating information about the current size of the network to all participants using O(|E|) operations where |E| is the number of edges in the network. Afterwards, all nodes have the same network size estimate, which can be made arbitrarily accurate by averaging results from multiple rounds of the protocol. Security measures are included which make it prohibitively expensive for a typical active participating adversary to significantly manipulate the estimates. This paper includes experimental results that demonstrate the viability, efficiency and accuracy of the protocol.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, June 1, 2017 - 11:34:47 AM
Last modification on : Thursday, January 6, 2022 - 11:38:04 AM
Long-term archiving on: : Wednesday, September 6, 2017 - 6:58:37 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Nathan Evans, Bartlomiej Polot, Christian Grothoff. Efficient and Secure Decentralized Network Size Estimation. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.304-317, ⟨10.1007/978-3-642-30045-5_23⟩. ⟨hal-01531109⟩



Record views


Files downloads