Referenced Items are not available for this document.
We introduce the problem of mesh optical network protection based on multiple logical ring/cycles. A two-staged problem formulation as well as classical ring finding algorithms are first discussed. A state-of-art protection cycle (p-cycle) finding algorithm is then proposed. This algorithm is scalable and especially suitable for sparse mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.
Published in:
Communications, 2002. ICC 2002. IEEE International Conference on
(Volume:5
)
Date of Conference: 2002
- Page(s):
- 2756 - 2760 vol.5
- Print ISBN:
- 0-7803-7400-2
- INSPEC Accession Number:
- 7395160
- Digital Object Identifier :
- 10.1109/ICC.2002.997344
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
