The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one o...The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one of the representative solutions,but it still has room for improvement in terms of routing stability.In this paper,we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules(MTCR-CR).The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL)construction solutions that meet the minimum number of topology changes to avoid route oscillations.The simulation results in Beidou-3 show that compared with DT-DVTR,MTCR-CR reduces the number of routing changes by about 92%,the number of path changes caused by routing changes is about38%,and the rerouting time is reduced by approximately 47%.At the same time,in order to show our algorithm more comprehensively,the same experimental index test was also carried out on the Globalstar satellite constellation.展开更多
We study asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the maximum latency of source-destination node-pai...We study asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the maximum latency of source-destination node-pairs over links with linear latencies. We show that there exists an optimal solution that is a 9-approximate Nash equilibrium, significantly improving the existing upper bound of 54 on the instability factor. We present fast implementation of the best response dynamics for computing a Nash equilibrium. Furthermore, we perform empirical study on the price of stability, narrowing the gap between the lower and upper bounds to 0.7436.展开更多
基金supported by the National Key Research and Development Program of China(No.2020YFB1806000)。
文摘The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one of the representative solutions,but it still has room for improvement in terms of routing stability.In this paper,we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules(MTCR-CR).The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL)construction solutions that meet the minimum number of topology changes to avoid route oscillations.The simulation results in Beidou-3 show that compared with DT-DVTR,MTCR-CR reduces the number of routing changes by about 92%,the number of path changes caused by routing changes is about38%,and the rerouting time is reduced by approximately 47%.At the same time,in order to show our algorithm more comprehensively,the same experimental index test was also carried out on the Globalstar satellite constellation.
基金Supported in part by China 973 Project(Grant No.2011CB80800)National Natural Science Foundation of China(Grant Nos.10531070,10721101,11222109 and 71101006)CAS Program for Cross & Cooperative Team of Science & Technology Innovation
文摘We study asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the maximum latency of source-destination node-pairs over links with linear latencies. We show that there exists an optimal solution that is a 9-approximate Nash equilibrium, significantly improving the existing upper bound of 54 on the instability factor. We present fast implementation of the best response dynamics for computing a Nash equilibrium. Furthermore, we perform empirical study on the price of stability, narrowing the gap between the lower and upper bounds to 0.7436.