Efficient and Secure Decentralized Network Size Estimation - NETWORKING 2012 Access content directly
Conference Papers Year : 2012

Efficient and Secure Decentralized Network Size Estimation

Nathan Evans
  • Function : Author
  • PersonId : 1009197
Bartlomiej Polot
  • Function : Author
  • PersonId : 1009198
Christian Grothoff
  • Function : Author
  • PersonId : 1009199


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.
Fichier principal
Vignette du fichier
978-3-642-30045-5_23_Chapter.pdf (306.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01531109 , version 1 (01-06-2017)





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⟩
68 View
100 Download



Gmail Facebook X LinkedIn More