Service link grooming in data communication networks
Techniques for migrating a plurality of communications services in a data communication network are disclosed. Aspects include accessing a migration map for the plurality of communications services in the data communication network; identifying a communications dependency between a first service and a second service in the plurality of communications services, wherein according to the migration map the first service is configured to migrate from a first route to a second route, the second service is configured to migrate from a third route to a fourth route, and the third route overlaps with the second route; determining, based on the identified communications dependency, a migration sequence for migrating the plurality of communications services in the data communication network; and migrating the plurality of communications services from a first plurality of configurations to a second plurality of configurations according to the migration sequence.
1. A method for configuring a data communication network to satisfy a plurality of service demands in the data communication network, comprising:
identifying a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold;
wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands;
calculating a cost associated with each of the plurality of connected components;
determining, based on the calculated costs, a subset of that covers the plurality of service demands;
determining, based on the subset of the plurality of connected components, sets of service links for the plurality of service demands; and
configuring the data communication network to satisfy the plurality of service demands using the sets of service links.
2. The method of claim 1 , wherein the subset of the plurality of connected components is determined by using a set cover algorithm.
3. The method of claim 2 , wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm.
4. The method of claim 1 , wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the respective connected component.
5. A network management system, comprising:
at least one processor; and
a memory containing instructions executable by the at least one processor, to cause the network management system to perform operations for configuring a data communications network, the operations comprising:
identifying a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold;
wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, and each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands;
calculating a cost associated with each of the plurality of connected components;
determining, based on the calculated costs, a subset of the plurality of connected components that covers the plurality of service demands;
determining, based on the subset of the plurality of connected components, the sets of service links for the plurality of service demands; and
configuring the data communication network to satisfy the plurality of service demands using the sets of service links.
6. The network management system of claim 5 , wherein the subset of the plurality of connected components is determined by using a set cover algorithm.
7. The network management system of claim 6 , wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm.
8. The network management system of claim 5 , wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the respective connected component.
9. A non-transitory computer readable medium storing a set of instructions that is executable by at least one processor of a network management system to cause the network management system to perform a method for configuring a data communication network to satisfy a plurality of service demands in the data communication network, the method comprising:
identifying a plurality of connected components in a service demand graph, wherein each of the connected components is formed by one or more of a plurality of edges and one or more of a plurality of vertices, and the number of edges included in each of the plurality of connected components is less than or equal to a predetermined size threshold;
wherein the service demand graph comprises the plurality of vertices and the plurality of edges, each vertex corresponding to an end point of a service demand, and each edge connecting two vertices that correspond to end points of a same service demand, and the plurality of edges corresponding to different service demands;
calculating a cost associated with each of the plurality of connected components;
determining, based on the calculated costs, a subset of the plurality of connected components that covers the plurality of service demands;
determining, based on the subset of the plurality of connected components, sets of service links for the plurality of service demands; and
configuring the data communication network to satisfy the plurality of service demands using the sets of service links.
10. The non-transitory computer readable medium of claim 9 , wherein the subset of the plurality of connected components is determined by using a set cover algorithm.
11. The non-transitory computer readable medium of claim 10 , wherein the set cover algorithm includes a greedy algorithm or an integer linear programming algorithm.
12. The non-transitory computer readable medium of claim 9 , wherein calculating the cost associated with each of the plurality of connected components is based on a number of service links required to satisfy the respective connected component.