Improved Routing Strategies with Succinct Tables

@article{Awerbuch1990ImprovedRS,
  title={Improved Routing Strategies with Succinct Tables},
  author={Baruch Awerbuch and Amotz Bar-Noy and Nathan Linial and David Peleg},
  journal={J. Algorithms},
  year={1990},
  volume={11},
  pages={307-341}
}
In designing a routing scheme for a communication network it is desirable to use as short as possible paths for routing messages, while keeping the routing information stored in the processors’ local memory as succinct as possible. The efftciency of a routing scheme is measured in terms of its stretch factor-the maximum ratio between the cost of a route computed by the scheme and that of a cheapest path connecting the same pair of vertices. This paper presents several simple families of routing… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 105 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

UPFAL, A tradeoff between size and efficiency for routine tables, JACM

E. D. PELEG
5th Conf. on System Sciences, • 1989

FREDERICKSON AND R. JANARDAN, Separator-based strategies for efficient message routing, in “Proceedings

G N.
27th Symp. on Foundations of Computer Science, • 1988

FRANCEZ, A new approach to detection of locally indicative stability, in “Proceedings

N. N. SHAVIT
13th ICALP, • 1986

Termination detection for diffusing computations

G N.
Inform. Process. Lert • 1980

ZIMMERMANN, OS1 reference model-The IS0 model of architecture for open systems interconnection

VI H.
IEEE Trans. Cummun • 1980

A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations

H. CHERNOFF
Ann. Math. Srar& • 1952

Similar Papers

Loading similar papers…