Abstract

The algorithmic small-world phenomenon, empirically established by Milgram in the 60 s [1], was theoretically explained by Kleinberg in 2000 [2]. However, from today's perspective his model has several severe shortcomings that limit the applicability to real-world networks. In order to give a more convincing explanation, we study decentralized greedy routing in a random graph model (geometric inhomogeneous random graphs) which overcomes all previous shortcomings. We prove that greedy routing succeeds with constant probability, and in case of success almost surely finds an almost shortest path of length Θ(log⁡log⁡n), with stretch 1+o(1). Moreover, natural local patching methods ensure success probability 1, while maintaining the same stretch. These results also address the question whether there are efficient local routing protocols for the internet graph. Despite promising experimental studies the question remained unsolved theoretically. We give for the first time a rigorous, affirmative answer for a thoroughly validated model of the internet graph.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.