{"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}
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.