Abstract
In this paper we study a new random graph model that we denote (\(\kappa ,\pi \))-KG and new greedy routing algorithms (of deterministic and probabilistic nature). The (\(\kappa ,\pi \))-KG graphs have power-law degree distribution and small-world properties. (\(\kappa ,\pi \))-KG roots on the Geometric Inhomogeneous Random Graph (GIRG) model, and hence they both preserve the properties of the hyperbolic graphs and avoid the problems of using hyperbolic cosines. In order to construct (\(\kappa ,\pi \))-KG graphs, we introduce two parameters \(\kappa \) and \(\pi \) in the process of building a (\(\kappa ,\pi \))-KG graph. With these parameters we can generate Kleinberg and power-law networks as especial cases of (\(\kappa ,\pi \))-KG. Also, we propose two new greedy routing algorithms to reduce the fail ratio and maintaining a good routing performance. The first algorithm is deterministic and the second is, in essence, a weighted random walk. We use simulation techniques to test our network model, and evaluate the new routing algorithms on the two graph models (GIRG and (\(\kappa ,\pi \))-KG). In our simulations, we evaluate the number of hops to reach a destination from a source and the routing fail ratio, and measure the impact of the parameters (\(\kappa \) and \(\pi \)) on the performance of the new routing algorithms. We observe that our graph model (\(\kappa ,\pi \))-KG is more flexible than GIRG, and the new routing algorithms have better performance than the routing algorithms previously proposed.
This submission is a short paper. This work was partially funded by the Spanish grant TIN2017-88749-R (DiscoEdge), the Region of Madrid EdgeData-CM program (P2018/TCS-4499), and the NSF of China grant 61520106005.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A geographic algorithm routes a message to the neighbor closest to the destination.
- 2.
All links are considered bidirectional.
- 3.
The distance can be Euclidean, Manhattan, or based on the \(\infty -norm\).
- 4.
The next hop is chosen with probability inversely proportional to the distance to the destination.
References
Boguná, M., Papadopoulos, F., Krioukov, D.: Sustaining the internet with hyperbolic mapping. Nat. Commun. 1(62), 1–8 (2010)
Bringmann, K., Keusch, R., Lengler, J.: Geometric inhomogeneous random graphs. Theor. Comput. Sci. 760, 35–54 (2019)
Bringmann, K., Keusch, R., Lengler, J., Maus, Y., Molla, A.R.: Greedy routing and the algorithmic small-world phenomenon. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, New York, NY, USA, pp. 371–380. ACM (2017)
Cassagnes, C., Tiendrebeogo, T., Bromberg, D., Magoni, D.: Overlay addressing and routing system based on hyperbolic geometry. In: IEEE Symposium on Computers and Communications (ISCC), pp. 294–301 (2011)
Chung, F., Linyuan, L.: The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. 99(25), 15879–15882 (2002)
Chung, F., Linyuan, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6(2), 125–145 (2002)
Kleinberg, J.M.: Navigation in a small world. Nature 406(6798), 845 (2000)
Kleinberg, R.: Geographic routing using hyperbolic space. In: IEEE INFOCOM 2007–26th IEEE International Conference on Computer Communications, pp. 1902–1909 (2007)
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguñá, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82, 036106 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Sevilla, A., Fernández Anta, A. (2021). Routing in Generalized Geometric Inhomogeneous Random Graphs. In: Georgiou, C., Majumdar, R. (eds) Networked Systems. NETYS 2020. Lecture Notes in Computer Science(), vol 12129. Springer, Cham. https://doi.org/10.1007/978-3-030-67087-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-67087-0_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67086-3
Online ISBN: 978-3-030-67087-0
eBook Packages: Computer ScienceComputer Science (R0)