Access the full text.
Sign up today, get DeepDyve free for 14 days.
Fangcheng Tang, L. Ruan (2005)
A Protection Tree Scheme for First-Failure Protection and Second-Failure Restoration in Optical Networks
W. Grover (2000)
Bridging the Ring-Mesh Dichotomy With P-Cycles
M. Médard, S. Finn, R. Barry (1999)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphsIEEE/ACM Trans. Netw., 7
A. Groebbens, D. Colle, S. Maesschalck, I. Lievens, M. Pickavet, P. Demeester, L. Tran, K. Steenhaut, A. Nowé (2003)
Efficient Protection in MPλS Networks Using Backup Trees: Part Two—SimulationsPhotonic Network Communications, 6
Shahrarn Shah-Heydari, O. Yang (2001)
A tree-based algorithm for protection/restoration in optical mesh networksCanadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555), 2
(2004)
Cycle - based protection for optical transport networks , Ph . D . Dissertation
D. Stamatelakis (1997)
Theory and Algorithms for Preconfiguration of Spare Capacity in Mesh Restorable Networks
T. Lan, K. Steenhaut, A. Nowé (2002)
Shared backup tree protection in MP/spl lambda/S networksThe 8th International Conference on Communication Systems, 2002. ICCS 2002., 2
G. Xue, Li Chen, K. Thulasiraman (2003)
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant treesIEEE J. Sel. Areas Commun., 21
(2000)
Bridging the ringmesh dichotomy with p-cycles. Proceedings of IEEE/VDE design of reliable communication networks (DRCN
W. Grover (2003)
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
S. Shah-Heydari (2007)
Self-repairing hierarchical tree-based link restoration scheme for mesh networks
G. Xue, Li Chen, K. Thulasiraman (2002)
Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphsGlobal Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 3
Yuna Zhang, O. Yang (2002)
A distributed tree algorithms for WDM network protection/restoration5th IEEE International Conference on High Speed Networks and Multimedia Communication (Cat. No.02EX612)
G. Xue, L. Chen, K. Thulasiraman (2002)
Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphsProceedings of GLOBECOM 2002 - IEEE Global Telecommunications Conference, 21
S. Shah-Heydari, O. Yang (2004)
Hierarchical Protection Tree Scheme for Failure Recovery in Mesh NetworksPhotonic Network Communications, 7
A. Groebbens, D. Colle, S. Maesschalck, I. Lievens, M. Pickavet, P. Demeester, L. Tran, K. Steenhaut, A. Nowé (2003)
Efficient Protection in MPλS Networks Using Backup Trees: Part One—Concepts and HeuristicsPhotonic Network Communications, 6
As high-speed networks grow in capacity, network protection becomes increasingly important. Recently, following interest in p-cycle protection, the related concept of p-trees has also been studied. In one line of work, a so-called “hierarchical tree” approach is studied and compared to p-cycles on some points. Some of the qualitative conclusions drawn, however, apply only to p-cycle designs consisting of a single Hamiltonian p-cycle. There are other confounding factors in the comparison between the two, such as the fact that, while the tree-based approach is not 100% restorable, p-cycles are. The tree and p-cycle networks are also designed by highly dissimilar methods. In addition, the claims regarding hierarchical trees seem to contradict earlier work, which found pre-planned trees to be significantly less capacity-efficient than p-cycles. These contradictory findings need to be resolved; a correct understanding of how these two architectures rank in terms of capacity efficiency is a basic issue of network science in this field. We therefore revisit the question in a definitive and novel way in which a unified optimal design framework compares minimum capacity, 100% restorable p-tree and p-cycle network designs. Results confirm the significantly higher capacity efficiency of p-cycles. Supporting discussion provides intuitive appreciation of why this is so, and the unified design framework contributes a further theoretical appreciation of how pre-planned trees and pre-connected cycles are related. In a novel further experiment we use the common optimal design model to study p-cycle/p-tree hybrid designs. This experiment answers the question “To what extent can a selection of trees compliment a cycle-based design, or vice-versa?” The results demonstrate the intrinsic merit of cycles over trees for pre-planned protection.
Photonic Network Communications – Springer Journals
Published: Aug 17, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.