利用近最优分段路由提高地面卫星综合网络利用率

Guiting Zhong, Jian Yan, Linling Kuang
{"title":"利用近最优分段路由提高地面卫星综合网络利用率","authors":"Guiting Zhong, Jian Yan, Linling Kuang","doi":"10.1109/ICCChinaW.2018.8674481","DOIUrl":null,"url":null,"abstract":"The dynamic topology of integrated terrestrial-satellite networks and limited resources in space segment bring challenges to the design of efficient routing and traffic engineering (TE) schemes. In this paper, we proposed a segment routing based routing/TE framework for integrated terrestrial-satellite networks. In particular, we showed that near-optimal performance can be obtained with a limited number of middle nodes placed in the segments compared to multi-commodity flow. Furthermore, we formulated the segment routing problem with maximum profit as a primal-dual set cover problem, and presented an online heuristic algorithm to solve the optimization problem. We have proven that the proposed algorithm is $\\left[ {\\frac{1}{2},\\log d} \\right]$-competitive. Simulation results show that the proposed algorithm outperforms the traditional satellite algorithms in terms of throughput and rejection probability. In addition, we presented an implementation architecture of the segment routing in integrated terrestrial-satellite networks.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improving Integrated Terrestrial-Satellite Network Utilization using Near-Optimal Segment Routing\",\"authors\":\"Guiting Zhong, Jian Yan, Linling Kuang\",\"doi\":\"10.1109/ICCChinaW.2018.8674481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The dynamic topology of integrated terrestrial-satellite networks and limited resources in space segment bring challenges to the design of efficient routing and traffic engineering (TE) schemes. In this paper, we proposed a segment routing based routing/TE framework for integrated terrestrial-satellite networks. In particular, we showed that near-optimal performance can be obtained with a limited number of middle nodes placed in the segments compared to multi-commodity flow. Furthermore, we formulated the segment routing problem with maximum profit as a primal-dual set cover problem, and presented an online heuristic algorithm to solve the optimization problem. We have proven that the proposed algorithm is $\\\\left[ {\\\\frac{1}{2},\\\\log d} \\\\right]$-competitive. Simulation results show that the proposed algorithm outperforms the traditional satellite algorithms in terms of throughput and rejection probability. In addition, we presented an implementation architecture of the segment routing in integrated terrestrial-satellite networks.\",\"PeriodicalId\":201746,\"journal\":{\"name\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"volume\":\"210 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCChinaW.2018.8674481\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCChinaW.2018.8674481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

地星一体化网络的动态拓扑结构和空间资源的有限性给高效路由与通信工程(TE)方案的设计带来了挑战。本文提出了一种基于分段路由的地星综合网络路由/TE框架。特别是,我们表明,与多商品流相比,在片段中放置有限数量的中间节点可以获得接近最优的性能。在此基础上,将利润最大化的路段路由问题表述为一个原始对偶集覆盖问题,并提出了一种在线启发式算法来求解该优化问题。我们已经证明了所提出的算法是$\left[ {\frac{1}{2},\log d} \right]$ -竞争的。仿真结果表明,该算法在吞吐量和拒绝概率方面都优于传统的卫星算法。此外,我们还提出了一种地星综合网络中网段路由的实现体系结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving Integrated Terrestrial-Satellite Network Utilization using Near-Optimal Segment Routing
The dynamic topology of integrated terrestrial-satellite networks and limited resources in space segment bring challenges to the design of efficient routing and traffic engineering (TE) schemes. In this paper, we proposed a segment routing based routing/TE framework for integrated terrestrial-satellite networks. In particular, we showed that near-optimal performance can be obtained with a limited number of middle nodes placed in the segments compared to multi-commodity flow. Furthermore, we formulated the segment routing problem with maximum profit as a primal-dual set cover problem, and presented an online heuristic algorithm to solve the optimization problem. We have proven that the proposed algorithm is $\left[ {\frac{1}{2},\log d} \right]$-competitive. Simulation results show that the proposed algorithm outperforms the traditional satellite algorithms in terms of throughput and rejection probability. In addition, we presented an implementation architecture of the segment routing in integrated terrestrial-satellite networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信