The program NETWORK_COVER realize ways of improving of the P-cycle technology for finding cyclic paths (p-cycles) for mesh topology protection/restoration.


Optimization problem of finding a desirable set of p-cycles can be formulated as integer program (IP) where variables correspond to all cycles in a network. A standard approach is to use then IP algorithms to solve this problem. The drawback of this approach is that the number of variables (cycles) is very large (may be exponential) even we consider relatively small networks.

Sshot browse solution.gif

Our algorithms based on fast extracting a relatively small subset of «essential» variables. Instead of solution of large scale integer program in standard approach in our approach it is necessary to solve one linear program (LP) dual to the linear relaxation of the original integer program (we propose special efficient algorithm for this purpose) and solve one relatively small integer subproblem which includes «essential» integer variables.

You need an unzip tool like WinZip to unpack (and decrypt) the distribution.

Password — nortel99.


Файл:Network cover chm.zip on NETWORK_COVER in CHM (Compiled HTML) — Internet Explorer required.


Файл:Network cover bin.zip for Win95/98/2000/NT.


Файл:Network cover src.zip.


Download documentation and follow instructions in Section «Installation».