Tunnel Loops and its Detection
draft-ng-intarea-tunnel-loop-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Chan-Wah Ng , Benjamin Lim , Mohana Jeyatharan | ||
| Last updated | 2008-10-26 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
Many protocols in the Internet Protocol suite use packet encapsulations. This runs into the danger of forming a tunnel loop. Since each tunnel entry point encapsulates the inner packet with a tunnel packet header that contains a new hop count, a packet entering a tunnel loop may be routed infinitely, consuming network resources. Although there exist methods to cause a packet in a tunnel loop to be discarded eventually, it would be more desirable to detect the presence of a tunnel loop and act accordingly. This draft explores the possibility for tunnel entry points to detect the presence of a tunnel loop by using an extra identifier tagged to the outer packet header.
Authors
Chan-Wah Ng
Benjamin Lim
Mohana Jeyatharan
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)