|
|
|
Novel P-Cycle protection strategy for asymmetric
traffic in mesh optical networks |
| LI Bin, ZANG Yunhua, DENG Yu, HUANG Shanguo, GU Wanyi |
| Key Laboratory of Optical Communications and Lightwave Technologies (Ministry of Education), Beijing University of Posts and Telecommunications; |
|
|
|
|
Abstract A novel prefigured-cycle (P-Cycle) algorithm was proposed to improve the protection success ratio for asymmetric traffic in mesh optical networks. The proposed algorithm was simulated in a Pan-European COST239 network environment under an asymmetric dynamic traffic model. The experimental results show that the proposed algorithm has lower capacity redundancy and higher utilization rate of configured resources than traditional P-Cycle methods. Network performance can be improved when implementing this algorithm under single-link failure circumstances. The system behavior is analyzed under different traffic volumes and the configuration strategy is also investigated for the heavy-load and light-load networks respectively.
|
|
Issue Date: 05 September 2008
|
|
| 1 |
Doucette J He D Grover W D et al.Algorithmic approaches for efficient enumerationof candidate P-Cycles and capacitated P-Cycle network designIn: Proceedings of the Fourth International Workshopon Design of Reliable Communication Networks, Alberta 2003 212220
|
| 2 |
Grover W D Stamatelakis D Cycle-oriented distributedpreconfiguration: ring-like speed with mesh-like capacity for self-planningnetwork restorationIn: Proceedings of IEEEInternational Conference on Communications 1998 1537543
|
| 3 |
Zhang Z R Zhong W D Bose S K Dynamically survivable WDM network design with P-Cycle-basedPWCEIEEE Communications Letters 2005 9(8)756758.
doi:10.1109/LCOMM.2005.1496606
|
| 4 |
Zhang Pei Deng Yu Huang Shanguo et al.P-Cycles algorithms in WDM networksJournal of Beijing University of Posts and Telecommunications 2007 30(1)127131(in Chinese)
|
| 5 |
Stamatelakis D Grover W D Theoretical underpinnings forthe efficiency of restorable networks using preconfigured cyclesIEEE Transactions on Communications 2000 48(8)12621265.
doi:10.1109/26.864163
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
