Eci Telecom Ltd.

Ribbon Communications Operating Company, Inc.

Inbal Hecht

Efraim Gelman

Shirel Ezra

Ziv Shem-Tov

Hayim Porat

Ziv Shem-tov

According to one example, a method performed by a computing system includes receiving a request for optimizing a communication network, the request defining a set of demands for the communication network, each demand of the set of demands having two or more endpoints, a diversity policy, a number of routes, and a set of constraints. The method further includes selecting a subset of optimization functions from a set of optimization functions, the selecting being based on characteristics of the communication network and a decision tree. The method further includes using the selected subset of optimization functions, determining an initial solution for the communication network, the initial solution comprising assignment of routes within demands of the set of demands. The method further includes, within a time constraint, iteratively applying an updated subset of optimization functions with modified parameters to reduce a cost of the initial solution to produce an optimal solution.

Flow orchestration for network configuration

A network management system can be configured to identify routes for satisfying a set of demands on a communications network using layer graph(s). The network management system can generate the layer graph(s) using a network graph that represents the optical communication network and an associated sets of available frequency slots. The network management system can iteratively identify candidate path(s) on the layer graph(s) that correspond to each of the demands and determine a cost for each candidate path. The cost for a candidate path can depend on a set of available edges affected by the selection of the candidate path. In each iteration, the network management system can select the lowest cost candidate path, update the network graph to reflect the selection of this candidate path, update the layer graph(s) based on the updating of the network graph, and update the candidate paths for the remaining demands as needed.

Optical communication network configuration

A network management system can be configured to identify routes for satisfying a set of demands on an optical communication network using layer graph(s). The layer graph edges can have edge scores that indicate a cost of the edge. The network management system can generate the layer graph(s) using a network graph that represents the optical communication network and an associated sets of available frequency slots. The network management system can iteratively identify candidate path(s) on the layer graph(s) that correspond to each of the demands and determine a cost for each candidate path using the edge scores. In each iteration, the network management system can select the lowest cost candidate path, update the layer graph(s) based on this selection, and update the candidate paths for the remaining demands as needed. The network management system can similarly generate restoration paths for each of the demands.

Headend nodes on a communication network can be configured to recover from a change of network conditions by generating new paths for demands. A headend node can generate paths both for demand(s) managed by the headend and other demand(s) managed by other headend(s). The headend nodes can be initialized with the same network representation and can deterministically identify paths, such that each headend identifies the same path for the same demand. The headend nodes can provide configuration instructions for the demands that they manage, but can provide them according to a deterministic schedule, to avoid conflicts.

Communication network configuration

An assignment of demands to routes on a communication network can be improved by selecting and updating a subset of the routes. A network management system (or other communication network component) can obtain a representation of the communication network. The representation can include a network graph, sets of resources, and a set of paths for the network graph. The network management system can update the set of paths by selecting a path subset and updating the paths of the path subset. The updating can satisfy a total change condition and a network improvement condition. The updating can be limited to unused edge and resource combinations or edge and resource combinations used by paths in the path subset. The network management system can configure the communications network to satisfy the demand using routes corresponding to the updated set of paths.

Spectral defragmentation in communication networks

Systems and methods are disclosed for determining a more-efficient set of routes on a communications network, given an initial set of routes that satisfies a set of demands. Consistent with disclosed embodiments, the routes can be represented as network paths on a network graph that represents the communications network. In some embodiments, a set of irreducible paths can be generated from the original network paths. The communications network can then be updated to implement routes corresponding to the set of irreducible paths. In some embodiments, a bipartite graph can be generated from the original network paths and the irreducible paths. An updated set of paths can be generated by selecting ones of the original network paths or the irreducible paths. In some embodiments, auxiliary graph can be generated from the original network paths and the irreducible paths. An updated set of paths can be generated using the auxiliary graph.

Path selection in data communication networks

Systems and methods are disclosed for configuring a communication network to satisfy a set of demands. A network management system can obtain a network graph representing the communication network, connectivity relationship that indicates valid pairs of edges for each vertex in the network graph, and a structure that lacks zero divisors. The network management system can use the network graph, connectivity relationship, and structure to determine a path length for which a valid path connecting a source vertex and a terminal vertex exists. The path length can be determined using a dynamic programming approach that associates an element of the structure with the collection of paths connecting the source vertex and the terminal vertex. The network management system can then use the network graph, connectivity relationship, and structure to determine a valid path of the path length that connects the source vertex and the terminal vertex.

Connectivity aware path finding

A network management system can be configured to identify routes for satisfying a set of demands on a communications network using a network graph that represents the communication network. The network graph edges can have edge scores that indicate a priority of the edge. The edge score for a network edge corresponding to a communication link in the communication network can depend on the topology of the communication network or the characteristics of the communication link. The network management system can iteratively identify candidate path(s) on the network graph that correspond to each of the demands and determine a score for each candidate path using the edge scores. In each iteration, the network management system can select the lowest score candidate path, update the network graph to reflect the selection of this candidate path, update the edge scores based on the updating of the network graph, and update the candidate paths for the remaining demands as needed.

Systems and methods are disclosed for configuring a communications network. In disclosed embodiments, a set of permissible service link decompositions and a set of basic service links may be obtained for the communications network. A spanning subset of service links for the communications may be generated. Generation of the spanning subset may include selecting a decomposition of a first service link from a set of permissible service link decompositions; updating the set of permissible service link decompositions based on the selected decomposition; and updating the set of basic service links using the updated set of permissible service link decompositions. In some embodiments, obtaining the set of permissible service link decompositions can include generating a set of permissible service link decompositions by traversing decomposition graphs generated for each of the service links. In some embodiments, the communications network can be configured to satisfy network demands using the spanning subset.

Systems and methods for configuring a communications network

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.

Service link grooming in data communication networks

Systems and methods are disclosed for configuring a communications network. In disclosed embodiments, for a communication network comprising fiber optic cables connected by switches and transceiver-transponders, a graph representing the communication network can be obtained with edges representing the fiber optic cables, and nodes representing the switches and transceiver-transponders. A set of service links can be determined for a path in the communication network based on a set of demands for the path. Each service link can represent data transmission by one of the transceiver-transponders through one or more of the fiber optic cables connected by zero or more of the switches. Sets of service links can be iteratively selected for progressively longer initial segments of the path. When the initial segment comprises the path, the set of service links for the initial segment can be selected as the set of service links for the path.

Growing community of inventors

Petah Tikva, Israel

Inbal Hecht