An oblivious shortest-path routing algorithm for fully connected cubic networks

DOI10.1016/J.JPDC.2006.03.008MaRDI QIDQ2433302zbMATH OpenOpenAlexFDO

Authors Xiaofan Yang, Graham M. Megson, D. J. Evans

Publication date 27 October 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2006.03.008

zbMATH Keywords

fully connected cubic networkhierarchical interconnection networkinterconnection networkrouting algorithmshortest path

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• Routing properties of a recursive interconnection network
• Shortest-Path Routing in Arbitrary Networks
• A class of hierarchical graphs as topologies for interconnection networks
• A routing solution of FC_n
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS

Cited in

(6)

• A routing solution of FC_n
• A cubic-time algorithm for computing the trinet distance between level-1 networks
• Routing properties of a recursive interconnection network
• The generalized 3-connectivity of a family of regular networks
• An efficient algorithm to construct disjoint path covers of DCell networks
• A class of hierarchical graphs as topologies for interconnection networks

This page was built for publication: An oblivious shortest-path routing algorithm for fully connected cubic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433302)