Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • 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 (Engelska)Ingår i: The 4th IEEE International Conference on Peer-to-Peer Computing, proceedings, 2004, s. 159-166Konferensbidrag, Publicerat paper (Refereegranskat)
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).

Ort, förlag, år, upplaga, sidor
2004. s. 159-166
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:kth:diva-109820ISI: 000223904300019OAI: oai:DiVA.org:kth-109820DiVA, id: diva2:584666
Konferens
4th International Conference on Peer-to-Peer Computing (P2P2004)
Anmärkning

QC 20130610

Tillgänglig från: 2013-01-09 Skapad: 2013-01-09 Senast uppdaterad: 2013-06-10Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Sök vidare i DiVA

Av författaren/redaktören
Girdzijauskas, Sarunas
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 36 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf