Brief announcement: the accuracy of tree-based counting in dynamic networks

  • Authors:

  • Supriya Krishnamurthy;John Ardelius;Erik Aurell;Mads Dam;Rolf Stadler;Fetahi Zebenigus Wuhib

  • Affiliations:

  • SICS Center for Networked Systems, Stockholm, Sweden;SICS Center for Networked Systems, Stockholm, Sweden;Royal Institute of Technology, Stockholm, Sweden;Royal Institute of Technology, Stockholm, Sweden;Royal Institute of Technology, Stockholm, Sweden;Royal Institute of Technology, Stockholm, Sweden

  • Venue:
  • Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study a simple Bellman-Ford-like protocol which performs network size estimation over a tree-shaped overlay. A continuous time Markov model is constructed which allows key protocol characteristics to be estimated under churn, including the expected number of nodes at a given (perceived) distance to the root and, for each such node, the expected (perceived) size of the subnetwork rooted at that node. We validate the model by simulations, using a range of network sizes, node degrees, and churn-to-protocol rates, with convincing results.