42 | P a g e

REFERENCES
[1] Georgios Ellinas, Aklilu Gebreyesus Hailemariam, and Thomas E. Stern, "Protection Cycles in
Mesh WDM Networks.", in IEEE Journal on selected areas in communications, VOL. 18, NO. 10,
OCTOBER 2000.
[2] W. D. Grover and D. Stamatelakis, Cycle-oriented distributed configuration: Ring-like speed
with mesh-like capacity for self-planning network restoration, in Proc. ICC98, 1998, pp. 537543.
[3] H. Zeng, C. Huang, and A. Vukovic, A novel fault detection andlocalization scheme for mesh
all-optical networks based on monitoringcycles, Photonic Network Commun., vol. 11, no. 3, May
2006.
[4] H. Zeng, Monitoring-cycle based fault detection and localization in mesh all-optical networks,"
Ph.D. Dissertation, Carleton University, Ottawa, Canada, Spring 2007.
[5] Wayne D. Grover, and Aden Grue, Self-Fault Isolation in Transparent p-Cycle Networks: p-
Cycles as Their Own m-Cycles in IEEE Communications Letters, vol. 11, no. 12, December 2007.

[6] D. Stamatelakis and W. D. Grover, Theoretical underpinnings for the efficiency of restorable
networks using preconfigured cycles (p-cycles), in IEEE Transactions on Communications, vol.
48, no. 8, pp. 12621265, Aug. 2000.
[7] J. Doucette, D. He, W. D. Grover, and O. Yang, Algorithmic approaches for efficient
enumeration of candidate p-cycles and capacitated p-cycle network design, in Proc., DRCN 2003,
Alberta, Canada, Oct. 2003.
[8] Asthana, R.; Singh, Y.N.; Grover, W.D., "p-Cycles: An overview," Communications Surveys &
Tutorials, IEEE, vol.12, no.1, pp.97-111, First Quarter 2010.
[9] Rachna Asthana, "Study of p-Cycle Based Protection in Optical Networks and Removal of its
Shortcomings", Ph.D. Thesis, IIT Kanpur, Kanpur, November 2007.
[10] W. D. Grover, p-Cycles, Chapter 10 in Mesh-Based Survivable Networks: Options and
Strategies for Optical, MPLS, SONET and ATM Networking. Upper Saddle River, NJ: Prentice Hall,
2004.
43 | P a g e

[11] W. Grover and D. Stamatelakis, Bridging the ring-mesh dichotomy with p-cycles, in
Proc. IEEE VDE Design of Reliable Communication Networks (DRCN 2000), April 2000, pp.
92-104.
[12] N. S. V. R.ao. Computational Complexity Issues in operative Diagnosis of graph-based
systems. IEEE Transactions on Computers, 42(4). Pp.447-457 April 1993.
[13] L. L. Ho et al.. Adaptive and automated detection of service anomalies in transaction
oriented WANs. IEEE Journal on Selected Areas on Communications, pp. 744-757, May 2000.
[14] C. Mas and P. Thiran. An efficient algorithm for locating soft and hard failures in WDM
networks. IEEE Journal on Selected Areas on Communications, Vol.18, No. 10, pp. 1900-1911,
October 2000.
[15] I. Kaizela and M. Schwartz, Schemes for Fault Identification in Communications networks,
IEEE/ACM Transactions on Networking. 3(6), December 1995.
[16] C. Mas and P. Thiran. A review on fault location methods and their applications in optical
networks Optical Network Magazine Volume 2, Number 4, July/August 2001.
[17] Carmen Mas Machuca, Loarinis Tomkos, Failure Detection for Secure Optical Networks
Athens Information Technology(AlT) Markopoulo Av.,19002 Peania,Greece Mo.C2.1 pp. 70
ICTON 2003.
[18] M. Medard, S. R. Chinn and P. Saengudomlert,Node wrappers for QoS monitoring in
transparent optical nodes, Journal of High Speed Networks, Vol. 10, pp. 247-268, 2001.
[19] [1] J. Zheng and H. T. Mouftah, Optical WDM Networks: Concepts and Design
Principles. New York, Wiley-IEEE Press, 2004.
[20] H. T. Mouftah and P. H. Ho, Optical Networks Architecture and Survivability, Norwell,
MA Kluwer, 2003.
[21] W. D. Grover, Mesh-Based Survivable Networks. Englewood Cliffs, NJ: Prentice-Hall,
2003.
44 | P a g e

