High Performance Inter-satellite Routing Design of Terahertz Interface

Wang, Xiaotian; Li, Tong; Qiu, Jian; Diao, Wenwen

doi:10.1109/icecai58670.2023.10176766

Cited by 1 publication

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, there are two possible approaches to formulating the traffic loss optimization problem [5,6,[14][15][16][17][18][19][20]. According to the first approach, the information densities, x ijk , are considered as variables.…”

Section: Problem Statement and Backgroundmentioning

confidence: 99%

“…An alternative to mathematical models based on routes are mathematical models based on flows in communication channels [16], which, starting from a certain graph density, have a lower dimension (fewer number of state variables) than models based on flows. The closest concepts to the algorithm proposed in this paper have been presented in [17,18], which consider cell losses in the ATM network.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks

Gaipov,

Tausnev,

Khodenkov

et al. 2023

Algorithms

View full text Add to dashboard Cite

Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network design stage and during its operation. We propose an algorithm based on a minimum loss intensity (greedy-gradient algorithm) to search for optimal routes of information transmission in telecommunication networks. The relevance of the developed algorithm is determined by its practical use in data-transmitting modeling systems. The proposed algorithm satisfies several requirements, such as the speed of the calculations performed, the fulfillment of the conditions for its convergence, and its independence on the selected loss probability function, as well as on the network topology. The idea of the algorithm is a step-by-step recalculation of metrics based on derivatives of the loss intensity function with simultaneous redistribution of information flows along the routes determined by the Floyd algorithm. The comparative efficiency of the proposed algorithm is demonstrated by computational experiments on various network topologies (up to 100 nodes) with various traffic intensities.

show abstract