{
  "draft": "draft-ietf-ospf-dc-07",
  "doc_id": "RFC3883",
  "title": "Detecting Inactive Neighbors over OSPF Demand Circuits (DC)",
  "authors": [
    "S. Rao",
    "A. Zinin",
    "A. Roy"
  ],
  "format": [
    "TEXT",
    "HTML"
  ],
  "page_count": "6",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Open Shortest Path First IGP",
  "abstract": "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 \"neighbor probing\" to address the above problem. [STANDARDS-TRACK]",
  "pub_date": "October 2004",
  "keywords": [
    "OSPF-DC",
    "Open Shortest Path First",
    "Demand Circuits"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [
    "RFC1793"
  ],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC3883",
  "errata_url": null
}