Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Routing fast convergence optimization method for leo/meo satellite network

A satellite network, fast convergence technology, applied in data exchange networks, digital transmission systems, electrical components, etc., can solve problems such as increasing network congestion, high fault misjudgment rate, and affecting network convergence speed.

Active Publication Date: 2019-01-25
DALIAN UNIV
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] First, in the fault detection phase of the RLSR protocol, in order to achieve fast fault detection, the number of confirmations for the detection message is only one time. Although it can effectively speed up fault detection, this detection method is not available for satellite networks with poor stability. Dynamic and high misjudgment rate of faults
[0004] Second, the RLSR protocol uses the flooding method in the link state notification LSA diffusion stage, which will increase the routing overhead in the satellite network, increase the possibility of network congestion, and increase the LSA queuing delay. Thereby affecting the path of the network to converge
[0007] Exponential algorithm uses a small initial value of spfHoldTime at the beginning. Once the topology changes frequently, spfHoldTime will quickly reach its maximum value, thus effectively limiting the update frequency of the routing table.
However, due to the high dynamic characteristics of the satellite network, when the exponential avoidance algorithm is used in the satellite network, spfHoldTime will quickly reach the limit value, which will cause a lot of time delay
Moreover, in the exponential avoidance algorithm, the timer is used as the only criterion for judging the update of the routing table, which will generate a large amount of unnecessary delay. For example, when there is only one LSA in the entire network, it is assumed that the router receives the LSA at time 0 , using the exponential avoidance algorithm will delay the time of spfDelay+spfHoldTime, and this delay is unnecessary, which will affect the convergence speed of the entire network

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Routing fast convergence optimization method for leo/meo satellite network
  • Routing fast convergence optimization method for leo/meo satellite network
  • Routing fast convergence optimization method for leo/meo satellite network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0078] The routing fast convergence optimization method of LEO / MEO satellite network includes: the steps of dynamic bidirectional forwarding detection. Aiming at the problem of high misjudgment rate of RLSR, a dynamic bidirectional forwarding detection technology DBFD (Dynamic Bidirectional forwarding Detection) is proposed. The reliability parameters are assigned to the road and each node, and the reliability of the link and the node is set according to the number of failures of the link and the node in a satellite network cycle, and the sending interval of the end-to-end message is dynamically adjusted according to the reliability, so that It is able to adapt to the highly dynamic nature of satellite networks.

[0079] 1. Relevant parameter settings, specifically:

[0080] Two parameters are set inside each node: set the number of neighbor nodes as n, and the reliability level of neighbor nodes Reliability level of the peer link When a node failure occurs on node A, the ...

Embodiment 2

[0094] The routing fast convergence optimization method for LEO / MEO satellite network, including: the steps for coverage clustering of MEO / LEO satellite network, clustering is carried out according to the coverage of MEO satellite, the cluster head is served by MEO satellite, and then the repeated coverage nodes Coincidence Node and Free Node are further processed to complete the entire clustering process. This algorithm limits the routing hops of LSA diffusion and reduces routing overhead;

[0095] S1, satellite classification:

[0096] Given a satellite set S, according to the orbital height, the satellite set is divided into two categories: M={m i |i=1,2,...,m}, which means the set of mid-orbit satellites; L={l j |j=1, 2,...,n}, representing a set of low-orbit satellites;

[0097] e(i, j) represents the link between satellite i and satellite j, and E(i) represents the set of neighbor nodes of satellite i;

[0098] S2, determine the link weight:

[0099] Let d(s i ,s j...

Embodiment 3

[0107] like image 3 As shown, as a further supplement to Embodiment 2, due to the overlap of coverage areas of cluster heads, the same LEO satellite may be covered by multiple cluster heads, so it is necessary to further process the repeated coverage nodes. The processing method is as follows:

[0108] The first step is to traverse the set N, and set the repeated coverage node set Represents a cluster and the intersection of

[0109] like Then update N as

[0110] like Then update N as

[0111] like Assume where l k ∈ L ij . like Then update N as like Then update N as like Then update N,

[0112] like and traverse L ij Calculate d(m i , l k ) and d(m j , l k ), where l k ∈ L ij . If d(m i , l k )>d(m j , l k ),but If d(m i , l k )j , l k ),but If d(m i , l k ) = d(m j , l k ),Assume Represents a cluster The number of elements in . like then update the cluster for like then update the cluster for l...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The route fast convergence optimization method of the LEO / MEO satellite network includes: a step of dynamic two-way forwarding detection; a step of coverage clustering for the MEO / LEO satellite network; and a step of judging the fault type of the satellite network. In the fault detection stage, the fault detection speed is improved through dynamic bidirectional forwarding detection; in the LSA diffusion stage, the routing overhead and queuing delay are reduced through the overlay network clustering algorithm; in the routing table update stage, the SFTJM algorithm is used to reduce the routing table update time Delay, and finally achieve the rapid convergence of the entire network.

Description

technical field [0001] The invention belongs to the field of satellite network dynamic routing protocol, in particular to a fast convergence optimization method for LEO / MEO satellite network routing. Background technique [0002] With the development of network communication, satellite network, as the extension of ground network, has attracted more and more attention of scholars. Due to the characteristics of large delay and high dynamics of the satellite network, the original routing protocol on the ground cannot adapt to the satellite network. At present, scientists at home and abroad propose to combine the virtual topology routing algorithm with the OSPF protocol and the dynamic routing protocol to improve the routing convergence speed of the satellite network. . The RLSR protocol is a representative of this type of protocol, but the protocol still has the following deficiencies: [0003] First, in the fault detection phase of the RLSR protocol, in order to achieve fast...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04B7/185H04L12/703H04L45/28
CPCH04B7/18519H04B7/18584H04B7/18597H04L45/28
Inventor 潘成胜来维庚杨力魏德宾
Owner DALIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com