Sökning: id:"swepub:oai:DiVA.org:kth-25811" >
A Practical Approac...
-
Shafaat, Tallat M.KTH,Elektronik- och datorsystem, ECS
(författare)
A Practical Approach to Network Size Estimation for Structured Overlays
- Artikel/kapitelEngelska2008
Förlag, utgivningsår, omfång ...
-
Berlin :SPRINGER-VERLAG,2008
-
printrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:kth-25811
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-25811URI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:kon swepub-publicationtype
Anmärkningar
-
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.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Ghodsi, Ali
(författare)
-
Haridi, SeifKTH,Programvaru- och datorsystem, SCS(Swepub:kth)u1j6y2uf
(författare)
-
KTHElektronik- och datorsystem, ECS
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:SELF-ORGANIZING SYSTEMS, PROCEEDINGSBerlin : SPRINGER-VERLAG, s. 71-839783540921561
Internetlänk
Hitta via bibliotek
Till lärosätets databas