Download the full-sized PDF of p-Cycles: New Solutions for Node Protection, Transparency, and Large Scale Network DesignDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Graduate Studies and Research, Faculty of


This file is in the following collections:

Theses and Dissertations

p-Cycles: New Solutions for Node Protection, Transparency, and Large Scale Network Design Open Access


Other title
optical transport networks
Type of item
Degree grantor
University of Alberta
Author or creator
Onguetou Boaye, Diane Prisca
Supervisor and department
Grover, Wayne D. (Electrical and Computer Engineering)
Examining committee member and department
Cockburn, Bruce (Electrical and Computer Engineering)
Fair, Ivan (Electrical and Computer Engineering)
Sterbenz, James (External examiner, Electrical Engineering and Computer Science, Information and Telecommunication Technology Center, University of Kansas)
Elmallah, Ehab (Computing Science)
Grover, Wayne D. (Electrical and Computer Engineering)
Department of Electrical and Computer Engineering

Date accepted
Graduation date
Doctor of Philosophy
Degree level
Optical transport networks are critical infrastructures which carry huge amounts of great traffic variety but are inevitably subject to laser diode failures, fiber cuts and sometimes node outages. The concept of p-cycles is very attractive and competitive in the domain of network survivability because p-cycles have a unique ability to combine the real-time switching simplicity and speed of rings with the capacity efficiency, flexibility and freedom of a mesh in the routing of working and restored state paths. This dissertation presents several new research studies that increase our knowledge and act of available techniques to use and understand p-cycles. Advancements include a relatively simple but cost-effective generalization of how a BLSR-ring (or p-cycle to-date) derives survivability, in the event of node failure, through loopback at the nearest two neighbor-nodes on the same cycle. Significantly, this new insight also gives rise to a novel two-hop segment protection paradigm that unifies node and span failure protection. As well, the thesis introduces two fundamental advances for dealing with optical network transparency. One is the complementary matching of longer working paths with shorter protection segments available through p-cycles, thereby controlling the optical reach in restored network states. The other is the in-depth consideration of glass-switched p-cycles to rapidly, simply and efficiently provide for the direct replacement of failed fiber sections with whole replacement fibers. Experiments highlight that p-cycles formed out the span fibers overcome the complexity due to wavelength continuity requirements in transparent-based designs, significantly reduce overall capital expenditure (CapEx) costs and provide a solid working capacity envelope for dynamic traffic considerations. We also make advances on the problem of solving very large scale p-cycle design problems, with a technique that combines Genetic Algorithms (GA) with Integer Linear Programming (ILP). Basically, the GA-ILP considers any p-cycle ILP (to be solved) as the fitness function for a GA-like evolutionary heuristic, aimed at preselecting a few manageable candidate cycles working well together, from an almost infinite space. Beside the GA-ILP conceptual simplicity, experiments show high quality design solutions to very large scale p-cycle problem instances, involving up to 200 nodes.
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 4170397
Last modified: 2015:10:12 11:00:33-06:00
Filename: Onguetou_Thesis_Final_27July2011.pdf
Original checksum: b8fcdf4eeec0edf21370955e7a4550b0
Well formed: true
Valid: true
Status message: Too many fonts to report; some fonts omitted. Total fonts = 1973
Page count: 236
Activity of users you follow
User Activity Date