M. Erwin, R. B. Bakker-van-leeuwen, and . Tan, Prefix routing schemes in dynamic networks, Computer Networks and ISDN Systems, vol.26, issue.4, pp.403-421, 1993.

A. Bui, A. Kumar-datta, F. Petit, and V. Villain, State-optimal snapstabilizing pif in tree networks, WSS, pp.78-85, 1999.

A. Bui, A. Kumar-datta, F. Petit, and V. Villain, Snap-stabilization and PIF in tree networks, Distributed Computing, vol.29, issue.1, pp.3-19, 2007.
DOI : 10.1007/s00446-007-0030-4

K. , M. Chandy, and J. Misra, Distributed computation on graphs: Shortest path algorithms, Commun. ACM, vol.25, issue.11, pp.833-837, 1982.

T. Cormen, C. Leierson, R. Rivest, and C. Stein, IntroductionàIntroduction`Introductionà l'algorithmique. Eyrolles, seconde edition, 2002.

A. Cournier, S. Devismes, and V. Villain, Snap-stabilizing PIF and useless computations, 12th International Conference on Parallel and Distributed Systems, (ICPADS'06), pp.39-48, 2006.
DOI : 10.1109/ICPADS.2006.100
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.726

S. Delaët, S. Devismes, M. Nesterenko, and S. Tixeuil, Snapstabilization in message-passing systems. CoRR, abs/0802, 1123.

W. Edsger and . Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

S. Dolev, Self-Stabilizing Routing and Related Protocols, Journal of Parallel and Distributed Computing, vol.42, issue.2, pp.122-127, 1997.
DOI : 10.1006/jpdc.1997.1317

S. Dolev, A. Israeli, and S. Moran, Uniform dynamic self-stabilizing leader election, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.4, pp.424-440, 1997.
DOI : 10.1109/71.588622
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.7453

S. Dolev and N. Tzachar, Empire of colonies: Self-stabilizing and self-organizing distributed algorithms, OPODIS, pp.230-243, 2006.

J. Duato, A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.8, pp.841-854, 1996.
DOI : 10.1109/71.532115

M. Flammini and G. Gambosi, On devising Boolean Routing schemes, Theoretical Computer Science, vol.186, issue.1-2, pp.171-198, 1997.
DOI : 10.1016/S0304-3975(97)86543-7

P. Fraigniaud and C. Gavoille, Interval Routing Schemes, Algorithmica, vol.21, issue.2, pp.155-182, 1998.
DOI : 10.1007/PL00009211

C. Gavoille, A survey on interval routing, Theoretical Computer Science, vol.245, issue.2, pp.217-253, 2000.
DOI : 10.1016/S0304-3975(99)00283-2

. Shing-tsaan, N. Huang, and . Chen, A self-stabilizing algorithm for constructing breadth-first trees, Inf. Process. Lett, vol.41, issue.2, pp.109-117, 1992.

C. Johnen and S. Tixeuil, Route Preserving Stabilization, Self-Stabilizing Systems, pp.184-198, 2003.
DOI : 10.1007/3-540-45032-7_14

A. Kosowski and L. Kuszner, A Self-stabilizing Algorithm for Finding a??Spanning Tree in a Polynomial Number of Moves, In PPAM, pp.75-82, 2005.
DOI : 10.1007/11752578_10

R. Kralovic and P. Ruzicka, Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing, Theoretical Computer Science, vol.374, issue.1-3, pp.203-213, 2007.
DOI : 10.1016/j.tcs.2006.10.036

P. Merlin and A. Segall, A Failsafe Distributed Routing Protocol, IEEE Transactions on Communications, vol.27, issue.9, pp.1280-1287, 1979.
DOI : 10.1109/TCOM.1979.1094552

M. Philip, P. J. Merlin, and . Schweitzer, Deadlock avoidance in store-and-forward networks, Jerusalem Conference on Information Technology, pp.577-581, 1978.

L. Schwiebert and D. N. Jayasimha, A universal proof technique for deadlock-free routing in interconnection networks, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures , SPAA '95, pp.175-184, 1995.
DOI : 10.1145/215399.215440

D. William and . Tajibnapis, A correctness proof of a topology information maintenance protocol for a distributed computer network, Commun. ACM, vol.20, issue.7, pp.477-485, 1977.

G. Tel, Introduction to Distributed Algorithms, 2001.
DOI : 10.1017/CBO9781139168724

S. Toueg, I. T. Watson-research, and . Center, An all-pairs shortest-path distributed algorithm, Performance Evaluation, vol.1, issue.1, 1980.
DOI : 10.1016/0166-5316(81)90048-1

S. Toueg, Deadlock- and livelock-free packet switching networks, Proceedings of the twelfth annual ACM symposium on Theory of computing , STOC '80, pp.94-99, 1980.
DOI : 10.1145/800141.804656

S. Toueg and K. Steiglitz, Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks, SIAM Journal on Computing, vol.10, issue.4, pp.702-712, 1981.
DOI : 10.1137/0210053

S. Toueg and J. D. Ullman, Deadlock-Free Packet Switching Networks, SIAM Journal on Computing, vol.10, issue.3, pp.594-611, 1981.
DOI : 10.1137/0210044

J. Van-leeuwen and R. B. Tan, Interval Routing, The Computer Journal, vol.30, issue.4, pp.298-307, 1987.
DOI : 10.1093/comjnl/30.4.298

J. Van-leeuwen and R. B. Tan, Compact routing methods: A survey, SIROCCO, pp.99-110, 1994.