论文信息 - Kautz topologies for all-optical self-routing networks

Kautz topologies for all-optical self-routing networks

Kautz directed graphs (digraphs) arise from larger de Bruijn digraphs by the deletion of nodes or from smaller de Bruijn digraphs by additional nodes, respectively. Thus all-optical self- routing networks with Kautz topologies have different properties compared with de Bruijn. Kautz digraphs may be extended by their sum and product graphs and contain planar (crossover-free) embeddings.

Josef Giglmayr

[1] Jean-Claude Bermond,et al. Extensions of networks with given diameter , 1989, Discret. Math..

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

[3] Kumar N. Sivarajan,et al. Lightwave networks based on de Bruijn graphs , 1994, TNET.

[4] Jean-Claude Bermond,et al. Large fault-tolerant interconnection networks , 1989, Graphs Comb..

[5] Paul J.M. Havinga,et al. An algorithm for generating node disjoint routes in Kautz digraphs , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[6] Marco Ajmone Marsan,et al. Topologies for wavelength-routing all-optical networks , 1993, TNET.

[7] Abhijit Sengupta,et al. On multihop optical network topology using Kautz digraphs , 1995, Proceedings of INFOCOM'95.

[8] Miguel Angel Fiol,et al. Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.

[9] Makoto Imase,et al. Fault-tolerant processor interconnection networks , 1986, Systems and Computers in Japan.

[10] Tse-yun Feng,et al. A Survey of Interconnection Networks , 1981, Computer.

[11] Dhiraj K. Pradhan,et al. The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[12] Denise Amar. On the Connectivity of Some Telecommunications Networks , 1983, IEEE Transactions on Computers.