| | |
Summary: On Small World Graphs in Non-uniformly Distributed Key Spaces
Sarunas Girdzijauskas, Anwitaman Datta, Karl Aberer
Ecole Polytechnique F´ed´erale de Lausanne (EPFL)
School of Computer and Communication Sciences
CH-1015 Lausanne, Switzerland
Email: {sarunas.girdzijauskas, anwitaman.datta, karl.aberer}@epfl.ch
Abstract
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 Klein-
berg's small-world model [7] we extend the model of build-
ing "routing-efficient" small-world graphs and propose
two new models. We show that the graph, constructed ac-
cording to our model for uniform key distribution and log-
arithmic 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 pre-
serves all desired properties of Kleinberg's small-world
model. With such a model we are setting a reference base
|
