Tactical traffic engineering based on segment routing policies

Patent metadata

Field	Value
Publication number	US-10212088-B2
Application number	US-201615345049-A
Country	US
Kind code	B2
Filing date	Nov 7, 2016
Priority date	Nov 7, 2016
Publication date	Feb 19, 2019
Grant date	Feb 19, 2019

Abstract

In one embodiment, a method includes monitoring traffic in a Segment Routing (SR) network through a collection of a Segment Routing Demand Matrix (SRDM) at a Traffic Engineering (TE) system operating at a network device, receiving topology information for the SR network at the TE system, modeling the SR network based on the topology information and the SRDM at the TE system, identifying a violation of a constraint in the SR network at the TE system, and running an optimization algorithm for SR optimization of constraints in the SR network at the TE system, wherein the optimization comprises limiting a number of Segment Identifiers (SIDs) used in a SR policy implemented to resolve the constraint violation. An apparatus is also disclosed herein.

First claim

What is claimed is:

1. A method comprising:
monitoring traffic in a Segment Routing (SR) network through collection of a Segment Routing Demand Matrix (SRDM) at a Traffic Engineering (TE) system operating at a network device;
receiving topology information for the SR network at the TE system;
modeling the SR network based on said topology information and said SRDM at the TE system;
identifying a constraint violation in the SR network at the TE system;
running an optimization algorithm for SR optimization of constraints in the SR network at the TE system, wherein said SR optimization comprises limiting a number of Segment identifiers (SIDs) used in a SR policy implemented to resolve said constraint violation; and
instantiating said SR policy in the SR network,
wherein instantiating said SR policy comprises deployment of a TE tunnel utilizing an orchestration platform.

2. The method of claim 1 wherein identifying said violation comprises receiving a BGP-LS (Border Gateway Protocol Link State) notification.

3. The method of claim 1 wherein said constraints comprise SLA (Service Level Agreement) constraints.

4. The method of claim 1 wherein limiting a number of SIDs used in said SR policy comprises limiting the number of SIDs to two.

5. The method of claim 1 wherein running said optimization algorithm comprises identifying a smallest demand larger than an amount of saturation on a congested link and demands smaller than the amount of saturation.

6. The method of claim 5 wherein running said optimization algorithm further comprises attempting to relocate one or more of said identified demands over an alternate path.

7. The method of claim 1 wherein running said optimization algorithm comprises relocating at least one demand using one or two SIDs in said SR policy.

8. The method of claim 7 wherein relocating at least one demand comprises relocating said demand based on available capacity, latency, or IGP (Interior Gateway Protocol) distance.

9. The method of claim 1 further comprising relocating a demand to resolve said constraint violation and moving said demand back when said constraint will no longer be violated.

10. An apparatus comprising:
interfaces for receiving traffic and topology information in a Segment Routing (SR) network;
memory for storing said traffic and topology information including traffic demands calculated from a Segment Routing Demand Matrix (SRDM); and
a processor for modeling the SR network based on topology information and said SRDM, identifying a constraint violation in the SR network, and running an optimization algorithm for SR optimization of constraints in the SR network, wherein said SR optimization comprises limiting a number of Segment Identifiers (SIDs) used in a SR policy implemented to resolve said constraint violation;
wherein limiting a number of SIDs used in said SR policy comprises limiting the number of SIDs to two.

11. The apparatus of claim 10 wherein the processor is further operable to instantiate said SR policy in the SR network.

12. The apparatus of claim 10 wherein running said optimization algorithm comprises identifying a smallest demand larger than an amount of saturation on a congested link and demands smaller than the amount of saturation, and relocating one or more of said identified demands to resolve said constraint violation.

13. The apparatus of claim 10 wherein running said optimization algorithm comprises relocating at least one demand based on changes to one or two of said SIDs.

14. The apparatus of claim 10 wherein said violation is identified upon receiving a BGP-LS (Border Gateway Protocol Link State) notification.

15. The apparatus of claim 10 wherein said constraints comprise SLA (Service Level Agreement) constraints.

16. The apparatus of claim 10 wherein the processor is further operable to deploy a TE tunnel to instantiate said SR policy.

17. One or more non-transitory computer readable media storing logic, which when executed by a processor performs the following:
monitor traffic in a Segment Routing (SR) network through collection of a Segment Routing Demand Matrix (SRDM) at a Traffic Engineering (TE) system;
process topology information for the SR network at the TE system;
model the SR network based on said topology information and said SRDM at the TE system;
identify a constraint violation in the SR network at the TE system;
run an optimization algorithm for SR optimization of constraints in the SR network at the TE system, wherein said SR optimization comprises limiting a number of Segment Identifiers (SIDs) used in a SR policy implemented to resolve said constraint violation; and
relocate a demand to resolve said constraint violation and move said demand back when said constraint will no longer be violated.

18. The one or more non-transitory computer readable media of claim 17 further storing additional logic, which when executed by a processor performs the following:
identify a smallest demand larger than an amount of saturation on a congested link and demands smaller than the amount of saturation and relocate one or more of said identified demands over an alternate path utilizing the SR policy that resolves said constraint violation.

19. The one or more non-transitory computer readable media of claim 17 wherein said constraint is resolved by relocating at least one demand based on available capacity, latency, or IGP (Interior Gateway Protocol) distance.

20. The one or more non-transitory computer readable media of claim 17 further operable to deploy a TE tunnel to instantiate said SR policy.

Assignees

• Cisco Tech Inc

Inventors

• Laberge Tim
• Filsfils Clarence
• Francois Pierre Jean Rene

Classifications

• H04L47/125 Primary

  by balancing the load, e.g. traffic engineering · CPC title

• H04L47/122

  by diverting traffic away from congested entities · CPC title

• H04L47/825

  Involving tunnels, e.g. MPLS · CPC title

• H04L47/2425

  for supporting services specification, e.g. SLA · CPC title

• H04L45/02

  Topology update or discovery · CPC title