<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-ospf-dc" target="https://datatracker.ietf.org/doc/html/draft-ietf-ospf-dc-07">
   <front>
      <title>Detecting Inactive Neighbors over OSPF Demand Circuits (DC)</title>
      <author initials="A. D." surname="Zinin" fullname="Alex D. Zinin">
         <organization>Alcatel</organization>
      </author>
      <author initials="A." surname="Roy" fullname="Abhay Roy">
         <organization>Cisco Systems</organization>
      </author>
      <author initials="S. P." surname="Rao" fullname="Sira P. Rao">
         </author>
      <date month="February" day="5" year="2004" />
      <abstract>
	 <t>OSPF is a link-state intra-domain routing protocol used in IP networks.  OSPF behavior over demand circuits (DC) is optimized in RFC 1793 to minimize the amount of overhead traffic.  A part of the 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 an OSPF-inactive neighbor over such a link.  This memo introduces a new mechanism called &quot;neighbor probing&quot; to address the above problem. [STANDARDS-TRACK]
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-ospf-dc-07" />
   
</reference>
