COHEN , Johanne

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...

Le problème considéré intervient dans le cadre de la diffusion à un groupe de gros volumes de données. L'objectif de ce travail est de trouver un schéma de communication qui minimise le coût total.

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...

In this paper, we compare the use of two packets models in slotted optical ring networks: a model where each message has to be routed in consecutive slots, and a model where the slots can be routed independently. We first focus on the algorithmic complexity of the related problems. Then, we give the results we obtain with an OMNET simulator in...