[22] A. V. Sichani, Signaling protocols for survivable all-optical networks, Ph.D. dissertation,
Schl. Inf. Technol. Eng., Univ. Ottawa, Ottawa, ON, Canada, Jan. 2006.
[23] A. V. Sichani and H. T. Mouftah, Limited-perimeter vector matching fault-localization
protocol for transparent all-optical communication networks, Commun. IET, vol. 1, no. 3, pp. 472
478, Jun. 2007.
[24] Mazen Khair, Burak Kantarci, Jun Zheng, and Hussein T. Mouftah, Optimization for Fault
Localization in All-Optical Networks, Journal of Lightwave Technology, vol. 27, no. 21, November
1, 2009.
[25] M. Mdard, D. Marquis, R. A. Barry, and S. G. Finn, Security issues in all-optical networks,"
IEEE Network Mag., vol. 11, no. 3, pp. 4248, May/June 1997.
[26] T. Y. Chow, F. Chudak, and A. M. French, Fast optical layer mesh protection using pre cross-
connected trails," IEEE/ACM Trans. Networking, vol. 12, no. 3, pp. 539548, 2004.
[27] H. Zeng, C. Huang, A. Vukovic, and M. Savoie, Fault detection and path performance
monitoring in meshed all-optical networks", in Proc. IEEE GLOBECOM, 2004.
[28] J. Tapolcai, B.Wu, and P.-H. Ho, On monitoring and failure localization in mesh all-optical
networks," in Proc. IEEE INFOCOM, 2009.
[29] Y. Pointurier, M. Coates, and M. Rabbat, Active monitoring of all optical networks," in Proc.
IEEE ICTON, pp. 169172, 2008.
[30] Sava Stanic, Suresh Subramaniam, Gokhan Sahin, Hongsik Choi, and Hyeong-Ah Choi, Active
Monitoring and Alarm Management for Fault Localization in Transparent All-Optical Networks,
IEEE Transactions on Network and Service Management, vol. 7, no. 2, June 2010.
[31] Bin Wu, Pin-Han Ho, Monitoring trail: a new paradigm for fast link failure localization in
WDM mesh networks, IEEE Global Telecommunications Conference, pp. 1 5, 2008.
[32] Ruyan Wang, Lei Xu, Dapeng Wu, Sheng Huang, An Effective Multi-fault Localization
Algorithm for Optical Networks, Third International Symposium on Intelligent Information
Technology Application Workshops, 2009.
45 | P a g e

[33] Y. Hamazumi, M. Koga, K. Kawai, H. Ichino, K. Sato, Optical path fault management in
layered networks, in Proceedings o f IEEE Globecom 98, Vol. 4, pages 2309-2314, Sydney,
Australia, Nov. 8-12, 1998.

[34] S. Stanic, S. Subramaniam, H. Choi, G. Sahin, and H.-A. Choi, On monitoring transparent
optical networks, in Proceedings of International Conference on Parallel Processing Workshops,
pages 217-223, Vancouver, BC, Canada, Aug. 18- 21,2002.

[35] ITU-T G.798, Characteristics o f optical transport network hierarchy equipment functional
blocks, Jan. 2002.

[36] W. D. Wallis, A Beginner's guide to graph theory, Boston: Birkhaeuser, 2000.

