Dynamic Path Routing with Maximum Allowable p-Cycle Length and with m-Cycle in Optical Mesh Networks
- 9 Downloads
During modern age, fast communication is an essential requirement of everyone and communication between large distances is mainly provided by optical mesh networks. Network failures even for a small interval lead to large disruptions in providing service of transferring of data. Therefore, for reliable network services, network survivability plays a vital role. Preconfigured protection cycle (p-cycle) combines the benefits of ring as well as mesh-based shared protection schemes which are two fundamental techniques of network survivability. Hamiltonian p-cycles (crosses every node of the network at one time) are mostly selected to achieve the level of optimal redundancy due to which the total length of the protection path may become longer than the length of the primary path, so the signal quality may fall below the desired threshold. In order to maintain required signal quality, the maximum possible length of protection path through p-cycle is to be limited. Shortest path routing (SPR) with restricted p-cycle length is mostly employed in current existing strategies of the optical networks. The monitoring cycles (m-cycles) are used for detection of fault and after that the affected service is protected which was interrupted due to span failure. This paper considers dynamic path routing (DPR) using the restricted p-cycle length with m-cycle against single-link failure. p-Cycles combined with m-cycles are used for identification of the location of the faults and its protection. An integer linear program (ILP) is expressed in optimizing the needed protection capacity with length restriction of p-cycles using DPR, and at the same time m-cycle properties are combined. Numerical results show that the total spare capacity with DPR under the maximum allowed p-cycle length combining m-cycles considering fault localization and protection is lesser than SPR.
KeywordsDynamic path routing Fault localization Hamiltonian p-cycle m-Cycle p-Cycle p-Cycle length limit Shortest path routing
The support for this work has been provided by World Bank under TEQIP II in the scheme of Doctoral Program Research Assistantship at HBTU (formerly HBTI).
- 1.W.D. Grover, Mesh-Based Survivable Networks (Prentice Hall, Upper Saddle River, 2004)Google Scholar
- 2.R. Ramaswami, K.N. Sivarajan, Optical Networks: A Practical Perspective, 2nd edn. (Morgan Kaufmann, Burlington, 2009)Google Scholar
- 9.W.D. Grover, Mesh-Based Survivable Networks: Options for Optical, MPLS, SONET and ATM Networking (Prentice-Hall, Upper Saddle River, 2003)Google Scholar
- 12.H. Zeng, Monitoring-Cycle Based Fault Detection and Localization in Mesh All Optical Networks, Ph.D. Dissertation, Carleton University, Ottawa, Canada, November 2007Google Scholar
- 14.G. Keiser, Optical Fiber Communications, 4th edn. (Tata McGraw-Hill, New York City, 2010)Google Scholar
- 15.J.M. Senior, Optical Fiber Communications: Principles and Practice, 2nd edn. (Prentice Hall, Delhi, 2008)Google Scholar
- 16.H. Li, p-Cycle Based Protection in WDM Mesh Networks, Ph.D. Thesis, Concordia University, Canada, 2012Google Scholar
- 18.W.D. Grover, D. Stamatelakis, Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration, in Proceedings of the IEEE International Conference on Communications, Atlanta, Georgia, USA, June 7–11, 1998, pp. 537–543Google Scholar
- 21.R. Asthana, Study of p-Cycle Based Protection in Optical Networks and Removal of Its Shortcomings, Ph.D. Thesis, Indian Institute of Technology, Kanpur, November 2007Google Scholar
- 22.A. Smutnicki, K. Walkowiak, Optimization of p-cycles for survivable anycasting streaming, in Proceedings of 7th International Workshop on the Design of Reliable Communication Networks, Washington DC, USA, October 2009, pp. 227–234Google Scholar