A Practical Approach to Network Size Estimation for Structured Overlays

QC 20101101
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.

Ghodsi, Ali (författare)
Haridi, SeifKTH,Programvaru- och datorsystem, SCS(Swepub:kth)u1j6y2uf (författare)
KTHElektronik- och datorsystem, ECS (creator_code:org_t)

Ingår i:SELF-ORGANIZING SYSTEMS, PROCEEDINGSBerlin : SPRINGER-VERLAG, s. 71-839783540921561

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.