CN112260742A - Fast rerouting method and device in mesh satellite network - Google Patents

Fast rerouting method and device in mesh satellite network Download PDF

Info

Publication number
CN112260742A
CN112260742A CN202010949505.8A CN202010949505A CN112260742A CN 112260742 A CN112260742 A CN 112260742A CN 202010949505 A CN202010949505 A CN 202010949505A CN 112260742 A CN112260742 A CN 112260742A
Authority
CN
China
Prior art keywords
node
max
satellite
link
positional relationship
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
Application number
CN202010949505.8A
Other languages
Chinese (zh)
Other versions
CN112260742B (en
Inventor
杨芫
徐明伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CN202010949505.8A priority Critical patent/CN112260742B/en
Publication of CN112260742A publication Critical patent/CN112260742A/en
Application granted granted Critical
Publication of CN112260742B publication Critical patent/CN112260742B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/18578—Satellite systems for providing broadband data service to individual earth stations
    • H04B7/18584—Arrangements for data networking, i.e. for data packet routing, for congestion control
    • 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/18578—Satellite systems for providing broadband data service to individual earth stations
    • H04B7/18582—Arrangements for data linking, i.e. for data framing, for error recovery, for multiple access
    • 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/24—Multipath
    • 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/28—Routing or path finding of packets in data switching networks using route fault recovery

Abstract

The invention discloses a fast rerouting method and a fast rerouting device in a mesh satellite network, wherein the method comprises the following steps of: acquiring a relative position relationship between a current satellite node (x, y) and a destination satellite node (a, b); determining the area of the destination satellite node according to the relative position relationship; and adopting a corresponding route calculation strategy according to the area. The method can resist the link failure in any single orbit and the link failure among a plurality of orbits in the mesh satellite network, and can adapt to the transfer of the links among the orbits, thereby being capable of quickly and efficiently finding a new transfer path through quick rerouting when the link failure and the link among the orbits are transferred, and effectively avoiding the interruption of communication.

Description

Fast rerouting method and device in mesh satellite network
Technical Field
The invention relates to the technical field of satellite networks, in particular to a fast rerouting method and a fast rerouting device in a mesh satellite network.
Background
Satellite networks are an important component of a world-wide integrated network. Spatial links in a satellite network may experience link failures that cause network communications to be interrupted. The traditional routing method needs to announce a new network topology when a link failure occurs, recalculate the routing of the whole network based on the new topology, and then send a routing table to each satellite node. Due to the large delay of the spatial link and the limited resource of the satellite node, the rerouting process takes a long time, and the network communication cannot be recovered in the long time.
Therefore, it is highly desirable to design a fast rerouting method for a satellite network.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, an object of the present invention is to provide a fast rerouting method in a mesh satellite network, which can quickly and efficiently find a new forwarding path through fast rerouting when a link failure occurs or an inter-orbit link is handed over, thereby effectively avoiding communication interruption.
Another object of the present invention is to provide a fast rerouting device in a mesh satellite network.
In order to achieve the above object, an embodiment of an aspect of the present invention provides a fast rerouting method in a mesh satellite network, including the following steps: acquiring a relative position relationship between a current satellite node (x, y) and a destination satellite node (a, b); determining the area of the destination satellite node according to the relative position relation; and adopting a corresponding route calculation strategy according to the area.
The rapid rerouting method in the mesh satellite network provided by the embodiment of the invention can resist any link fault in a single orbit and link faults among a plurality of orbits in the mesh satellite network, and can adapt to the transfer of the links among the orbits, so that a new forwarding path can be rapidly and efficiently found through the rapid rerouting when the link faults and the links among the orbits are transferred, and the interruption of communication is effectively avoided.
In addition, the fast rerouting method in the mesh satellite network according to the above embodiment of the present invention may further have the following additional technical features:
further, in an embodiment of the present invention, the method further includes: and acquiring the binary representation of the position of each satellite node, and acquiring four corresponding neighbor nodes at most.
Further, in one embodiment of the present invention, the relative positional relationship includes:
the first positional relationship: x is the number of>a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxWherein,% represents modulus operation, and the distance from y to b in the satellite motion direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite motion;
the second positional relationship: x is the number of<a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
the third positional relationship: x is the number of>a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
the fourth positional relationship: x is the number of<a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
fifth positional relationship: x is a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
sixth positional relationship: x is a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
seventh positional relationship: x > a and y ═ b;
eighth positional relationship: x < a and y ═ b.
Further, in an embodiment of the present invention, the taking a corresponding route calculation policy according to the located area includes:
step S1, if the current satellite node is the destination satellite node, receiving the forwarded data packet;
step S2, if the destination satellite node belongs to the first position relation, the link of the node (x, y) to the node (x-1, y) is available, and the data packet is not from the node (x-1, y), the next hop node is (x-1, y); otherwise, go to step S21;
step S21, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, the next-hop node is (x, y ≧ 1); otherwise, go to step S22;
step S22, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1); otherwise, discarding the data packet;
step S3, if the destination satellite node belongs to the second positional relationship, all (x-1, y) are replaced with (x +1, y), and step S2 of the destination satellite node belonging to the first positional relationship is performed;
step S4, if the destination satellite node belongs to the third positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S2 where the destination satellite node belongs to the first positional relationship;
step S5, if the destination satellite node belongs to the fourth positional relationship, replacing all (x-1, y) with (x +1, y), and performing step S4 that the destination satellite node belongs to the third positional relationship;
step S6, if the destination satellite node belongs to the fifth positional relationship, if the link of node (x, y) to node (x, y |) 1 is available and the data packet is not from node (x, y |) 1, then the next hop node is (x, y |) 1; otherwise, step S61 or step S62 is executed, and if step S61 and step S62 are not both true, step S63 is executed;
step S61, if the link of the node (x, y) to the node (x-1, y) is available and the data packet is not from the node (x-1, y) or the link of the node (x, y) to the node (x +1, y) is not available, the next hop node is (x-1, y); ,
step S62, if the link of the node (x, y) to the node (x +1, y) is available and the data packet is not from the node (x +1, y) or the link of the node (x, y) to the node (x-1, y) is not available, the next hop node is (x +1, y);
step S63, if the link of the node (x, y) to the node (x, y ≦ 1) is available, the next hop node is (x, y ≦ 1); otherwise, discarding the data packet;
step S7, if the destination satellite node belongs to the sixth positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S6 where the destination satellite node belongs to the fifth positional relationship;
step S8, if the destination satellite node belongs to a seventh positional relationship, if a link of the node (x, y) to the node (x-1, y) is available, the next hop node is (x-1, y); otherwise, step S81 or step S82 is executed, and if step S81 and step S82 are not both true, step S83 is executed;
step S81, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S82, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S83, otherwise, discarding the data packet;
step S9, if the destination satellite node belongs to the eighth positional relationship, replacing all (x-1, y) with (x +1, y), and executing step S8 that the destination satellite node belongs to the seventh positional relationship.
In order to achieve the above object, another embodiment of the present invention provides a fast rerouting device in a mesh satellite network, including: an acquisition module for acquiring a relative positional relationship between a current satellite node (x, y) and a destination satellite node (a, b); the determining module is used for determining the area of the destination satellite node according to the relative position relation; and the processing module is used for adopting a corresponding route calculation strategy according to the area.
The rapid rerouting device in the mesh satellite network provided by the embodiment of the invention can resist any link fault in a single orbit and link faults among a plurality of orbits in the mesh satellite network, and can adapt to the transfer of the links among the orbits, so that a new transfer path can be rapidly and efficiently found through the rapid rerouting when the link faults and the links among the orbits are transferred, and the interruption of communication is effectively avoided.
In addition, the fast rerouting device in the mesh satellite network according to the above embodiment of the present invention may further have the following additional technical features:
further, in an embodiment of the present invention, the obtaining module is further configured to obtain a binary representation of a location of each satellite node, and obtain a corresponding maximum of four neighboring nodes.
Further, in one embodiment of the present invention, the relative positional relationship includes:
the first positional relationship: x is the number of>a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxWherein,% represents modulus operation, and the distance from y to b in the satellite motion direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite motion;
the second positional relationship: x is the number of<a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
the third positional relationship: x is the number of>a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
the fourth positional relationship: x is the number of<a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
fifth positional relationship: x is a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
sixth positional relationship: x is a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
seventh positional relationship: x > a and y ═ b;
eighth positional relationship: x < a and y ═ b.
Further, in an embodiment of the present invention, the processing module is further configured to:
step S1, if the current satellite node is the destination satellite node, receiving the forwarded data packet;
step S2, if the destination satellite node belongs to the first position relation, the link of the node (x, y) to the node (x-1, y) is available, and the data packet is not from the node (x-1, y), the next hop node is (x-1, y); otherwise, go to step S21;
step S21, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, the next-hop node is (x, y ≧ 1); otherwise, go to step S22;
step S22, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1); otherwise, discarding the data packet;
step S3, if the destination satellite node belongs to the second positional relationship, all (x-1, y) are replaced with (x +1, y), and step S2 of the destination satellite node belonging to the first positional relationship is performed;
step S4, if the destination satellite node belongs to the third positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S2 where the destination satellite node belongs to the first positional relationship;
step S5, if the destination satellite node belongs to the fourth positional relationship, replacing all (x-1, y) with (x +1, y), and performing step S4 that the destination satellite node belongs to the third positional relationship;
step S6, if the destination satellite node belongs to the fifth positional relationship, if the link of node (x, y) to node (x, y |) 1 is available and the data packet is not from node (x, y |) 1, then the next hop node is (x, y |) 1; otherwise, step S61 or step S62 is executed, and if step S61 and step S62 are not both true, step S63 is executed;
step S61, if the link of the node (x, y) to the node (x-1, y) is available and the data packet is not from the node (x-1, y) or the link of the node (x, y) to the node (x +1, y) is not available, the next hop node is (x-1, y); ,
step S62, if the link of the node (x, y) to the node (x +1, y) is available and the data packet is not from the node (x +1, y) or the link of the node (x, y) to the node (x-1, y) is not available, the next hop node is (x +1, y);
step S63, if the link of the node (x, y) to the node (x, y ≦ 1) is available, the next hop node is (x, y ≦ 1); otherwise, discarding the data packet;
step S7, if the destination satellite node belongs to the sixth positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S6 where the destination satellite node belongs to the fifth positional relationship;
step S8, if the destination satellite node belongs to a seventh positional relationship, if a link of the node (x, y) to the node (x-1, y) is available, the next hop node is (x-1, y); otherwise, step S81 or step S82 is executed, and if step S81 and step S82 are not both true, step S83 is executed;
step S81, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S82, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S83, otherwise, discarding the data packet;
step S9, if the destination satellite node belongs to the eighth positional relationship, replacing all (x-1, y) with (x +1, y), and executing step S8 that the destination satellite node belongs to the seventh positional relationship.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is an exemplary diagram of a mesh satellite network topology, wherein the number of orbits and the number of satellites in orbit may differ from those in FIG. 1 in practice;
FIG. 2 is a flow diagram of a fast reroute method in a mesh satellite network in accordance with an embodiment of the present invention;
FIG. 3 is a schematic diagram of a neighbor node of a satellite node (x, y) in a mesh satellite network according to an embodiment of the invention;
FIG. 4 is a schematic diagram illustrating the division of a region where a destination node is located in a mesh satellite network according to an embodiment of the invention;
FIG. 5 is a diagram illustrating an example of a mesh satellite network fast reroute process according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a fast rerouting device in a mesh satellite network according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
The present application is based on the recognition and discovery by the inventors of the following problems:
the mesh satellite network is a common topology structure for medium and low orbit satellite networking, and a Walker constellation is a typical mesh satellite network. As shown in fig. 1, a mesh satellite network comprises a plurality of orbits, each of which has a plurality of satellites connected in a ring by intra-orbital links. Satellites in adjacent orbits can establish inter-orbital links if the direction of motion is the same, thus forming a mesh of the satellite network. In general, the direction of the satellite motion is different between the 0 th orbit and the last orbit, and no inter-orbit link is established, so that a seam (seam) is formed. Due to the high-speed movement of the satellite and the limitation of physical conditions, the satellite closes the inter-orbit link when moving to a certain area, and the phenomenon is called inter-orbit link handover. Inter-orbital link handoff results in a dynamically changing satellite network topology, which may also result in communication disruptions, and therefore a fast reroute scheme is also needed to quickly and efficiently find a new forwarding path.
The fast rerouting method and apparatus in a mesh satellite network according to an embodiment of the present invention will be described below with reference to the accompanying drawings.
Fig. 2 is a flow chart of a fast reroute method in a mesh satellite network in accordance with one embodiment of the present invention.
As shown in fig. 2, the fast rerouting method in the mesh satellite network includes the following steps:
in step S101, a relative positional relationship between the current satellite node (x, y) and the destination satellite node (a, b) is acquired.
In one embodiment of the present invention, further comprising: and acquiring the binary representation of the position of each satellite node, and acquiring four corresponding neighbor nodes at most.
It is understood that the position of a satellite node is represented by a binary set (x, y), where x represents the orbit number and y represents the satellite number. y ismaxRepresenting the number of satellites in the same orbit. As can be seen from the structure of the mesh satellite network, the node (x, y) has at most four neighboring nodes, as shown in fig. 3, which are:
a. nodes (x, y |, 1) connected by intra-track links, wherein y | _ 1 has the following meaning: if y is>Y 1 ═ y-1 if 0, y 1 ═ y-1 if y ═ 0max；
b. Nodes (x, y ≦ 1) connected by intra-track links, where y ≦ 1 as follows: if y is<ymaxY ≠ 1 ═ y +1, and if y ═ ymaxThen y ≦ 1 ≦ 0;
c. nodes (x-1, y) connected by inter-track links;
d. nodes (x +1, y) connected by inter-track links.
In step S102, the area where the destination satellite node is located is determined according to the relative position relationship.
Specifically, the dividing of the area where the destination node is located specifically includes:
assuming that the current node is (x, y) and the destination node is (a, b), the following 8 cases are classified according to the relative positional relationship between the node (x, y) and the node (a, b). As shown in FIG. 4, wherein (r) -is expressed in first to eighth positional relationships.
①x>a and (b + y)max-y)％ymax≤(y+ymax-b)％ymax(where% represents a modulo operation, the same applies below), i.e. the distance from y to b in the direction of the satellite motion is equal to or shorter than the distance from y to b in the opposite direction of the satellite motion;
②x<a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxI.e. the ratio of the distance from y to b in the direction of movement of the satelliteThe distance to b in the opposite direction of the satellite motion is equal or shorter;
③x>a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
④x<a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
x is a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThat is, the distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
x is a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
and ═ b;
x < a and y ═ b.
Before forwarding a data packet, the current node first calculates the area where the destination node is located, and then adopts a corresponding route calculation method according to the calculation result, i.e. step S103.
In step S103, a corresponding route calculation policy is taken according to the area where the route is located.
It can be understood that the calculation route needs to be used to the area where the destination node is located (i.e., (r) — (r) above), and whether each link connected to the current node is available, and from which neighbor node the packet needs to be forwarded. The method comprises the following specific steps:
if the current node is the destination node: and receiving the data packet, and finishing the routing process.
If the destination node belongs to (r): if node (x, y) has a link available to node (x-1, y) (i.e., no link failure or no link handoff occurs, the same applies below) and the packet is not from node (x-1, y), then the next hop node is (x-1, y).
If not, then,
i. if the link of the node (x, y) to the node (x, y | > 1) is available and the packet is not from the node (x, y | > 1) or the link of the node (x, y) to the node (x, y | > 1) is not available, the next hop node is (x, y | > 1);
otherwise, if the link of the node (x, y) to the node (x, y ≦ 1) is available and the packet is not from the node (x, y ≦ 1) or the link of the node (x, y) to the node (x, y ≦ 1), the next hop node is (x, y ≦ 1);
else, discarding the packet.
If the destination node belongs to II: the treatment method is to replace all (x-1, y) in the step (i) with (x +1, y), and other steps are completely the same as the step (i).
If the destination node belongs to the third: the process was performed by replacing all (x, y ≧ 1) in (r) with (x, y ≧ 1) and all (x, y ≧ 1) with (x, y ≧ 1), and the other steps were completely the same as (r).
If the destination node belongs to the fourth node: the processing method is to replace all (x-1, y) in the third step with (x +1, y), and other steps are completely the same as the third step.
If the destination node belongs to the fifth step: if the link of the node (x, y) to the node (x, y | _ 1) is available and the packet is not from the node (x, y | _ 1), the next hop node is (x, y | _ 1).
If not, then,
i. if a link from node (x, y) to node (x-1, y) is available and a packet is not from node (x-1, y) or a link from node (x, y) to node (x +1, y) is not available, then the next hop node is (x-1, y);
else, if a link of node (x, y) to node (x +1, y) is available and the packet is not from node (x +1, y) or a link of node (x, y) to node (x-1, y) is not available, then the next hop node is (x +1, y);
else, if a link of node (x, y) to node (x, y ≦ 1) is available, the next hop node is (x, y ≦ 1);
otherwise, discarding the data packet.
The order of i and ii above may be interchanged.
If the destination node belongs to the following: the process was performed by replacing all (x, y ≧ 1) in the (n) layer by (x, y ^ 1) and all (x, y ^ 1) by (x, y ^ 1) simultaneously, and the other steps were completely the same as the (n) layer.
If the destination node belongs to the following parts: if a link for node (x, y) to node (x-1, y) is available, then the next hop node is (x-1, y);
if not, then,
i. if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, the next hop node is (x, y ≧ 1);
ii, if the link of the node (x, y) to the node (x, y | _ 1) is available and the packet is not from the node (x, y | _ 1) or the link of the node (x, y) to the node (x, y | _ 1) is not available, the next hop node is (x, y | _ 1);
else, discarding the packet.
The order of i and ii above may be interchanged.
If the destination node belongs to the following components: the treatment method is to replace all (x-1, y) in the step (c) with (x +1, y), and other steps are completely the same as the step (c).
The fast rerouting method in the mesh satellite network will be further explained by a specific application example, as shown in fig. 5, the starting node of the packet is (4,10), and the destination node is (1, 1). The fast rerouting of data packets through the nodes is as follows:
the starting node (4,10) generates a data packet, and calculates that the destination node (1,1) belongs to the third node, at the moment, a link to the node (3,10) is available, the data packet does not come from the node (3,10), and the next hop node is (3, 10);
the nodes (3,10) receive the data packets from the nodes (4,10), calculate that the destination node (1,1) belongs to the third node, at this time, the link to the nodes (2,10) is unavailable, the link to the nodes (3,11) is available, and the data packets do not come from the nodes (3,11), and according to the third node, the next hop node is (3, 11);
the nodes (3,11) receive the data packets from the nodes (3,10), calculate that the destination node (1,1) belongs to the third node, at this time, the link to the nodes (2,11) is unavailable, the link to the nodes (3,0) is available, and the data packets do not come from the nodes (3,0), and according to the third node, the next hop node is (3, 0);
the nodes (3,0) receive the data packets from the nodes (3,11), calculate that the destination node (1,1) belongs to the third node, at this time, the link to the node (2,0) is unavailable, the link to the node (3,1) is available, and the data packet does not come from the node (3,1), and according to the third node, the next hop node is (3, 1);
the node (3,1) receives the data packet from the node (3,0), calculates that the destination node (1,1) belongs to the node (3,2), the link to the node (2,1) is unavailable, the link to the node (3,2) is available, and the data packet does not come from the node (3,2), and knows that the next hop node is (3,2) according to the node (3, 1);
the node (3,2) receives the data packet from the node (3,1), calculates that the destination node (1,1) belongs to (i), at the moment, the link to the node (2,2) is unavailable, the link to the node (3,1) is available but the data packet comes from the node (3,1), the link to the node (3,3) is available and the data packet does not come from the node (3,3), and knows that the next hop node is (3,3) according to (ii);
the nodes (3,3) receive the data packets from the nodes (3,2), calculate that the destination nodes (1,1) belong to (i), at the moment, the links to the nodes (2,3) are unavailable, the links to the nodes (3,2) are available but the data packets come from the nodes (3,2), the links to the nodes (3,4) are available and the data packets do not come from the nodes (3,4), and know that the next hop nodes are (3,4) according to (ii);
the nodes (3,4) receive the data packets from the nodes (3,3), calculate that the destination node (1,1) belongs to (r), at the moment, the link to the nodes (2,4) is available and the data packets do not come from the nodes (2,4), and the next hop node is (2, 4);
the nodes (2,4) receive the data packets from the nodes (3,4), calculate that the destination node (1,1) belongs to the node (1), at this time, the link to the node (1,4) is unavailable, the link to the node (2,3) is available, and the data packets do not come from the node (2,3), and know that the next hop node is (2,3) according to the node (i);
the nodes (2,3) receive the data packets from the nodes (2,4), calculate that the destination node (1,1) belongs to (1), at the moment, the link to the nodes (1,3) is available and the data packets do not come from the nodes (1,3), and the next hop node is (1, 3);
the nodes (1,3) receive the data packets from the nodes (2,3), calculate that the destination node (1,1) belongs to the fifth, at this time, the link to the nodes (1,2) is available and the data packets do not come from the nodes (1,2), so the next hop node is (1, 2);
the nodes (1,2) receive the data packet from the nodes (1,3), calculate that the destination node (1,1) belongs to the fifth, at this time, the link to the node (1,1) is unavailable, the link to the node (0,2) is unavailable, the link to the node (2,2) is unavailable, the link to the node (1,3) is available, and the next hop node is (1, 3);
the nodes (1,3) receive the data packets from the nodes (1,2), calculate that the destination node (1,1) belongs to the fifth, when the link to the nodes (1,2) is available but the data packet comes from the nodes (1,2), the link to the nodes (0,3) is available and the data packet does not come from the nodes (0,3), and the next hop node is (0, 3);
the nodes (0,3) receive the data packets from the nodes (1,3), calculate that the destination nodes (1,1) belong to (2), wherein the links to the nodes (1,3) are available but the data packets come from the nodes (1,3), the links to the nodes (0,2) are available and the data packets do not come from the nodes (0,2), so that the next hop nodes are (0, 2);
the nodes (0,2) receive the data packets from the nodes (0,3), calculate that the destination node (1,1) belongs to the node II, at this time, the link to the nodes (1,2) is unavailable, the link to the nodes (0,1) is available, and the data packets do not come from the nodes (0,1), so that the next hop node is (0, 1);
the node (0,1) receives the data packet from the node (0,2), calculates that the destination node (1,1) belongs to the group of the nodes, wherein the link to the node (1,1) is unavailable, the link to the node (0,2) is available but the data packet comes from the node (0,2), the link to the node (0,0) is available and the data packet does not come from the node (0,0), so that the next hop node is (0, 0);
the node (0,0) receives the data packet from the node (0,1), calculates that the destination node (1,1) belongs to node (0,11), when the link to the node (1,0) is unavailable, the link to the node (0,1) is available but the data packet comes from the node (0,1), the link to the node (0,11) is available and the data packet does not come from the node (0,11), so the next hop node is (0, 11);
the node (0,11) receives the data packet from the node (0,0), calculates that the destination node (1,1) belongs to node (1,11), the link to the node (1,11) is available at the moment, the data packet does not come from the node (1,11), and the next hop node is node (1, 11);
the nodes (1,11) receive the data packets from the nodes (0,11), calculate that the destination node (1,1) belongs to the sixth step, at this time, the link to the nodes (1,0) is available and the data packets do not come from the nodes (1,0), and the next-hop node is (1, 0);
the node (1,0) receives the data packet from the node (1,11), calculates that the destination node (1,1) belongs to the sixth step, at this time, the link to the node (1,1) is available and the data packet does not come from the node (1,1), and the next hop node is (1, 1);
and the node (1,1) receives the data packet from the node (1,0), the data packet reaches the destination node, and the process is finished.
According to the rapid rerouting method in the mesh satellite network provided by the embodiment of the invention, link faults in any single orbit and link faults among multiple orbits can be resisted in the mesh satellite network, and the method can adapt to the transfer of the links among the orbits, so that a new forwarding path can be rapidly and efficiently found through rapid rerouting when the link faults and the links among the orbits are transferred, and the interruption of communication is effectively avoided.
Next, a fast rerouting apparatus in a mesh satellite network according to an embodiment of the present invention will be described with reference to the accompanying drawings.
Fig. 6 is a schematic structural diagram of a fast rerouting device in a mesh satellite network according to an embodiment of the present invention.
As shown in fig. 6, the fast rerouting device 10 in the mesh satellite network includes: an acquisition module 100, a determination module 200 and a processing module 300.
The obtaining module 100 is configured to obtain a relative position relationship between a current satellite node (x, y) and a destination satellite node (a, b); the determining module 200 is configured to determine a region where the destination satellite node is located according to the relative position relationship; the processing module 300 is configured to adopt a corresponding route calculation policy according to the located area. The device 10 of the embodiment of the invention can quickly and efficiently find out a new forwarding path through quick rerouting when a link failure occurs and an inter-track link is handed over, thereby effectively avoiding communication interruption.
Further, in an embodiment of the present invention, the obtaining module 100 is further configured to obtain a binary representation of a location of each satellite node, and obtain a corresponding maximum of four neighboring nodes.
Further, in one embodiment of the present invention, the relative positional relationship includes:
the first positional relationship: x is the number of>a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxWherein,% represents modulus operation, and the distance from y to b in the satellite motion direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite motion;
the second positional relationship: x is the number of<a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
the third positional relationship: x is the number of>a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
the fourth positional relationship: x is the number of<a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
fifth positional relationship: x is a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite motion direction is compared with the distance from yThe distance from the satellite to the satellite in the opposite direction is equal to or shorter than b;
sixth positional relationship: x is a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
seventh positional relationship: x > a and y ═ b;
eighth positional relationship: x < a and y ═ b.
Further, in an embodiment of the present invention, the processing module 300 is further configured to:
step S1, if the current satellite node is the destination satellite node, receiving the forwarded data packet;
step S2, if the destination satellite node belongs to the first position relation, and the link of the node (x, y) to the node (x-1, y) is available, and the data packet is not from the node (x-1, y), the next hop node is (x-1, y); otherwise, go to step S21;
step S21, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1); otherwise, go to step S22;
step S22, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1); otherwise, discarding the data packet;
step S3, if the destination satellite node belongs to the second position relationship, all (x-1, y) are replaced by (x +1, y), and step S2, in which the destination satellite node belongs to the first position relationship, is executed;
step S4, if the destination satellite node belongs to the third positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing step S2 where the destination satellite node belongs to the first positional relationship;
step S5, if the destination satellite node belongs to the fourth positional relationship, replacing all (x-1, y) with (x +1, y), and performing step S4 that the destination satellite node belongs to the third positional relationship;
step S6, if the destination satellite node belongs to the fifth positional relationship, if the link of the node (x, y) to the node (x, y |) 1 is available and the data packet is not from the node (x, y |) 1, the next hop node is (x, y |) 1; otherwise, step S61 or step S62 is executed, and if step S61 and step S62 are not both true, step S63 is executed;
step S61, if the link of the node (x, y) to the node (x-1, y) is available and the data packet is not from the node (x-1, y) or the link of the node (x, y) to the node (x +1, y) is not available, the next hop node is (x-1, y);
step S62, if the link of the node (x, y) to the node (x +1, y) is available and the data packet is not from the node (x +1, y) or the link of the node (x, y) to the node (x-1, y) is not available, the next hop node is (x +1, y);
step S63, if the link of the node (x, y) to the node (x, y ≦ 1) is available, the next hop node is (x, y ≦ 1); otherwise, discarding the data packet;
step S7, if the destination satellite node belongs to the sixth positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), while replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing step S6 where the destination satellite node belongs to the fifth positional relationship;
step S8, if the destination satellite node belongs to the seventh positional relationship, if the link of the node (x, y) to the node (x-1, y) is available, the next hop node is (x-1, y); otherwise, step S81 or step S82 is executed, and if step S81 and step S82 are not both true, step S83 is executed;
step S81, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S82, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S83, otherwise, discarding the data packet;
step S9, if the destination satellite node belongs to the eighth positional relationship, replace all (x-1, y) with (x +1, y), and perform step S8 where the destination satellite node belongs to the seventh positional relationship.
It should be noted that the foregoing explanation of the embodiment of the fast rerouting method in the mesh satellite network is also applicable to the fast rerouting device in the mesh satellite network of the embodiment, and details are not repeated here.
According to the rapid rerouting device in the mesh satellite network provided by the embodiment of the invention, link faults in any single orbit and link faults among multiple orbits can be resisted in the mesh satellite network, and the device can adapt to the transfer of the links among the orbits, so that a new transfer path can be quickly and efficiently found through rapid rerouting when the link faults and the links among the orbits are transferred, and the interruption of communication is effectively avoided.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (8)

1. A method for fast rerouting in a mesh satellite network, comprising the steps of:
acquiring a relative position relationship between a current satellite node (x, y) and a destination satellite node (a, b);
determining the area of the destination satellite node according to the relative position relation; and
and adopting a corresponding route calculation strategy according to the area.
2. The method of claim 1, further comprising:
and acquiring the binary representation of the position of each satellite node, and acquiring four corresponding neighbor nodes at most.
3. The method of claim 2, wherein the relative positional relationship comprises:
the first positional relationship: x is the number of>a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxWherein,% represents modulus operation, and the distance from y to b in the satellite motion direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite motion;
the second positional relationship: x is the number of<a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
third positionThe relationship is as follows: x is the number of>a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
the fourth positional relationship: x is the number of<a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
fifth positional relationship: x is a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
sixth positional relationship: x is a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
seventh positional relationship: x > a and y ═ b;
eighth positional relationship: x < a and y ═ b.
4. The method according to claim 3, wherein said adopting the corresponding route calculation policy according to the area in which the route is located comprises:
step S1, if the current satellite node is the destination satellite node, receiving the forwarded data packet;
step S2, if the destination satellite node belongs to the first position relation, the link of the node (x, y) to the node (x-1, y) is available, and the data packet is not from the node (x-1, y), the next hop node is (x-1, y); otherwise, go to step S21;
step S21, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, the next-hop node is (x, y ≧ 1); otherwise, go to step S22;
step S22, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1); otherwise, discarding the data packet;
step S3, if the destination satellite node belongs to the second positional relationship, all (x-1, y) are replaced with (x +1, y), and step S2 of the destination satellite node belonging to the first positional relationship is performed;
step S4, if the destination satellite node belongs to the third positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S2 where the destination satellite node belongs to the first positional relationship;
step S5, if the destination satellite node belongs to the fourth positional relationship, replacing all (x-1, y) with (x +1, y), and performing step S4 that the destination satellite node belongs to the third positional relationship;
step S6, if the destination satellite node belongs to the fifth positional relationship, if the link of node (x, y) to node (x, y |) 1 is available and the data packet is not from node (x, y |) 1, then the next hop node is (x, y |) 1; otherwise, step S61 or step S62 is executed, and if step S61 and step S62 are not both true, step S63 is executed;
step S61, if the link of the node (x, y) to the node (x-1, y) is available and the data packet is not from the node (x-1, y) or the link of the node (x, y) to the node (x +1, y) is not available, the next hop node is (x-1, y); ,
step S62, if the link of the node (x, y) to the node (x +1, y) is available and the data packet is not from the node (x +1, y) or the link of the node (x, y) to the node (x-1, y) is not available, the next hop node is (x +1, y);
step S63, if the link of the node (x, y) to the node (x, y ≦ 1) is available, the next hop node is (x, y ≦ 1); otherwise, discarding the data packet;
step S7, if the destination satellite node belongs to the sixth positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S6 where the destination satellite node belongs to the fifth positional relationship;
step S8, if the destination satellite node belongs to a seventh positional relationship, if a link of the node (x, y) to the node (x-1, y) is available, the next hop node is (x-1, y); otherwise, step S81 or step S82 is executed, and if step S81 and step S82 are not both true, step S83 is executed;
step S81, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S82, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S83, otherwise, discarding the data packet;
step S9, if the destination satellite node belongs to the eighth positional relationship, replacing all (x-1, y) with (x +1, y), and executing step S8 that the destination satellite node belongs to the seventh positional relationship.
5. A fast reroute apparatus in a mesh satellite network, comprising:
an acquisition module for acquiring a relative positional relationship between a current satellite node (x, y) and a destination satellite node (a, b);
the determining module is used for determining the area of the destination satellite node according to the relative position relation; and
and the processing module is used for adopting a corresponding route calculation strategy according to the area.
6. The apparatus of claim 5, wherein the obtaining module is further configured to obtain a binary representation of a location of each satellite node and obtain a corresponding maximum of four neighboring nodes.
7. The apparatus of claim 6, wherein the relative positional relationship comprises:
the first positional relationship: x is the number of>a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxWherein,% represents modulus operation, and the distance from y to b in the satellite motion direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite motion;
the second positional relationship: x is the number of<a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
the third positional relationship: x is the number of>a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
the fourth positional relationship: x is the number of<a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
fifth positional relationship: x is a and (b + y)max-y)％ymax≤(y+ymax-b)％ymaxThe distance from y to b in the satellite movement direction is equal to or shorter than the distance from y to b in the opposite direction of the satellite movement;
sixth positional relationship: x is a and (b + y)max-y)％ymax>(y+ymax-b)％ymaxThe distance from y to b in the opposite direction of the satellite motion is shorter than the distance from y to b in the direction of the satellite motion;
seventh positional relationship: x > a and y ═ b;
eighth positional relationship: x < a and y ═ b.
8. The apparatus of claim 7, wherein the processing module is further configured to:
step S1, if the current satellite node is the destination satellite node, receiving the forwarded data packet;
step S2, if the destination satellite node belongs to the first position relation, the link of the node (x, y) to the node (x-1, y) is available, and the data packet is not from the node (x-1, y), the next hop node is (x-1, y); otherwise, go to step S21;
step S21, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, the next-hop node is (x, y ≧ 1); otherwise, go to step S22;
step S22, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1); otherwise, discarding the data packet;
step S3, if the destination satellite node belongs to the second positional relationship, all (x-1, y) are replaced with (x +1, y), and step S2 of the destination satellite node belonging to the first positional relationship is performed;
step S4, if the destination satellite node belongs to the third positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S2 where the destination satellite node belongs to the first positional relationship;
step S5, if the destination satellite node belongs to the fourth positional relationship, replacing all (x-1, y) with (x +1, y), and performing step S4 that the destination satellite node belongs to the third positional relationship;
step S6, if the destination satellite node belongs to the fifth positional relationship, if the link of node (x, y) to node (x, y |) 1 is available and the data packet is not from node (x, y |) 1, then the next hop node is (x, y |) 1; otherwise, step S61 or step S62 is executed, and if step S61 and step S62 are not both true, step S63 is executed;
step S61, if the link of the node (x, y) to the node (x-1, y) is available and the data packet is not from the node (x-1, y) or the link of the node (x, y) to the node (x +1, y) is not available, the next hop node is (x-1, y); ,
step S62, if the link of the node (x, y) to the node (x +1, y) is available and the data packet is not from the node (x +1, y) or the link of the node (x, y) to the node (x-1, y) is not available, the next hop node is (x +1, y);
step S63, if the link of the node (x, y) to the node (x, y ≦ 1) is available, the next hop node is (x, y ≦ 1); otherwise, discarding the data packet;
step S7, if the destination satellite node belongs to the sixth positional relationship, replacing all (x, y ≦ 1) with (x, y ≦ 1), simultaneously replacing all (x, y ≦ 1) with (x, y ≦ 1), and performing the step S6 where the destination satellite node belongs to the fifth positional relationship;
step S8, if the destination satellite node belongs to a seventh positional relationship, if a link of the node (x, y) to the node (x-1, y) is available, the next hop node is (x-1, y); otherwise, step S81 or step S82 is executed, and if step S81 and step S82 are not both true, step S83 is executed;
step S81, if the link from the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link from the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S82, if the link of the node (x, y) to the node (x, y ≧ 1) is available and the packet is not from the node (x, y ≧ 1) or the link of the node (x, y) to the node (x, y ≧ 1) is not available, then the next hop node is (x, y ≧ 1);
step S83, otherwise, discarding the data packet;
step S9, if the destination satellite node belongs to the eighth positional relationship, replacing all (x-1, y) with (x +1, y), and executing step S8 that the destination satellite node belongs to the seventh positional relationship.
CN202010949505.8A 2020-09-10 2020-09-10 Rerouting method and device in mesh satellite network Active CN112260742B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010949505.8A CN112260742B (en) 2020-09-10 2020-09-10 Rerouting method and device in mesh satellite network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010949505.8A CN112260742B (en) 2020-09-10 2020-09-10 Rerouting method and device in mesh satellite network

Publications (2)

Publication Number Publication Date
CN112260742A true CN112260742A (en) 2021-01-22
CN112260742B CN112260742B (en) 2022-04-08

Family

ID=74232273

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010949505.8A Active CN112260742B (en) 2020-09-10 2020-09-10 Rerouting method and device in mesh satellite network

Country Status (1)

Country Link
CN (1) CN112260742B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113329409A (en) * 2021-04-25 2021-08-31 清华大学 Routing method and device for avoiding high risk area in low-orbit satellite network
CN114222345A (en) * 2021-11-26 2022-03-22 网络通信与安全紫金山实验室 Routing path calculation method and device, electronic equipment and storage medium
US20220247487A1 (en) * 2021-02-04 2022-08-04 Huawei Technologies Co., Ltd. Method and apparatus for limited flooding in networks using transit nodes
WO2022160739A1 (en) * 2021-01-31 2022-08-04 华为技术有限公司 Satellite network routing method, apparatus, device, and system, and readable storage medium
US11438823B2 (en) 2020-05-29 2022-09-06 Huawei Technologies Co., Ltd. Orthodromic routing
US11451475B2 (en) 2019-12-19 2022-09-20 Huawei Technologies Co., Ltd. Packet forwarding based on geometric location
US11601780B2 (en) 2021-01-05 2023-03-07 Huawei Technologies Co., Ltd. Method and apparatus for propagating network status updates using directional tracking
WO2023241392A1 (en) * 2022-06-15 2023-12-21 华为技术有限公司 Failure processing method and device for satellite communication
US11909627B2 (en) 2021-01-04 2024-02-20 Huawei Technologies Co., Ltd. Method and apparatus for managing network status information using multiple degree of precision graph

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20010010651A (en) * 1999-07-21 2001-02-15 이계철 Method for rerouting handover route in satellite system
CN102143561A (en) * 2011-04-01 2011-08-03 上海交通大学 Position-based data packet forward method in wireless self-organized network
CN102202333A (en) * 2011-06-24 2011-09-28 中国人民解放军国防科学技术大学 Routing method of wireless ad hoc network used for small satellite constellation communication
CN103986512A (en) * 2014-04-30 2014-08-13 南京邮电大学 Satellite network inter-satellite link failure recovery method based on regional division
US9094856B1 (en) * 2014-02-25 2015-07-28 Intelligent Fusion Technology, Inc. Routing method for satellite communication network
US20150215201A1 (en) * 2014-01-30 2015-07-30 Eci Telecom Ltd. Method for implementing fast re-routing (frr)
US20150358861A1 (en) * 2013-12-23 2015-12-10 Thales Satellite communication system for a continuous high-bitrate access service over a coverage area including at least one polar region
CN111464225A (en) * 2020-02-26 2020-07-28 重庆邮电大学 Satellite routing load balancing algorithm based on source routing

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20010010651A (en) * 1999-07-21 2001-02-15 이계철 Method for rerouting handover route in satellite system
CN102143561A (en) * 2011-04-01 2011-08-03 上海交通大学 Position-based data packet forward method in wireless self-organized network
CN102202333A (en) * 2011-06-24 2011-09-28 中国人民解放军国防科学技术大学 Routing method of wireless ad hoc network used for small satellite constellation communication
US20150358861A1 (en) * 2013-12-23 2015-12-10 Thales Satellite communication system for a continuous high-bitrate access service over a coverage area including at least one polar region
US20150215201A1 (en) * 2014-01-30 2015-07-30 Eci Telecom Ltd. Method for implementing fast re-routing (frr)
US9094856B1 (en) * 2014-02-25 2015-07-28 Intelligent Fusion Technology, Inc. Routing method for satellite communication network
CN103986512A (en) * 2014-04-30 2014-08-13 南京邮电大学 Satellite network inter-satellite link failure recovery method based on regional division
CN111464225A (en) * 2020-02-26 2020-07-28 重庆邮电大学 Satellite routing load balancing algorithm based on source routing

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
WAN PENG 等: "Dynamic Source Routing algorithm in low-earth orbit Satellite Constellation", 《2006 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY》 *
YUAN YANG 等: "Fast Rerouting Against Multi-Link Failures Without Topology Constraint", 《IEEE/ACM TRANSACTIONS ON NETWORKING 》 *
刘庆利 等: "基于地理位置多业务LEO卫星网络路由算法", 《计算机仿真》 *
耿男 等: "基于二维路由的流量工程解决方案", 《重庆邮电大学学报(自然科学版)》 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11451475B2 (en) 2019-12-19 2022-09-20 Huawei Technologies Co., Ltd. Packet forwarding based on geometric location
US11438823B2 (en) 2020-05-29 2022-09-06 Huawei Technologies Co., Ltd. Orthodromic routing
US11909627B2 (en) 2021-01-04 2024-02-20 Huawei Technologies Co., Ltd. Method and apparatus for managing network status information using multiple degree of precision graph
US11601780B2 (en) 2021-01-05 2023-03-07 Huawei Technologies Co., Ltd. Method and apparatus for propagating network status updates using directional tracking
WO2022160739A1 (en) * 2021-01-31 2022-08-04 华为技术有限公司 Satellite network routing method, apparatus, device, and system, and readable storage medium
US20220247487A1 (en) * 2021-02-04 2022-08-04 Huawei Technologies Co., Ltd. Method and apparatus for limited flooding in networks using transit nodes
US11476925B2 (en) * 2021-02-04 2022-10-18 Huawei Technologies Co., Ltd. Method and apparatus for limited flooding in networks using transit nodes
CN113329409A (en) * 2021-04-25 2021-08-31 清华大学 Routing method and device for avoiding high risk area in low-orbit satellite network
CN114222345A (en) * 2021-11-26 2022-03-22 网络通信与安全紫金山实验室 Routing path calculation method and device, electronic equipment and storage medium
CN114222345B (en) * 2021-11-26 2024-04-09 网络通信与安全紫金山实验室 Routing path calculation method, device, electronic equipment and storage medium
WO2023241392A1 (en) * 2022-06-15 2023-12-21 华为技术有限公司 Failure processing method and device for satellite communication

