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
A Practical Approach to Network Size Estimation for Structured Overlays
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).ORCID iD: 0000-0002-6718-0144
2008 (English)In: SELF-ORGANIZING SYSTEMS, PROCEEDINGS / [ed] Hummel KA; Sterbenz JPG, Berlin: SPRINGER-VERLAG , 2008, Vol. 5343, 71-83 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 5343
Keyword [en]
Cybernetics, Distributed computer systems, Technical presentations
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-25811ISI: 000263515100007Scopus ID: 2-s2.0-58349117706ISBN: 978-3-540-92156-1 (print)OAI: oai:DiVA.org:kth-25811DiVA: diva2:359933
Conference
3rd International Workshop on Self-Organizing Systems, Vienna, AUSTRIA, DEC 10-12, 2008
Note

QC 20101101

Available from: 2010-11-01 Created: 2010-11-01 Last updated: 2017-06-08Bibliographically approved
In thesis
1. Dealing with Network Partitions and Mergers in Structured Overlay Networks
Open this publication in new window or tab >>Dealing with Network Partitions and Mergers in Structured Overlay Networks
2009 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Structured overlay networks form a major classof peer-to-peer systems, which are touted for their abilitiesto scale, tolerate failures, and self-manage. Any long livedInternet-scale distributed system is destined to facenetwork partitions. Although the problem of network partitionsand mergers is highly related to fault-tolerance andself-management in large-scale systems, it has hardly beenstudied in the context of structured peer-to-peer systems.These systems have mainly been studied under churn (frequentjoins/failures), which as a side effect solves the problemof network partitions, as it is similar to massive nodefailures. Yet, the crucial aspect of network mergers has beenignored. In fact, it has been claimed that ring-based structuredoverlay networks, which constitute the majority of thestructured overlays, are intrinsically ill-suited for mergingrings. In this thesis, we present a number of research papers representing our work on handling network partitions and mergers in structured overlay networks. The contribution of this thesis is threefold. First, we provide a solution for merging ring-based structured overlays. Our solution is tuneable, by a {\em fanout} parameter, to achieve a trade-off between message and time complexity. Second, we provide a network size estimation algorithm for ring-based structured overlays. We believe that an estimate of the current network size can be used for tuning overlay parameters that change according to the network size, for instance the fanout parameter in our merger solution.Third, we extend our work from fixing routing anomalies to achieving data consistency. We argue that decreasing lookup inconsistencies on the routing level aids in achieving data consistency in applications built on top of overlays. We study the frequency of occurence of lookup inconsistencies and discuss solutions to decrease the affect of lookup inconsistencies.

Place, publisher, year, edition, pages
Stockholm: KTH, 2009. 87 p.
Series
Trita-ICT-ECS AVH, ISSN 1653-6363 ; 09:01
Keyword
Structured Overlay Networks, Distributed Hash Tables, DHTs, Network Partitions, Network Mergers, Network Size Estimation, Lookup Inconsistencies, Gossiping
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-10211 (URN)978-91-7415-290-6 (ISBN)
Presentation
2009-05-08, Sal D, Kungl Tekniska Högskolan, Isajordsgatan 39, Kista, Forum IT-Universitetet, 14:00 (English)
Opponent
Supervisors
Available from: 2009-04-15 Created: 2009-04-09 Last updated: 2010-11-01Bibliographically approved

Open Access in DiVA

No full text

Scopus

Authority records BETA

Haridi, Seif

Search in DiVA

By author/editor
Shafaat, Tallat M.Haridi, Seif
By organisation
Electronic, Computer and Software Systems, ECSSoftware and Computer Systems, SCS (Closed 20120101)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 36 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