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

IETF · RFC · RFC9667

RFC9667 · Dynamic Flooding on Dense Graphs

Dynamic Flooding on Dense Graphs

Routing with link-state protocols in dense network topologies can result in suboptimal convergence times due to the overhead associated with flooding. This can be addressed by decreasing the flooding topology so that it is less dense. This document discusses the problem in some depth and an architectural solution. Specific protocol changes for IS-IS, OSPFv2, and OSPFv3 are described in this document.

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

Routing with link-state protocols in dense network topologies can result in suboptimal convergence times due to the overhead associated with flooding. This can be addressed by decreasing the flooding topology so that it is less dense. This document discusses the problem in some depth and an architectural solution. Specific protocol changes for IS-IS, OSPFv2, and OSPFv3 are described in this document.

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

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

Полные импортированные сведения карточки
{
  "id": "RFC9667",
  "number": 9667,
  "title_en": "Dynamic Flooding on Dense Graphs",
  "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": "Routing with link-state protocols in dense network topologies can result in suboptimal convergence times due to the overhead associated with flooding. This can be addressed by decreasing the flooding topology so that it is less dense. This document discusses the problem in some depth and an architectural solution. Specific protocol changes for IS-IS, OSPFv2, and OSPFv3 are described in this document.",
  "authors": [
    "T. Li",
    "P. Psenak",
    "H. Chen",
    "L. Jalil",
    "S. Dontula"
  ],
  "organizations": [],
  "publication_date": "2024-10-01",
  "current_status": "EXPERIMENTAL",
  "current_status_ru": "Экспериментальный",
  "publication_status": "EXPERIMENTAL",
  "publication_status_ru": "Экспериментальный",
  "lifecycle": "experimental",
  "lifecycle_ru": "Экспериментальный",
  "stream": "IETF",
  "stream_ru": "IETF",
  "area": "rtg",
  "area_ru": "Маршрутизация",
  "working_group": "lsr",
  "source_draft": "draft-ietf-lsr-dynamic-flooding-18",
  "page_count": 41,
  "doi": "10.17487/RFC9667",
  "keywords": [
    "datacenter",
    "IGP",
    "routing",
    "flooding",
    "dense",
    "graph",
    "topology"
  ],
  "formats": [
    "HTML",
    "TXT",
    "PDF",
    "XML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc9667/",
    "html": "https://www.rfc-editor.org/rfc/rfc9667.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc9667.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc9667/"
  }
}