A new approach to all pairs shortest paths in planar graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The Computer Journal
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient message routing in planar networks
SIAM Journal on Computing
Implicit Data Structures for the Dictionary Problem
Journal of the ACM (JACM)
Graph Theory With Applications
Graph Theory With Applications
Distributed multicasting algorithm in a wide area network
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
IEEE Transactions on Parallel and Distributed Systems
Design of a viable fault-tolerant routing strategy for optical-based grids
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
| Hi-index | 14.98 |
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