SELF-TERMINATION MECHANISM FOR LABEL SWAPPING ROUTING

In networks that use label swapping routing, like ATM, inconsistent ro uting tables, due to either incorrect setups or memory failures, may r esult in infinite looping of packets, This work proposes and analyzes a method for ensuring self-termination in such networks. The method is based on imposing linear order on the labels chosen by the stations a long the route during connection setup, and on a simple on-line check performed by every station upon making routing decisions. We then anal yze the probability of connection setup failure due to the linear orde r constraint, and show that it is very small.