Download the full-sized PDF of Pre-cross-connected protection architectures for transparent optical transport networksDownload 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

Pre-cross-connected protection architectures for transparent optical transport networks Open Access


Other title
restorable network
optical network
transport network
Type of item
Degree grantor
University of Alberta
Author or creator
Grue, Aden
Supervisor and department
Grover, Wayne (Electrical and Computer Engineering)
Examining committee member and department
Ghani, Nasir (Electrical and Computer Engineering, University of New Mexico)
Amaral, Nelson (Computing Science)
Fair, Ivan (Electrical and Computer Engineering)
Cockburn, Bruce (Electrical and Computer Engineering)
DeCorby, Ray (Electrical and Computer Engineering)
Department of Electrical and Computer Engineering

Date accepted
Graduation date
Doctor of Philosophy
Degree level
This thesis presents a collection of studies on the topic of survivable transparent optical networks. As backbone networks increase in capacity, the issue of their survivability grows correspondingly in importance. The transparent optical network offers many advantages as the optical backbone network of the future, but also faces several challenges with regards to network protection. The fundamental question addressed by this thesis is therefore “How can we achieve high availability and failure resiliency in transparent optical transport networks?” We cover the design, characterization, and comparison of several protection architectures, many of them novel, that share the property of pre-cross-connection, a property that is important for protection of transparent networks. The architectures studied include span p-trees, PXTs, path p-trees, p-cycles, FIPP p-cycles, and UPSR-like p-cycles. We first present detailed studies of the PXT, span p-tree, and path p-tree architectures. This includes the development of efficient design algorithms and structural analysis of efficient designs. The results indicate a clear hierarchy of efficiency, with cycles being the most efficient, followed by trails, and then trees. However, we discover that architectures with lower average efficiency can be used to complement more efficient structures in rare cases. We also present a new design method for PXTs that is as capacity-efficient as the prior established method, but produces designs with greatly improved structural characteristics. We then move on to address PXT protection under a collection of real-world design constraints. The results show that PXTs strike a balance between efficiency and flexibility under these constraints. A further study on the problem of failure localization in transparent p-cycle networks demonstrates the possibility of integrating low cost failure localization capabilities into p-cycle network designs. Finally, we propose UPSR-like p-cycles as a way to combine the simplicity and speed of dedicated protection with the flexibility of mesh-based approaches. The results from our design experiments show that this architecture is able to take advantage of mesh topologies in a way that traditional ring-based approaches cannot. We also demonstrate methods by which UPSR-like p-cycle networks can deliver superior dual failure restorability to a select class of high priority services.
License granted by Aden Grue ( on 2009-09-01T21:16:01Z (GMT): 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 the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein 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: 8352560
Last modified: 2015:10:12 12:11:41-06:00
Filename: Grue_Aden_Fall 2009.pdf
Original checksum: d073010a65f16d578177f7482e59155b
Well formed: true
Valid: true
Status message: Too many fonts to report; some fonts omitted. Total fonts = 1092
Page count: 380
Activity of users you follow
User Activity Date