Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Brief Announcement: The Accuracy of Tree-based Counting in Dynamic Networks
KTH, School of Computer Science and Communication (CSC), Computational Biology, CB. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-5432-6442
Show others and affiliations
2010 (English)In: PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, NEW YORK: ASSOC COMPUTING MACHINERY , 2010, 291-292 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
NEW YORK: ASSOC COMPUTING MACHINERY , 2010. 291-292 p.
Keyword [en]
Markov model, distributed spanning tree
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-36023DOI: 10.1145/1835698.1835770ISI: 000286908100060Scopus ID: 2-s2.0-77956243165OAI: oai:DiVA.org:kth-36023DiVA: diva2:429963
Conference
2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING
Note

QC 20110706

Available from: 2011-07-06 Created: 2011-07-06 Last updated: 2016-05-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Dam, Mads

Search in DiVA

By author/editor
Aurell, ErikDam, MadsStadler, RolfWuhib, Fetahi Zebenigus
By organisation
Computational Biology, CBACCESS Linnaeus CentreTheoretical Computer Science, TCSCommunication Networks
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 59 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf