CN113067775A - Protocol-independent heuristic source route discovery method - Google Patents
Protocol-independent heuristic source route discovery method Download PDFInfo
- Publication number
- CN113067775A CN113067775A CN202110271479.2A CN202110271479A CN113067775A CN 113067775 A CN113067775 A CN 113067775A CN 202110271479 A CN202110271479 A CN 202110271479A CN 113067775 A CN113067775 A CN 113067775A
- Authority
- CN
- China
- Prior art keywords
- satellite
- queue
- source
- destination
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a protocol-independent heuristic source route discovery method, which comprises the following steps: acquiring a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration; obtaining a routing path from a source satellite to a destination satellite according to the satellite network topology; and generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a destination satellite. The embodiment of the invention can adapt to various protocols by using the protocol-independent MPLS transmission mode, and the label is coded by using a mode based on the logic position, so that the label configuration of the satellite does not need to be updated during the running of the satellite; the logic position information is introduced as an heuristic function to guide route learning, only part of satellites are required to participate in the route learning, the signaling flow in the network and the number of the satellites participating in the route learning are greatly reduced, the route convergence efficiency is improved, and the network available time is prolonged.
Description
Technical Field
The invention relates to the technical field of network communication, in particular to a protocol-independent heuristic source route discovery method.
Background
The current routing mode of the LEO low-orbit satellite network is mainly a snapshot routing and dynamic routing mode. Snapshot routing cuts the satellite's operating cycle into a series of time slices, and the topology within each time slice is fixed, so the routing table can also be fixed within the time slice. And the satellite selects a corresponding routing table to guide data packet forwarding according to the current time slice. When the dynamic routing occurs at the moment that the original routing is unavailable due to the damage of some satellites or links, the topological graph of the whole constellation is firstly obtained by generally adopting a distance vector routing protocol of full-network flooding, and then the path calculation is carried out according to parameters such as weight, distance and the like. When the number of low earth orbit satellites increases rapidly, the traditional dynamic routing has the defects of excessive flooding information, slow convergence and jittering convergence results.
Thus, there is still a need for improvement and development of the prior art.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a protocol-independent heuristic source route discovery method aiming at solving the above-mentioned defects in the prior art, and aiming at solving the problems of excessive flooding information, slow convergence and jittering convergence result of the traditional dynamic route in the prior art.
The technical scheme adopted by the invention for solving the problems is as follows:
in a first aspect, an embodiment of the present invention provides a protocol-independent heuristic source route discovery method, where the method includes:
acquiring a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration;
obtaining a routing path from a source satellite to a destination satellite according to the satellite network topology;
and generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a destination satellite.
In one implementation, the generation manner of the satellite network topology is:
acquiring the logic position of a satellite node;
and generating a satellite network topology according to the logic position.
In one implementation, the obtaining a routing path from the source satellite to the destination satellite according to the satellite network topology includes:
obtaining the logic position of a source satellite and the logic position of a target satellite according to the preset relation between the satellite network topology and the satellite nodes;
when the satellite corresponding to the satellite node is not damaged and a communication link between the satellite nodes is in a connection state, calculating a route from the logic position of the source satellite to the logic position of the destination satellite by adopting a snapshot routing algorithm to obtain a route path from the source satellite to the destination satellite;
and when the satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, calculating a route from the logic position of the source satellite to the logic position of the destination satellite by adopting a dynamic routing algorithm to obtain a route path from the source satellite to the destination satellite.
In one implementation, the calculating, by using a dynamic routing algorithm, a route from the logical position of the source satellite to the logical position of the destination satellite when a satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, and obtaining the route path from the source satellite to the destination satellite includes:
when a satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, acquiring a Manhattan distance from the satellite node to the target satellite;
storing the satellite nodes and the manhattan distances into a first queue;
and traversing the first queue to obtain a routing path from the source satellite to the destination satellite.
In one implementation, the performing a traversal calculation on the first queue to obtain a routing path from the source satellite to the destination satellite includes:
traversing the first queue and extracting the satellite node with the minimum Manhattan distance;
storing the manhattan distance and the satellite node into a second queue;
and calculating a routing path of the adjacent satellite of the satellite node according to the first queue and the second queue to obtain the routing path from the source satellite to the destination satellite.
In one implementation, the performing routing path calculation on neighboring satellites of the satellite node according to the first queue and the second queue to obtain a routing path from the source satellite to the destination satellite includes:
when the link from the satellite node to the adjacent satellite is in a connection state or the second queue does not have the adjacent satellite, judging whether the adjacent satellite exists in the first queue or not;
when the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is not the destination satellite, adding the adjacent satellite to the first queue, and traversing the first queue to find out the satellite node with the minimum Manhattan distance;
and when the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is the destination satellite, stopping path calculation and using the second queue as a routing path from the source satellite to the destination satellite.
In an implementation manner, the generating an encapsulated packet in an MPLS label manner according to the routing path includes:
obtaining label queue data corresponding to the routing path according to the routing path;
and generating an encapsulated data packet in an MPLS label mode according to the label queue data.
In an implementation manner, the generating an encapsulated packet in an MPLS label manner according to the label queue data includes:
acquiring a destination address information data packet;
and encapsulating the label queue data and the destination address information data packet to generate an encapsulated data packet in an MPLS label mode.
In a second aspect, an embodiment of the present invention further provides a protocol-independent heuristic source route discovery apparatus, where the apparatus includes a satellite network topology construction unit, a route path acquisition unit, and an encapsulated packet generation and transmission unit, where:
the satellite network topology construction unit is used for acquiring a Walker constellation configuration and constructing a satellite network topology according to the Walker constellation configuration;
a routing path obtaining unit, configured to obtain a routing path from a source satellite to a destination satellite according to the satellite network topology;
and the encapsulated data packet generating and sending unit is used for generating an encapsulated data packet in an MPLS label mode according to the routing path and sending the encapsulated data packet to a target satellite.
In a third aspect, an embodiment of the present invention further provides an intelligent terminal, including a memory, and one or more programs, where the one or more programs are stored in the memory, and configured to be executed by one or more processors includes a method for performing the protocol-independent heuristic source route discovery method according to any one of the above.
In a fourth aspect, embodiments of the present invention also provide a non-transitory computer-readable storage medium, wherein instructions of the storage medium, when executed by a processor of an electronic device, enable the electronic device to perform a protocol-independent heuristic source route discovery method as described in any one of the above.
The invention has the beneficial effects that: the method comprises the steps of firstly obtaining a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration; then obtaining a routing path from the source satellite to the destination satellite according to the satellite network topology; finally, generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a target satellite; therefore, the embodiment of the invention can adapt to various protocols by using the protocol-independent MPLS transmission mode, and the label is coded by using a logic position-based mode, so that the label configuration of the satellite does not need to be updated during the running of the satellite; the logic position information is introduced as an heuristic function to guide route learning, only part of satellites are required to participate in the route learning, the signaling flow in the network and the number of the satellites participating in the route learning are greatly reduced, the route convergence efficiency is improved, and the network available time is prolonged.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart illustrating a protocol-independent heuristic source route discovery method according to an embodiment of the present invention.
Fig. 2 is a logical location diagram of a satellite node according to an embodiment of the present invention.
Fig. 3 is a Walker constellation diagram provided in the embodiment of the present invention.
Fig. 4 is a local Walker constellation diagram according to an embodiment of the present invention.
Fig. 5 is a flow chart of protocol independent heuristic source routing communication provided by an embodiment of the present invention.
Fig. 6 is a flowchart of a dynamic routing scheme according to an embodiment of the present invention.
Fig. 7 is a flowchart of a dynamic route learning process according to an embodiment of the present invention.
FIG. 8 is a diagram illustrating results of mpls frames provided in accordance with an embodiment of the present invention.
Fig. 9 is a schematic block diagram of a protocol-independent heuristic source route discovery apparatus according to an embodiment of the present invention.
Fig. 10 is a schematic block diagram of an internal structure of an intelligent terminal according to an embodiment of the present invention.
Detailed Description
The invention discloses a protocol-independent heuristic source route discovery method, and in order to make the purpose, technical scheme and effect of the invention clearer and clearer, the invention is further described in detail below by referring to the attached drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may also be present. Further, "connected" or "coupled" as used herein may include wirelessly connected or wirelessly coupled. As used herein, the term "and/or" includes all or any element and all combinations of one or more of the associated listed items.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
Because the LEO low-orbit satellite scale is rapidly enlarged in recent years (the number of satellite nodes is enlarged to the order of thousands and tens of thousands) along with the rapid development of satellite technology in the prior art, the traditional snapshot routing mode of storing the routing table on the satellite has great pressure on storage and routing matching of the satellite, and the traditional dynamic routing (OSPF) is basically incapable of convergence (the Cisco protocol suggests no more than 50 nodes in the domain). Even with DSR protocols that do not require full network flooding as a highlight, flood learning in small areas is required. The defects of excessive flooding information, slow convergence and jittering convergence results exist on a large-scale constellation scene and an LEO network with frequent topology change.
In order to solve the problems in the prior art, the embodiment of the present invention provides a protocol-independent heuristic source route discovery method, which can implement protocol independence on a data plane without updating the tag position of a satellite itself, wherein the data plane uses an mpls + ipv4 or ipv6 mode; in the control plane, the requirement of the traditional mode of updating the route in the whole network is eliminated, and meanwhile, the route learning is guided in a mode of taking the path direction and the distance as a heuristic function, so that the route convergence speed is accelerated. In specific implementation, firstly, acquiring a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration; then, according to the satellite network topology, a route path from a source satellite to a destination satellite is obtained, and route learning is guided in a way that the path direction and distance are used as heuristic functions in the process, so that the route convergence speed can be accelerated; and finally, generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a target satellite to realize efficient communication among the satellites.
Exemplary method
The embodiment provides a protocol-independent heuristic source route discovery method, which can be applied to intelligent terminals for network communication. As shown in fig. 1 in detail, the method includes:
s100, acquiring a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration;
specifically, a Walker constellation configuration is obtained, the Walker constellation is a general satellite orbit which is a circular orbit, each orbit plane is evenly distributed, and the satellites in the orbit planes are evenly distributed in a constellation arrangement manner, so that a satellite network topology can be constructed after the Walker constellation configuration is obtained, and in the satellite network topology, for example, each satellite can be provided with a plurality of same-orbit inter-satellite links and a plurality of different-orbit inter-satellite links, and the links can be maintained for a long time, because the relative speed of the connected satellites is very low except in a high-latitude area.
The generation mode of the satellite network topology is as follows: acquiring the logic position of a satellite node; and determining the topology of the satellite network according to the logic position.
Specifically, the logical position of the satellite node is obtained first, for example, taking the walker star constellation as an example, a logical position concept is introduced, so that the formed virtual topology has a mesh form, and an efficient path is used to represent parameters, as shown in fig. 2: < In, Is, Iw, Ie > (which Is
InterfaceNorth, Interfacesouth, InterfaceWest, an abbreviation for InterfaceEast) four tags represent the north, south, west, east outgoing interfaces of a single satellite, respectively, and may be listed as tag queues: [ In, Iw, Is, Iw ] to represent the path: north again to west and south again to west. And then generating a satellite network topology according to the logic position. As shown in fig. 3, for example, a satellite network includes two types of inter-satellite links: in some time slices, the same-orbit link and the different-orbit link exist between the satellites, and at the moment, the satellites are connected with the surrounding satellites and the links to form a grid shape, so that the formed satellite network topology is in a grid shape. In other time slices, the satellite runs near the north-south pole, the inter-orbit links of the polar orbit satellite network are disconnected when entering the polar region, only the same orbit is connected at the moment, no link between different orbits exists, the field-shaped satellite network is changed into the III-shaped satellite network, and the connection is reestablished after leaving the polar region, so that the topology of the satellite network has dynamics.
Having obtained the satellite network topology, the following steps can be performed as shown in fig. 1: step S200, obtaining a routing path from the source satellite to the destination satellite according to the satellite network topology;
in particular, the ground station may calculate a routing path from the source satellite to the destination satellite according to an IP-based routing algorithm or a distributed routing algorithm or a snapshot sequence routing algorithm or an ATM-based routing algorithm according to the satellite network topology for a known time slice.
For obtaining a routing path from the source satellite to the destination satellite, said calculating a routing path according to the satellite network topology comprises the steps of:
step S201, obtaining a logical position of a source satellite and a logical position of a target satellite according to a preset relation between the satellite network topology and the satellite nodes;
step S202, when the satellite corresponding to the satellite node is not damaged and the communication link between the satellite nodes is in a connection state, calculating the route from the logic position of the source satellite to the logic position of the destination satellite by adopting a snapshot routing algorithm to obtain a route path from the source satellite to the destination satellite;
step S203, when the satellite corresponding to the satellite node is damaged or the communication link between the satellite nodes is in a disconnected state, calculating the route from the logic position of the source satellite to the logic position of the destination satellite by adopting a dynamic routing algorithm to obtain the route path from the source satellite to the destination satellite.
In the present embodiment, a satellite network topology of a grid pattern in a time slice is acquired. Firstly, according to a preset relation between the satellite network topology and the satellite nodes, obtaining a logical position of a source satellite and a logical position of a target satellite; for example, the ground station receives a data message to be forwarded, which contains address information from a source satellite(s) to a destination satellite (d) at a certain time, and since the topology of the satellite is known and does not change in a given time slice, the ground station obtains the logical positions of the source satellite and the destination satellite in a satellite topology grid according to the mapping relationship between the source satellite address and the destination satellite address and the satellite. In this embodiment, as shown in FIG. 4, source s corresponds to satellite 7 and destination d corresponds to satellite 3. When the satellite corresponding to the satellite node is not damaged and a communication link between the satellite nodes is in a connection state, calculating a route from the logic position of the source satellite to the logic position of the destination satellite by adopting a snapshot routing algorithm to obtain a route path from the source satellite to the destination satellite; for example, labels are preset (north In Is 110, west Iw Is 101, south Is 111, east Ie Is 103), as shown In fig. 5, when a satellite corresponding to the satellite node Is not damaged and a communication link between the satellite nodes Is In a connected state, the satellite node normally forwards the data message, and after receiving the data message, the satellite 7 pops up a head of a label queue [103,110,110,103,103 ]: 103, finding out that the corresponding forwarding port is an eastern interconnection port according to 103, and forwarding, wherein the label queue of the data message is changed to [110,110,103,103], as shown in fig. 4, the satellite 4 pops up the head of queue 110 of the label queue [110,110,103,103] after receiving, finds out that the corresponding forwarding port is a northbound port according to 110, and forwards, and subsequent satellites 5, 6 and 3 sequentially pop up the label head of queue and forward until the destination. According to the snapshot routing scheme, snapshot routing entries of all source and destination addresses at all times do not need to be stored in the satellite, only corresponding port forwarding is needed to be carried out according to the received labels, required storage resources are greatly reduced in a large-scale constellation scene, meanwhile, due to the fact that the satellite does not need to carry out calculation such as longest matching and the like according to the destination addresses, related routing calculation and storage loads are carried out on a ground station, and precious satellite resources are saved. And when the satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, calculating a route from the logic position of the source satellite to the logic position of the destination satellite by adopting a dynamic routing algorithm to obtain a route path from the source satellite to the destination satellite. Correspondingly, when the satellite corresponding to the satellite node is damaged or the communication link between the satellite nodes is in a disconnected state, calculating a route from the logical position of the source satellite to the logical position of the destination satellite by using a dynamic routing algorithm, and obtaining a route path from the source satellite to the destination satellite comprises the following steps: when a satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, acquiring a Manhattan distance from the satellite node to the target satellite; storing the Manhattan distance between the satellite node and the target satellite into a first queue; and traversing the first queue to obtain a routing path from the source satellite to the destination satellite.
Specifically, when a satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, a dynamic routing mode is entered, the ground station finds that the packet loss rate of some connections exceeds a threshold D, and the duration exceeds a threshold T, and triggers a route discovery process. The ground station knows the source and target satellite according to the connected source and target address information and the satellite corresponding to the address information, and simultaneously knows the position of the source and target satellite on the virtual topology according to the logical position diagram of the current time point. As shown in fig. 5, when a satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, a dynamic route learning process is entered: acquiring the Manhattan distance from the satellite node to the target satellite; in practice, other distance calculation methods or other parameters such as delay may be used instead of the manhattan function as the heuristic function. If the Manhattan distance from the target satellite to the destination is defined as H, the Manhattan distance H can be obtained, and then the satellite nodes and the Manhattan distance are stored into a first queue; starting from a starting satellite, putting the satellite node and the H value thereof into a first queue alpha, and performing traversal calculation on the first queue to obtain a routing path from the source satellite to the destination satellite. Correspondingly, the step of performing traversal calculation on the first queue to obtain a routing path from the source satellite to the destination satellite includes the following steps: traversing the first queue and extracting the satellite node with the minimum Manhattan distance; storing the manhattan distance and the satellite node into a second queue; and calculating a routing path of the adjacent satellite of the satellite node according to the first queue and the second queue to obtain the routing path from the source satellite to the destination satellite.
Specifically, traversing the first queue, and extracting the satellite node with the minimum Manhattan distance; for example, traversing the first queue α, finding out a satellite node with the minimum manhattan distance H, taking the satellite node as a current satellite to be processed, and then storing the manhattan distance and the satellite node into a second queue; for example, the satellite node and the corresponding manhattan H value are moved into a second queue β, and finally, according to the first queue and the second queue, a routing path calculation is performed on the adjacent satellite of the satellite node to obtain a routing path from the source satellite to the destination satellite. Correspondingly, the step of calculating the routing path of the adjacent satellite of the satellite node according to the first queue and the second queue to obtain the routing path from the source satellite to the destination satellite includes the following steps: when the link from the satellite node to the adjacent satellite is in a connection state or the second queue does not have the adjacent satellite, judging whether the adjacent satellite exists in the first queue or not; when the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is not the destination satellite, adding the adjacent satellite to the first queue, and traversing the first queue to find out the satellite node with the minimum Manhattan distance; and when the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is the destination satellite, stopping path calculation and using the second queue as a routing path from the source satellite to the destination satellite.
Specifically, when the link from the satellite node to the adjacent satellite is in a connection state or the second queue does not have the adjacent satellite, determining whether the adjacent satellite exists in the first queue; for example, if the satellite node is unreachable or is in the second queue β, it is ignored; otherwise, judging whether the adjacent satellite is in the first queue alpha. When the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is not the destination satellite, adding the adjacent satellite to the first queue, and traversing the first queue to find out the satellite node with the minimum Manhattan distance; that is, if the neighboring satellite is not in the first queue α and the satellite corresponding to the current satellite node is not the destination satellite, the neighboring satellite is added to the first queue α and the current satellite is set as its superior node, the H value of this satellite is recorded, and the step of traversing the first queue α to find the satellite node with the smallest manhattan distance H is performed again, as shown in fig. 6. And when the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is the destination satellite, stopping path calculation and using the second queue as a routing path from the source satellite to the destination satellite. For example, if the neighboring satellite is not in the first queue α and the current satellite node is the destination satellite, a path has been found and the route discovery process is stopped. And finally, the second queue beta is the satellite through which the path passes, and then a label queue is obtained according to the position relation between the satellite network topological graph and the adjacent satellite to finish forward routing learning. The destination satellite then completes the reverse route learning by reversing the label queue to obtain a path from the destination to the source.
The dynamic route learning process is explained in detail below by taking fig. 7 as an example:
h101, the damage of the satellite 5 affects a link 7- >4- >5- >6- > 3. Link 7- >8- >9- >6- >3 and link 7- >4- >1- >2- >3 are forwarded as usual without being affected.
H102: the ground station finds that the link 7- >4- >5- >6- >3 is blocked, starts a route learning process, calculates the source and target satellites to be 7 and 3 according to the source and target address information and the logic position relation of the link 7- >4- >5- >6- >3, and informs the starting satellite 7 of the source and target satellites through a signaling packet
H103: the satellite 7 receives the route learning request, calculates its manhattan distance H to 4 from the satellite 3, and puts the information into a queue α: [ (7, H to 4) ]
H104: traverse all satellites in the queue α, with the smallest H satellite being 7, the satellite currently being processed
H105: moving satellite 7 from queue alpha to queue beta
H106 probing satellites adjacent to satellite 7 with icmp protocol: both 8 and 4 are reachable, and the manhattan distances from the satellites 8 and 4 to the destination satellite 3 are recorded and saved in the alpha queue: [ (8, H ═ 3), (4, H ═ 3) ]
And H107, repeating the step 104, traversing the alpha queue to select the satellite with the minimum H value, wherein H is 3, and the optional satellite 8 is the satellite needing to be processed currently.
H108: the satellite 8 is moved from the α queue to the β queue, where α ═ 4, (' H ═ 3) (' 7, ', H ═ 4), (' 8, ', H ═ 3) ]
H109 probing satellites adjacent to satellite 8 with icmp protocol: and 5, ignoring the damage detection protocol because the damage detection protocol is not reachable. Satellite 7 is in queue beta and is ignored. Satellite 9 may arrive and the manhattan distance to the destination satellite 3 may be calculated and stored in the alpha queue [ (4, H ═ 3), (9,
H＝2)]β＝[(7,H＝4),(8,H＝3)]
h110: and repeating the step 104, traversing the alpha queue, and selecting the satellite 9 with the minimum H value of 2 as the satellite needing to be processed currently.
H111: the satellite 9 moves from α to β queue, where α ═ [ (4, H ═ 3) ] β ═ [ (7, H ═ 4), (8, H ═ 3), (9, H ═ 2) ]
H120. probing the neighboring satellites of satellite 9 with icmp protocol, storing satellite 6 in alpha queue, and then traversing the selected satellite 6 as the current processing satellite. Satellite 6 is moved from alpha to beta queue.
H121: the adjacent satellites of the satellite 6 are detected by the icmp protocol, the satellite 3 is stored in an alpha queue, and then the selected satellite 3 is traversed to be the current processing satellite. Satellite 3 is moved from alpha to beta queue.
H122, the satellite 3 is the destination, and the route search is completed, where α ═ 4, H ═ 3, β ═ 7, H ═ 4, (8, H ═ 3), (9, H ═ 2), (6, H ═ 1), (3, H ═ 0) ]
H123: in the beta queue, the parent node 3- >6- >9- >8- >7 of the self is found from the satellite 3 in sequence, and the route from the satellite 3 to the satellite 7 is obtained. The reverse direction is the route from satellite 7 to satellite 3.
H124: and then obtaining a label queue according to the logic position: satellite 7 to satellite 3: [110,110,103,103,103] this time the dynamic route calculation is complete.
After obtaining the routing path from the source satellite to the destination satellite, the following steps are performed as shown in fig. 1: and step S300, generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a destination satellite. Correspondingly, the step of generating an encapsulated packet in an MPLS label manner according to the routing path and sending the encapsulated packet to a destination satellite includes the steps of: obtaining label queue data corresponding to the routing path according to the routing path; and generating an encapsulated data packet in an MPLS label mode according to the label queue data.
Specifically, label queue data corresponding to the routing path is obtained according to the routing path; for example, according to the topology of the satellite, the time delay, the load and the like, the ground station calculates the route of the source and destination (s, d) by the routing algorithm, which sequentially passes through the satellite: 7- >4- >5- >6- >3, according to the outgoing interface and interconnection relationship of the satellite, the label queue corresponding to the route is: and 103,110,110,103,103, generating an encapsulated packet in MPLS label mode according to the label queue data. Correspondingly, the step of generating an encapsulated packet in an MPLS label manner according to the label queue data includes the following steps: acquiring a destination address information data packet; and encapsulating the label queue data and the destination address information data packet to generate an encapsulated data packet in an MPLS label mode.
Specifically, as shown in fig. 8, a destination address information packet is obtained, for example, the packet before encapsulation is Ethernet + DATA, and then the label queue DATA and the destination address information packet are encapsulated to generate an encapsulated packet in an MPLS label manner, for example, an MPLS header is added between Ethernet and DATA after encapsulation, the MPLS header is a standard structure in which there is a label queue, and then there are some other flags, such as expsstl, specifically related to MPLS functions. The ground station pushes the tag queue into the mpls frame as shown in fig. 7, and the encapsulated service packet is sent to the satellite to begin transmission.
Exemplary device
As shown in fig. 9, an embodiment of the present invention provides a protocol-independent heuristic source route discovery apparatus, where the apparatus includes a satellite network topology construction unit 401, a route path acquisition unit 402, and an encapsulated packet generation and transmission unit 403, where:
the satellite network topology construction unit 401 is configured to obtain a Walker constellation configuration, and construct a satellite network topology according to the Walker constellation configuration;
a routing path obtaining unit 402, configured to obtain a routing path from a source satellite to a destination satellite according to the satellite network topology;
an encapsulated packet generating and sending unit 403, configured to generate an encapsulated packet in an MPLS label manner according to the routing path, and send the encapsulated packet to a destination satellite.
Based on the above embodiments, the present invention further provides an intelligent terminal, and a schematic block diagram thereof may be as shown in fig. 10. The intelligent terminal comprises a processor, a memory, a network interface, a display screen and a temperature sensor which are connected through a system bus. Wherein, the processor of the intelligent terminal is used for providing calculation and control capability. The memory of the intelligent terminal comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the intelligent terminal is used for being connected and communicated with an external terminal through a network. The computer program when executed by a processor implements a protocol independent heuristic source route discovery method. The display screen of the intelligent terminal can be a liquid crystal display screen or an electronic ink display screen, and the temperature sensor of the intelligent terminal is arranged inside the intelligent terminal in advance and used for detecting the operating temperature of internal equipment.
It will be understood by those skilled in the art that the schematic diagram of fig. 10 is only a block diagram of a part of the structure related to the solution of the present invention, and does not constitute a limitation to the intelligent terminal to which the solution of the present invention is applied, and a specific intelligent terminal may include more or less components than those shown in the figure, or combine some components, or have different arrangements of components.
In one embodiment, an intelligent terminal is provided that includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: acquiring a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration;
obtaining a routing path from a source satellite to a destination satellite according to the satellite network topology;
and generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a destination satellite.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, databases, or other media used in embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
In summary, the present invention discloses a protocol-independent heuristic source route discovery method, which includes: acquiring a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration; obtaining a routing path from a source satellite to a destination satellite according to the satellite network topology; and generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a destination satellite. The embodiment of the invention can adapt to various protocols by using the protocol-independent MPLS transmission mode, and the label is coded by using a mode based on the logic position, so that the label configuration of the satellite does not need to be updated during the running of the satellite; the logic position information is introduced as an heuristic function to guide route learning, only part of satellites are required to participate in the route learning, the signaling flow in the network and the number of the satellites participating in the route learning are greatly reduced, the route convergence efficiency is improved, and the network available time is prolonged.
Based on the above embodiments, the present invention discloses a protocol independent heuristic source route discovery method, it should be understood that the application of the present invention is not limited to the above examples, and it is obvious to those skilled in the art that the above modifications and changes can be made, and all of these modifications and changes should fall within the scope of the appended claims.
Claims (10)
1. A protocol-agnostic heuristic source route discovery method, characterized in that the method comprises:
acquiring a Walker constellation configuration, and constructing a satellite network topology according to the Walker constellation configuration;
obtaining a routing path from a source satellite to a destination satellite according to the satellite network topology;
and generating an encapsulated data packet in an MPLS label mode according to the routing path, and sending the encapsulated data packet to a destination satellite.
2. The protocol-agnostic heuristic source route discovery method of claim 1, wherein the satellite network topology is generated in a manner that:
acquiring the logic position of a satellite node;
and generating a satellite network topology according to the logic position.
3. The protocol-agnostic heuristic source route discovery method of claim 2, wherein said deriving a routing path from the source satellite to the destination satellite based on the satellite network topology comprises:
obtaining the logic position of a source satellite and the logic position of a target satellite according to the preset relation between the satellite network topology and the satellite nodes;
when the satellite corresponding to the satellite node is not damaged and a communication link between the satellite nodes is in a connection state, calculating a route from the logic position of the source satellite to the logic position of the destination satellite by adopting a snapshot routing algorithm to obtain a route path from the source satellite to the destination satellite;
and when the satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, calculating a route from the logic position of the source satellite to the logic position of the destination satellite by adopting a dynamic routing algorithm to obtain a route path from the source satellite to the destination satellite.
4. The protocol-agnostic heuristic source route discovery method of claim 3, wherein the computing a route from the logical position of the source satellite to the logical position of the destination satellite using a dynamic routing algorithm when the satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, resulting in the route path from the source satellite to the destination satellite comprises:
when a satellite corresponding to the satellite node is damaged or a communication link between the satellite nodes is in a disconnected state, acquiring a Manhattan distance from the satellite node to the target satellite;
storing the satellite nodes and the manhattan distances into a first queue;
and traversing the first queue to obtain a routing path from the source satellite to the destination satellite.
5. The protocol-agnostic heuristic source route discovery method of claim 4, wherein said performing a traversal computation on the first queue to obtain a routing path from the source satellite to the destination satellite comprises:
traversing the first queue and extracting the satellite node with the minimum Manhattan distance;
storing the manhattan distance and the satellite node into a second queue;
and calculating a routing path of the adjacent satellite of the satellite node according to the first queue and the second queue to obtain the routing path from the source satellite to the destination satellite.
6. The protocol-agnostic heuristic source route discovery method of claim 5, wherein the performing routing path computations for neighboring satellites of the satellite node based on the first queue and the second queue to obtain a routing path from the source satellite to the destination satellite comprises:
when the link from the satellite node to the adjacent satellite is in a connection state or the second queue does not have the adjacent satellite, judging whether the adjacent satellite exists in the first queue or not;
when the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is not the destination satellite, adding the adjacent satellite to the first queue, and traversing the first queue to find out the satellite node with the minimum Manhattan distance;
and when the adjacent satellite is not arranged in the first queue and the satellite corresponding to the satellite node is the destination satellite, stopping path calculation and using the second queue as a routing path from the source satellite to the destination satellite.
7. The protocol-agnostic heuristic source route discovery method of claim 1, wherein generating an MPLS label-wise encapsulation packet according to the routing path comprises:
obtaining label queue data corresponding to the routing path according to the routing path;
and generating an encapsulated data packet in an MPLS label mode according to the label queue data.
8. The protocol-agnostic heuristic source route discovery method of claim 7, wherein the generating an encapsulated packet in MPLS label mode based on the label queue data comprises:
acquiring a destination address information data packet;
and encapsulating the label queue data and the destination address information data packet to generate an encapsulated data packet in an MPLS label mode.
9. An intelligent terminal comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory, and wherein the one or more programs being configured to be executed by the one or more processors comprises instructions for performing the method of any of claims 1-8.
10. A non-transitory computer-readable storage medium, wherein instructions in the storage medium, when executed by a processor of an electronic device, enable the electronic device to perform the method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110271479.2A CN113067775B (en) | 2021-03-12 | 2021-03-12 | Protocol-independent heuristic source route discovery method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110271479.2A CN113067775B (en) | 2021-03-12 | 2021-03-12 | Protocol-independent heuristic source route discovery method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113067775A true CN113067775A (en) | 2021-07-02 |
| CN113067775B CN113067775B (en) | 2022-09-02 |
Family
ID=76560218
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110271479.2A Active CN113067775B (en) | 2021-03-12 | 2021-03-12 | Protocol-independent heuristic source route discovery method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113067775B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115514407A (en) * | 2022-07-28 | 2022-12-23 | 鹏城实验室 | Low earth orbit satellite network routing method, system and computer readable storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104065576A (en) * | 2014-07-07 | 2014-09-24 | 武汉大学 | Label switching method in dynamic MPLS satellite network |
| CN107040470A (en) * | 2016-12-26 | 2017-08-11 | 北京邮电大学 | Update method and device based on low-orbit satellite link topology status data |
| CN108400936A (en) * | 2018-03-05 | 2018-08-14 | 大连大学 | Information Network method for routing based on MPLS |
| CN110518959A (en) * | 2019-08-09 | 2019-11-29 | 南京理工大学 | A kind of LEO satellite network communication means and its system based on MPLS and DTN |
| CN111953512A (en) * | 2020-07-02 | 2020-11-17 | 西安电子科技大学 | Construction method, system and application of Mobius constellation topology configuration facing Walker constellation |
| CN112217555A (en) * | 2020-08-24 | 2021-01-12 | 成都天奥集团有限公司 | Formation satellite routing method based on SDN architecture and adopting SR routing protocol |
| CN112333109A (en) * | 2020-11-17 | 2021-02-05 | 重庆邮电大学 | Ant colony optimization-based load balancing routing method in low-orbit satellite network |
| CN112351469A (en) * | 2020-09-23 | 2021-02-09 | 北京遥测技术研究所 | Route optimization method based on inter-satellite link |
-
2021
- 2021-03-12 CN CN202110271479.2A patent/CN113067775B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104065576A (en) * | 2014-07-07 | 2014-09-24 | 武汉大学 | Label switching method in dynamic MPLS satellite network |
| CN107040470A (en) * | 2016-12-26 | 2017-08-11 | 北京邮电大学 | Update method and device based on low-orbit satellite link topology status data |
| CN108400936A (en) * | 2018-03-05 | 2018-08-14 | 大连大学 | Information Network method for routing based on MPLS |
| CN110518959A (en) * | 2019-08-09 | 2019-11-29 | 南京理工大学 | A kind of LEO satellite network communication means and its system based on MPLS and DTN |
| CN111953512A (en) * | 2020-07-02 | 2020-11-17 | 西安电子科技大学 | Construction method, system and application of Mobius constellation topology configuration facing Walker constellation |
| CN112217555A (en) * | 2020-08-24 | 2021-01-12 | 成都天奥集团有限公司 | Formation satellite routing method based on SDN architecture and adopting SR routing protocol |
| CN112351469A (en) * | 2020-09-23 | 2021-02-09 | 北京遥测技术研究所 | Route optimization method based on inter-satellite link |
| CN112333109A (en) * | 2020-11-17 | 2021-02-05 | 重庆邮电大学 | Ant colony optimization-based load balancing routing method in low-orbit satellite network |
Non-Patent Citations (3)
| Title |
|---|
| JIA, MIN, ET AL.: ""Routing algorithm with virtual topology toward to huge numbers of LEO mobile satellite network based on SDN."", 《MOBILE NETWORKS AND APPLICATIONS》 * |
| ZHU, YONGHU, ET AL.: ""Software defined routing algorithm in LEO satellite networks."", 《2017 INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATICS (ICELTICS)》 * |
| 丁俊栋: ""低轨卫星网络的路由技术研究"", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115514407A (en) * | 2022-07-28 | 2022-12-23 | 鹏城实验室 | Low earth orbit satellite network routing method, system and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113067775B (en) | 2022-09-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109510768B (en) | Method, device and system for transmitting Link State Advertisement (LSA) | |
| CN106375231B (en) | A kind of flow switching method, equipment and system | |
| US20150124587A1 (en) | Loop detection and repair in a multicast tree | |
| CN103685022A (en) | Message forwarding method and service provider network edge equipment | |
| CN104378296A (en) | Message forwarding method and device | |
| US10785701B2 (en) | Hybrid control plane entity for fat tree route disaggregation | |
| US20190394059A1 (en) | Bit index explicit replication (bier) penultimate hop popping | |
| CN108833272B (en) | Route management method and device | |
| CN103763750A (en) | Method for fast achieving packet forwarding in wireless ad hoc network of TDMA protocol | |
| CN113067775B (en) | Protocol-independent heuristic source route discovery method | |
| CN114710193A (en) | Satellite-to-ground link processing method and device and network equipment | |
| CN102932255B (en) | Method and device for selecting tunnel path | |
| CN115361335A (en) | SR-MPLS-based dynamic routing method for low-orbit satellite network | |
| WO2022002093A1 (en) | Distributing information in communication networks | |
| US11516120B2 (en) | Distance vector negative southbound topology information for routing in fat trees (RIFT) route | |
| CN110120906B (en) | Method and device for realizing dual active access TRILL park edge | |
| CN108601055B (en) | Method and system for deploying L3 VPN in L TE mobile backhaul network | |
| US8072908B2 (en) | Partitioned forwarding of packets originated on a broadcast link among layer 2 forwarding devices of different adjacency networks | |
| US11271844B2 (en) | Routing in fat tree networks using negative disaggregation advertisements | |
| CN115632692B (en) | Satellite dynamic topology routing method | |
| US11088939B1 (en) | Reducing open shortest path first protocol link flap | |
| CN114268593B (en) | SDN-based space satellite network source route forwarding method and device | |
| US20220173996A1 (en) | Route advertisement method, route generation method, and device | |
| CN104412548A (en) | Method and device for keeping user device IP address fixed | |
| CN114222345A (en) | Routing path calculation method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |