The Eulerian stretch of a network topology and the ending guarantee of a convergence routing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Interconnection Networks Year : 2004

The Eulerian stretch of a network topology and the ending guarantee of a convergence routing

Dominique Barth
  • Function : Author
Pascal Berthomé
  • Function : Author
Johanne Cohen

Abstract

In this paper, we focus on convergence packet routing techniques in a network, obtained from an Eulerian routing in the digraph modeling the target network. Given an Eulerian circuit $\cal C$ in a digraph $G$, we consider the maximal number $diamW_{\cal C}$ of arcs that a packet has to follow on $\cal C$ from its origin to its destination (we talk about the {\em ending guarantee} of the routing). We consider the {\em Eulerian diameter of $G$} as defined by ${\cal E}(G)=\min\limits_{{\cal C}\in Eul(G)} diamW_{\cal C}$, where $Eul(G)$ is the set of all the Eulerian circuits in $G$. After giving a preliminary result about the complexity of finding ${\cal E}(G)$ for any digraph $G$, we give some lower and upper bounds of this parameter. We conclude by giving some families of digraphs having good Eulerian diameter.
No file

Dates and versions

inria-00108086 , version 1 (19-10-2006)

Identifiers

Cite

Dominique Barth, Pascal Berthomé, Johanne Cohen. The Eulerian stretch of a network topology and the ending guarantee of a convergence routing. Journal of Interconnection Networks, 2004, 5 (2), pp.93-109. ⟨10.1142/S0219265904001040⟩. ⟨inria-00108086⟩
52 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More