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

The problem of designing space- and communication-efficient routing schemes for networks that experience faults is addressed. For any outerplanar network containing t faults, a succinct routing scheme is presented that uses O(αtn) space and communication to generate routings that are less than ((α+1)/(α-1))^t times longer than optimal, where α>1 is an odd-valued integer parameter. Thus, the routings can be tuned as desired, using a suitable amount of information. Efficient sequential and distributed algorithms are presented for setting up the routing schemes