Self-termination mechanism for label swapping routing

Author

Cohen, Reuven ; Ofek, Yoram

Author_Institution

Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

Volume

2

Issue

5

fYear

1994

fDate

10/1/1994 12:00:00 AM

Firstpage

541

Lastpage

545

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 self-termination 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

Keywords

asynchronous transfer mode; failure analysis; packet switching; probability; telecommunication network reliability; telecommunication network routing; ATM networks; connection setup failure probability; infinite packet looping prevention; label swapping routing; linear order constraint; on-line check; packet switching; routing decisions; self-termination mechanism; Computer science; Failure analysis; Hardware; High-speed networks; Multiprotocol label switching; Network interfaces; Network topology; Routing; Tin;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.336318

Filename

336318