Maximum-shortest-path (MSP) is not optimal for a general N × N torus

IEEE Transactions on Reliability

Volumn 52, Issue 1, 2003, Pages 22-25

  Sheng, Li ^a   Wu, Jie ^b  

^a DREXEL UNIVERSITY   (United States)

^b Florida Atlantic University   (United States)

Author keywords

Mesh; Optimality; Probability; Shortest path routing; Torus

Indexed keywords

MATHEMATICAL MODELS; PROBABILITY; VECTORS;

SHORTEST PATH ROUTING;

FUNCTIONS;

EID: 0037333171     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2002.807240     Document Type: Article

References (3)

1. S. Badr and P. Podar, "An optimal SPR policy for network computers with regular mesh-connected topologies," IEEE Trans. Comput., vol. 38, no. 10, pp. 1362-1371, Oct. 1989.
2. T. Weller and B. Hajek, "Comments on: An optimal shortest-path routing policy for network computers with regular mesh-connected topologies," IEEE Trans. Comput., vol. 43, no. 7, pp. 862-864, July 1994.
3. J. Wu, "Maximum-shortest-path (MSP): An optimal shortest-path routing policy for network computers with regular mesh-connected topologies," IEEE Trans. Rel., vol. 48, no. 3, pp. 247-255, Sept. 1999.