Segment Routing Flexible Algorithm (Flex-Algo) will provide easy way of calculating different paths with different type of constraints. It will allow us to define our own algorithm. This new algorithm can still be minimizing IGP metric but it can also be minimizing TE metric, minimizing delay metric (new metric definition added to IGP), avoiding some links or …
An SR Policy is used to instantiate an ordered list of segments. SR policy is identified with tuple; Head-end, color and End-point. The Head-end is the node where the policy is implemented. It may be an IPv4 or IPv6 address. The End-point indicates the destination of the policy. The endpoint is specified as an IPv4 …
In the IGP based IP networks we have one simple algorithm and it calculates the shortest path to the destination according to planned IGP metric.IGP metric is the only constraint we can assign to the links. We have more with MPLS TE implementations like TE Metric, link admin group, bw etc. The problem with TE, …
IGP provides mechanisms through which Segment Routing interoperate with LDP. The control plane of segment routing can co-exists with LDP. If you plan to migrate from LDP to Segment Routing, or if you have some routers which does not support Segment Routing but you still want to use Segment Routing, Interoperability of SR and LDP will …
TI-LFA can add one or more segment when switching traffic to backup and loop free alternate path. According to below topology let’s assume we want to protect not only the link between Node-A and Node-B but we also want to protect Node-B. Without TI-LFA, we can’t protect Node-B. According to formula it seems it isn’t possible …
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. …