Communication network configuration

A non-transitory computer-readable medium containing instructions that, when executed by at least one processor of a system, cause the system to perform operations for configuring a communication network, comprising:

• obtaining a network graph representing the communication network, the network graph including:
• vertices corresponding to nodes in the communication network;
• and
• edges corresponding to communication links in the communication network;
• determining a score for a first edge in the network graph, the score determination comprising:
• determining a first graph cut on the network graph, the first graph cut having a first graph cut rank and a first graph cut edge set that includes the first edge;
• and
• wherein the score depends in part on a first value of a first function for the first graph cut rank, the first function being a decreasing function of the first graph cut rank;
• determining, using the score for the first edge, a path on the network graph for a demand on the communication network;
• and
• configuring the communication network to satisfy the demand using the path.

A method for configuring a communication network, comprising:

• obtaining a network graph representing the communication network, the network graph including:
• vertices corresponding to nodes in the communication network;
• edges corresponding to communication links in the communication network, the communications links having equal costs, lengths, and delays and belonging to the same network segment;
• wherein the network graph includes a first subnetwork graph containing more than 10 vertices and a second subnetwork graph containing more than 10 vertices, the first and second subnetwork graphs connected by only two edges, a first edge between a vertex A in the first subnetwork and a vertex X in the second subnetwork and a second edge between the vertex X and a vertex B in the second subnetwork;
• and
• wherein a minimum length of a path entirely within the first subnetwork that connects vertex A and vertex B is greater than three;
• obtaining a demand having vertex A as a source vertex and vertex B as a terminal vertex;
• determining a path connecting vertex A and vertex B, the path excluding the first edge and the second edge;
• and
• configuring the communication network to satisfy the demand using the path.