BGP Request for Advertising Candidate Path of Segment Routing TE Policies
Zhenbin Li, Lei Li
Abstract
Zhenbin Li, Lei Li
Abstract
An SR Policy is a set of candidate paths. The headend of an SR Policy may learn multiple candidate paths for an SR Policy via a number of different mechanisms, e.g., CLI, NetConf, PCEP, or BGP. BGP distribute candidate paths has been defined in [I-D.ietf-idr-segment-routing-te- policy]. This document defines an extension of BGP to request BGP speaker(controller) advertise the candidate paths. The goal is to unify the protocol when the candidate path of SR Policy provision is via BGP to reduce the network complexity and potential bugs cause by different protocol interactions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An SR Policy is a set of candidate paths. The headend of an SR Policy may learn multiple candidate paths for an SR Policy via a number of different mechanisms, e.g., CLI, NetConf, PCEP, or BGP. BGP distribute candidate paths has been defined in [I-D.ietf-idr-segment-routing-te- policy]. This document defines an extension of BGP to request BGP speaker(controller) advertise the candidate paths. The goal is to unify the protocol when the candidate path of SR Policy provision is via BGP to reduce the network complexity and potential bugs cause by different protocol interactions.
Key concepts: Border Gateway Protocol, Computer science, Computer network, Path (computing), Routing protocol, Routing (electronic design automation), Set (abstract data type), Protocol (science)