IETF · RFC · RFC3906
RFC3906 · Calculating Interior Gateway Protocol (IGP) Routes Over Traffic Engineering Tunnels Calculating Interior Gateway Protocol (IGP) Routes Over Traffic Engineering Tunnels
This document describes how conventional hop-by-hop link-state routing protocols interact with new Traffic Engineering capabilities to create Interior Gateway Protocol (IGP) shortcuts. In particular, this document describes how Dijkstra's Shortest Path First (SPF) algorithm can be adapted so that link-state IGPs will calculate IP routes to forward traffic over tunnels that are set up by Traffic Engineering. This memo provides information for the Internet community.
IETF · RFC
Официальная английская аннотация This document describes how conventional hop-by-hop link-state routing protocols interact with new Traffic Engineering capabilities to create Interior Gateway Protocol (IGP) shortcuts. In particular, this document describes how Dijkstra's Shortest Path First (SPF) algorithm can be adapted so that link-state IGPs will calculate IP routes to forward traffic over tunnels that are set up by Traffic Engineering. This memo provides information for the Internet community.
Связи документа
Официальный источник · 2004-10-01
Проверка просрочена
Информационный
Статус: 16.10.2026, 10:21 МСК
Срок следующей проверки: 17.10.2026, 10:21 МСК
Полный текст не зарегистрирован для автоматической сверки.
Errata: нет записей в успешно полученной базе
История и основания проверки
16.10.2026, 10:21 МСК · rfc-index · changed · HTTP 2004c599b64f95deebb9295a603747e28c7b172b15516b4d7140d35b3c5fec97311
16.10.2026, 10:21 МСК · rfc-errata · changed · HTTP 200e208d511c7450a0c65b6a6cfa47471ac873f0c81442bcb911eaac5a2097a8609
10.10.2026, 18:39 МСК · rfc-index · adapter_changed · HTTP 200d413c804505ea10e4abfabc529e82cbfd950616d85fd71658122beeabf74c73b
10.10.2026, 18:39 МСК · rfc-errata · adapter_changed · HTTP 2009fd444088360c9a55b9d1543eb948d627c9e30ac3d9d9cdc222e5883be7e59ee
10.10.2026, 18:36 МСК · rfc-index · unchanged · HTTP 304d413c804505ea10e4abfabc529e82cbfd950616d85fd71658122beeabf74c73b
10.10.2026, 18:36 МСК · rfc-errata · baseline · HTTP 2009fd444088360c9a55b9d1543eb948d627c9e30ac3d9d9cdc222e5883be7e59ee
10.10.2026, 18:34 МСК · rfc-index · changed · HTTP 200d413c804505ea10e4abfabc529e82cbfd950616d85fd71658122beeabf74c73b
10.10.2026, 18:34 МСК · rfc-errata · error · HTTP 200Empty response or forbidden XML entities
rfc-errata · официальный источник
rfc-index · официальный источник
Полные импортированные сведения карточки {
"id": "RFC3906",
"number": 3906,
"title_en": "Calculating Interior Gateway Protocol (IGP) Routes Over Traffic Engineering Tunnels",
"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 describes how conventional hop-by-hop link-state routing protocols interact with new Traffic Engineering capabilities to create Interior Gateway Protocol (IGP) shortcuts. In particular, this document describes how Dijkstra's Shortest Path First (SPF) algorithm can be adapted so that link-state IGPs will calculate IP routes to forward traffic over tunnels that are set up by Traffic Engineering. This memo provides information for the Internet community.",
"authors": [
"N. Shen",
"H. Smit"
],
"organizations": [],
"publication_date": "2004-10-01",
"current_status": "INFORMATIONAL",
"current_status_ru": "Информационный",
"publication_status": "INFORMATIONAL",
"publication_status_ru": "Информационный",
"lifecycle": "informational",
"lifecycle_ru": "Справочный",
"stream": "IETF",
"stream_ru": "IETF",
"area": "rtg",
"area_ru": "Маршрутизация",
"working_group": "rtgwg",
"source_draft": "draft-ietf-rtgwg-igp-shortcut-01",
"page_count": 8,
"doi": "10.17487/RFC3906",
"keywords": [
"hop-by-hop link-state routing protocols",
"SPF",
"shortest path first"
],
"formats": [
"TXT",
"HTML"
],
"relations": {
"obsoletes": [],
"obsoleted_by": [],
"updates": [],
"updated_by": [],
"is_also": [],
"see_also": []
},
"links": {
"info": "https://www.rfc-editor.org/info/rfc3906/",
"html": "https://www.rfc-editor.org/rfc/rfc3906.html",
"txt": "https://www.rfc-editor.org/rfc/rfc3906.txt",
"datatracker": "https://datatracker.ietf.org/doc/rfc3906/"
}
}