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

IETF · RFC · RFC2992

RFC2992 · Analysis of an Equal-Cost Multi-Path Algorithm

Analysis of an Equal-Cost Multi-Path Algorithm

Equal-cost multi-path (ECMP) is a routing technique for routing packets along multiple paths of equal cost. The forwarding engine identifies paths by next-hop. When forwarding a packet the router must decide which next-hop (path) to use. This document gives an analysis of one method for making that decision. The analysis includes the performance of the algorithm and the disruption caused by changes to the set of next-hops. This memo provides information for the Internet community.

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

Equal-cost multi-path (ECMP) is a routing technique for routing packets along multiple paths of equal cost. The forwarding engine identifies paths by next-hop. When forwarding a packet the router must decide which next-hop (path) to use. This document gives an analysis of one method for making that decision. The analysis includes the performance of the algorithm and the disruption caused by changes to the set of next-hops. This memo provides information for the Internet community.

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

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

Полные импортированные сведения карточки
{
  "id": "RFC2992",
  "number": 2992,
  "title_en": "Analysis of an Equal-Cost Multi-Path 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": "Equal-cost multi-path (ECMP) is a routing technique for routing packets along multiple paths of equal cost. The forwarding engine identifies paths by next-hop. When forwarding a packet the router must decide which next-hop (path) to use. This document gives an analysis of one method for making that decision. The analysis includes the performance of the algorithm and the disruption caused by changes to the set of next-hops. This memo provides information for the Internet community.",
  "authors": [
    "C. Hopps"
  ],
  "organizations": [],
  "publication_date": "2000-11-01",
  "current_status": "INFORMATIONAL",
  "current_status_ru": "Информационный",
  "publication_status": "INFORMATIONAL",
  "publication_status_ru": "Информационный",
  "lifecycle": "informational",
  "lifecycle_ru": "Справочный",
  "stream": "Legacy",
  "stream_ru": "Исторический поток",
  "area": "",
  "area_ru": "",
  "working_group": "",
  "source_draft": "draft-hopps-ecmp-algo-analysis-04",
  "page_count": 8,
  "doi": "10.17487/RFC2992",
  "keywords": [
    "ECMP",
    "routing",
    "packets",
    "forwarding"
  ],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc2992/",
    "html": "https://www.rfc-editor.org/rfc/rfc2992.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc2992.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc2992/"
  }
}