B. Awerbuch, A. Bar-noy, N. Linial, and D. Peleg, Improved routing strategies with succint tables, Journal of Algorithms, pp.307-341, 1990.

B. Awerbuch and D. Peleg, Routing with polynomial communication-space trade-oo, SIAM Journal on Discrete Mathematics, vol.5, pp.151-162, 1992.

W. J. Dally and C. L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Transaction on Computers, C, vol.36, pp.547-553, 1987.

M. Flammini, J. Van-leeuwen, and A. M. Spaccamela, Lower bounds on interval routing, Tech. Rep, vol.69, 1994.

P. Fraigniaud and C. Gavoille, Optimal interval routing, Parallel Processing, vol.854, pp.785-796, 1994.

, Memory requirement for universal routing schemes, 14 th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, pp.223-230, 1995.

G. N. Frederickson and R. Janardan, Designing networks with compact routing tables, Algorithmica, vol.3, pp.171-190, 1988.

C. Gavoille and E. Gu, Worst case bounds for shortest path interval routing, LIP, vol.69364, 1995.
URL : https://hal.archives-ouvertes.fr/hal-02101800

C. Gavoille and S. , Routing memory requirement for distributed networks, vol.3, 1995.

M. Li and P. M. , Vit anyi, An Introduction to Kolmogorov Complexity and its Applications, 1993.

D. Peleg and A. A. , Sch affer, Graph spanners, Journal of Graph Theory, vol.13, pp.99-116, 1989.

D. Peleg and E. , EEcient message passing using succint routing tables, 1987.

, A trade-oo between space and eeciency for routing tables, 20 th Annual ACM Symposium on Theory of Computing (STOC), pp.43-52, 1988.

N. Santoro and R. Khatib, Labelling and implicit routing in networks, The Computer Journal, vol.28, pp.5-8, 1985.

J. Van-leeuwen and R. B. Tan, Interval routing, The Computer Journal, vol.30, pp.298-307, 1987.