⌕ Поиск по атласу

IETF · RFC · RFC981

RFC981 · Experimental multiple-path routing algorithm

Experimental multiple-path routing algorithm

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.

Официальная английская аннотация

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.

Связи документа

Официальный источник · 1986-03-01

Полные импортированные сведения карточки
{
  "id": "RFC981",
  "number": 981,
  "title_en": "Experimental multiple-path routing algorithm",
  "title_ru": "",
  "summary_ru": "",
  "purpose_ru": "",
  "use_ru": "",
  "full_translation_path": "",
  "full_translation_checked_at": "",
  "full_translation_source_sha256": "",
  "architect_note_ru": "",
  "topics_ru": [],
  "translation_state": "not_prepared",
  "verification_level": "not_prepared",
  "verification_level_ru": "Русская выжимка не подготовлена",
  "verification_note_ru": "",
  "abstract_en": "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.",
  "authors": [
    "D.L. Mills"
  ],
  "organizations": [],
  "publication_date": "1986-03-01",
  "current_status": "UNKNOWN",
  "current_status_ru": "Статус не назначен",
  "publication_status": "UNKNOWN",
  "publication_status_ru": "Статус не назначен",
  "lifecycle": "unknown",
  "lifecycle_ru": "Статус не определён",
  "stream": "Legacy",
  "stream_ru": "Исторический поток",
  "area": "",
  "area_ru": "",
  "working_group": "",
  "source_draft": "",
  "page_count": 22,
  "doi": "10.17487/RFC981",
  "keywords": [],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc981/",
    "html": "https://www.rfc-editor.org/rfc/rfc981.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc981.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc981/"
  }
}