Abstract
Navigation plays a pivotal role in the operation of real-world complex networks. In this paper, we delve into the extensive realm of the ’store and forward’ principle, comprising two fundamental components: the addressing scheme for network nodes and the routing function responsible for establishing paths between network endpoints. Particularly, we show that the hyperbolic geometry of complex networks can be used to greatly improve the orderliness of navigation patterns in complex networks implementing the store and forward principle. By using entropy-based measures applied on the forwarding tables we provide a formal assessment for the orderliness which can also be used to estimate the memory requirements of navigation directly at individual nodes and in the whole network.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Allard, A., Serrano, M.Á.: Navigable maps of structural brain networks across species. PLoS Comput. Biol. 16(2), e1007584 (2020)
Boguná, M., Papadopoulos, F., Krioukov, D.: Sustaining the internet with hyperbolic mapping. Nat. Commun. 1(1), 62 (2010)
Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoret. Comput. Sci. 372(1), 115–121 (2007)
Gulyás, A., Rétvári, G., Heszberger, Z., Agarwal, R.: On the scalability of routing with policies. IEEE/ACM Trans. Networking 23(5), 1610–1618 (2014)
Kőrösi, A., Gulyás, A., Heszberger, Z., Bíró, J., Rétvári, G.: On the memory requirement of hop-by-hop routing: tight bounds and optimal address spaces. IEEE/ACM Trans. Networking 28(3), 1353–1363 (2020)
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguná, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)
Papadopoulos, F., Kitsak, M., Serrano, M.Á., Boguná, M., Krioukov, D.: Popularity versus similarity in growing networks. Nature 489(7417), 537–540 (2012)
Papadopoulos, F., Psomas, C., Krioukov, D.: Network mapping by replaying hyperbolic growth. IEEE/ACM Trans. Networking 23(1), 198–211 (2014)
Rétvári, G., Tapolcai, J., Kőrösi, A., Majdán, A., Heszberger, Z.: Compressing IP forwarding tables: towards entropy bounds and beyond. In: Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, pp. 111–122 (2013)
Voitalov, I., Aldecoa, R., Wang, L., Krioukov, D.: Geohyperbolic routing and addressing schemes. ACM SIGCOMM Comput. Commun. Rev. 47(3), 11–18 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ficzere, D., Hollósi, G., Frankó, A., Varga, P., Biró, J. (2024). Orderliness of Navigation Patterns in Hyperbolic Complex Networks. In: Cherifi, H., Rocha, L.M., Cherifi, C., Donduran, M. (eds) Complex Networks & Their Applications XII. COMPLEX NETWORKS 2023. Studies in Computational Intelligence, vol 1143. Springer, Cham. https://doi.org/10.1007/978-3-031-53472-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-031-53472-0_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53471-3
Online ISBN: 978-3-031-53472-0
eBook Packages: EngineeringEngineering (R0)