Back to Search Start Over

Distance-layer structure of the De Bruijn and Kautz digraphs: analysis and application to deflection routing

Authors :
Universitat Politècnica de Catalunya. Departament de Matemàtiques
Universitat Politècnica de Catalunya. OMGRAPH - Optimisation Methods on Graphs
Fàbrega Canudas, José
Martí Farré, Jaume
Muñoz López, Francisco Javier
Universitat Politècnica de Catalunya. Departament de Matemàtiques
Universitat Politècnica de Catalunya. OMGRAPH - Optimisation Methods on Graphs
Fàbrega Canudas, José
Martí Farré, Jaume
Muñoz López, Francisco Javier
Publication Year :
2023

Abstract

This is the peer reviewed version of the following article: Fàbrega, J.; Martí, J.; Muñoz, X. Distance-layer structure of the De Bruijn and Kautz digraphs: analysis and application to deflection routing. "Networks", 29 Juliol 2023, which has been published in final form at https://onlinelibrary.wiley.com/doi/10.1002/net.22177. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited.<br />In this article, we present a detailed study of the reach distance-layer structure of the De Bruijn and Kautz digraphs, and we apply our analysis to the performance evaluation of deflection routing in De Bruijn and Kautz networks. Concerning the distance-layer structure, we provide explicit polynomial expressions, in terms of the degree of the digraph, for the cardinalities of some relevant sets of this structure. Regarding the application to defection routing, and as a consequence of our polynomial description of the distance-layer structure, we formulate explicit expressions, in terms of the degree of the digraph, for some probabilities of interest in the analysis of this type of routing. De Bruijn and Kautz digraphs are fundamental examples of digraphs on alphabet and iterated line digraphs. If the topology of the network under consideration corresponds to a digraph of this type, we can perform, in principle, a similar vertex layer description.<br />Partially supported by the Ministerio de Ciencia e Innovación/Agencia Estatal de Investigación, Spain, and the European Regional Development Fund under project PGC2018-095471-B-I00; and by AGAUR from the Catalan Government under project 2017SGR-1087.<br />Peer Reviewed<br />Postprint (author's final draft)

Details

Database :
OAIster
Notes :
application/pdf, English
Publication Type :
Electronic Resource
Accession number :
edsoai.on1409476786
Document Type :
Electronic Resource