Digraph Isomorphisms and Free Space Optical Networks

David Coudert (1) , Afonso Ferreira (1) , Stéphane Pérennes (1)

1 SLOOP - Simulation, Object Oriented Languages and Parallelism

The de Bruijn digraph B(d,D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed. In this paper, we show that any digraph defined on words and alphabets of the same size, through an arbitrary permutation on the alphabet and an arbitrary permutation on the word indices, is isomorphic to the de Bruijn, provided that this latter permutation is cyclic. As an application, we recall that it is known that the Optical Transpose Interconnection System from UCSD can implement the de Bruijn interconnections for n$ nodes, for a fixed d, with O(n) lenses. We show here how to improve this hardware requirement to $\Theta(\sqrtn)$.\\

Mots clés: DISTRIBUTED SYSTEMS; OPTICAL NETWORKS; FREE SPACE OF OPTICAL INTERCONNECTIONS; OPTICAL TRANSPOSE INTERCONNECTION SYSTEM; DE BRUIJN; GRAPH ISOMORPHISMS; DIGRAPHS

Domaines: Autre [cs.OH]

David Coudert, Afonso Ferreira, Stéphane Pérennes. Digraph Isomorphisms and Free Space Optical Networks. [Research Report] RR-3817, INRIA. 1999. ⟨inria-00072841⟩