1. THE EULERIAN STRETCH OF A NETWORK TOPOLOGY AND THE ENDING GUARANTEE OF A CONVERGENCE ROUTING.
- Author
-
BARTH, DOMINIQUE, BERTHOME, PASCAL, and COHEN, JOHANNE
- Subjects
- *
COMPUTER networks , *TOPOLOGY , *NETWORK routers , *TELECOMMUNICATION systems , *PACKET switching (Data transmission) , *COMPUTER science , *DATA transmission systems - Abstract
In this paper, we focus on convergence packet routing techniques in an all-optical network, obtained from an Eulerian routing in the digraph modeling the target network. Given an Eulerian circuit C in a digraph C, we deal with the maximal number diamWC of arcs that a packet has to follow on C from its origin to its destination (we talk about the ending guarantee of the routing). We consider the Eulerian diameter of C as defined by E(C) = mm C ∈ Eul(G) diamWc, where E(G) is the set of all the Eulerian circuits in C. After giving a preliminary result about the complexity of finding ((C) for any digraph G, we give some lower and upper bounds of this parameter. The main part of the paper is devoted to the description of a combinatorial design of various network topologies having good Eulerian diameters. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF