The Community for Technology Leaders
Green Image
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( alpha tn) space and communication to generate routings that are less than (( alpha +1)/( alpha -1))/sup t/ times longer than optimal, where alpha <1 is an odd-valued i
space efficient; fault-tolerant; message routing; outerplanar networks; routing schemes; networks; fault tolerant computing; multiprocessor interconnection networks.
G.N. Frederickson, R. Janardan, "Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks", IEEE Transactions on Computers, vol. 37, no. , pp. 1529-1540, December 1988, doi:10.1109/12.9731
115 ms
(Ver 3.1 (10032016))