Data structure for service path restoration in data communication networks
View Patent ↗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 providing one or more restoration paths in a data communication network, comprising:
identifying a failure in one or more service paths of the data communication network;
determining one or more affected service links in the data communication network based on the identified failure and a first data structure, wherein the first data structure includes a plurality of service paths, and for each of the service paths, the first data structure indicates each of one or more service links in the data communication network that use the plurality of service paths;
determining one or more affected service demands based on the affected service links and a second data structure,
wherein the second data structure includes a plurality of service links provided by the data communication network, and for each of the service links, the second data structure indicates each of one or more service demands in the data communication network that can be satisfied by using the plurality of service links, and wherein the second data structure is different from the first data structure,
wherein the one or more service demands in the second data structure require service delivered from a first service node to a second service node;
for each of the affected service demands, determining one or more allowed service links by removing the affected service links from a set of corresponding service links for the affected service demands; and
for each of the affected service demands, determining the one or more restoration paths based on the one or more allowed service links.
2. The method of claim 1 , wherein the one or more restoration paths are determined by using a Dijkstra's algorithm.
3. The method of claim 1 , further comprising:
for each of the affected service demands, constructing a network graph including a plurality of service nodes and one or more service links, wherein the affected service links are excluded from the network graph.
4. The method of claim 1 , wherein the one or more allowed service links are determined based on a third data structure, the third data structure including a plurality of service demands and a corresponding set of service links that can be used by the plurality of service demands.
5. The method of claim 4 , wherein the one or more restoration paths are determined based on a fourth data structure, the fourth data structure including the plurality of service links provided by the data communication network, one or more corresponding service paths, and a corresponding cost metric.
6. A network management system for migrating a plurality of communications services in a data communication network, the system comprising:
at least one processor; and
a memory for storing instructions executable by the at least one processor;
wherein the at least one processor is configured to:
identify a failure in one or more service paths of the data communication network;
determine one or more affected service links in the data communication network based on the identified failure and a first data structure, wherein the first data structure includes a plurality of service paths, and for each of the service paths, the first data structure indicates each of one or more service links in the data communication network that use the plurality of service paths;
determine one or more affected service demands based on the affected service links and a second data structure,
wherein the second data structure includes a plurality of service links provided by the data communication network, and for each of the service links, the second data structure indicates each of one or more service demands in the data communication network that can be satisfied by using the plurality of service links, and wherein the second data structure is different from the first data structure,
wherein the one or more service demands in the second data structure require service delivered from a first service node to a second service node;
for each of the affected service demands, determine one or more allowed service links by removing the affected service links from a set of corresponding service links for the affected service demands; and
for each of the affected service demands, determine the one or more restoration paths based on the one or more allowed service links.
7. The network management system of claim 6 , wherein the one or more restoration paths are determined by using a Dijkstra's algorithm.
8. The network management system of claim 6 , wherein the at least one processor is further configured to:
for each of the affected service demands, construct a network graph including a plurality of service nodes and one or more service links, wherein the affected service links are excluded from the network graph.
9. The network management system of claim 6 , wherein the one or more allowed service links are determined based on a third data structure, the third data structure including a plurality of service demands and a corresponding set of service links that can be used by the plurality of service demands.
10. The network management system of claim 9 , wherein the one or more restoration paths are determined based on a fourth data structure, the fourth data structure including the plurality of service links provided by the data communication network, one or more corresponding service paths, and a corresponding cost metric.
11. 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 operations for providing one or more restoration paths in a data communication network, the operations comprising:
identifying a failure in one or more service paths of the data communication network;
determining one or more affected service links in the data communication network based on the identified failure and a first data structure, wherein the first data structure includes a plurality of service paths, and for each of the service paths, the first data structure indicates each of one or more service links in the data communication network that use the plurality of service paths;
determining one or more affected service demands based on the affected service links and a second data structure,
wherein the second data structure includes a plurality of service links provided by the data communication network, and for each of the service links, the second data structure indicates each of one or more service demands in the data communication network that can be satisfied by using the plurality of service links, and wherein the second data structure is different from the first data structure,
wherein the one or more service demands in the second data structure require service delivered from a first service node to a second service node;
for each of the affected service demands, determining one or more allowed service links by removing the affected service links from a set of corresponding service links for the affected service demands; and
for each of the affected service demands, determining the one or more restoration paths based on the one or more allowed service links.
12. The non-transitory computer readable medium of claim 11 , wherein the one or more restoration paths are determined by using a Dijkstra's algorithm.
13. The non-transitory computer readable medium of claim 11 , wherein the operations further comprise:
for each of the affected service demands, constructing a network graph including a plurality of service nodes and one or more service links, wherein the affected service links are excluded from the network graph.
14. The non-transitory computer readable medium of claim 11 , wherein the one or more allowed service links are determined based on a third data structure, the third data structure including a plurality of service demands and a corresponding set of service links that can be used by the plurality of service demands.
15. The non-transitory computer readable medium of claim 14 , wherein the one or more restoration paths are determined based on a fourth data structure, the fourth data structure including the plurality of service links provided by the data communication network, one or more corresponding service paths, and a corresponding cost metric.