Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing
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 …
Bruijn and Kautz digraphs, and we apply our analysis to the performance evaluation of …
Monotonicity and performance evaluation: applications to high speed and mobile networks
A Bušić, JM Fourneau - Cluster Computing, 2012 - Springer
We illustrate through examples how monotonicity may help for performance evaluation of
networks. We consider two different applications of stochastic monotonicity in performance …
networks. We consider two different applications of stochastic monotonicity in performance …
Distance-layer structure of the De Bruijn and Kautz digraphs: analysis and application to deflection routing (with examples and remarks)
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 …
Bruijn and Kautz digraphs, and we apply our analysis to the performance evaluation of …
Transport time distribution for deflection routing on an odd torus
JM Fourneau, T Czachórski - Euro-Par 2005 Parallel Processing: 11th …, 2005 - Springer
We analyze the performance of all optical packet networks. As optical storage of packets is
not available, we assume that the routing protocol is based on deflection. This routing …
not available, we assume that the routing protocol is based on deflection. This routing …
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing
In the main part of this paper we present polynomial expressions for the cardinalities of
some sets of interest of the nice distance-layer structure of the well-known De Bruijn and …
some sets of interest of the nice distance-layer structure of the well-known De Bruijn and …
Performance evaluation of an optimal deflection routing algorithm on an odd torus
T Czachórski, JM Fourneau - Archiwum informatyki teoretycznej i …, 2004 - infona.pl
We analyze the performance of all optical packet networks. As optical storage of packets is
not available, we assume that the routing protocol is based on deflection. This routing …
not available, we assume that the routing protocol is based on deflection. This routing …
Level crossing ordering of Markov chains: computing end to end delays in an all optical network
We advocate the use of level crossing ordering of Markov chains and we present two
applications of this ordering to analyze the deflection routing in an all optical packet network …
applications of this ordering to analyze the deflection routing in an all optical packet network …