This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks
December 1988 (vol. 37 no. 12)
pp. 1529-1540
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

[1] J.A. Bondy and U. S. R. Murty,Graph Theory with Applications. New York: American Elsevier, 1976.
[2] G. Frederickson, "Implicit data structures for the dictionary problem,"J. ACM, vol. 30, pp. 80-94, 1983.
[3] G. N. Frederickson, "A new approach to all pairs shortest paths in planar graphs," inProc. 19th Annu. ACM Symp. Theory Comput., New York, pp. 19-28, May 1987.
[4] G. N. Frederickson and R. Janardan, "Designing networks with compact routing tables,"Algorithmica, vol. 3, pp. 171-190, 1988.
[5] G. N. Frederickson and R. Janardan, "Space-efficient message routing in c-decomposable networks," submitted for journal publication.
[6] G. N. Frederickson and R. Janardan, "Efficient message routing in planar networks,"SIAM J. Comput.
[7] "Space-efficient and fault-tolerant message routing in outerplanar networks," inProc. 1988 Int. Conf. Parallel Processing, St. Charles, IL, Aug. 1988, pp. 282-289.
[8] F. Harary,Graph theory. Reading, MA: 1969.
[9] J. I. Munro and H. Suwanda, "Implicit data structures for fast search and update,"J. Comput. Syst. Sci., vol. 21, pp. 236-250, Oct. 1980.
[10] D. Peleg and E. Upfal, "A trade-off between space and efficiency for routing tables," inProc. 20th Annu. ACM Symp. Theory Comput., Chicago, IL, May 1988, pp. 43-52.
[11] N. Santoro and R. Khatib, "Labelling and implicit routing in networks,"Comput. J., vol. 28, pp. 5-8, Feb. 1985.
[12] S. Toueg, "An all-pairs shortest-path distributed algorithm," IBM Res. Rep. RC8397, June 1980.
[13] J. van Leeuwen and R. B. Tan, "Computer networks with compact routing tables, " inThe Book of L, G. Rozenberg and A. Salomaa, Eds. New York: Springer-Verlag, 1986, pp. 259-273.
[14] J. van Leeuwen and R. B. Tan, "Interval routing,"Comput. J., vol. 30, pp. 298-307, Aug. 1987.

Index Terms:
space efficient; fault-tolerant; message routing; outerplanar networks; routing schemes; networks; fault tolerant computing; multiprocessor interconnection networks.
Citation:
G.N. Frederickson, R. Janardan, "Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks," IEEE Transactions on Computers, vol. 37, no. 12, pp. 1529-1540, Dec. 1988, doi:10.1109/12.9731
Usage of this product signifies your acceptance of the Terms of Use.