Data Files for Survivable Network Design with Shared-Protection Routing

The input and output files of the computational results referenced in the paper are presented here. Only the files pertaining to SND-NR are presented here as model SND-NR is also feasible for SND-R.

For each problem, there are three files - "input", "designed network" and "routes".

The "input" file has the following format:

1st line: number of nodes (NO_NODES), number of all possible edges (NO_EDGES) and modular link capacity.

Next NO_EDGES lines: From Node, To Node, Cost of installing one module of capacity, number of installed modules in the lower bound network SND-G.

Next line: Number of Commodities (K)

Next K lines: From Node, To Node, Demand

The "designed network" file has the following format:

NO_EDGES lines: From Node, To Node, Cost of installing one module of capacity, number of installed modules in the SND-NR network.

The "routes" file has the following format. Each row is terminated by a newline command

Commodity number (will range from 0 through K-1 both inclusive), internal indicator variable, number of demand sent along this path, A matrix of length NO_EDGES, B matrix of length NO_EDGES, PathA of length 1+NO_NODES, PathB of length 1+NO_NODES.

A matrix and B matrix are 0-1 matrices of the said length. An entry of 0 in index e indicates that edge e is not used in the route. An entry of 1 in index e indicates that edge e is used in the route. A matrix corresponds to the working path. B matrix corresponds to the restoration path.

The next entries correspond to PathA matrix of length 1+NO_NODES.

PathA[PathA[0]] through PathA[NO_NODES] is the actual working path.

The next entries correspond to PathB matrix of length 1+NO_NODES.

PathB[PathB[0]] through PathB[NO_NODES] is the actual restoration path.

For example, consider file pioro Routes. The last line indicates that for commodity 779, 113 units of demand are satisfied along that route. The working path for this route is 38-29-9-39. The restoration path for this route is 38-33-4-1-39.

atlanta: Input, Routes

france: Designed Network, Input, Routes

germany: Designed Network, Input, Routes

newyork: Input, Routes

norway: Designed Network, Input, Routes

pdh: Input, Routes

pioro: Designed Network, Input, Routes

polska: Designed Network, Input, Routes

Table 1
Problem 1: Designed Network, Input, Routes

Problem 2: Designed Network, Input, Routes

Problem 3: Designed Network, Input, Routes

Problem 4: Designed Network, Input, Routes

Problem 5: Designed Network, Input, Routes

Table 2
Problem 1: Designed Network, Input, Routes

Problem 2: Designed Network, Input, Routes

Problem 3: Designed Network, Input, Routes

Problem 4: Designed Network, Input, Routes

Problem 5: Designed Network, Input, Routes

Table 3
Problem 1: Designed Network, Input, Routes

Problem 2: Designed Network, Input, Routes

Problem 3: Designed Network, Input, Routes

Problem 4: Designed Network, Input, Routes

Problem 5: Designed Network, Input, Routes