Also Published As

Publication number Publication date
CN112260742B (en) 2022-04-08

Similar Documents

Publication Publication Date Title
CN112260742B (en) Rerouting method and device in mesh satellite network
US7515551B2 (en) Techniques for reducing adjacencies in a link-state network routing protocol
US7535828B2 (en) Algorithm for backup PE selection
KR100450407B1 (en) A Multi QoS Path Computation Method
CA2417864C (en) Method and apparatus for selecting maximally disjoint shortest paths in a network
US8248919B2 (en) Method, device and system for updating routes after node fails in P2P network
US20190149457A1 (en) Modeling a border gateway protocol network
US20060101157A1 (en) Communications routing
EP1506640B1 (en) Distribution scheme for distributing network parameters among network nodes
JP5385984B2 (en) How to calculate multicast routes
JP2008167451A (en) Data-path dynamic link management in mobile ad hoc network
US20080253290A1 (en) Optimization of Traffic Distribution in Multipath Routing
EP1851559A2 (en) Method and apparatus for constructing a repair path around a non-available component in a data communications network
JP2001308912A (en) Qos path calculation device
JP5625121B2 (en) Prioritizing routing information updates
WO2005062654A1 (en) Arrangements and method for handling macro diversity in a universal mobile telecommunications system
WO2012139734A1 (en) Method and system for automatic selection of detour paths in a wireless mesh network
Sakurai et al. AODV multipath extension using source route lists with optimized route establishment
US6771604B1 (en) Method for location management in a communication network
CN116566886B (en) Stateless unicast protection routing method based on biplane
CN108243104B (en) Multi-layer LSP control method and device
US11888596B2 (en) System and method for network reliability
EP4329374A1 (en) Communication processing method and related device
Tarutani et al. An Improvement of an IP Fast Reroute Method Using Multiple Routing Tables
KR100506038B1 (en) Subnetwork-based segment automatic restoration method

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