ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
On multihop optical network topology using Kautz digraphs
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Multiwavelength lightwave networks for computer communication
IEEE Communications Magazine
The LAMBDANET multiwavelength network: architecture, applications, and demonstrations
IEEE Journal on Selected Areas in Communications
A simple adaptive routing scheme for congestion control in ShuffleNet multihop lightwave networks
IEEE Journal on Selected Areas in Communications
Performance of the multichannel multihop lightwave network under nonuniform traffic
IEEE Journal on Selected Areas in Communications
Applications of public gigabit networks
IEEE Network: The Magazine of Global Internetworking
WDM-based local lightwave networks. I. Single-hop systems
IEEE Network: The Magazine of Global Internetworking
WDM-based local lightwave networks. II. Multihop systems
IEEE Network: The Magazine of Global Internetworking
An overview of lightwave packet networks
IEEE Network: The Magazine of Global Internetworking
Optimal node placement in an optical packet switching Manhattan street network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multipoint-to-point lightpaths in all-optical networks: Dimensioning and cost analysis
Performance Evaluation
An holistic framework for regular virtual topology design
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.24 |
In this paper, we propose Kautz graphs as attractive logical topologies for multihop WDM lightwave networks. Logical topologies proposed in the literature include the ShuffleNet, De Bruijn graph, Manhattan Street Network, and Hypercube. We show that for a given nodal in-degree and out-degree and average number of hops between stations, a network based on Kautz graphs can support a much larger number of stations than competing topologies (ShuffleNet and De Bruijn networks). Our experimental and analytical results show that despite its larger size (more number of stations), a Kautz graph based network shows similar delay and throughput performance as a De Bruijn graph based network. Further, a topology based on Kautz graph has more uniform optical channel loading and utilizes the installed network capacity more efficiently than a De Bruijn network. In addition, fault tolerance properties of Kautz graphs are better than those of De Bruijn graphs. To deal with non-uniform and asymmetric traffic, an adaptive routing scheme is proposed for Kautz networks, which relieves the network of congestion bottlenecks resulting from non-uniform traffic. Finally, we give the VLSI design and layout a router for Kautz graph-based networks using OASIS (Open Architecture Silicon Implementation Software).