RFC8664 · Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing
Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing
Segment Routing (SR) enables any head-end node to select any path without relying on a hop-by-hop signaling technique (e.g., LDP or RSVP-TE). It depends only on "segments" that are advertised by link-state Interior Gateway Protocols (IGPs). An SR path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), an explicit configuration, or a Path Computation Element (PCE). This document specifies extensions to the Path Computation Element Communication Protocol (PCEP) that allow a stateful PCE to compute and initiate Traffic-Engineering (TE) paths, as well as a Path Computation Client (PCC) to request a path subject to certain constraints and optimization criteria in SR networks. This document updates RFC 8408.
IETF · RFCОфициальная английская аннотация
Segment Routing (SR) enables any head-end node to select any path without relying on a hop-by-hop signaling technique (e.g., LDP or RSVP-TE). It depends only on "segments" that are advertised by link-state Interior Gateway Protocols (IGPs). An SR path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), an explicit configuration, or a Path Computation Element (PCE). This document specifies extensions to the Path Computation Element Communication Protocol (PCEP) that allow a stateful PCE to compute and initiate Traffic-Engineering (TE) paths, as well as a Path Computation Client (PCC) to request a path subject to certain constraints and optimization criteria in SR networks. This document updates RFC 8408.
{
"id": "RFC8664",
"number": 8664,
"title_en": "Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing",
"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": "Segment Routing (SR) enables any head-end node to select any path without relying on a hop-by-hop signaling technique (e.g., LDP or RSVP-TE). It depends only on \"segments\" that are advertised by link-state Interior Gateway Protocols (IGPs). An SR path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), an explicit configuration, or a Path Computation Element (PCE). This document specifies extensions to the Path Computation Element Communication Protocol (PCEP) that allow a stateful PCE to compute and initiate Traffic-Engineering (TE) paths, as well as a Path Computation Client (PCC) to request a path subject to certain constraints and optimization criteria in SR networks. This document updates RFC 8408.",
"authors": [
"S. Sivabalan",
"C. Filsfils",
"J. Tantsura",
"W. Henderickx",
"J. Hardwick"
],
"organizations": [],
"publication_date": "2019-12-01",
"current_status": "PROPOSED STANDARD",
"current_status_ru": "Предлагаемый стандарт",
"publication_status": "PROPOSED STANDARD",
"publication_status_ru": "Предлагаемый стандарт",
"lifecycle": "active",
"lifecycle_ru": "Действующий",
"stream": "IETF",
"stream_ru": "IETF",
"area": "rtg",
"area_ru": "Маршрутизация",
"working_group": "pce",
"source_draft": "draft-ietf-pce-segment-routing-16",
"page_count": 29,
"doi": "10.17487/RFC8664",
"keywords": [
"SR",
"Traffic-Engineering",
"PCE"
],
"formats": [
"HTML",
"TXT",
"PDF",
"XML"
],
"relations": {
"obsoletes": [],
"obsoleted_by": [],
"updates": [
"RFC8408"
],
"updated_by": [
"RFC9756",
"RFC9933"
],
"is_also": [],
"see_also": []
},
"links": {
"info": "https://www.rfc-editor.org/info/rfc8664/",
"html": "https://www.rfc-editor.org/rfc/rfc8664.html",
"txt": "https://www.rfc-editor.org/rfc/rfc8664.txt",
"datatracker": "https://datatracker.ietf.org/doc/rfc8664/"
}
}