Binding SID (BSID) is a method of steering traffic into an SR Policy. BSID is used to provide greater scalability. The BSID is bound to an SR Policy which may have a list of SIDs. Any packets received with an active segment equal to BSID are steered onto the bound SR Policy. Usage of BSID …
An SR Policy is used to instantiate an ordered list of segments. A Segment is and instruction that a node executes on the incoming packet; Forward packet according to the shortest path, Forward packet through a specific interface, Deliver packet to a given application or service etc. A Segment Identifier (SID) identifies a Segment. And …
IGP Adjacency Segment Identifier (Adj-SID) is a local label allocated from SRLB. It is attached to a unidirectional adjacency or a set of unidirectional adjacencies. Segment Routing Adj-SIDs usually represent a link (peering) and have a local significance. Of course It is used with Prefix-SID of local node. Locally significant means that the remote nodes …
SRv6 is a new source routing paradigm which means that the source can define the path that the packet will take. There are already some other ways to do this “Source Routing” but SRv6 is candidate to be easiest way. It is possible to run Segment Routing on MPLS Data and IPv6 Data plane. To …
Segment Routing divides a network into several segments and assign a segment ID to each segment. A Segment is an instruction that a node executes on the incoming packet; Forward packet according to the shortest path, Forward packet through a specific interface, deliver packet to a given application or service etc. A Segment Identifier (SID) …
SR architecture doesn’t have a specific control plane protocol. A routing protocol, ISIS, OSPF or BGP, is generally used to distribute Segment ID information in the network. Segment Ids distributed by IGP are called IGP Segments and those distributed by BGP are called BGP Segments. An IGP Segment ID (IGP SID) is a type of …
When the whole architecture of routing was designed the idea was sending the packet to the destination by the best path possible. It is achieved based on the routing table build from link-state database which is received from their neighbors. But what if I want to force the packets to go across some other way. …