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)
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
Communications of the ACM
A New Network Topology with Multiple Meshes
IEEE Transactions on Computers
Multi-Mesh-an efficient topology for parallel processing
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
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
Wormhole Routing for Complete Exchange in Multi-Mesh
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
A new scalable optimal topology for multi-hop optical networks
Computer Communications
Hi-index | 0.24 |
In this paper, we propose two different architectures, the multi-mesh (MM) and the incomplete multi-mesh (IMM), for use in wavelength division multiplexed optical networks. These architectures can be deployed as a physical topology for single hop or a logical topology for multihop networks. In terms of simplicity of interconnection and routing, these architectures are comparable to the regular mesh and the torus networks. However, the new architectures exhibit significantly superior topological properties than the mesh and the torus. For example, whereas a two-dimensional torus with N nodes has a diameter of @Q(N^0^.^5), an MM network with the same number of nodes and links has a diameter of @Q(N^0^.^2^5). The IMM can be constructed for any number of nodes and is incrementally expandable. We provide results of our simulation studies for the call blocking probabilities for the MM network. The advantage of the IMM over the de Bruijn network lies in the fact that unlike the de Bruijn network, this network can be constructed for any number of nodes and is incrementally expandable.