Computer networks
Topologies for wavelength-routing all-optical networks
IEEE/ACM Transactions on Networking (TON)
Lightwave networks based on de Bruijn graphs
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Shift Register Sequences
Design of logical topologies for wavelength-routed all-optical networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Graphs and Hypergraphs
On a scalable topology for lightwave networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms
IEEE Transactions on Computers
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
KCube: A novel architecture for interconnection networks
Information Processing Letters
Theory and network applications of balanced kautz tree structures
ACM Transactions on Internet Technology (TOIT)
Tide: An effective and practical design for hierarchical-structured P2P model
Computer Communications
Binomial graph: a scalable and fault-tolerant logical network topology
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
KMcube: the compound of Kautz digraph and Möbius cube
Frontiers of Computer Science: Selected Publications from Chinese Universities
L24: Parallelism, performance, energy efficiency, and cost trade-offs in future sensor platforms
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 14.98 |
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.