Protocol Action: 'Detecting Inactive Neighbors over OSPF Demand Circuits' to Proposed Standard

[The IESG <iesg-secretary at ietf.org>]

The IESG has approved the following document:

- 'Detecting Inactive Neighbors over OSPF Demand Circuits '
   <draft-ietf-ospf-dc-07.txt> as a Proposed Standard

This document is the product of the Open Shortest Path First IGP 
Working Group. 

The IESG contact persons are Bill Fenner and Alex Zinin.

Technical Summary

  The Demand Circuit Extension for OSPF (RFC 1793) reduces routing protocol
  overhead on demand circuit links by eliminating Hello messages over such
  links.  This prevents the link from being kept alive simply by routing
  protocol traffic, but also prevents the detection of a dead neighbor over
  a live demand circuit.  Detecting Inactive Neighbors over OSPF Demand
  Circuits introduces a mechanism which probes the liveness of the neighbor
  on a demand circuit only when other traffic is flowing and/or with packets
  that do not count towards keeping the link up.  In this way, neighbor
  liveness may be detected while retaining the on-demand nature of the
  circuit.

Working Group Summary

  There was consensus in the OSPF Working Group on this specification.

Protocol Quality

  The protocol was reviewed for the IESG by Bill Fenner.  There are
  two implementations.

RFC-Editor Note:

In the second paragraph of section 2, please replace the acronym
"NBMA" with "Non-Broadcast Multi-Acess (NBMA) links".

In the third paragraph of section 2, please replace the acronym
"LSDB" with "Link State Database (LSDB)".

Please change the title of section 5 to "Deployment Considerations".


_______________________________________________
IETF-Announce mailing list
IETF-Announce at ietf.org
https://www1.ietf.org/mailman/listinfo/ietf-announce