[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Open Shortest Path First IGP Working Group of the IETF.
Title : Detecting Inactive Neighbors over OSPF Demand Circuits
Author(s) : S. Rao, A. Zinin
Filename : draft-ietf-ospf-dc-00.txt
Pages : 6
Date : 14-Nov-00
OSPF [RFC2328] is a link-state intra-domain routing protocol used in
IP networks. OSPF behavior over demand circuits is optimized in
[RFC1793] to minimize the amount of overhead traffic. A part of OSPF
demand circuit extensions is the Hello suppression mechanism. This
technique allows a demand circuit to go down when no interesting
traffic is going through the link. However, it also introduces a
problem, where it becomes impossible to detect a OSPF-inactive
neighbor over such a link. This memo addresses the above problem by
introducing three mechanisms---Hello probes, limitation of the number
of LSA retransmits and flushing of self-originated LSAs.
A URL for this Internet-Draft is:
Internet-Drafts are also available by anonymous FTP. Login with the username
"anonymous" and a password of your e-mail address. After logging in,
type "cd internet-drafts" and then
A list of Internet-Drafts directories can be found in
Internet-Drafts can also be obtained by e-mail.
Send a message to:
In the body type:
NOTE: The mail server at ietf.org can return the document in
MIME-encoded form by using the "mpack" utility. To use this
feature, insert the command "ENCODING mime" before the "FILE"
command. To decode the response(s), you will need "munpack" or
a MIME-compliant mail reader. Different MIME-compliant mail readers
exhibit different behavior, especially when dealing with
"multipart" MIME messages (i.e. documents which have been split
up into multiple messages), so check your local documentation on
how to manipulate these messages.
Below is the data which will enable a MIME compliant mail reader
implementation to automatically retrieve the ASCII version of the