A Discrete-Time Traffic and Topology Adaptive Routing Algorithm for LEO Satellite Networks

Abstract

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas

QoS routing algorithm based on traffic classification in LEO satellite networks

“…where ( , ) a c N , ( , ) b d M A satellite network without considering fractional satellite handover but integer satellite handover is called discrete-time traffic and topology (DT-TT) model [6]. The Earth is uniformly divided into N M u terrestrial zones which are rectangle, contiguous and non-overlapping.…”

“…E t denotes the propagation delay updating at the sth topology updating interval (TOI), which has discussed in our previous work [6]. ( ) q l E t denotes the queuing delay updating at the lth traffic updating interval (TRI), which enables a very fast response to traffic load on the outgoing link.…”

“…This algorithm overcame the limitation of traffic information, but the highsignal requirement is the most challenging problem. Based on our researches, we have proposed a discrete-time traffic and topology adaptive routing (DT-TTAR) algorithm [6]. This algorithm presented the minimum end-to-end delay counting both the propagation delay and the queuing delay, but ignored other performances.…”

A QoS guarantee service serving model in LEO satellite networks based on differential game

“…There are some outstanding works [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18] which are some fruitful outcomes.…”

Optimized routing protocol for broadband hybrid satellite constellation communication IP network system

“…Based on the queuing theory and the Little's equation [23,24], the queuing delay and some parameters of node link state information can be deduced from the open Jackson queuing [23] network which is used as the queuing delay model. Hence, the average service rate of node i can be written as (9).…”