{
  "number": 981,
  "title": "Experimental multiple-path routing algorithm",
  "authors": [
    "D.L. Mills"
  ],
  "published": "1986-03",
  "status": "Unknown",
  "stream": "Legacy",
  "pages": 22,
  "formats": [
    "TXT",
    "HTML"
  ],
  "abstract": "This document introduces wiretap algorithms, a class of experimental, multiple routing algorithms that compute quasi-optimum routes for stations sharing a packet-radio broadcast channel. The primary route (a minimum-distance path), and additional paths ordered by distance, which serve as alternate routes should the primary route fail, are computed. This prototype is presented as an example of a class of routing algorithms and data-base management techniques that may find wider application in the Internet community. Discussions and suggestions for improvements are welcomed.",
  "doi": "10.17487/RFC981",
  "urls": {
    "html": "https://rfc.dk/rfc981/",
    "text": "https://rfc.dk/rfc981.txt",
    "rfc_editor": "https://www.rfc-editor.org/rfc/rfc981",
    "datatracker": "https://datatracker.ietf.org/doc/rfc981/"
  },
  "text_modified": "1986-03-21T19:15:20Z"
}