This Article 
 Bibliographic References 
 Add to: 
On a Lightwave Network Topology Using Kautz Digraphs
October 1999 (vol. 48 no. 10)
pp. 1131-1138

Abstract—In this paper, the properties of Kautz digraphs are studied to evaluate their suitability as topology for optical networks. The properties are compared to those of other topologies proposed in the literature and it has been shown these topologies have better performance in terms of queuing delay in a multihop network. For a given degree of each node and a given diameter of the network, a Kautz digraph supports more nodes than other topologies, like shufflenet or that of using a de Bruijn digraph, and seems to be an attractive design for the physical topology as well.

[1] B. Mukherjee, “WDM-Based Local Lightwave Networks Part I: Single Hop Systems,” IEEE Network, vol. 6, pp. 12-27, May 1992.
[2] B. Mukherjee, “WDM-Based Local Lightwave Networks Part II: Multihop Systems,” IEEE Network, vol. 6, pp. 20-32, July 1992.
[3] A.S. Acampora, “A Multi-Channel Multihop Local Lightwave Network,” Proc. IEEE GLOBECOM '87, pp. 37.5.1-9, 1987.
[4] Z. Zhang and A.S. Acampora, “Analysis of Multihop Lghtwave Networks,” Proc. IEEE GLOBECOM '90, pp. 1,873-1,879, 1990.
[5] A.S. Acampora and M.J. Karol, “An Overview of Lightwave Packet Networks,” IEEE Network, vol. 3, pp. 29-41, Jan. 1989.
[6] M. Ajmone Marshan, A. Bianco, E. Leonardi, and F. Neri, “Topologies for Wavelength-Routing All-Optical Networks,” IEEE/ACM Trans. Networking, vol. 1, pp. 534-546, Oct. 1993.
[7] K.N. Sivarajan and R. Ramaswami, “Lightwave Networks based on de Bruijn Graphs,” IEEE/ACM Trans. Networking, vol. 2, pp. 70-79, Feb. 1994.
[8] J. Iness, S. Banerjee, and B. Mukherjee, “GEMNET: A Generalized Shuffle-Exchange-Based Regular, Scalable and Modular Multihop Network Based on WDM Lightwave Technology,” IEEE/ACM Trans. Networking, vol. 3, no. 4, Aug. 1995.
[9] W.H. Kautz, “Design of Optimal Interconnection Networks for Multiprocessors,” Architectures and Design of Digital Computers, NATO Advanced Summer Inst., pp. 249-272, 1969.
[10] J-C. Bermond, N. Homobono, and C. Peyrat, “Large Fault Tolerant Interconnection Networks,” Graphs and Combinatorics, vol. 5, pp. 107-123, 1989.
[11] C. Berge, Graphs and Hypergraphs. New York: North-Holland, 1973.
[12] W.G. Bridges and S. Toueg, “On the Impossibility of Directed Moore Graphs,” J. Combinatorial Theory B, vol. 29, pp. 339-341, 1980.
[13] S.W. Golomb, Shift Register Sequences. Aegean Park Press, 1982.
[14] A. Tanenbaum, Computer Networks. Prentice Hall, 1988.
[15] A. Venkateswaran and A. Sengupta, “On a Scalable Topology for Lightwave Networks,” Proc. IEEE INFOCOM '96, pp. 427-434, Mar. 1996.
[16] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[17] J.A. Bannister, L. Fratta, and M. Gerla, “Topological Design of the Wavelength-Division Optical Network,” Proc. IEEE INFOCOM '90, pp. 1,005-1,013, 1990.
[18] B. Mukherjee, S. Ramamurthy, D. Banerjee, and A. Mukherjee, “Some Principles for Designing a Wide-Area Optical Network,” Proc. IEEE INFOCOM '94, 1994.
[19] R. Ramaswami and K.N. Sivarajan, “Routing and Wavelength Assignment in All-Optical Networks,” Technical Report RC 19592, IBM Research Report, 1994.
[20] R. Ramaswami and K.N. Sivarajan, “Design of Logical Topologies for Wavelength Routed All-Optical Networks,” Proc. IEEE INFOCOM '95, pp. 1,316-1,325, 1995.

Index Terms:
Multihop network, WDM network, routing algorithm, blocking probability, logical topology.
Geetha Panchapakesan, Abhijit Sengupta, "On a Lightwave Network Topology Using Kautz Digraphs," IEEE Transactions on Computers, vol. 48, no. 10, pp. 1131-1138, Oct. 1999, doi:10.1109/12.805162
Usage of this product signifies your acceptance of the Terms of Use.