Search: onr:"swepub:oai:DiVA.org:kth-25811" >
A Practical Approac...
A Practical Approach to Network Size Estimation for Structured Overlays
-
- Shafaat, Tallat M. (author)
- KTH,Elektronik- och datorsystem, ECS
-
Ghodsi, Ali (author)
-
- Haridi, Seif (author)
- KTH,Programvaru- och datorsystem, SCS
-
(creator_code:org_t)
- Berlin : SPRINGER-VERLAG, 2008
- 2008
- English.
-
In: SELF-ORGANIZING SYSTEMS, PROCEEDINGS. - Berlin : SPRINGER-VERLAG. - 9783540921561 ; , s. 71-83
- Related links:
-
https://urn.kb.se/re...
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- Cybernetics
- Distributed computer systems
- Technical presentations
- Computer science
- Datalogi
Publication and Content Type
- ref (subject category)
- kon (subject category)
Find in a library
To the university's database