[37] F. Jarger, A survey of the cycle double cover conjecture, in: Cycles in Graphs, Edited by
B. R. Alspach and C. D. Godsil, Annals o f discrete mathematics 27, New York: Elsevier
Science, 1985.

[38] G. Shen, Design and performance of protected working capacity envelopes based on p-
cycles: an alternative framework for dynamic survivable network service provisioning. PhD
Thesis, University of Alberta, Edmonton, 2006.

[39] Z. Zhang, W.D. Zhong, and S.K. Bose, Dynamically survivable WDM network design
with p-cycle based PWCE, IEEE Communication Letters, vol. 9, pp. 756-758, Aug. 2005.

[40] W. He, J. Fang, and A.K. Somani, A new p-cycle based survivable design for dynamic
traffic in WDM networks, in Proc. of IEEE Global Telecommunications Conference, St.
Louis, Missouri, Nov. 28 Dec. 2, 2005, pp. 5 pages.

[41] G. Shen, W.D. Grover, Automatic lightpath service provisioning with an adaptive
protected working capacity envelope based on p-cycles, in Proc. of 5th Int. Workshop on the
Design of Reliable Communication Networks, Ischia Island, Italy, Oct. 16-19, 2005, pp. 9
pages.




APPENDIX

Following are the experimental results output of the simulation of the ILP Model of p-Cycle
with self fault isolation implemented on IBM ILOG CPLEX OPTIMIZATION STUDIO
v12.6:

NET-2- 26 SPANS

1. Pure p-Cycle with and 1unit cost/wavelength
// solution (optimal) with objective 97
// Quality Incumbent solution:
// MILP objective 9.7000000000e+001
// MILP solution norm |x| (Total, Max) 1.07000e+002 1.00000e+001

spare = [4 5 4 3 8 4 6 0 2 6 4 10 4 10 8 0 2 8 3 4 1 1 0];

noPcyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 2 0 0 0 0 0 0 0 0 0 0];


























2. p-Cycle with fault isolation and 1 unit cost/wavelength
// solution (optimal) with objective 100
// Quality Incumbent solution:
// MILP objective 1.0000000000e+002
// MILP solution norm |x| (Total, Max) 1.11000e+002 1.00000e+001
Spare = [2 3 4 5 6 6 3 1 4 5 4 10 5 10 8 1 3 8 4 5 1 1 1];
noPCyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 3 0 0 0 0 1 0 0 0 0 0];
46 | P a g e


47 | P a g e



3. Pure p-Cycle with distance dependent cost


// solution (optimal) with objective 172
// Quality Incumbent solution:
// MILP objective 1.7200000000e+002
// MILP solution norm |x| (Total, Max) 1.14000e+002 1.00000e+001


spare = [0 0 6 6 7 7 3 1 3 3 6 10 7 10 8 0 2 8 8 6 2 0 0];


noPcyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 3 3 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 2 0 2 0 0 0 0 0 0 0 0];






4. p-Cycle with self fault isolation and distance dependent cost


// solution (optimal) with objective 180
// Quality Incumbent solution:
// MILP objective 1.8000000000e+002
// MILP solution norm |x| (Total, Max) 1.14000e+002 1.00000e+001


Spare = [2 1 4 7 5 7 5 2 2 5 4 10 5 10 8 1 3 8 6 5 1 1 1];


noPCyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 2 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 3 0 0 0 0 1 0 0 0 0 0];




48 | P a g e


5. Pure p-Cycle with random working capacity and distance dependent cost
// solution (optimal) with objective 178
// Quality Incumbent solution:
// MILP objective 1.7800000000e+002
// MILP solution norm |x| (Total, Max) 1.15000e+002 1.00000e+001
// MILP solution error (Ax=b) (Total, Max) 0.00000e+000 0.00000e+000
// MILP x bound error (Total, Max) 0.00000e+000 0.00000e+000
// MILP x integrality error (Total, Max) 0.00000e+000 0.00000e+000
// MILP slack bound error (Total, Max) 0.00000e+000 0.00000e+000
//

