TY - JOUR
T1 - Space-efficient and fault-tolerant message routing in outerplanar networks
AU - Frederickson, Greg N.
AU - Janardan, Ravi
PY - 1988/12/1
Y1 - 1988/12/1
N2 - A fault-tolerant routing scheme for outerplanar networks is presented, that stores routing information succinctly and routes messages along near-shortest paths. For an n-node network containing t node and edge faults, the total space and communication is O(tαn) and the routings generated are within a factor of ((α + 1)/(α - 1))t of optimal, where α > 1 is an odd-value integer parameter. Thus, the routings can be tuned as desired. Efficient algorithms are given for setting up the routing scheme.
AB - A fault-tolerant routing scheme for outerplanar networks is presented, that stores routing information succinctly and routes messages along near-shortest paths. For an n-node network containing t node and edge faults, the total space and communication is O(tαn) and the routings generated are within a factor of ((α + 1)/(α - 1))t of optimal, where α > 1 is an odd-value integer parameter. Thus, the routings can be tuned as desired. Efficient algorithms are given for setting up the routing scheme.
UR - http://www.scopus.com/inward/record.url?scp=0024137402&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0024137402&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0024137402
SN - 0190-3918
VL - 3
SP - 282
EP - 289
JO - Proceedings of the International Conference on Parallel Processing
JF - Proceedings of the International Conference on Parallel Processing
ER -