Short cut Eulerian routing of datagrams in all optical point-to-point networks

We describe routing functions for optical packets in point-to-point networks. These functions are based on Eulerian tours. We first define different measures to handle the efficiency of this routing. Then, we describe an algorithm to compute these measures. Moreover, we present such an Eulerian routing in the square mesh and prove that the induced paths are close to the optimal (shortest paths) ones. We also construct a large family of digraphs having an optimal Eulerian routing.