spare = [0
0 6 6 6 6 4 0 4 4 6 10 6 10 9 0 1 9 9 6 3 0 0];
noPcyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 3 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 3 0 0 0 0 0 0 0 0];


6. p-Cycle with self fault isolation with distance dependent cost and random
working capacity
// solution (optimal) with objective 185
// Quality Incumbent solution:
// MILP objective 1.8500000000e+002
// MILP solution norm |x| (Total, Max) 1.17000e+002 1.00000e+001


Spare = [1 1 5 7 5 6 4 1 4 4 6 10 6 10 9 1 2 9 7 5 1 1 1];


noPCyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 2 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 1 0 0 1 0 0 0 0 0];



49 | P a g e


NET-1-28 SPANS

1. Pure PCycle with unit cost
// solution (optimal) with objective 377
// Quality Incumbent solution:
// MILP objective 3.7700000000e+002
// MILP solution norm |x| (Total, Max) 4.02000e+002 2.30000e+001
spare = [23 11 12 23 4 19 15 3 16 11 7 16 6 22 16 13 11 4 8 21 18 18 18 14
14 16 2 16];

noPcyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0
0 0 0 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 2];


2. p-Cycle with self fault isolation with unit cost
// solution (optimal) with objective 377
// Quality Incumbent solution:
// MILP objective 3.7700000000e+002
// MILP solution norm |x| (Total, Max) 4.02000e+002 2.30000e+001

Spare = [23 11 12 23 4 19 15 3 16 11 7 16 6 22 16 13 11 4 8 21 18 18 18 14
14 16 2 16];

noPCyles = [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0
0 0 0 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 2];


3. PCycle with self fault isolation and distance dependent cost

// solution (optimal) with objective 642
// Quality Incumbent solution:
// MILP objective 6.4200000000e+002
// MILP solution norm |x| (Total, Max) 4.15000e+002 2.30000e+001

Spare = [23 21 2 23 6 17 17 1 16 6 12 16 6 20 21 15 13 4 8 21 18 18 18 14
14 16 2 16];

noPCyles = [5 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 11 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 2 0 0 2 0
0 0 1 0 0 0 0 0 0 0 0 0 2];

50 | P a g e


4. Pure PCycle with distance dependent cost

// solution (optimal) with objective 640
// Quality Incumbent solution:
// MILP objective 6.4000000000e+002
// MILP solution norm |x| (Total, Max) 4.20000e+002 2.30000e+001
spare = [23 23 0 23 6 17 17 0 17 5 12 17 5 18 23 17 15 4 8 21 18 18 18 14
14 16 2 16];

noPcyles = [6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 10 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 2 0
0 0 5 0 0 0 0 0 0 0 0 0 2];


5. Pure p-Cycle with random working capacity and distance dependent cost

// solution (optimal) with objective 759
// Quality Incumbent solution:
// MILP objective 7.5900000000e+002
// MILP solution norm |x| (Total, Max) 3.97000e+002 2.00000e+001

spare = [20 12 10 20 2 20 10 0 20 0 10 20 10 20 20 20 10 11 12 7 15 15 15 15 15
18 3 18];

noPcyles = [1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0
0 0 0 0 0 0 0 0 0 0 0 0 3];



6. p-Cycle with self fault isolation with random working capacity and distance
dependent cost

// solution (optimal) with objective 761
// Quality Incumbent solution:
// MILP objective 7.6100000000e+002
// MILP solution norm |x| (Total, Max) 3.93000e+002 2.00000e+001
Spare = [20 10 10 20 1 19 11 1 20 1 9 20 11 19 20 18 11 10 11 9 15 15 15 14 14 18
4 18];

noPCyles = [0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 2 0
0 0 0 0 0 0 0 0 0 0 0 0 4];