Optimal Path Calculation for Multi-ring Based Packet–Optical Transport Networks
DOI:
https://doi.org/10.13052/jwe1540-9589.2364Keywords:
MPLS-TP, protection and recovery, optimal path calculationAbstract
Multi-domain optical transport networks are inherently non-interoperable and require integrated orchestration and path provisioning mechanisms at the network-wide level. Moreover, ensuring the network’s survivability is a critical issue. While the MPLS-TP (multi-protocol label switching-transport profile) defines various protection and recovery mechanisms as standards, it does not address methods for calculating and selecting protection and recovery paths. Therefore, an algorithm is needed to calculate and set up paths to ensure quick protection and recovery across the entire integrated network, minimizing conflicts in protection and recovery at the packet optical integrated network level. In this paper, we proposed an algorithm that calculates and sets a path that enables rapid protection and recovery in an MPLS-TP network composed of a multi-ring-mesh topology. To this end, this study proposes the concept of a transparent node (T-node) for calculating link-disjoint SPF (shortest path first) in a multi-ring network with dual or more rings. A T-node is a node in a ring with more than a dual ring and indicates that the node has been used once in route calculation. Therefore, during path calculation, a T-node can be used as a source node and an intermediate node but not as a destination node.
Downloads
References
S. Waleed, M. Faizan, M. Iqbal and M. I. Anis, Demonstration of Single Link Failure Recovery using Bellman Ford and Dijkstra Algorithm in SDN, pp. 0–30.
L. Yang, D. Li and dan R. Tan, “Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm”, IEEE Access, vol. 8, pp. 88717–88728, 2020.
S. Khan, S. Anjum, U. A. Gulzari, T. Umer and B. S. Kim, “Bandwidth-Constrained Multi-Objective Segmented Brute-Force Algorithm for Efficient Mapping of Embedded Applications on NoC Architecture”, IEEE Access, vol. 6, pp. 11242–11254, 2017.
W. Xia, C. Di, H. Guo and dan S. Li, “Reinforcement Learning Based Stochastic Shortest Path Finding in Wireless Sensor Networks”, IEEE Access, vol. 7, pp. 157807–157817, 2019.
Y. Li, Z. L. Zhang and dan D. Boley, “From shortest-path to all-path: The routing continuum theory and its applications”, IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 7, pp. 1745–1755, 2014.
C. W. Ahn dan and R. S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations”, IEEE Trans. Evol. Comput., vol. 6, no. 6, pp. 566–579, 2002.
O. Cosma, P. C. Pop and dan I. Zelina, “An effective genetic algorithm for solving the clustered shortest-path tree problem”, IEEE Access, vol. 9, pp. 15570–15591, 2021.
M. K. M. Ali dan and F. Kamoun, Neural Networks for Shortest Path Computation and Routing in Computer Networks, vol. 4, no. 6, 1993.
M. Huynh, S. Goose, P. Mohapatra and dan R. Liao, “RRR: Rapid Ring Recovery Submillisecond Decentralized Recovery for Ethernet Ring”, IEEE Trans. Comput., vol. 60, no. 11, pp. 1561–1570, 2011.
M. Tsubokawa, “Reliability Evaluation for Distributed PONs with Ring and Tree Topologies”, IEEE/OSA J. Opt. Commun. Network, vol. 4, no. 10, pp. 790–798, 2012.
Q. E. Muftikhali, A. Y. Danar, A. Kusumawati and dan S. Hidayat, “Algoritma Genetika dalam Menentukan Rute Optimal Topologi Cincin pada WAN”, J. Teknol. Inf. dan Ilmu Komput., vol. 4, no. 1, pp. 62, 2017.
