Subrange Caching: Handling Popular Range Queries in DHTs
Globe '08 Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Depth of field and cautious-greedy routing in social networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Oscar: small-world overlay for realistic key distributions
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Magnet: practical subscription clustering for Internet-scale publish/subscribe
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Hi-index | 0.00 |
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 outdegree. 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.