论文标题
De Bruijn和Kautz Digraphs的距离结构：分析和应用偏转路由（带有示例和备注）
Distance-layer structure of the De Bruijn and Kautz digraphs: analysis and application to deflection routing (with examples and remarks)
论文作者
论文摘要
在本文中，我们介绍了De Bruijn和Kautz Digraphs的距离距离结构的详细研究，并将分析应用于De Bruijn和Kautz网络中偏转路由的性能评估。关于距离层结构，我们就该结构的某些相关集的基础的基础性提供了明确的多项式表达式。关于叛逃路线的应用以及我们对距离结构的多项式描述的结果，我们根据二分法的程度制定了明确的有理表达式，以便在分析这种类型的路由时感兴趣的一些概率。 de Bruijn和Kautz Digraphs是字母和迭代线挖掘的基本示例。如果正在考虑的网络的拓扑与此类型的挖掘相对应，则我们可以原则上执行类似的顶点层描述。
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.
