Distance-layer structure of the De Bruijn and Kautz digraphs: analysis and application to deflection routing (with examples and remarks)

TL;DR

This paper analyzes the distance-layer structure of De Bruijn and Kautz digraphs, providing explicit formulas and applying the results to evaluate deflection routing performance in such networks.

Contribution

It offers explicit polynomial and rational expressions for the distance-layer structure and routing probabilities in De Bruijn and Kautz digraphs, enhancing network analysis tools.

Findings

Explicit formulas for distance-layer cardinalities

Rational expressions for routing probabilities

Application to network performance evaluation

Abstract

In this paper, 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 rational 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.