Journal article
Maximum-shortest-path (MSP) is not optimal for a general N N torus
IEEE transactions on reliability, v 52(1)
01 Jan 2003
Abstract
A shortest-path routing is optimal if it maximizes the probability of reaching the destination from a given source, assuming that each link in the system has a given failure probability. An approximation for the shortest-path routing policy, maximum-shortest-path (MSP) routing was proposed by Wu (see ibid., vol.48, no.3, p.247-55, 1999). Wu shows that: MSP is optimal in the mesh and hypercube networks; MSP is at least suboptimal in the torus network; MSP is optimal for 6 6 and 8 8 tori; and conjectured that MSP is optimal for 2-D tori in general. This short paper shows that, contrary to the claims by Wu, MSP is not optimal for a general N N torus-specifically, MSP is not optimal for a 12 12 torus, and its optimal routing depends on the success probability.
Metrics
Details
- Title
- Maximum-shortest-path (MSP) is not optimal for a general N N torus
- Creators
- Li ShengJie Wu
- Publication Details
- IEEE transactions on reliability, v 52(1)
- Publisher
- The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Web of Science ID
- WOS:000181104200009
- Scopus ID
- 2-s2.0-0037333171
- Other Identifier
- 991014878549004721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Computer Science, Hardware & Architecture
- Computer Science, Software Engineering
- Engineering, Electrical & Electronic