scientific article; zbMATH DE number 1990700

MaRDI QIDQ4430867zbMATH OpenFDO

Authors Li Sheng, Yufei Wang, Jie Wu

Publication date 13 October 2003

zbMATH Keywords

hypercubesreliability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)

Recommendations

• ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES
• An optimal shortest-path routing policy for network computers with regular mesh-connected topologies
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• Optimal routing algorithms for mesh-connected processor arrays
• Computing optimal shortcuts for networks
• Computing optimal shortcuts for networks
• Complexity of pairwise shortest path routing in the grid
• Shortest route computation in distributed systems
• Shortest-Path Routing in Arbitrary Networks

Cited in

(3)

• There is no optimal routing policy for the torus.
• ON ACHIEVING THE SHORTEST-PATH ROUTING IN 2-D MESHES
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS

This page was built for publication:

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