计算机科学
计算机网络
启发式
可扩展性
整数规划
分布式计算
服务(商务)
节点(物理)
算法
数据库
工程类
经济
结构工程
经济
操作系统
作者
Tianhe Liu,Wei Wang,Xiangkun Man,Huifang Xiong,Yongli Zhao,Guangquan Wang,Yajie Li,Yanxia Tan,Shan Dong,Jie Zhang
出处
期刊:Journal of Optical Communications and Networking
[The Optical Society]
日期:2023-03-24
卷期号:15 (5): 268-268
被引量:2
摘要
In optical transport networks, client signals are usually aggregated to the lightpath channels for long-haul transport, and the aggregation process is referred to as service mapping. In the context of physical-layer secured optical networks, in which the lightpaths are encrypted, network operators need to consider not only the bandwidth demand but also the security demand of client services in the service mapping process. This paper mainly explores the service mapping issue, which decides the solution for aggregating service into the physical-layer secured optical transport network. First, we introduce the physical-layer secured optical transport networks and illustrate their differences from the traditional optical network. Then, we formulate the service mapping problem as an integer linear programming (ILP) model to maximize the number of successfully mapped services. To address the scalability issue of the ILP model, we further propose two security-aware service mapping algorithms based on the security constraints. Simulation results show that the ILP model can reach a 98.8% successful service mapping rate in a six-node mesh network. The successful service mapping rate of the heuristics is about 0.5% lower than the ILP model, which proves that the performance of the heuristics is very close to the ILP.
科研通智能强力驱动
Strongly Powered by AbleSci AI