New directions in modelling, analysis and design of WDM/OFDM-networks: (I) Optical Switching

Abstract

Bearing in mind that a topological representation of a finite graph is a compact space, by the relationships between (Graph)Topology, Algebraic Topology, Group Theory, (Differential)Geometry and Combinatorics a new universe arises for modelling, analysis and design of (telecommunication) networks_ Throughout the present paper, coverings/covering spaces, the lifting problem and quotient graphs are briefly interpreted in terms of the requirements for the combinatorial design of optical switches though the presentation is mainly based on illustrations rather than on a (precise) mathematical description.

<title>Switch-setting algorithms for the optical N-gon prism switch</title>

“…The proposed multi-layer architectures have the capability to approach shuffle results if and only if (if) the intersection graph is a hypercube [2]. For example, the embedding of a 4-gon prism into another 4-gon prism and their interconnection (by switches) at the corners, establishes the Q 1(2 hypercube prism switch (Q 5 the 3-cube and is the Kronecker sum).…”

“…From the point of view of optics we feel (x) is preferred [29]. However, (all-optical) expanders and concentrators are needed in this case [2].…”

“…The N-gon prism switch may be considered as a starting point for a class of novel all-optical switching systems. The topological [2] and the combinatorial properties [3] of the N-gon prism switch have been briefly addressed. Additionally, the analysis of its physical properties has to be provided.…”