IEEE Transactions on Parallel and Distributed Systems
On a Lightwave Network Topology Using Kautz Digraphs
IEEE Transactions on Computers
IEEE Transactions on Computers
The Mcube: a symmetrical cube based network with twisted links
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Cycloid: a constant-degree and lookup-efficient P2P overlay network
Performance Evaluation - P2P computing systems
DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems
IEEE Transactions on Parallel and Distributed Systems
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Dcell: a scalable and fault-tolerant network structure for data centers
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
VOVO: VCR-Oriented Video-on-Demand in Large-Scale Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
KCube: A novel architecture for interconnection networks
Information Processing Letters
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph
Information Processing Letters
Leveraging a Compound Graph-Based DHT for Multi-Attribute Range Queries with Performance Analysis
IEEE Transactions on Computers
Hi-index | 0.00 |
This paper introduces a novel interconnection network called KMcube (Kautz-Möbius cube). KMcube is a compound graph of a Kautz digraph and Möbius cubes. That is, it uses the Möbius cubes as the unit cluster and connects many such clusters by means of a Kautz digraph at the cost of only one additional arc being added to any node in each Möbius cubes. The topological benefits of both basic graphs are preserved in the compound network. It utilizes the topological properties of Möbius cubes to conveniently embed parallel algorithms into each cluster and the short diameter of a Kautz digraph to support efficient inter-cluster communication. Additionally, KMcube provides other attractive properties, such as the regularity, symmetry, and expandability. The proposed methodology for KMcube is further applied to the compound graphs of Kautz digraph and other Möbius-like graphs with the similar diameter to a Möbius cube. Moreover, other hybrid graphs of Kautz digraph and Möbius cubes are proposed and compared.