New Directions in Modelling, Analysis and Design of WDM/OFDM-Networks: (I) Optical Switching

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.

[1]  Frank Harary,et al.  Which trees are link graphs? , 1980, J. Comb. Theory, Ser. B.

[2]  A. Yavuz Oruç,et al.  Designing Cellular Permutation Networks through Coset Decompositions of Symmetric Groups , 1987, J. Parallel Distributed Comput..

[3]  R. M. Tanner.  Explicit Concentrators from Generalized N-Gons , 1984 .

[4]  William S. Massey,et al.  Algebraic Topology: An Introduction , 1977 .

[5]  D. A. Waller,et al.  Kronecker Products and Local Joins of Graphs , 1977, Canadian Journal of Mathematics.

[6]  M. Hofmeister.  Counting double covers of graphs , 1988, J. Graph Theory.

[7]  D. Djoković,et al.  Automorphisms of graphs and coverings , 1974 .

[8]  N. Biggs.  Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[9]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[10]  R A Spanke,et al.  N-stage planar optical permutation network. , 1987, Applied optics.

[11]  Tomaz Pisanski,et al.  Edge-colorability of graph bundles , 1983, J. Comb. Theory, Ser. B.

[12]  Emilio Leonardi,et al.  De Bruijn topologies for self-routing all-optical networks , 1993, Optics & Photonics.

[13]  Karl N. Levitt,et al.  Cellular Interconnection Arrays , 1968, IEEE Transactions on Computers.

[14]  Josef Giglmayr.  Novel all-optical planar and compact minimum-stage switches of size >= 4x4 , 1997, Optics East.

[15]  Gunnar E. Carlsson,et al.  Interconnection Networks Based on a Generalization of Cube-Connected Cycles , 1985, IEEE Transactions on Computers.

[16]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[17]  Josef Giglmayr.  Kautz topologies for all-optical self-routing networks , 1995, Other Conferences.

[18]  Dana Angluin,et al.  Finite common coverings of pairs of regular graphs , 1981, J. Comb. Theory B.

[19]  Sungpyo Hong,et al.  Regular fourfold coverings with respect to the identity automorphism , 1993, J. Graph Theory.

[20]  D. A. Waller,et al.  Antipodal Embeddings of Graphs , 1977 .

[21]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[22]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[23]  Josef Giglmayr.  Rearrangeability and Connectivity of Multistage Interconnection Networks with Nearest-Neighbour Interconnections , 1994 .

[24]  D. A. Waller.  Double covers of graphs , 1976, Bulletin of the Australian Mathematical Society.

[25]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[26]  Shengming Jiang,et al.  Regular multicast multihop lightwave networks , 1995, Proceedings of INFOCOM'95.