Space-efficient and fault-tolerant message routing in outerplanar networks

Greg N. Frederickson, Ravi Janardan

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)282-289
Number of pages8
JournalProceedings of the International Conference on Parallel Processing
Volume3
StatePublished - Dec 1 1988

Fingerprint Dive into the research topics of 'Space-efficient and fault-tolerant message routing in outerplanar networks'. Together they form a unique fingerprint.

Cite this