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
Key-based consistency and availability 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
Show others and affiliations
2008 (English)In: Proceedings of the 17th International Symposium on High Performance Distributed Computing 2008, HPDC'08, 2008, 235-236 p.Conference paper, Published paper (Refereed)
Abstract [en]

Structured Overlay Networks (SONs) provide a promising platform for high performance applications since they are scalable, fault-tolerant and self-managing. SONs provide lookup services that map keys to nodes that can be used as processing or storage resources. In SONs, lookups for a key may return inconsistent results. Consequently, it is difficult to provide consistent data services on top of SONs that build on key-based search. In this paper, we study the frequency of occurrence of inconsistent lookups. We show that the affect of lookup inconsistencies can be reduced by using node responsibilities. We present our results as a trade-off between consistency and availability of keys.

Place, publisher, year, edition, pages
2008. 235-236 p.
Keyword [en]
Key-availability, Lookup consistency, Peer-to-peer systems, Structured overlay networks
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-25810Scopus ID: 2-s2.0-57349084604ISBN: 978-159593997-5 (print)OAI: oai:DiVA.org:kth-25810DiVA: diva2:359929
Conference
17th International Symposium on High Performance Distributed Computing 2008, HPDC'08; Boston, MA; 23 June 2008 through 27 June 2008
Note
QC 20101101Available from: 2010-11-01 Created: 2010-11-01 Last updated: 2010-11-01Bibliographically 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
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

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