H P Thadakamalla et al 2007 New J. Phys. 9 190 doi:10.1088/1367-2630/9/6/190
H P Thadakamalla1,3, R Albert2 and S R T Kumara1
Show affiliationsPart of Focus on Complex Networked Systems: Theory and Application
We study the decentralized search problem in a family of parameterized spatial network models that are heterogeneous in node degree. We investigate several algorithms and illustrate that some of these algorithms exploit the heterogeneity in the network to find short paths by using only local information. In addition, we demonstrate that the spatial network model belongs to a classof searchable networks for a wide range of parameter space. Further, we test these algorithms on the US airline network which belongs to this class of networks and demonstrate that searchability is a generic property of the US airline network. These results provide insights on designing the structure of distributed networks that need effective decentralized search algorithms.
89.70.-a Information and communication theory
Issue 6 (June 2007)
Received 12 March 2007
Published 28 June 2007
H P Thadakamalla et al 2007 New J. Phys. 9 190
J Liang et al 1997 Distrib. Syst. Engng. 4 151
M E Gouvea et al 1990 J. Phys.: Condens. Matter 2 1853
J C Jaeger and J D Clarke 1949 J. Sci. Instrum. 26 155
Abhay Ashtekar 2005 New J. Phys. 7 198
C S Chen et al 2006 J. Opt. A: Pure Appl. Opt. 8 88
Matjaž Perc and Attila Szolnoki 2007 New J. Phys. 9 267
Gerhard C Hegerfeldt and Dirk G Sondermann 1996 Quantum Semiclass. Opt. 8 121
Nai-Jen Huan and Ramaswamy Palaniappan 2004 J. Neural Eng. 1 142
Brian R Hunt 1996 Nonlinearity 9 845