A Practical Approach to Network Size Estimation for Structured Overlays
2008 (English)In: SELF-ORGANIZING SYSTEMS, PROCEEDINGS / [ed] Hummel KA; Sterbenz JPG, Berlin: SPRINGER-VERLAG , 2008, Vol. 5343, 71-83 p.Conference paper (Refereed)
Structured overlay networks have recently received much attention due to their self-* properties under dynamic and decentralized settings. The number of nodes in all overlay fluctuates all the time due to churn. Since knowledge of the size of the. overlay is a core requirement for many systems, estimating the size in a decentralized manner is a challenge taken up by recent research activities. Gossip-based Aggregation has been shown to give accurate estimates for the network size, but previous work done is highly sensitive to node failures. In this paper, we present a gossip-based aggregation-style network size estimation algorithm. We discuss shortcomings of existing aggregation-based size estimation algorithms, and give a solution that is highly robust to node failures and is adaptive to network delays. We examine our solution in various scenarios to demonstrate. its effectiveness.
Place, publisher, year, edition, pages
Berlin: SPRINGER-VERLAG , 2008. Vol. 5343, 71-83 p.
, LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 5343
Cybernetics, Distributed computer systems, Technical presentations
IdentifiersURN: urn:nbn:se:kth:diva-25811DOI: 10.1007/978-3-540-92157-8-7ISI: 000263515100007ScopusID: 2-s2.0-58349117706ISBN: 978-3-540-92156-1OAI: oai:DiVA.org:kth-25811DiVA: diva2:359933
3rd International Workshop on Self-Organizing Systems, Vienna, AUSTRIA, DEC 10-12, 2008
QC 201011012010-11-012010-11-012011-03-22Bibliographically approved