Kleinberg's Grid Reloaded

Abstract : One of the key features of small-worlds is the ability to route messages with few hops only using local knowledge of the topology. In 2000, Kleinberg proposed a model based on an augmented grid that asymptotically exhibits such property. In this paper, we propose to revisit the original model from a simulation-based perspective. Our approach is fueled by a new algorithm that uses dynamic rejection sampling to draw augmenting links. The speed gain offered by the algorithm enables a detailed numerical evaluation. We show for example that in practice, the augmented scheme proposed by Kleinberg is more robust than predicted by the asymptotic behavior, even for very large finite grids. We also propose tighter bounds on the performance of Kleinberg's routing algorithm. At last, we show that fed with realistic parameters, the model gives results in line with real-life experiments.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01417096
Contributor : Fabien Mathieu <>
Submitted on : Thursday, December 15, 2016 - 11:57:15 AM
Last modification on : Thursday, October 17, 2019 - 12:36:05 PM
Long-term archiving on : Thursday, March 16, 2017 - 5:57:52 PM

Files

OPODIS2016-camera-ready-paper9...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Relations

Citation

Fabien Mathieu. Kleinberg's Grid Reloaded. 20th International Conference on Principles of Distributed Systems (OPODIS 2016), Dec 2016, Madrid, Spain. ⟨10.4230/LIPIcs.OPODIS.2016.21⟩. ⟨hal-01417096⟩

Share

Metrics

Record views

347

Files downloads

122