A distributed congestion avoidance routing algorithm in mega-constellation network with multi-gateway

Chen, Quan; Chen, Xiaoqian; Yang, Lei; Wu, Shuai; Tao, Xuefeng

doi:10.1016/j.actaastro.2019.05.051

Cited by 46 publications

(24 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Let H ( S m , SG i ) denote the minimum hop‐count between S m and SG i . We adopt a similar method as Papapetrou et al and Chen et al 27,28 to calculate H ( S m , SG i ). Given the addresses ( v 1 , h 1 ) and ( v 2 , h 2 ) of satellites S 1 and S 2 , the minimum hop‐count H ( S 1 , S 2 ) is…”

Section: System Modelmentioning

confidence: 99%

Multiple gateway placement in large‐scale constellation networks with inter‐satellite links

Chen

Yang

Liu

et al. 2020

Satell Commun Network

Self Cite

View full text Add to dashboard Cite

Multiple gateways are required in large satellite constellation networks (LSCNs) with inter-satellite links (ISLs), and their placement may greatly affect the system performance. Gateway placement can be optimized to achieve better network performance under the non-uniform ground demand distribution. This paper formulates a gateway placement optimization model for LSCN with ISLs, aiming at achieving an optimal overall performance including delay, traffic peak, and load balance. The constraints of potential gateway location, gateway-satellite connectivity, and max hop-count are considered. A genetic algorithm (GA)-based method is proposed to solve the integer optimization problem with the help of quasi-evenly distributed reference layout. A Starlink-like constellation with ISLs is adopted in the simulation. The simulation results show that the optimized layout has better performance than the reference layout. Additionally, the locations with high user demand or at the middle of ocean are preferred by gateways. The network performance is jointly influenced by gateway placement, demand distribution, constellation configuration, node, and link capacities. The abnormally high ISL hop-count is found in the south Indian Ocean, which is caused by constellation and ISL configuration.

show abstract

Section: System Modelmentioning

confidence: 99%

Multiple gateway placement in large‐scale constellation networks with inter‐satellite links

Chen

Yang

Liu

et al. 2020

Satell Commun Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…In DRA, each satellite independently determines the next hop towards the destination based on the logical positions of the satellites without using Dijkstra algorithm. In [9], the authors proposed a longer side priority (LSP) routing strategy. The main idea is to forward packets to the direction with more remaining hops to reduce congestion.…”

Section: Related Workmentioning

confidence: 99%

A Distributed Survivable Routing Algorithm for Mega-Constellations With Inclined Orbits

Zhang

Qiu

2020

IEEE Access

View full text Add to dashboard Cite

Mega-constellations consisting of hundreds to thousands of low-earth-orbit (LEO) satellites are an attractive solution for providing global ubiquitous network access. Due to good coverage properties for populated areas, inclined orbits are gaining popularity among commercial constellations. A scalable routing algorithm with survivability plays a key role in such systems. In this paper, we propose a distributed survivable routing algorithm for mega-constellations with inclined orbits. First, the special topology characteristic of inclined constellations is identified and formalized. Based on the topology characterization, a basic X-Y routing algorithm is presented to determine multiple primary and secondary paths towards each destination utilizing the regularity of the network topology with minimal computation overhead. Then, a failure recovery mechanism which consists of a restricted flooding mechanism and a pre-detour mechanism is proposed to reduce end-to-end delay and signaling overhead in case of link failures. Besides, a partialrecord loop avoidance mechanism is proposed to deal with routing loops with minimal overhead. Finally, a vector-based next hop selection mechanism is proposed to facilitate the selection of next hop while incorporating various criteria. The performance of the proposed routing algorithm is evaluated through simulation on the Starlink constellation. Simulation results show that our proposal achieves scalability by reducing signaling overhead and provides better quality of service in terms of end-to-end delay under link failures.

show abstract

“…The definition of parameters in this paper is shown in Table II. Inspired by the literature [32], the routing process for fierce wolves is as follows. Equation (16) indicates that the strategy is based on the shortest path, and equation (17) gives the routing method.…”

Section: ) Fierce Wolf and Its Behaviormentioning

confidence: 99%

A Routing Model Based on Multiple-User Requirements and the Optimal Solution

Liu

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

To promote the development of high-bandwidth IP networks of nongeostationary Earth orbit (NGEO) satellites, this paper designs a new benefit measurement model. Moreover, we propose the class-A QoS benefit criterion (QABC), which is established based on a mathematical model involving the remaining queue length and QoS. The benefit model includes three maximum and minimum conflict subgoals and is designed to avoid the problem that the ant colony algorithm easily falls to local optima. This new model is solved with the wolf colony algorithm, which provides both next-hop selection and bottleneck bandwidth reservation mechanisms. Additionally, many burst flows can occur in satellite networks, and they lead to a slow convergence speed and unnecessary overhead. In this paper, the Kalman filter algorithm is used to address these issues. Considering the long-term correlation of satellite traffic, it is feasible to smooth the queue length with a Kalman filter. Finally, the Kalman filter wolf colony algorithm (KFWCA) can solve the conflict problem in the new benefit measurement model. The algorithm is applied in the network simulator NS2.35, and the results verify the effectiveness of load balancing and QoS maximization in a satellite network. The results indicate that the KFWCA yields better performance than other algorithms based on traffic allocation, the average delay, the packet loss rate and other factors, especially under high-traffic conditions. INDEX TERMS benefit measurement model; KFWCA; QoS support; load balancing I. INTRODUCTION

show abstract

A distributed congestion avoidance routing algorithm in mega-constellation network with multi-gateway

Cited by 46 publications

References 20 publications

Multiple gateway placement in large‐scale constellation networks with inter‐satellite links

Multiple gateway placement in large‐scale constellation networks with inter‐satellite links

A Distributed Survivable Routing Algorithm for Mega-Constellations With Inclined Orbits

A Routing Model Based on Multiple-User Requirements and the Optimal Solution

Contact Info

Product

Resources

About