An optimal delay routing algorithm considering delay variation in the LEO satellite communication network

Geng, Sunyue; Liu, Sifeng; Fang, Zhigeng; Gao, Su

doi:10.1016/j.comnet.2020.107166

Cited by 34 publications

(15 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where d is the number of resource types. When d � 0, it means that the LUT-based FPGA is in the state of energy saving (such as sleep, shutdown, or low-frequency operation), and when d � 1, it means that the LUT-based FPGA is in the state of operation [24]. Suppose that when a virtual machine is mapped to a physical LUT-based FPGA, the mapping relationship between all virtual machines in the data center and the physical LUT-based FPGA can be represented by a matrix R:…”

Section: Process Mapping Transformation Algorithmmentioning

confidence: 99%

FPGA Delay-Oriented Process Mapping Algorithm of Xiangxi Minority Based on LUT

Yun

Zeng

Zhang

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

At present, FPGA (field-programmable gate array) architecture has made great progress in the requirements of hardware volume, which can meet common needs. However, for the increasing number of resources, it is difficult to significantly reduce the delay of process mapping. Therefore, this paper proposes FDMAP (fit descending map) algorithm from the perspective of the LUT number to reduce the delay. This paper proposes a method of FPGA mapping and debugging for heterogeneous multicore high-performance processors based on isomorphic symmetric FPGA architecture, which effectively utilizes the architectural features of heterogeneous multicore processors and the symmetric features of isomorphic FPGA, divides FPGA functions from top to bottom in a hierarchical way, and constructs FPGA architecture from bottom to top. Using differential bridge and adaptive delay adjustment sampling technology, combined with the embedded virtual logic analyzer debugging tool, FPGA architecture can be lightened and deployed quickly. Multicore complementary core-to-core replacement simulation mapping methods such as debug shells can be used to effectively complete the mapping of the target’s high-performance heterogeneous multicore processor to the entire SOC (system on-ship) chip system-level FPGA. In the aspect of algorithm, the fdmap algorithm is mainly implemented, and the low latency mapping of resources is realized with FPGA architecture. In order to verify the effectiveness of mapping the fdmap algorithm, this paper compares the fdmap algorithm with the vector VM algorithm. The research shows that when the wavelength resolution is 7 pm and the temperature error is less than 1°C, the shell is debugged, and 10 mapping examples are simulated with the fdmap algorithm. In the experiment, the LUT with the most critical 20% is selected, and the closed value of the LUT search type is set to 0.86. Compared with the original data, the number of LUTs increased by 15.2%, and the criticality decreased by 35.21%. Compared with the vector VM algorithm with the biggest gap, the number of LUTs decreased by 14.25%, the criticality improved by 14.21%, and the overall delay decreased by 65%. Therefore, the isomorphic symmetric FPGA architecture proposed in this paper can improve the structural criticality and significantly reduce the latency while reducing the number of LUTs.

show abstract

Section: Process Mapping Transformation Algorithmmentioning

confidence: 99%

FPGA Delay-Oriented Process Mapping Algorithm of Xiangxi Minority Based on LUT

Yun

Zeng

Zhang

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The traditional LEO satellite network ignores the delay of links in routing, which leads to the incomplete evaluation of satellite network performance. To solve this problem, in [27], a satellite routing algorithm taking delay into account was proposed. The authors in [28] proposed a routing algorithm based on cooperative game theory to solve the problem of propagation delay and traffic load imbalance in LEO satellite network.…”

Section: Related Workmentioning

confidence: 99%

“…In the process of training, we use ε-greedy strategy, as shown in Equation (27), to avoid the result falling into the local optimal solution. The strategy can achieve the trade-off between exploration and exploitation, where r′ represents the random number generated in the process of selecting the action and ε represents the probability of action exploration.…”

Section: A Satellite Routing Algorithm Based On Reinforcement Learningmentioning

confidence: 99%

Reinforcement Learning‐Based Routing Algorithm in Satellite‐Terrestrial Integrated Networks

Yin

Huang

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Satellite-terrestrial integrated network (STIN) is an indispensable component of the Next Generation Internet (NGI) due to its wide coverage, high flexibility, and seamless communication services. It uses the part of satellite network to provide communication services to the users who cannot communicate directly in terrestrial network. However, existing satellite routing algorithms ignore the users’ request resources and the states of the satellite network. Therefore, these algorithms cannot effectively manage network resources in routing, leading to the congestion of satellite network in advance. To solve this problem, we model the routing problem in satellite network as a finite-state Markov decision process and formulate it as a combinatorial optimization problem. Then, we put forth a Q-learning-based routing algorithm (QLRA). By maximizing users’ utility, our proposed QLRA algorithm is able to select the optimal paths according to the dynamic characteristics of satellite network. Considering that the convergence speed of QLRA is slow due to the routing loop or ping-pong effect in the process of routing, we propose a split-based speed-up convergence strategy and also design a speed-up Q-learning-based routing algorithm, termed SQLRA. In addition, we update the Q value of each node from back to front in the learning process, which further accelerate the convergence speed of SQLRA. Experimental results show that our improved routing algorithm SQLRA greatly enhances the performance of satellite network in terms of throughput, delay, and bit error rate compared with other routing algorithms.

show abstract

“…The graphical evaluation review technique (GERT) network model solves the problem of the frequency of process nodes and cycle of network occurrence (Pritsker et al, 1966), Lin et al, 2011a) presents t-norm (Tω) fuzzy GERT simulation technology and extends to interval variables (Lin et al, 2011b). An optimal delay routing algorithm called delay queuing graphical evaluation and review technique minimal path is presented to apply to effective routing scheme with uncertain delay information (Geng et al, 2020). And this technique has good applications in risk analysis across several problem domains including engineering, environment, management, economic development, etc.…”

Section: Introductionmentioning

confidence: 99%

G-GERT network model of online public opinion reversal based on kernel and grey degree

Yan

Zeng

Xiong

et al. 2021

View full text Add to dashboard Cite

PurposeIn recent years, online public opinion reversal incidents have been occurring frequently, which has increased the complexity of the evolution of online public opinion, and they have become a difficult issue for public opinion management and control. It is of great significance to explore the regularity of online public opinion reversal.Design/methodology/approachCombined with the grey characteristics of online public opinion information, a grey graphical evaluation review technique (G-GERT) network model is constructed based on kernel and grey degree, and the frequency, probability and time of online public opinion reversal nodes are calculated using C-marking method and Z-marking method.FindingsThroughout the online public opinion reversal events, there are all repeated outbreak nodes occurring, so the authors regard the repeated occurrence of outbreak nodes as reversal. According to the average frequency, probability and time of repeated outbreak nodes in the G-GERT network model, the authors predict the corresponding key information of reversal. It can simulate the evolution process of public opinion events accurately.Originality/valueThe G-GERT network model based on kernel and grey degree reveals the regulation of public opinion reversal, predicts the frequency, probability and time of reversal nodes, which are the most concerned and difficult issues for decision-makers. The model provides the decision basis and reference for government decision-making departments.

show abstract

An optimal delay routing algorithm considering delay variation in the LEO satellite communication network

Cited by 34 publications

References 27 publications

FPGA Delay-Oriented Process Mapping Algorithm of Xiangxi Minority Based on LUT

FPGA Delay-Oriented Process Mapping Algorithm of Xiangxi Minority Based on LUT

Reinforcement Learning‐Based Routing Algorithm in Satellite‐Terrestrial Integrated Networks

G-GERT network model of online public opinion reversal based on kernel and grey degree

Contact Info

Product

Resources

About