Fe b 20 05 Near Optimal Routing for Small-World Networks with Augmented Local Awareness

In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with longrange links chosen at random according to the d-harmonic distribution. Kleinberg shows that the greedy routing algorithm by using only local information performs in O(log n) expected number of hops, where n… (More)