Change search
ReferencesLink to record
Permanent link

Direct link
On Small World Graphs in Non-uniformly Distributed Key Spaces
Ecole Polytechnique Fédérale de Lausanne (EPFL).
Ecole Polytechnique Fédérale de Lausanne (EPFL).
Ecole Polytechnique Fédérale de Lausanne (EPFL).
2005 (English)In: Proceedings - International Workshop on Biomedical Data Engineering, BMDE2005, 2005Conference paper (Refereed)
Abstract [en]

In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg's small-world model [7] we extend the model of building "routing-efficient" small-world graphs and propose two new models. We show that the graph, constructed according to our model for uniform key distribution and logarithmic outdegree, will have similar properties as the topologies of structured P2P systems with logarithmic out-degree. Moreover, we propose a novel model of building graphs which support uneven node distributions and preserves all desired properties of Kleinberg's small-world model. With such a model we are setting a reference base for nowadays emerging P2P systems that need to support uneven key distributions

Place, publisher, year, edition, pages
Keyword [en]
Distributed hash tables, Routing, Small-world graphs, Storage load balancing
National Category
Computer Systems
URN: urn:nbn:se:kth:diva-109827DOI: 10.1109/ICDE.2005.254OAI: diva2:584714
21st International Conference on Data Engineering Workshops 2005

QC 20130610

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

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Girdzijauskas, Sarunas
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 11 hits
ReferencesLink to record
Permanent link

Direct link