Mapping sub-wavelength service with heterogenous security demand over physical-layer secured optical transport networks

计算机科学 计算机网络 启发式 可扩展性 整数规划 分布式计算 服务(商务) 节点(物理) 算法 数据库 工程类 结构工程 操作系统 经济 经济
作者
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]
卷期号:15 (5): 268-268 被引量:2
标识
DOI:10.1364/jocn.480207
摘要

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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
亲爱的融完成签到,获得积分10
刚刚
云梦泽完成签到,获得积分10
1秒前
乐观发布了新的文献求助10
2秒前
2秒前
精明凡雁完成签到,获得积分10
3秒前
allglitters完成签到,获得积分10
3秒前
4秒前
SciGPT应助炫远采纳,获得10
4秒前
悦雨完成签到,获得积分10
4秒前
怡然自得发布了新的文献求助10
4秒前
4秒前
cdercder应助辛勤的含烟采纳,获得10
6秒前
tonghau895完成签到 ,获得积分10
6秒前
虚心小凝完成签到 ,获得积分10
6秒前
6秒前
daisycc0516完成签到,获得积分10
7秒前
7秒前
8秒前
ninao发布了新的文献求助10
8秒前
8秒前
9秒前
10秒前
小天使发布了新的文献求助10
11秒前
12秒前
13秒前
13秒前
14秒前
俞水云发布了新的文献求助10
15秒前
小xun完成签到,获得积分10
15秒前
16秒前
SciGPT应助邵梁健采纳,获得10
17秒前
y2102223232发布了新的文献求助20
18秒前
18秒前
QYQ完成签到 ,获得积分10
20秒前
顾矜应助稳重的书双采纳,获得10
21秒前
22秒前
李小晴天发布了新的文献求助10
22秒前
Smile完成签到,获得积分10
22秒前
蕊蕊完成签到 ,获得积分10
24秒前
所所应助于洪丹采纳,获得10
25秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
How to Use Machine Learning in Chemistry: An Introduction 1000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7583974
求助须知:如何正确求助?哪些是违规求助? 9162735
关于积分的说明 19607753
捐赠科研通 7165896
什么是DOI,文献DOI怎么找? 3266349
关于科研通互助平台的介绍 2431292
邀请新用户注册赠送积分活动 2257894