CN109963316B - Multipath routing method and equipment for mobile satellite network - Google Patents
Multipath routing method and equipment for mobile satellite network Download PDFInfo
- Publication number
- CN109963316B CN109963316B CN201910086462.2A CN201910086462A CN109963316B CN 109963316 B CN109963316 B CN 109963316B CN 201910086462 A CN201910086462 A CN 201910086462A CN 109963316 B CN109963316 B CN 109963316B
- Authority
- CN
- China
- Prior art keywords
- directed acyclic
- acyclic graph
- node
- target
- link
- 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.)
- Active
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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- 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/18—Loop-free operations
-
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
Abstract
The embodiment of the invention provides a multipath routing method and equipment for a mobile satellite network, wherein the method comprises the following steps: acquiring a directed acyclic graph of a transmission network, and determining a source node and a destination node of the directed acyclic graph of the transmission network; determining a target directed acyclic graph according to the transmission network directed acyclic graph, wherein the path delay of any path from a source node to a destination node in the target directed acyclic graph is less than or equal to a preset delay threshold value; performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, wherein the maximum directed acyclic graph meets a preset condition: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold; and determining the flow allocated to each link in the maximum directed acyclic graph according to the transmission traffic, wherein the embodiment of the invention can avoid the waste of bandwidth resources.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a multipath routing method and equipment for a mobile satellite network.
Background
In a mobile satellite network, due to the fact that space distances among satellite nodes are long, satellite load weight is limited, inter-satellite transmission power is limited and the like, inter-satellite link bandwidth is limited. When the service transmission is performed between the satellite network and the ground station, the shortest path is always preferred to be taken for the service data, but when the amount of the service data to be transmitted is large, if the service data is transmitted in the shortest path, congestion occurs in a local link, thereby affecting the transmission service quality of the service.
To avoid link congestion, a multi-path routing method is usually adopted to distribute the traffic data into multiple paths. At present, the commonly used multipath routing methods for mobile satellite networks all adopt a strategy of incompatible multiple paths.
However, the inventors have found that this approach results in a significant waste of bandwidth resources.
Disclosure of Invention
The invention provides a multipath routing method and equipment for a mobile satellite network, which aim to solve the problem of bandwidth resource waste caused by the multipath routing method in the prior art.
In a first aspect, the present invention provides a multipath routing method for a mobile satellite network, comprising: acquiring a directed acyclic graph of a transmission network, and determining a source node and a destination node of the directed acyclic graph of the transmission network;
determining a target directed acyclic graph according to the transmission network directed acyclic graph, wherein the path delay of any path from a source node to a destination node in the target directed acyclic graph is less than or equal to a preset delay threshold value;
performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, wherein the maximum directed acyclic graph meets a preset condition: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold;
and determining the flow distributed by each link in the maximum directed acyclic graph according to the transmission traffic.
In a first possible implementation manner, the determining a target directed acyclic graph according to the transport network directed acyclic graph includes:
traversing nodes in the directed acyclic graph of the transmission network, determining the shortest path time delay from a source node to a destination node through a target node, and obtaining a target path time delay, wherein the target node is any node in the directed acyclic graph of the transmission network;
judging whether the target path time delay exceeds a preset time delay threshold value, if so, deleting the target node and a corresponding link thereof from the transmission network directed acyclic graph;
and after traversing is finished, determining the transmission network directed acyclic graph after the nodes and the links are deleted as a target directed acyclic graph.
In a second possible implementation manner, performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, including:
layering the target directed acyclic graph to obtain a layered structure;
traversing links between every two nodes in the hierarchical structure, if a first newly-increased path from the source node to the destination node through a first node in a first hierarchical layer and a second node in a second hierarchical layer meets an acyclic condition and the time delay of the first newly-increased path does not exceed a preset time delay threshold, stopping traversing, adding the links between the first node and the second node into the target directed acyclic graph to obtain a new target directed acyclic graph, and continuing to execute the step of 'layering the target directed acyclic graph'; wherein the first hierarchy and the second hierarchy are any one of the hierarchies, the first node is any one of the nodes in the first hierarchy, the second node is any one of the nodes in the second hierarchy, and no link exists between the first node and the second node;
and if the newly added paths from any two nodes to the destination node by the source node after traversing the link between every two nodes in the hierarchical structure of the new target directed acyclic graph do not meet the acyclic condition, or the path delay of the newly added paths exceeds a preset delay threshold, taking the new target directed acyclic graph as the maximum directed acyclic graph.
With reference to the second possible implementation manner, in a third possible implementation manner, the sequence of traversing the links between two nodes in the hierarchical structure is:
a link from a node in a lower hierarchy in the hierarchy to a node in a higher hierarchy, a link between two nodes in a same hierarchy in the hierarchy, and a link from a node in a higher hierarchy in the hierarchy to a node in a lower hierarchy in the hierarchy.
With reference to any one of the foregoing implementation manners, in a fourth possible implementation manner, the determining, according to transmission traffic, traffic allocated to each link in the maximum directed acyclic graph includes:
acquiring the maximum transmission bandwidth and the currently occupied bandwidth of each link in the maximum directed acyclic graph;
determining a transmission blocking factor of the maximum directed acyclic graph according to transmission traffic;
and determining the flow allocated by each link according to the transmission blocking factor, the maximum transmission bandwidth of each link and the currently occupied bandwidth.
With reference to the fourth implementation manner, in a fifth implementation manner, the determining, according to the transmission blocking factor, the maximum transmission bandwidth of each link, and the currently occupied bandwidth, the traffic allocated to each link includes:
according to the expression
Determining the flow x of the ith link allocationiWherein α isTFor transmission of blocking factors, ciIs the maximum transmission bandwidth of the ith link,
is the currently occupied bandwidth of the ith link.
With reference to the fifth implementation manner, in a sixth implementation manner, the determining, according to transmission traffic, a transmission blocking factor of the maximum directed acyclic graph includes:
obtaining a limiting factor of the maximum directed acyclic graph;
determining the target bandwidth of each link according to the maximum bandwidth of each link and the limiting factor;
determining the target flow from the source node to the destination node according to the target bandwidth of each link;
judging whether the target flow meets the transmission service volume;
if not, adjusting the limiting factor by a dichotomy, taking the adjusted limiting factor as a new limiting factor, and continuing to execute the step of determining the target bandwidth of each link according to the maximum bandwidth and the limiting factor of each link;
and if so, determining the new limiting factor as a transmission blocking factor.
In a second aspect, an embodiment of the present invention provides a multipath routing apparatus for a mobile satellite network, including:
the system comprises an acquisition module, a transmission network directed acyclic graph generation module and a transmission network directed acyclic graph generation module, wherein the acquisition module is used for acquiring the transmission network directed acyclic graph and determining a source node and a destination node of the transmission network directed acyclic graph;
the determining module is used for determining a target directed acyclic graph according to the transmission network directed acyclic graph, wherein the sum of the path delay from any node in the target directed acyclic graph to a source node and the path delay from any node in the target directed acyclic graph to a destination node is less than or equal to a preset delay threshold value;
the expansion module is used for performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, wherein the maximum directed acyclic graph meets a preset condition: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold;
and the distribution module is used for determining the flow distributed by each link in the maximum directed acyclic graph according to the transmission traffic.
In a third aspect, an embodiment of the present invention provides a multipath routing device for a mobile satellite network, including: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing the computer-executable instructions stored by the memory causes the at least one processor to perform the multipath routing method for a mobile satellite network according to any one of the first aspects.
A fourth aspect of the present invention provides a computer-readable storage medium, where a computer executes instructions, and when a processor executes the computer to execute the instructions, the method for multipath routing for a mobile satellite network according to any one of the first aspect is implemented.
The multipath routing method and the multipath routing equipment for the mobile satellite network provided by the embodiment of the invention have the advantages that the target directed acyclic graph is determined through the directed acyclic graph of the transmission network, the maximum directed acyclic graph is determined according to the target directed acyclic graph, and the flow distributed by each link in the maximum directed acyclic graph is determined according to the transmission service, so that each link is fully utilized, and the waste of bandwidth resources is avoided.
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, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a first flowchart of an implementation of a multipath routing method for a mobile satellite network according to an embodiment of the present invention;
fig. 2 is a flowchart of a multipath routing method for a mobile satellite network according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a directed acyclic graph of a transmission network according to an embodiment of the present invention;
fig. 4 is a flowchart three of implementing the multipath routing method for the mobile satellite network according to the embodiment of the present invention;
FIG. 5 is a diagram illustrating a target directed acyclic graph according to an embodiment of the present invention;
FIG. 6 is a diagram illustrating a target directed acyclic graph according to an embodiment of the present invention;
FIG. 7 is a diagram illustrating a target directed acyclic graph according to an embodiment of the present invention;
fig. 8 is a flowchart of a fourth implementation of the multipath routing method for a mobile satellite network according to the embodiment of the present invention;
fig. 9 is a schematic structural diagram of a multipath routing apparatus for a mobile satellite network according to an embodiment of the present invention;
fig. 10 is a schematic hardware structure diagram of a multipath routing device for a mobile satellite network according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In a mobile satellite network, in order to avoid the limitation of inter-satellite link bandwidth, a multipath routing method is required to be used for transmitting service data. In order to avoid the waste of bandwidth resources, embodiments of the present invention provide a multipath routing method and apparatus for a mobile satellite network.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 1 is a first flowchart of an implementation of a multipath routing method for a mobile satellite network according to an embodiment of the present invention. As shown in fig. 1, the method of this embodiment may include:
step S101, a directed acyclic graph of a transmission network is obtained, and a source node and a destination node of the directed acyclic graph of the transmission network are determined.
In the embodiment of the invention, in graph theory, a graph is composed of nodes and edges connecting the nodes, and if each edge in the graph is directional, the graph is called a directed graph. If a directed graph cannot go from a certain node and go back to the node through a plurality of edges, the directed graph is a directed acyclic graph. In a transmission network, the start point of traffic transmission is the source node and the end point of traffic transmission is the destination node.
Step S102, determining a target directed acyclic graph according to the transmission network directed acyclic graph, wherein the path delay of any path from a source node to a destination node in the target directed acyclic graph is less than or equal to a preset delay threshold.
In the embodiment of the present invention, a path refers to a route from a source node to a destination node. The path delay refers to the time required for transmission data to travel from the source node to the destination node. The predetermined delay threshold is the maximum path delay allowed. In the directed acyclic graph of the transmission network, a plurality of transmission paths from a source node to a destination node exist, and a target directed acyclic graph is obtained by deleting paths exceeding a preset time delay threshold value in the directed acyclic graph of the transmission network.
Step S103, performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, wherein the maximum directed acyclic graph meets a preset condition: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold.
In the embodiment of the invention, the maximum directed acyclic graph meets an acyclic condition and a time delay constraint condition, wherein the time delay constraint condition means that the path time delay of any path in the maximum directed acyclic graph is less than or equal to a preset time delay threshold value. And, the maximum directed acyclic graph satisfies the preset conditions: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold. According to the characteristic of the maximum directed acyclic graph, the maximum directed acyclic graph is obtained by performing link expansion on the target directed acyclic graph and adding paths meeting acyclic conditions and time delay constraint conditions into the target directed acyclic graph.
And step S104, determining the flow rate distributed by each link in the maximum directed acyclic graph according to the transmission traffic.
In the embodiment of the present invention, a link refers to a line between any two adjacent nodes in a maximum directed acyclic graph. And after the maximum directed acyclic graph is determined, determining the flow allocated by each link according to the transmission traffic, namely completing flow allocation, and allocating transmission data according to the flow.
The embodiment of the invention determines the target directed acyclic graph through the directed acyclic graph of the transmission network, determines the maximum directed acyclic graph according to the target directed acyclic graph, and determines the flow distributed by each link in the maximum directed acyclic graph according to the transmission service, thereby fully utilizing each link and avoiding the waste of bandwidth resources.
Fig. 2 is a flowchart of a multipath routing method for a mobile satellite network according to an embodiment of the present invention. In this embodiment, a process of determining a target directed acyclic graph according to the transport network directed acyclic graph is described in detail based on the embodiment of fig. 1, and as shown in fig. 2, the method of this embodiment may include:
step S201, traversing nodes in the transmission network directed acyclic graph, determining a shortest path delay from a source node to a destination node through a destination node, and obtaining a destination path delay, where the destination node is any node in the transmission network directed acyclic graph.
Step S202, judging whether the target path time delay exceeds a preset time delay threshold value, if so, deleting the target node and the corresponding link thereof from the transmission network directed acyclic graph.
And step S203, after the traversal is completed, determining the transmission network directed acyclic graph after the link is deleted as a target directed acyclic graph.
In the embodiment of the invention, the directed acyclic graph of the transmission network has a plurality of nodes and a plurality of links, and the target directed acyclic graph is determined by traversing each node in the directed acyclic graph of the transmission network.
For example, nodes and links of a transport network directed acyclic graph are shown in FIG. 3 for node v3Through v3There are 2 paths, respectively path one: s → v1→v3→v5→ D, and path two: s → v2→v3→v5→ D. And respectively acquiring the path time delay of the first path and the path time delay of the second path, and if the path time delay of the second path is greater than the path time delay of the first path, taking the path time delay of the first path as the target path time delay. If the path delay of the path one exceeds the preset delay threshold, the path one and the path two do not meet the delay constraint condition, and then the node v is connected3And node v3Relevant input output links: v. of1→v3，v2→v3，v3→v5And deleted from the transport network directed acyclic graph. And traversing all nodes of the transmission network directed acyclic graph to obtain the target directed acyclic graph.
Fig. 4 is a flowchart three of an implementation of the multipath routing method for a mobile satellite network according to the embodiment of the present invention. This embodiment describes in detail a process of performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph based on the embodiment of fig. 1, as shown in fig. 4, where the method may include:
and S401, layering the target directed acyclic graph to obtain a layered structure.
Step S402, traversing links between every two nodes in the hierarchical structure, if a first newly-added path from the source node to the destination node through a first node in a first hierarchical layer and a second node in a second hierarchical layer meets an acyclic condition, and the delay of the first newly-added path does not exceed a preset delay threshold, stopping the traversal, adding the links between the first node and the second node into the target directed acyclic graph to obtain a new target directed acyclic graph, and continuing to execute step S401; wherein the first hierarchy and the second hierarchy are any one of the hierarchies, the first node is any one of the nodes in the first hierarchy, the second node is any one of the nodes in the second hierarchy, and no link exists between the first node and the second node.
Step S403, if the new path from any two nodes to the destination node through the source node does not satisfy the acyclic condition after traversing the link between every two nodes in the hierarchical structure of the new target directed acyclic graph, or the path delay of the new path exceeds the preset delay threshold, taking the new target directed acyclic graph as the maximum directed acyclic graph.
In the embodiment of the invention, the maximum directed acyclic graph is determined by expanding the links in the target directed acyclic graph.
In order to guarantee the completeness of the extension, the target directed acyclic graph needs to be layered. Each layer satisfies the conditions: each layer is a directed acyclic graph; each node exists and only in one layer; the last hops of all input links of the node of the j layer are positioned at the j-1 layer, wherein j is larger than 1. As shown in FIG. 5, the target directed acyclic graph is divided into 5 layers, i1、l2、l3、l4And l5。
The links are extended by traversing the links between every two nodes in the hierarchy.
Also taking FIG. 5 as an example, for l2Node v in a layer1And v2，l3Node v in a layer3And v4Judging whether the node v needs to be added or not1To node v4For the link of (1), first, the path S → v is acquired1→v4→v6Judging whether the path delay exceeds a preset delay threshold value or not by the path delay of → D, if not, judging whether the path meets an acyclic condition or not, if so, stopping traversing, and adding a node v into the target directed acyclic graph1To node v4The link of (2) as shown in fig. 6, a new target directed acyclic graph is obtained. And after obtaining a new target directed acyclic graph, continuously layering the new target directed acyclic graph to obtain a new layered structure, traversing the new layered structure until no new path meeting a time delay constraint condition and an acyclic condition exists after traversing links between every two nodes in the new target directed acyclic graph layered structure, and taking the new target directed acyclic graph as a maximum directed acyclic graph. The delay constraint is that the path delay of the path does not exceed the delay threshold.
As an embodiment of the present invention, the sequence of traversing the link between two nodes in the hierarchical structure is:
a link from a node in a lower hierarchy in the hierarchy to a node in a higher hierarchy, a link between two nodes in a same hierarchy in the hierarchy, and a link from a node in a higher hierarchy in the hierarchy to a node in a lower hierarchy in the hierarchy.
In the embodiment of the invention, the traversal order is set according to the characteristics of the hierarchical structure. Still taking fig. 5 as an example, assuming that the delay of each link is the same and is 1, the path delay of each path is 4. If l is increased, as shown in FIG. 72Node v in a layer1To l3Node v in a layer4Link between, newly added path S → v1→v4→v6Path delay of 4 → D, if layer l is added2Node v in the layer2To node v1Link of (d), newly added path S → v2→v1→v3→v5Path delay of → D is 5, if increasedAdding l3Node v in a layer4To l2Node v in a layer1To link, newly added path S → v2→v4→v1→v3→v5The path delay of → D is 6.
It can be seen that, increasing the links from the node in the lower hierarchy to the node in the higher hierarchy, the path delay of the newly added path is unchanged, increasing the links between two nodes in the same hierarchy, the path delay of the newly added path is larger, increasing the links from the node in the higher hierarchy to the node in the lower hierarchy, the path delay of the newly added path is larger, and based on this, the sequence of traversing the links between two nodes in the hierarchy is: a link from a node in a lower hierarchy in the hierarchy to a node in a higher hierarchy, a link between two nodes in a same hierarchy in the hierarchy, and a link from a node in a higher hierarchy in the hierarchy to a node in a lower hierarchy in the hierarchy.
For example, a link from one node in a lower hierarchy to one node in a higher hierarchy in the hierarchy is traversed, if new paths from all source nodes to destination nodes via new links do not satisfy a delay constraint condition or an acyclic condition, the link between two nodes in the same hierarchy in the hierarchy is traversed, if one of the new paths satisfies the delay constraint condition or the acyclic condition, the traversal is stopped, the new link is added to the target directed acyclic graph, a new target directed acyclic graph is obtained as the target directed acyclic graph, and the step S401 is continuously executed.
Fig. 8 is a flowchart of a fourth implementation of the multipath routing method for a mobile satellite network according to the embodiment of the present invention. This embodiment describes, in detail, the determining of the traffic allocated to each link in the maximum directed acyclic graph according to the transmission traffic based on the embodiment in fig. 1, as shown in fig. 8, where the method may include:
step S801, obtaining a maximum transmission bandwidth and a currently occupied bandwidth of each link in the maximum directed acyclic graph.
Step S802, determining the transmission blocking factor of the maximum directed acyclic graph according to the transmission traffic.
Step S803, determining the traffic allocated to each link according to the transmission blocking factor, the maximum transmission bandwidth of each link, and the currently occupied bandwidth.
In the embodiment of the present invention, the congestion factor of the link e is represented as:
in a multipath routed transport network, the congestion factor is the maximum congestion factor of each link, i.e. αT＝max{α(e)}。
The congestion factor is determined by bisection. One possible implementation is:
obtaining a limiting factor of a link in the maximum directed acyclic graph;
determining the target bandwidth of each link according to the maximum bandwidth of each link and the limiting factor;
determining the target flow from the source node to the destination node according to the target bandwidth of each link;
judging whether the target flow meets the transmission service volume;
if not, adjusting the limiting factor by a dichotomy, taking the adjusted limiting factor as a new limiting factor, and continuing to execute the step of determining the target bandwidth of each link according to the maximum bandwidth and the limiting factor of each link;
and if so, determining the new limiting factor as a transmission blocking factor.
In the embodiment of the present invention, the value range of the restriction factor is β ≦ 1 or more than 0, and first β ≦ 1, the target bandwidth c of the link i is obtained0i＝βciThe target flow from the source node to the destination node is
Wherein n is the total number of links in the maximum directed acyclic graph.
Judging whether the target flow C (beta) meets the transmission traffic, namely judging whether the target flow C (beta) meets the relationFormula (II): (1-eta) F < C (beta) < (1+ eta) F, wherein F is transmission traffic and eta is traffic error. If so, let alphaTIf not, the limiting factor is halved to obtain a new limiting factor, namely, the beta 'is set as beta/2, the beta' is taken as new beta, the target flow is recalculated until the target flow meets the transmission traffic, and at the moment, the beta is the congestion factor alphaT。
And after the limiting factor is determined, determining the flow allocated by each link according to the transmission blocking factor, the maximum transmission bandwidth of each link and the currently occupied bandwidth. As an embodiment of the present invention, one possible implementation manner is: according to the expression
Determining the flow x of the ith link allocationiWherein α isTFor transmission of blocking factors, ciIs the maximum transmission bandwidth of the ith link,
is the currently occupied bandwidth of the ith link.
The embodiment of the invention allocates the transmission service to each link of the maximum directed acyclic graph, and allocates more flow to the link with low bandwidth utilization rate, thereby improving the bandwidth utilization rate of each link and avoiding link blockage.
Fig. 9 is a schematic structural diagram of a multipath routing apparatus for a mobile satellite network according to an embodiment of the present invention, and as shown in fig. 9, the multipath routing apparatus 900 for a mobile satellite network according to the embodiment includes:
an obtaining module 901, configured to obtain a directed acyclic graph of a transmission network, and determine a source node and a destination node of the directed acyclic graph of the transmission network;
a determining module 902, configured to determine a target directed acyclic graph according to the transmission network directed acyclic graph, where a sum of a path delay from any node in the target directed acyclic graph to a source node and a path delay to a destination node is less than or equal to a preset delay threshold;
an extension module 903, configured to perform link extension on the target directed acyclic graph to obtain a maximum directed acyclic graph, where the maximum directed acyclic graph satisfies a preset condition: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold;
and an allocating module 904, configured to determine, according to the transmission traffic, a traffic amount allocated to each link in the maximum directed acyclic graph.
As an embodiment of the present invention, the determining module 902 is configured to determine a target directed acyclic graph according to the transport network directed acyclic graph, including:
traversing nodes in the directed acyclic graph of the transmission network, determining the shortest path time delay from a source node to a destination node through a target node, and obtaining a target path time delay, wherein the target node is any node in the directed acyclic graph of the transmission network;
judging whether the target path time delay exceeds a preset time delay threshold value, if so, deleting the target node and a corresponding link thereof from the transmission network directed acyclic graph;
and after traversing the link between every two nodes in the new target directed acyclic graph hierarchical structure, determining the new target directed acyclic graph as the maximum directed acyclic graph.
As an embodiment of the present invention, the extension module 903 is configured to layer the target directed acyclic graph to obtain a layered structure;
traversing links between every two nodes in the hierarchical structure, if a first newly-increased path from the source node to the destination node through a first node in a first hierarchical layer and a second node in a second hierarchical layer meets an acyclic condition and the time delay of the first newly-increased path does not exceed a preset time delay threshold, stopping traversing, adding the links between the first node and the second node into the target directed acyclic graph to obtain a new target directed acyclic graph, and continuing to execute the step of 'layering the target directed acyclic graph'; wherein the first hierarchy and the second hierarchy are any one of the hierarchies, the first node is any one of the nodes in the first hierarchy, the second node is any one of the nodes in the second hierarchy, and no link exists between the first node and the second node;
and if the newly added paths from any two nodes to the destination node by the source node after traversing the link between every two nodes in the hierarchical structure of the new target directed acyclic graph do not meet the acyclic condition, or the path delay of the newly added paths exceeds a preset delay threshold, taking the new target directed acyclic graph as the maximum directed acyclic graph.
As an embodiment of the present invention, the sequence of traversing the link between two nodes in the hierarchical structure is:
a link from a node in a lower hierarchy in the hierarchy to a node in a higher hierarchy, a link between two nodes in a same hierarchy in the hierarchy, and a link from a node in a higher hierarchy in the hierarchy to a node in a lower hierarchy in the hierarchy.
As an embodiment of the present invention, the allocating module 904 is configured to determine, according to the transmission traffic, the traffic allocated to each link in the maximum directed acyclic graph, including:
acquiring the maximum transmission bandwidth and the currently occupied bandwidth of each link in the maximum directed acyclic graph;
determining a transmission blocking factor of the maximum directed acyclic graph according to transmission traffic;
and determining the flow allocated by each link according to the transmission blocking factor, the maximum transmission bandwidth of each link and the currently occupied bandwidth.
As an embodiment of the present invention, the determining, according to the transmission blocking factor, the maximum transmission bandwidth of each link, and the currently occupied bandwidth, the traffic allocated to each link includes:
according to the expression
Determining the flow x of the ith link allocationiWherein α isTFor transmission of blocking factors, ciIs the maximum transmission bandwidth of the ith link,
is the currently occupied bandwidth of the ith link.
As an embodiment of the present invention, the determining a transmission blocking factor of the maximum directed acyclic graph according to transmission traffic includes:
obtaining a limiting factor of the maximum directed acyclic graph;
determining the target bandwidth of each link according to the maximum bandwidth of each link and the limiting factor;
determining the target flow from the source node to the destination node according to the target bandwidth of each link;
judging whether the target flow meets the transmission service volume;
if not, adjusting the limiting factor by a dichotomy, taking the adjusted limiting factor as a new limiting factor, and continuing to execute the step of determining the target bandwidth of each link according to the maximum bandwidth and the limiting factor of each link;
and if so, determining the new limiting factor as a transmission blocking factor.
The apparatus of this embodiment may be used to implement the method embodiments shown in fig. 1 to fig. 8, and the implementation principle and technical effect are similar, which are not described herein again.
Fig. 10 is a schematic hardware structure diagram of a multipath routing device for a mobile satellite network according to an embodiment of the present invention. As shown in fig. 10, the multipath routing device 1000 for a mobile satellite network provided by the present embodiment includes: at least one processor 1001 and memory 1002. The multipath routing device 1000 for a mobile satellite network further comprises a communication component 1003. The processor 1001, the memory 1002, and the communication unit 1003 are connected by a bus 1004.
In a specific implementation process, the at least one processor 1001 executes computer-executable instructions stored in the memory 1002, so that the at least one processor 1001 executes the multipath routing device method in any one of the above method embodiments. The communication unit 1003 is used for communicating with a terminal device and/or a server.
For a specific implementation process of the processor 1001, reference may be made to the above method embodiments, which have similar implementation principles and technical effects, and details of this embodiment are not described herein again.
In the embodiment shown in fig. 10, it should be understood that the Processor may be a Central Processing Unit (CPU), other general purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
The memory may comprise high speed RAM memory and may also include non-volatile storage NVM, such as at least one disk memory.
The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, the buses in the figures of the present application are not limited to only one bus or one type of bus.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer executing instruction is stored in the computer-readable storage medium, and when a processor executes the computer executing instruction, the multipath routing device method in any of the above method embodiments is implemented.
The computer-readable storage medium described above may be implemented by any type of volatile or non-volatile memory device or combination thereof, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk. Readable storage media can be any available media that can be accessed by a general purpose or special purpose computer.
An exemplary readable storage medium is coupled to the processor such the processor can read information from, and write information to, the readable storage medium. Of course, the readable storage medium may also be an integral part of the processor. The processor and the readable storage medium may reside in an Application Specific Integrated Circuits (ASIC). Of course, the processor and the readable storage medium may also reside as discrete components in the apparatus.
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (5)
1. A multipath routing method for a mobile satellite network, comprising:
acquiring a directed acyclic graph of a transmission network, and determining a source node and a destination node of the directed acyclic graph of the transmission network;
determining a target directed acyclic graph according to the transmission network directed acyclic graph, wherein the path delay of any path from a source node to a destination node in the target directed acyclic graph is less than or equal to a preset delay threshold value;
performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, wherein the maximum directed acyclic graph meets a preset condition: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold;
acquiring the maximum transmission bandwidth and the currently occupied bandwidth of each link in the maximum directed acyclic graph;
obtaining a limiting factor of the maximum directed acyclic graph;
determining the target bandwidth of each link according to the maximum bandwidth of each link and the limiting factor;
determining the target flow from the source node to the destination node according to the target bandwidth of each link;
judging whether the target flow meets the transmission service volume;
if not, adjusting the limiting factor by a dichotomy, taking the adjusted limiting factor as a new limiting factor, and continuing to execute the step of determining the target bandwidth of each link according to the maximum bandwidth and the limiting factor of each link;
if yes, determining the new limiting factor as a transmission blocking factor;
according to the expression
Determining the flow x of the ith link allocationiWherein α isTFor transmission of blocking factors, ciIs the maximum transmission bandwidth of the ith link,
is the currently occupied bandwidth of the ith link;
the determining a target directed acyclic graph according to the transmission network directed acyclic graph includes:
traversing nodes in the directed acyclic graph of the transmission network, determining the shortest path time delay from a source node to a destination node through a target node, and obtaining a target path time delay, wherein the target node is any node in the directed acyclic graph of the transmission network;
judging whether the target path time delay exceeds a preset time delay threshold value, if so, deleting the target node and a corresponding link thereof from the transmission network directed acyclic graph;
after traversing, determining the transmission network directed acyclic graph with the nodes and the links deleted as a target directed acyclic graph;
performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, including:
layering the target directed acyclic graph to obtain a layered structure;
traversing links between every two nodes in the hierarchical structure, if a first newly-increased path from the source node to the destination node through a first node in a first hierarchical layer and a second node in a second hierarchical layer meets an acyclic condition and the time delay of the first newly-increased path does not exceed a preset time delay threshold, stopping traversing, adding the links between the first node and the second node into the target directed acyclic graph to obtain a new target directed acyclic graph, and continuing to execute the step of 'layering the target directed acyclic graph'; wherein the first hierarchy and the second hierarchy are any one of the hierarchies, the first node is any one of the nodes in the first hierarchy, the second node is any one of the nodes in the second hierarchy, and no link exists between the first node and the second node;
and if the newly added paths from any two nodes to the destination node by the source node after traversing the link between every two nodes in the hierarchical structure of the new target directed acyclic graph do not meet the acyclic condition, or the path delay of the newly added paths exceeds a preset delay threshold, taking the new target directed acyclic graph as the maximum directed acyclic graph.
2. The method of claim 1, wherein the order of traversing the links between two nodes in the hierarchy is:
a link from a node in a lower hierarchy in the hierarchy to a node in a higher hierarchy, a link between two nodes in a same hierarchy in the hierarchy, and a link from a node in a higher hierarchy in the hierarchy to a node in a lower hierarchy in the hierarchy.
3. A multipath routing apparatus for a mobile satellite network, comprising:
the system comprises an acquisition module, a transmission network directed acyclic graph generation module and a transmission network directed acyclic graph generation module, wherein the acquisition module is used for acquiring the transmission network directed acyclic graph and determining a source node and a destination node of the transmission network directed acyclic graph;
the determining module is used for determining a target directed acyclic graph according to the transmission network directed acyclic graph, wherein the sum of the path delay from any node in the target directed acyclic graph to a source node and the path delay from any node in the target directed acyclic graph to a destination node is less than or equal to a preset delay threshold value;
the expansion module is used for performing link expansion on the target directed acyclic graph to obtain a maximum directed acyclic graph, wherein the maximum directed acyclic graph meets a preset condition: if a new path is added to the maximum directed acyclic graph, an acyclic condition is destroyed or the path delay of the new path exceeds the preset delay threshold;
the allocation module is used for acquiring the maximum transmission bandwidth and the currently occupied bandwidth of each link in the maximum directed acyclic graph;
obtaining a limiting factor of the maximum directed acyclic graph;
determining the target bandwidth of each link according to the maximum bandwidth of each link and the limiting factor;
determining the target flow from the source node to the destination node according to the target bandwidth of each link;
judging whether the target flow meets the transmission service volume;
if not, adjusting the limiting factor by a dichotomy, taking the adjusted limiting factor as a new limiting factor, and continuing to execute the step of determining the target bandwidth of each link according to the maximum bandwidth and the limiting factor of each link;
if yes, determining the new limiting factor as a transmission blocking factor;
according to the expression
Determining the flow x of the ith link allocationiWherein α isTFor transmission of blocking factors, ciIs the maximum transmission bandwidth of the ith link,
is the currently occupied bandwidth of the ith link;
the determining module is specifically configured to traverse nodes in the directed acyclic graph of the transmission network, determine a shortest path delay from a source node to a destination node through a target node, and obtain a target path delay, where the target node is any node in the directed acyclic graph of the transmission network; judging whether the target path time delay exceeds a preset time delay threshold value, if so, deleting the target node and a corresponding link thereof from the transmission network directed acyclic graph; after traversing, determining the transmission network directed acyclic graph with the nodes and the links deleted as a target directed acyclic graph;
the extension module is specifically used for layering the target directed acyclic graph to obtain a layered structure; traversing links between every two nodes in the hierarchical structure, if a first newly-increased path from the source node to the destination node through a first node in a first hierarchical layer and a second node in a second hierarchical layer meets an acyclic condition and the time delay of the first newly-increased path does not exceed a preset time delay threshold, stopping traversing, adding the links between the first node and the second node into the target directed acyclic graph to obtain a new target directed acyclic graph, and continuing to execute the step of 'layering the target directed acyclic graph'; wherein the first hierarchy and the second hierarchy are any one of the hierarchies, the first node is any one of the nodes in the first hierarchy, the second node is any one of the nodes in the second hierarchy, and no link exists between the first node and the second node; and if the newly added paths from any two nodes to the destination node by the source node after traversing the link between every two nodes in the hierarchical structure of the new target directed acyclic graph do not meet the acyclic condition, or the path delay of the newly added paths exceeds a preset delay threshold, taking the new target directed acyclic graph as the maximum directed acyclic graph.
4. A multipath routing device for a mobile satellite network, comprising: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing the computer-executable instructions stored by the memory causes the at least one processor to perform the multipath routing method for a mobile satellite network of any of claims 1-2.
5. A computer-readable storage medium having stored thereon computer-executable instructions which, when executed by a processor, implement the multipath routing method for a mobile satellite network of any one of claims 1 to 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910086462.2A CN109963316B (en) | 2019-01-29 | 2019-01-29 | Multipath routing method and equipment for mobile satellite network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910086462.2A CN109963316B (en) | 2019-01-29 | 2019-01-29 | Multipath routing method and equipment for mobile satellite network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109963316A CN109963316A (en) | 2019-07-02 |
| CN109963316B true CN109963316B (en) | 2021-07-30 |
Family
ID=67023547
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910086462.2A Active CN109963316B (en) | 2019-01-29 | 2019-01-29 | Multipath routing method and equipment for mobile satellite network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109963316B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115174588B (en) * | 2022-07-28 | 2024-03-01 | 中国工商银行股份有限公司 | Bandwidth control method, device, apparatus, storage medium and program product |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104239137A (en) * | 2014-08-21 | 2014-12-24 | 东软集团股份有限公司 | DAG (Directed Acyclic Graph) node optimal path-based multi-model parallel scheduling method and device |
| US8937886B2 (en) * | 2010-12-17 | 2015-01-20 | Cisco Technology, Inc. | Dynamic reroute scheduling in a directed acyclic graph (DAG) |
| CN107241268A (en) * | 2017-07-20 | 2017-10-10 | 北京航空航天大学 | Local multipath method for routing and device based on satellite-based ADS B message satellite networks |
| CN108141277A (en) * | 2015-10-13 | 2018-06-08 | 高通股份有限公司 | For the method and apparatus of the inter-satellite switching in Low Earth Orbit (LEO) satellite system |
| CN109067648A (en) * | 2018-07-27 | 2018-12-21 | 西安电子科技大学 | The calculation method of multiple constraint routing optimality based on DAG |
-
2019
- 2019-01-29 CN CN201910086462.2A patent/CN109963316B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8937886B2 (en) * | 2010-12-17 | 2015-01-20 | Cisco Technology, Inc. | Dynamic reroute scheduling in a directed acyclic graph (DAG) |
| CN104239137A (en) * | 2014-08-21 | 2014-12-24 | 东软集团股份有限公司 | DAG (Directed Acyclic Graph) node optimal path-based multi-model parallel scheduling method and device |
| CN108141277A (en) * | 2015-10-13 | 2018-06-08 | 高通股份有限公司 | For the method and apparatus of the inter-satellite switching in Low Earth Orbit (LEO) satellite system |
| CN107241268A (en) * | 2017-07-20 | 2017-10-10 | 北京航空航天大学 | Local multipath method for routing and device based on satellite-based ADS B message satellite networks |
| CN109067648A (en) * | 2018-07-27 | 2018-12-21 | 西安电子科技大学 | The calculation method of multiple constraint routing optimality based on DAG |
Non-Patent Citations (2)
| Title |
|---|
| DAG Based Multipath Routing Algorithm for Load Balancing in Machine-to-Machine Networks;Liang Liu,et al;《International Journal of Distributed Sensor Networks》;20140106;正文第1-3、5节、图2-4 * |
| LEO/MEO卫星网络中的一种新型分布式动态路由算法;李冬妮等;《小型微型计算机系统》;20050930;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109963316A (en) | 2019-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112738820B (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| US9225668B2 (en) | Priority driven channel allocation for packet transferring | |
| CN108965014B (en) | QoS-aware service chain backup method and system | |
| CN109451540B (en) | Resource allocation method and equipment for network slices | |
| US10574536B2 (en) | Capacity engineering in distributed computing systems | |
| CN109472441B (en) | Method, processing device, equipment and storage medium for allocating materials | |
| US11252076B2 (en) | Data forwarding method and apparatus | |
| CN107454019A (en) | Software defined network distribution method of dynamic bandwidth, device, equipment and storage medium | |
| CN103746852A (en) | Service routing configuration method and network management equipment | |
| CN108829738A (en) | Date storage method and device in a kind of ceph | |
| CN111355660A (en) | Routing determination method and system based on capacity balance and relative time delay | |
| CN112702399A (en) | Network community cooperation caching method and device, computer equipment and storage medium | |
| CN109963316B (en) | Multipath routing method and equipment for mobile satellite network | |
| CN111611076A (en) | Fair distribution method for mobile edge computing shared resources under task deployment constraint | |
| CN109041236B (en) | Wireless resource allocation method and device for services with different weights | |
| Chen et al. | A survivable virtual network embedding scheme based on load balancing and reconfiguration | |
| CN113438098A (en) | Time delay sensitive virtual network mapping method and device in cloud data center | |
| CN104270299A (en) | Method and system for virtual network mapping | |
| CN105357599A (en) | Method and device for resource allocation | |
| CN109831346B (en) | Method for deploying service function chain in network function virtualization environment | |
| CN111914285B (en) | Geographic distributed graph calculation method and system based on differential privacy | |
| CN114614899A (en) | Data center virtual optical network mapping method and device and electronic equipment | |
| CN114978273A (en) | Satellite-ground load balancing processing method and ground control center | |
| CN113472591A (en) | Method and device for determining service performance | |
| CN115834466B (en) | Method, device, equipment, system and storage medium for analyzing path of computing power network |
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 |