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
On de Bruijn routing in distributed hash tables: There and back again
Swiss Federal Institute of Technology Lausanne.
Swiss Federal Institute of Technology Lausanne.ORCID iD: 0000-0003-4516-7317
Swiss Federal Institute of Technology Lausanne.
2004 (English)In: The 4th IEEE International Conference on Peer-to-Peer Computing, proceedings, 2004, 159-166 p.Conference paper, Published paper (Refereed)
Abstract [en]

We show in this paper that de Bruijn networks, despite providing efficient search while using constant routing table size, as well as simplicity of the understanding and implementation of such networks, are unsuitable where key distribution will be uneven, a realistic scenario for most practical applications. In presence of arbitrarily skewed data distribution, it has only recently been shown that some traditional P2P overlay networks with non-constant (typically logarithmic) instead of constant routing table size can meet conflicting objectives of storage load balancing as well as search efficiency. So this paper while showing that de Bruijn networks fail, to meet these dual objectives, opens up a more general problem for the research community as to whether P2P systems with constant routing table can at all achieve the conflicting objectives of retaining search efficiency as well as storage load balancing, while preserving key ordering (which leads to uneven key distribution).

Place, publisher, year, edition, pages
2004. 159-166 p.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-109820ISI: 000223904300019OAI: oai:DiVA.org:kth-109820DiVA: diva2:584666
Conference
4th International Conference on Peer-to-Peer Computing (P2P2004)
Note

QC 20130610

Available from: 2013-01-09 Created: 2013-01-09 Last updated: 2013-06-10Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Girdzijauskas, Sarunas
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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