Routing properties of a recursive interconnection network

DOI10.1006/JPDC.2001.1729MaRDI QIDQ5943256zbMATH OpenOpenAlexFDO

Authors Rocky K. C. Chang, Hong Y. Wang

Publication date 14 August 2002

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

Full work available at URL https://doi.org/10.1006/jpdc.2001.1729

zbMATH Keywords

fully connected cubic network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• An oblivious shortest-path routing algorithm for fully connected cubic networks
• scientific article; zbMATH DE number 436070
• Recursive cubes of rings as models for interconnection networks
• scientific article; zbMATH DE number 1548173
• Construction of large‐size interconnection networks with high performance

Cited in

(10)

• On recurrent and recursive interconnection patterns
• Routing in series parallel networks
• Recurrence method of teletraffic evaluation in series-parallel telecommunication nets
• An oblivious shortest-path routing algorithm for fully connected cubic networks
• scientific article; zbMATH DE number 436070 (Why is no real title available?)
• scientific article; zbMATH DE number 1548173 (Why is no real title available?)
• scientific article; zbMATH DE number 949034 (Why is no real title available?)
• scientific article; zbMATH DE number 2104199 (Why is no real title available?)
• Routing properties of supercubes
• Recursive construction of parallel distribution networks

This page was built for publication: Routing properties of a recursive interconnection network

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