{
  "draft": "draft-ietf-ospf-version2-10",
  "doc_id": "RFC2178",
  "title": "OSPF Version 2",
  "authors": [
    "J. Moy"
  ],
  "format": [
    "TEXT",
    "HTML"
  ],
  "page_count": "211",
  "pub_status": "DRAFT STANDARD",
  "status": "DRAFT STANDARD",
  "source": "Open Shortest Path First IGP",
  "abstract": "This memo documents version 2 of the OSPF protocol. OSPF is a link-state routing protocol. It is designed to be run internal to a single Autonomous System. Each OSPF router maintains an identical database describing the Autonomous System's topology. From this database, a routing table is calculated by constructing a shortest-path tree.\n\n OSPF recalculates routes quickly in the face of topological changes, utilizing a minimum of routing protocol traffic. OSPF provides support for equal-cost multipath. An area routing capability is provided, enabling an additional level of routing protection and a reduction in routing protocol traffic. In addition, all OSPF routing protocol exchanges are authenticated. [STANDARDS-TRACK]",
  "pub_date": "July 1997",
  "keywords": [
    "Open",
    "Shortest",
    "Path",
    "First",
    "routing",
    "Autonomous",
    "system",
    "AS"
  ],
  "obsoletes": [
    "RFC1583"
  ],
  "obsoleted_by": [
    "RFC2328"
  ],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC2178",
  "errata_url": null
}