Self-Termination Mechanism for Label Swapping Routing

Abstract

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