{
  "number": 3883,
  "title": "Detecting Inactive Neighbors over OSPF Demand Circuits (DC)",
  "authors": [
    "S. Rao",
    "A. Zinin",
    "A. Roy"
  ],
  "published": "2004-10",
  "status": "Proposed Standard",
  "stream": "IETF",
  "area": "rtg",
  "working_group": "ospf",
  "pages": 6,
  "formats": [
    "TXT",
    "HTML"
  ],
  "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]",
  "keywords": [
    "OSPF-DC",
    "Open Shortest Path First",
    "Demand Circuits"
  ],
  "draft": "draft-ietf-ospf-dc-07",
  "doi": "10.17487/RFC3883",
  "updates": [
    "RFC1793"
  ],
  "urls": {
    "html": "https://rfc.dk/rfc3883/",
    "text": "https://rfc.dk/rfc3883.txt",
    "rfc_editor": "https://www.rfc-editor.org/rfc/rfc3883",
    "datatracker": "https://datatracker.ietf.org/doc/rfc3883/"
  },
  "text_modified": "2004-10-04T17:58:57Z"
}