Kleinberg's Grid Reloaded - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Kleinberg's Grid Reloaded


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.
Fichier principal
Vignette du fichier
OPODIS2016-camera-ready-paper90.pdf (281.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01417096 , version 1 (15-12-2016)


Attribution - CC BY 4.0



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⟩


223 View
129 Download



Gmail Facebook Twitter LinkedIn More