Optimal Path Calculation for Multi-Ring Based Packet-Optical Transport Networks

IF 0.7 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Journal of Web Engineering Pub Date : 2024-09-01 DOI:10.13052/jwe1540-9589.2364
Hyuncheol Kim
{"title":"Optimal Path Calculation for Multi-Ring Based Packet-Optical Transport Networks","authors":"Hyuncheol Kim","doi":"10.13052/jwe1540-9589.2364","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 6","pages":"801-812"},"PeriodicalIF":0.7000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10747169","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Web Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10747169/","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多环的分组-光传输网络的最优路径计算
多域光传输网络本质上是不可互操作的,因此需要在整个网络层面建立集成的协调和路径供应机制。此外,确保网络的可生存性也是一个关键问题。虽然 MPLS-TP(多协议标签交换-传输配置文件)将各种保护和恢复机制定义为标准,但并未涉及计算和选择保护与恢复路径的方法。因此,需要一种算法来计算和设置路径,以确保整个集成网络的快速保护和恢复,最大限度地减少分组光集成网络层面的保护和恢复冲突。在本文中,我们提出了一种算法,可以计算和设置路径,从而在由多环网拓扑组成的 MPLS-TP 网络中实现快速保护和恢复。为此,本研究提出了透明节点(T-node)的概念,用于在双环或多环多环网络中计算链路不相交 SPF(最短路径优先)。T 节点是双环以上环网中的一个节点,表示该节点在路由计算中被使用过一次。因此,在路径计算过程中,T 节点可以用作源节点和中间节点,但不能用作目的节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Web Engineering
Journal of Web Engineering 工程技术-计算机:理论方法
CiteScore
1.80
自引率
12.50%
发文量
62
审稿时长
9 months
期刊介绍: The World Wide Web and its associated technologies have become a major implementation and delivery platform for a large variety of applications, ranging from simple institutional information Web sites to sophisticated supply-chain management systems, financial applications, e-government, distance learning, and entertainment, among others. Such applications, in addition to their intrinsic functionality, also exhibit the more complex behavior of distributed applications.
期刊最新文献
A Study on Estimating Theme Park Attendance Using the AdaBoost Algorithm Based on Weather Information from the Korea Meteorological Administration Web Adversarial Attacks on Pre-Trained Deep Learning Models for Encrypted Traffic Analysis Priority-Based QoS Extensions and IAM Improvements Research on Quantum Key, Distribution Key and Post-Quantum Cryptography Key Applied Protocols for Data Science and Web Security Optimal Path Calculation for Multi-Ring Based Packet-Optical Transport Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1