Name
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/90.336318 | Networking, IEEE/ACM Transactions |
Keywords | Field | DocType |
Multiprotocol label switching,Routing,Hardware,Failure analysis,Network interfaces,High-speed networks,Computer science,Network topology,Tin | Multipath routing,Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Policy-based routing,Static routing,Computer science,Computer network,Routing table,Routing Information Protocol,Distributed computing | Journal |
Volume | Issue | ISSN |
2 | 5 | 1063-6692 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Reuven Cohen | 1 | 788 | 70.03 |
| Yoram Ofek | 2 | 608 | 81.68 |