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
Dealing with network partitions in structured overlay networks
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, Software and Computer Systems, SCS.ORCID iD: 0000-0002-6718-0144
2009 (English)In: Peer-to-Peer Networking and Applications, ISSN 1936-6442, Vol. 2, no 4, 334-347 p.Article in journal (Refereed) Published
Abstract [en]

Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. These systems have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this paper, we present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

Place, publisher, year, edition, pages
2009. Vol. 2, no 4, 334-347 p.
Keyword [en]
DHTs, Distributed hash tables, Loopy rings, Network mergers, Network partitions, Structured overlay networks
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-25807DOI: 10.1007/s12083-009-0037-7ISI: 000284092500005Scopus ID: 2-s2.0-70350616363OAI: oai:DiVA.org:kth-25807DiVA: diva2:359925
Note
QC 20101101Available from: 2010-11-01 Created: 2010-11-01 Last updated: 2012-01-18Bibliographically 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

Other links

Publisher's full textScopus

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
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 55 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