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
DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications
RISE, Swedish ICT, SICS.
RISE, Swedish ICT, SICS, Computer Systems Laboratory.
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0002-6718-0144
2003 (English)In: Proceedings of the 3rd International Symposium on Cluster Computing and the Grid, 2003, 1, , p. 15Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network characterized by three parameters: N the maximum number of nodes that can be in the network; k the search arity within the network and f the degree of fault-tolerance. Once these parameters are instantiated, the resulting network has several desirable properties. The first property, which is the main contribution of this paper, is that there is no separate procedure for maintaining routing tables; instead, any out-of-date or erroneous routing entry is eventually corrected on the fly thereby, eliminating unnecessary bandwidth consumption. The second property is that each lookup request is resolved in at most logk(N) overlay hops under normal operations. Third, each node maintains only (k-1) logk(N) + 1 addresses of other nodes for routing purposes. Fourth, new nodes can join and existing nodes can leave at will with a negligible disturbance to the ability to resolve lookups in logk(N) hops in average. Fifth, the probability of getting a lookup failure for a pair key/value that was inserted in the system is negligible. Sixth, even if f consecutive nodes fail simultaneously, correct lookup is still guaranteed.

Place, publisher, year, edition, pages
2003, 1. , p. 15
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-22425DOI: 10.1109/CCGRID.2003.1199386ISBN: 0-7695-1919-9 (print)OAI: oai:DiVA.org:ri-22425DiVA, id: diva2:1041970
Conference
3rd International Symposium on Cluster Computing and the Grid , 12-15 May 2003, Tokyo, Japan
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Haridi, Seif
By organisation
SICSComputer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
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
v. 2.34.0