ALGORITHM APPROACHES FOR MINIMAL OPERATION BACKWARD ERROR RECOVERY IN DYNAMIC NETWORK TOPOLOGIES
DOI:
https://doi.org/10.29121/ijetmr.v12.i12.2025.1721Keywords:
Index Terms—WDM, loop-back, Network Restoration, Mesh NetworksAbstract
Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. In this paper, we consider a failure model in which any two links in the network may fail in an arbitrary order. Three loopback methods of recovering from double-link failures are presented. The first two methods require the identification of the failed links, while the third one does not. However, pre computing the backup paths for the third method is more difficult than for the first two. A heuristic algorithm that pre-computes backup paths for links is presented. Numerical results comparing the performance of our algorithm with other approaches suggests that it is possible to achieve recovery from double-link failures with a modest increase in backup capacity. Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is desirable to provide rapid preplanned recovery of link or node failures in a bandwidth-efficient distributed manner. We introduce generalized loop-back, a novel scheme for performing loop-back in optical mesh networks. We present an algorithm to perform recovery for link failure and one to perform generalized loop-back recovery for node failure. We illustrate the operation of both algorithms, prove their validity, and present a network management protocol algorithm, which enables distributed operation for link or node failure. We present three different applications of generalized loop-back. First, we present heuristic algorithms for selecting recovery graphs, which maintain short maximum and average lengths of recovery paths. Second, we present WDM-based loop-back recovery for optical networks where wavelengths are used to back up other wavelengths. We compare, for WDM-based loop-back, the operation of generalized loop-back operation with known ring-based ways of providing loop- back recovery over mesh networks. Finally, we introduce the use of generalized loop-back to provide recovery in a way that allows dynamic choice of routes over preplanned directions.
Downloads
References
A New Algorithm for Bi-Directional Self-Healing for Arbitrary Redundant Networks (1998).. In Proceedings of the Optical Fiber Communication Conference. IEEE.
Brown, G. N., Grover, W. D., Slevinsky, J. B., and MacGregor, M. H. (1994). An Architecture for Efficient Survivable Networks. In Proceedings of IEEE GLOBECOM (Vol. 2, pp. 471–477). IEEE.
Doverspike, R., and Wilson, B. (1994). Comparison of Capacity Efficiency of DCS Network Restoration Routing Techniques. Journal of Network and Systems Management, 2(2), 135–144. https://doi.org/10.1007/BF02139308
Dravida, S., Anderson, J., Doshi, B. T., and Harshavardhana, P. (1994). Fast Restoration of ATM Networks. IEEE Journal on Selected Areas in Communications, 12(1), 128–136. https://doi.org/10.1109/49.265712
Ellinas, G., Hailemarian, R. G., and Stern, T. E. (2000). Protection Cycles in Mesh WDM Networks. IEEE Journal on Selected Areas in Communications, 18(10), 1924–1937. https://doi.org/10.1109/49.887913
Ellinas, G., and Stern, T. E. (1996). Automatic Protection Switching for Link Failures in Optical Networks With Bi-Directional Links. In Proceedings of IEEE GLOBECOM (Vol. 1, pp. 152–156). IEEE. https://doi.org/10.1109/GLOCOM.1996.594351
Fan, G. (1992). Covering Graphs by Cycles. SIAM Journal on Computing, 21(3), 491–496. https://doi.org/10.1137/0405039
Finn, S. G., Médard, M., and Barry, R. A. (1997). A Novel Approach to Automatic Protection Switching Using Trees. In Proceedings of the International Conference on Communications. IEEE.
Fournier, I. (1985). Longest Cycles in 2-Connected Graphs of Independence Number. In Cycles in Graphs, Annals of Discrete Mathematics (Vol. 115, pp. 201–204). North-Holland.
Goddyn, L. (1985). A Girth Requirement for the Double Cycle Cover Conjecture. In Cycles in Graphs, Annals of Discrete Mathematics (Vol. 115, pp. 13–26). North-Holland. https://doi.org/10.1016/S0304-0208(08)72994-3
Grover, W. D. (1992). Case Studies of Survivable Ring, Mesh and Mesh-Arc Hybrid Networks. In Proceedings of IEEE GLOBECOM (pp. 633–638). IEEE. https://doi.org/10.1109/GLOCOM.1992.276439
Grover, W. D., and Stamatelakis, D. (1998). Cycle-Oriented Distributed Preconfiguration: Ring-Like Speed with Mesh-like Capacity for Self-Planning Network reconfiguration. In Proceedings of IEEE International Conference on Communications (Vol. 2, pp. 537–543). IEEE. https://doi.org/10.1109/ICC.1998.682929
Häggkvist, R., and Jackson, B. (1985). A Note on Maximal Cycles in 2-Connected Graphs. In Cycles in Graphs, Annals of Discrete Mathematics (Vol. 115, pp. 205–208). North-Holland. https://doi.org/10.1016/S0304-0208(08)73011-1
Itai, A., Lipton, R. J., Papadimitriou, C. H., and Rodeh, M. (1981). Covering Graphs with Simple Circuits. SIAM Journal on Computing, 10(4), 746–750. https://doi.org/10.1137/0210058
Jackson, B. (1980). Hamilton Cycles in Regular 2-Connected Graphs. Journal of Combinatorial Theory, Series B, 29(1), 27–46. https://doi.org/10.1016/0095-8956(80)90042-8
Jaeger, F. (1985). A Survey of the Double Cycle Cover Conjecture. In Cycles in Graphs, Annals of Discrete Mathematics (Vol. 115, pp. 1–12). North-Holland. https://doi.org/10.1016/S0304-0208(08)72993-1
Jan, R.-H., Hwang, F.-J., and Cheng, S.-T. (1993). Topological Optimization of a Communication Network Subject to a Reliability Constraint. IEEE Transactions on Reliability, 42(1), 63–70. https://doi.org/10.1109/24.210272
Médard, M., Finn, S. G., and Barry, R. A. (1997). Automatic Protection Switching for Multicasting in Optical Mesh Networks. In Proceedings of the Optical Fiber Communication Conference. IEEE. https://doi.org/10.1364/ONA.1998.AP1
Venkatesan, S., Veerasamy, J., and Shah, J. C. (1995). Spare Capacity Assignment in Telecom Networks Using Path Restoration. In Proceedings of IEEE International Conference on Communications (pp. 370–374). IEEE. https://doi.org/10.1109/MASCOT.1995.378644
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Aasifa Arabi, Dr. Nilesh Bhosle
This work is licensed under a Creative Commons Attribution 4.0 International License.
License and Copyright Agreement
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal.
- That it is not under consideration for publication elsewhere.
- That its release has been approved by all the author(s) and by the responsible authorities – tacitly or explicitly – of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
Copyright
Authors who publish with International Journal of Engineering Technologies and Management Research agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or edit it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
For More info, please visit CopyRight Section
