Title :
Short cut Eulerian routing of datagrams in all optical point-to-point networks
Author :
Laforest, C. ; Vial, S.
Author_Institution :
LaMI, Univ. d´Evry, Evry, France
Abstract :
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.
Keywords :
multiprocessor interconnection networks; optical fibre LAN; telecommunication network routing; trees (mathematics); Eulerian routing; Eulerian tours; datagrams; optical network routing; optical packet routing; optical point-to-point networks; routing functions; short cut routing; square mesh graph; tree; All-optical networks; Costs; Intelligent networks; Optical design; Optical fiber networks; Physical layer; Read only memory; Routing; Telecommunication traffic; Traffic control;
Conference_Titel :
Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM
Conference_Location :
Ft. Lauderdale, FL
Print_ISBN :
0-7695-1573-8
DOI :
10.1109/IPDPS.2002.1015518
