CN107070794B - Low-orbit information network optimal network benefit time delay constraint routing method - Google Patents

Low-orbit information network optimal network benefit time delay constraint routing method Download PDF

Info

Publication number
CN107070794B
CN107070794B CN201611124356.1A CN201611124356A CN107070794B CN 107070794 B CN107070794 B CN 107070794B CN 201611124356 A CN201611124356 A CN 201611124356A CN 107070794 B CN107070794 B CN 107070794B
Authority
CN
China
Prior art keywords
node
data packet
path
rdp
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
Application number
CN201611124356.1A
Other languages
Chinese (zh)
Other versions
CN107070794A (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.)
Aerospace Dongfanghong Satellite Co Ltd
Original Assignee
Aerospace Dongfanghong Satellite Co Ltd
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 Aerospace Dongfanghong Satellite Co Ltd filed Critical Aerospace Dongfanghong Satellite Co Ltd
Priority to CN201611124356.1A priority Critical patent/CN107070794B/en
Publication of CN107070794A publication Critical patent/CN107070794A/en
Application granted granted Critical
Publication of CN107070794B publication Critical patent/CN107070794B/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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • 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/32—Flooding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a low-orbit information network optimal network benefit time delay constraint routing method, which comprises the steps that a source node generates and sends an RDP data packet; the intermediate node searches all links meeting the optimal network benefit of the delay constraint by adopting a delay constraint optimal network benefit routing algorithm, calculates the routing measurement on the links, updates the RDP data packet and sends all the links meeting the optimal network benefit of the delay constraint to the neighbor node; the destination node selects the RDP data packet with the maximum routing metric attribute, and the path node information in the RDP data packet forms an effective path pfGenerating RRP data packet along the effective path pfSending back the RRP data packet; after the source node receives the RRP data packet, the source node follows the effective path pfAnd transmitting the service data. The method improves the probability that the selected path continuously meets the delay constraint of the transmission service flow under the dynamic environment of the low-orbit satellite network by establishing the transmission path which enables the benefit expectation of the delay constraint network to be maximized, thereby improving the overall benefit of the network for bearing the real-time aggregation service flow.

Description

Low-orbit information network optimal network benefit time delay constraint routing method
Technical Field
The invention relates to an optimal network benefit time delay constraint routing method design applied to a low-orbit information network.
Background
For a low-orbit information network, a route oriented to service QoS and network flow balance is a key for improving network efficiency and usability, at the moment, a network layer protocol plays a key role in service and network QoS through path decision, and path selection can directly determine QoS for bearing service flow and has a forming role in flow distribution in a network link.
The path selection requires corresponding optimal constrained routing, that is, routing aiming at optimization of service QoS index and network performance index and meeting constraint, which is called QoS routing. The QoS routing algorithm searches for an available path according to available network resources, link states and service QoS requirements, sets QoS parameter threshold constraint conditions or optimization criteria in the path searching process, obtains a transmission path meeting specific service quality requirements for services with strict, specific bandwidth, time delay and other service quality parameter requirements, and continuously and strictly ensures service quality of the services in the service transmission process by implementing resource reservation on the path.
The QoS routing has been developed more mature in the ground network, but in the dynamic low-earth orbit satellite integrated information network with time-varying topology and unbalanced service distribution, the traditional delay QoS constraint routing technology based on RSVP resource reservation cannot provide strict delay constraint QoS guarantee. Firstly, the network topology structure of the integrated information network of the low earth orbit satellite and the user access relation are time-varying, the link establishment time and the link capacity are jittered, and the factors are synthesized to form the rapid change of the network flow distribution, which causes the unstable QoS performance of the network transmission path, and the real-time service flow needs the network to provide continuous and stable network transmission path and bandwidth resources. Secondly, as mentioned above, to reduce the QoS rerouting and RSVP resource reservation signaling overhead and reduce the waiting time delay for path establishment, an RSVP aggregation model is required, some short-time flows or low-traffic flows directly use the formed QoS path transmission channel, frequent satellite switching causes dynamic changes in the composition of the aggregated flow, non-predictive traffic bursts and increases in average rate are formed, the resource demand on the transmission channel may exceed the resource reservation in a short period, and the QoS performance is constrained by the traffic flow delay. In addition, global service distribution is unbalanced, and along with relative motion change of a satellite network and the earth, when the network load level is higher, a large-area near saturated or saturated link is easy to form, even dynamic link congestion is formed, and the probability that the service delay constraint QoS performance on a path is influenced by dynamic change is increased. Due to the combined action of the factors, the delay QoS requirement of the service flow of the low-orbit satellite integrated information network and the QoS performance of the path are easy to mismatch, so that the path cannot continuously guarantee the bandwidth requirement of the delay constraint of the real-time service flow, the delay QoS interruption rate of the real-time service is increased, and the overall network benefit is reduced.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the method overcomes the defects of the prior art, provides the optimal network benefit time delay constraint routing method of the low-orbit information network, and improves the overall benefit of the network for bearing the real-time aggregation service flow.
The technical solution of the invention is as follows: a low-orbit information network optimal network benefit time delay constraint routing method comprises a source node step, a middle node step and a destination node step, and specifically comprises the following steps:
(1) and the source node:
(1.1) after the source node receives the path request information of the service flow f, extracting the source node, the destination node, the service flow identifier and the service flow information CH from the path request informationfThe method comprises the steps of adding RDP (remote data protocol) sending time stamps which are current whole network uniform time, reserving a path node recording space and a path routing metric attribute recording space, generating an RDP data packet, and sending the RDP data packet to all neighbor nodes of the node; defaulting that the neighbor node is an intermediate node, and entering the step (2) after the neighbor node receives the RDP data packet;
(1.2) the source node waits for the path to respond to the RRP data packet, if the RRP data packet is received within the preset time, an effective transmission path is extracted from the RRP data packet, the validity of resource reservation is checked, if the effective transmission path is valid, the service flow f is sent along the effective transmission path, and if the effective transmission path is not valid, the service flow is rejected; if the RRP data packet is not received within the preset time, the service flow is rejected;
(2) and the intermediate node:
(2.1) judging whether the node is the destination node of the service flow f according to whether the destination node in the RDP data packet is the node number of the node, if so, jumping to the step (3.1) of executing the destination node, if not, considering the node as an intermediate node, and entering the step (2.2);
(2.2) analyzing the content in the RDP data packet, detecting whether the RDP data packet is repeated through whether the RDP with the same triple of the source node, the destination node and the service identifier is received, if the RDP data packet is the same, determining that the repeated RDP data packet is received, discarding the RDP data packet without any processing, and otherwise, entering the step (2.3);
(2.3) calculating the minimum bandwidth resource quantity requirement of the node
Figure GDA0001238800320000031
Entering the step (2.4);
(2.4) searching all links meeting the time delay constraint optimal network benefit routing algorithm, calculating routing metrics on the links, storing the node number into a path node recording space reserved in an RDP data packet, storing the routing metrics of the corresponding links into a path routing metric attribute recording space, changing an RDP sending timestamp, updating the RDP data packet, forwarding the updated RDP data packet to the next node along the links meeting the time delay constraint optimal network benefit routing algorithm, after receiving the RDP data packet, jumping to the step (2), executing a step of an intermediate node, and if no link meeting the time delay constraint optimal network benefit routing algorithm exists, discarding the RDP data packet;
(2.5) waiting for the RRP packet, and when the intermediate node receives the RRP packet, showing that the intermediate node is the finally determined effective path p of the traffic flow ffAccording to the service flow bandwidth requirement corresponding to the node recorded in the RRP data packet, implementing resource reservation and sending the RRP data packet to the effective path pfThe upstream neighbor node performs corresponding steps according to whether the upstream neighbor node is a source node or an intermediate node;
(3) and the destination node:
(3.1) receiving and storing RDP data packets, extracting the routing metric attribute in all the received RDP data packets within a certain time range, and selecting the RDP data packet with the maximum routing metric attribute, wherein the path node information in the RDP data packet is the effective path pfExtracting the effective path pfAnd corresponding route measurement attribute, generates RRP data packet, and sends the RRP data packet to effective path p according to path node information in RRP data packetfThe upstream neighbor node performs corresponding steps according to whether the upstream neighbor node is the source node or the intermediate node.
And (3.1) setting a certain time range to be more than 2 times of the reference path delay from the source node to the destination node.
Step (2.2) adopting a time delay constraint optimal network benefit routing algorithm to search all links meeting the time delay constraint optimal network benefit routing algorithm and calculate routing measurement on the links, which specifically comprises the following steps: when the node is path pfWhen the node is the kth node, K is more than or equal to 1, and each link e from the kth node to the neighbor node is processed as follows:
(2.2.1) judging whether a link e from the kth node to the neighbor node meets the first path pruning leaf constraint
Figure GDA0001238800320000041
Wherein the content of the first and second substances,
Figure GDA0001238800320000042
Figure GDA0001238800320000043
representing the minimum remaining bandwidth on k-1 links before the current time,
Figure GDA0001238800320000044
indicating the minimum remaining bandwidth at the kth node at the current time, when k is 1,
Figure GDA0001238800320000045
equal to the traffic flow bandwidth requirement value, if not, ending, if yes, entering step (2.2.2);
(2.2.2) computing Link e relative to Path pfDelay bound reliability parameter of
Figure GDA0001238800320000046
(2.2.3) constraining the reliability parameter according to the time delay
Figure GDA0001238800320000047
Calculating the route metric of the traffic flow f on the link e
Figure GDA0001238800320000048
And checking whether link e satisfies a second path pruning constraint:
Figure GDA0001238800320000049
if not, ending, otherwise, considering link e as the link satisfying the time delay constraint optimal network benefit routing algorithm, and the routing metric on the link is
Figure GDA00012388003200000410
Path pfMinimum bandwidth resource quantity requirement of kth node
Figure GDA00012388003200000411
Calculated according to the following formula:
Figure GDA00012388003200000412
in the formula, σfRepresents the maximum burst data length of the traffic flow f; rhofRepresents the average arrival rate of the traffic flow f;
Figure GDA00012388003200000413
represents the maximum packet length, D, of the traffic flow ffAn end-to-end delay constraint threshold for traffic flow f,
Figure GDA00012388003200000414
is the difference between the current time and the RDP send timestamp; k represents a node number, the node number of the source node is k equal to 1, when k is equal to 1,
Figure GDA00012388003200000415
the bandwidth requirement for the traffic flow.
Calculating link e relative to path p in said step (2.2.2)fDelay bound reliability parameter of
Figure GDA00012388003200000416
Wherein the content of the first and second substances,
Figure GDA00012388003200000417
indicates that link e is in
Figure GDA00012388003200000418
Probability of continuous connectivity;
Figure GDA0001238800320000051
indicating that under the condition of persistent connection, the link e is
Figure GDA0001238800320000052
The bandwidth resource provided for the service flow f is continuously greater than g (p)f) The probability of (c).
The route metric of the (2.2.3) traffic flow f on link e
Figure GDA0001238800320000053
The calculation formula of (2) is as follows:
Figure GDA0001238800320000054
in the formula (I), the compound is shown in the specification,
Figure GDA0001238800320000055
is pfRoute metric, ω, for traffic flow f for link e' of the first K-1 nodesfQoS priority weighting for the service flow f with a value range of [0, 1%]，
Figure GDA0001238800320000056
Represents a path pfThe product of the reliability parameters of the links previously passing through K-1 nodes,
Figure GDA0001238800320000057
ωiQoS priority weighting for service flow i with value range of [0, 1%]ξ is defined as [0,1 ]]The interference weighting parameter in the range, i is the number of a certain traffic flow of all the N traffic flows passing through the link e,
Figure GDA0001238800320000058
indicating the reliability parameter of the ith traffic stream as it passes through link e.
Compared with the prior art, the invention has the beneficial effects that:
(1) the invention improves the probability that the selected path continuously meets the delay constraint of the transmission service flow under the dynamic environment of the low-orbit satellite network by establishing the transmission path which enables the benefit expectation of the delay constraint network to be maximized, thereby improving the overall benefit of the network bearing the real-time aggregation service flow;
(2) according to the special link dynamic characteristics of the low-orbit satellite communication network, a path delay constraint reliability evaluation model is established, and the delay constraint reliability of a new path and the reliability interference relationship with the current path delay constraint QoS are evaluated;
(3) the invention builds a path optimization target of the current network utility expectation maximization based on the path delay constraint reliability parameter by using the thought of self-interference system capacity optimization, so that the path selection considers the delay constraint service quality of the call service flow and the interference caused by the delay constraint service quality of the on-line service flow at the same time, the action of the selected path on the network benefit is comprehensively measured, and the network benefit meeting the delay constraint QoS at the maximization is taken as a criterion, and the network flow distribution is balanced;
(4) the invention sets the path admittance control criterion, appropriately controls the network link flow level, thereby protecting the overall network benefit in the dynamic network environment, if the evaluation shows that the use of a certain path by the call service flow will cause the network utility expectation to be reduced, the use of the path is considered to possibly cause the network loss to be larger than the profit, and the path is excluded in the path searching process;
(5) the invention adopts a reaction type flooding routing strategy commonly used by a dynamic network to reduce the cost of updating the QoS state information of the network link and improve the accuracy of the link state information.
Drawings
Fig. 1 is a flowchart of an optimal network benefit delay constraint routing method of a low-orbit information network according to the present invention.
Detailed Description
The invention is described in detail below with reference to the accompanying drawings and specific embodiments.
The invention provides a time delay constraint routing method for optimal network benefit of a low earth orbit information network, which is based on an RSVP flow aggregation service model, and improves the probability that a selected path continuously meets the time delay constraint of a transmission service flow under the dynamic environment of a low earth orbit satellite network by establishing a transmission path which enables the time delay constraint network benefit to be expected to be maximized, thereby improving the overall benefit of the network for bearing the real-time aggregation service flow.
The steps of the source node, the intermediate node and the destination node are described below.
1. Source node
The access satellite node of the service flow f is a source node, and after the source node receives the path request information of the service flow f, the access satellite node comprises:
(1.1) generating RDP data packet
RDP (route detection packet) represents a path detection data packet, and the RDP data packet comprises a source node, a destination node, a service flow identifier f, an RDP sending time stamp and service flow information CHfTraffic bandwidth requirement information, path node record space and path route metric attribute record space, wherein,
Figure GDA0001238800320000061
parameter set f for service flow, used for describing real-time aggregation service flow, wherein
Figure GDA0001238800320000062
Representing the preset transmission starting time of the service flow f; a. thef(τf) Representing the duration distribution function, tau, of a traffic flow ffRepresents the duration of the traffic flow; sigmafRepresents the maximum burst data length of the traffic flow f; rhofRepresents the average arrival rate of the traffic flow f;
Figure GDA0001238800320000063
representing the maximum packet length of the traffic flow f.
After the source node receives the path request information of the service flow f, the source node requests the pathExtracting source node, destination node, service flow identifier f and service flow information CH from the informationfAnd increasing RDP sending time stamps which are the current whole network uniform time, reserving a path node recording space and a path routing measurement attribute recording space, and generating an RDP data packet. The traffic flow information CHfAnd the data formats of the RDP packets are shown in tables 1 and 2, respectively:
table 1 traffic flow information CHf
Figure GDA0001238800320000071
Table 2 RDP data packet
Figure GDA0001238800320000072
In the above table, the RDP sending timestamp is the whole network uniform time when the RDP data packet is sent, and the path node recording space and the path routing metric attribute recording space reserved at the source node end are fixed words 0 xFF.
(1.2) sending the RDP data packet to the neighbor nodes through each neighbor link of the source node;
and (1.3) starting an RDP timer corresponding to the service, waiting for an RRP data packet, recording the timers aiming at the source node Y and the service f as a timer Yf, wherein the time set by the timer is an empirical parameter and is generally obtained by actually measuring the time from the source node to the destination node. If the RRP data packet is received within the preset time, extracting an effective transmission path from the RRP data packet, checking the validity of resource reservation, if the RRP data packet is valid, establishing a service path, and starting to send a service flow f along the established effective transmission path, otherwise, rejecting the service flow without any processing; if the RRP packet is not received within a predetermined time (i.e., before the timer Yf times out), the traffic flow is rejected and no processing is performed.
The rrp (route responding packet) represents a route response packet. The format of the RRP packet is shown in table 3:
TABLE 3 RRP data packet
Figure GDA0001238800320000073
In the above table, the path node recording space: sequentially storing the serial numbers of all nodes on an effective path from a source node to a destination node; path routing metric attribute record space: and the path node recording space is used for sequentially storing all node routing metric attributes on the effective path from the source node to the destination node.
The source node checks the validity of the resource reservation by: firstly, extracting a reserved bandwidth corresponding to a source node from an RRP data packet service flow bandwidth demand space, judging whether the reserved bandwidth exceeds the service flow bandwidth demand, if so, considering that the resource reservation is effective, otherwise, the resource reservation is invalid.
2. Intermediate node
When a satellite routing node n in the network receives an RDP packet, first, the node performs the following steps:
(2.1) judging whether the node is the destination node of the service flow f according to whether the destination node in the RDP data packet is the node number of the node, if so, jumping to the step (3.1) of executing the destination node, if not, considering the node as an intermediate node, and executing the step (2.2);
(2.2) analyzing the content in the RDP data packet, detecting whether the RDP data packet is repeated through whether the RDP with the same triple of the source node, the destination node and the service identifier is received, if the RDP data packet is the same, determining that the repeated RDP data packet is received, discarding the RDP data packet without any processing, and otherwise, executing the step (2.3);
(2.3) calculating the minimum bandwidth resource quantity requirement of the node
Figure GDA0001238800320000081
Typically, the entire path pfMinimum bandwidth resource quantity requirement g (p) off) The calculation formula is as follows:
Figure GDA0001238800320000082
in the formula: sigmafRepresents the maximum burst data length, p, of the traffic flow ffRepresenting the average arrival rate of the traffic flow f,
Figure GDA0001238800320000083
indicating the maximum packet length, K, of the traffic flow ffFor the transmission path pfTotal number of hops, i.e. how many hops there are in total, e.g. 2 hops for CBA, dprop(pf) To follow path pfPath propagation delay, D, for sending RDP packets from source node to destination nodefA delay constraint threshold for an end-to-end service flow f, where the delay constraint threshold is determined by a data flow type, and one type of information in the whole network is determined by a threshold, such as: voice service: 50 ms; short message service: for 10 s.
By path pfTake the kth node in (1) as an example, because of the path PfCurrently, only the first k nodes can be known, and the algorithm uses
Figure GDA0001238800320000091
Approximate substitution of PfThen path pfApproximation of minimum bandwidth resource quantity requirement of
Figure GDA0001238800320000092
Comprises the following steps:
Figure GDA0001238800320000093
in the formula, σf、ρf、
Figure GDA0001238800320000094
CH for the service ffDefinition, DfAn end-to-end delay constraint threshold for traffic flow f,
Figure GDA0001238800320000095
to send a timestamp with RDP based on the current timeThe difference between them. k represents a node number, the node number of the source node is k equal to 1, when k is equal to 1,
Figure GDA0001238800320000096
the bandwidth requirement for the traffic flow.
(2.4) searching all links meeting the optimal network benefit routing algorithm of the delay constraint by adopting the optimal network benefit routing algorithm of the delay constraint, calculating routing measurement on the links, storing the node number into a path node recording space reserved in an RDP data packet, storing the routing measurement of the corresponding link into a path routing measurement attribute recording space, changing an RDP sending time stamp, updating the RDP data packet, forwarding the updated RDP data packet to the next node along the link meeting the optimal network benefit routing algorithm of the delay constraint, and discarding the RDP data packet if no link meeting the optimal network benefit routing algorithm of the delay constraint exists, wherein the method specifically comprises the following steps:
(2.4.1), judging whether the link e from the kth node to the neighbor node meets the first path pruning leaf constraint
Figure GDA0001238800320000097
Wherein the content of the first and second substances,
Figure GDA0001238800320000098
Figure GDA0001238800320000099
representing the minimum remaining bandwidth on k-1 links before the current time,
Figure GDA00012388003200000910
the minimum residual bandwidth on the kth node at the current moment is represented and is directly acquired on the router, and when k is 1, the minimum residual bandwidth is ignored
Figure GDA00012388003200000911
Item, retention
Figure GDA00012388003200000912
The entry, the minimum remaining bandwidth of the source node, is equal to the traffic flowThe bandwidth demand value is judged, if the bandwidth demand value is not met, the process is ended, and if the bandwidth demand value is met, the process enters the step (2.4.2);
(2.4.2) computing Link e relative to Path pfDelay bound reliability parameter of
Figure GDA00012388003200000913
Link e is relative to path pfDelay bound reliability parameter of
Figure GDA00012388003200000914
Wherein the content of the first and second substances,
Figure GDA00012388003200000915
indicates that link e is in
Figure GDA00012388003200000916
Probability of continuous connectivity;
Figure GDA00012388003200000917
indicating that under the condition of persistent connection, the link e is
Figure GDA00012388003200000918
The bandwidth resource provided for the service flow f is continuously greater than g (p)f) The probability of (c).
Here, it is defined that: at time t, let path pfOther parameters remain unchanged, link e may be in time interval
Figure GDA0001238800320000101
The end-to-end time delay of the service flow f is ensured to be less than a time delay threshold DfIs called link e relative to path pfIs expressed as a delay bound reliability parameter of
Figure GDA0001238800320000102
Figure GDA0001238800320000103
Wherein the content of the first and second substances,
Figure GDA0001238800320000104
indicates that link e is in
Figure GDA0001238800320000105
Probability of continuous connectivity;
Figure GDA0001238800320000106
indicating that under the condition of persistent connection, the link e is
Figure GDA0001238800320000107
The bandwidth resource provided for the service flow f is continuously greater than g (p)f) The probability of (c). t is the current time of day and t is,
Figure GDA0001238800320000108
indicating the transmission start time, τ, of the traffic flow ffThe duration of the traffic flow.
Figure GDA0001238800320000109
The historical parameters based on the node long-term statistical link-on duration are calculated, and for the ground network,
Figure GDA00012388003200001010
at 1, for a low-track information network,
Figure GDA00012388003200001011
it can be scaled by unifying the call-through rate over a given time, provided that 0.5 hours are disconnected within 24 hours,
Figure GDA00012388003200001012
Figure GDA00012388003200001013
according to all the service flows i epsilon Γ on the linkeThe flow characteristic parameter and the service flow information of the service flow f are calculated to obtain gammaeIs the set of all traffic flows through link e.
The general link e is provided with a plurality of service flows, the plurality of service flows are superposed and then obey normal distribution according to the central limit theorem, the mean value and the variance of the normal distribution are easily calculated according to the parameters of the service flows, and the probability that the cumulative distribution is greater than a certain value is easily found according to a normal distribution table, so that the probability that the cumulative distribution is greater than the certain value is obtained
Figure GDA00012388003200001014
(2.4.3) constraining the reliability parameter according to the time delay
Figure GDA00012388003200001015
Calculating the route metric of the traffic flow f on the link e
Figure GDA00012388003200001016
Route metric Uf(pf) A benefit function formed for the transmission of a traffic flow through the network, the function expressing the passage of the traffic flow f through the path pfThe resulting network benefits are transmitted in the network.
Route measurement of traffic flow f on link e
Figure GDA00012388003200001017
Defined as selecting link e as pfThe k-th hop path of (a) is a change value of the network benefit expectation. The calculation formula is as follows:
Figure GDA00012388003200001018
in the formula (I), the compound is shown in the specification,
Figure GDA00012388003200001019
is pfRoute metric, ω, for traffic flow f for link e' of the first K-1 nodesfQoS priority weighting for the service flow f with a value range of [0, 1%]，
Figure GDA00012388003200001020
Represents a path pfThrough K-1 node links beforeThe product of the dependence parameters is obtained by multiplying the dependence parameters,
Figure GDA0001238800320000111
ωiQoS priority weighting for service flow i with value range of [0, 1%]ξ is defined as [0,1 ]]The interference weighting parameter in the range, i is the number of a certain traffic flow of all the N traffic flows passing through the link e,
Figure GDA0001238800320000112
indicating the reliability parameter of the ith traffic stream as it passes through link e.
(2.4.4), checking whether the link e meets the second path pruning constraint:
Figure GDA0001238800320000113
if the constraint is not satisfied, ending, otherwise, the route metric on the link e calculated in the step (2.4.3) is the route metric
Figure GDA0001238800320000114
(2.4.5) storing the node into a path node recording space reserved in the RDP data packet, and measuring the route of the link e
Figure GDA0001238800320000115
And storing the RDP data packet into a path routing metric attribute recording space, updating the RDP data packet, and forwarding the RDP data packet to a neighbor node at the other end of the link e along the link e.
(2.5) waiting for the RRP data packet, and after the RRP data packet is received by a satellite routing node n in the network, showing that the node is taken as a path p of a service flow ffWhen the node will perform resource reservation (the actual reserved resource may be less than the traffic bandwidth requirement but should be greater than it)
Figure GDA0001238800320000116
) Storing the actually reserved resources into the service flow bandwidth requirement entry in the RRP, and forwarding the RRP data packet to the pfOf the upstream neighbor node.
(3) And the destination node:
(3.1) when a first RDP data packet identified by a source node, a destination node and a service identification triple is received, starting a timer Df, wherein a path stored in the received RDP data packet is an effective path meeting routing constraints within the timing time of the timer Df, the path routing metric in the RDP packet is the optimized metric of the whole path, storing the received RDP data packet until the timer Df is overtime, discarding all subsequently received RDP data packets identified, and entering the step (3.2), wherein the overtime time of the timer Df is more than 2 times of the reference path delay from the source node to the destination node, and the reference path delay is obtained through testing.
(3.2) extracting the routing metric attribute in all the received RDP data packets, and selecting the RDP data packet with the largest routing metric attribute from the storage unit, wherein the RDP data packet with the largest routing metric attribute is determined by comparing the minimum routing metric attribute value in each RDP data packet in the storage unit, namely the path node information in the RDP data packet with the largest routing metric attribute value is the effective path pfGenerating RRP data packet, implementing path confirmation and resource reservation along the reverse path of the path, and sending to the effective path p according to the path node information in the RDP data packetfThe upstream node of (1). And generating the RRP data packet.
Those skilled in the art will appreciate that those matters not described in detail in the present specification are well known in the art.

Claims (2)

1. A low-orbit information network optimal network benefit time delay constraint routing method is characterized by comprising a source node step, an intermediate node step and a destination node step, and specifically comprises the following steps:
(1) and the source node:
(1.1) after the source node receives the path request information of the service flow f, extracting the source node, the destination node, the service flow identifier and the service flow information CH from the path request informationfService flow bandwidth demand information, and adding RDP (remote data protocol) sending time stamps which are current whole network uniform time, and reserving path node recording space and path routing measurement attribute recordsRecording the space, generating an RDP data packet, and sending the RDP data packet to all neighbor nodes of the node; considering the neighbor node as an intermediate node, and entering the step (2) after the neighbor node receives the RDP data packet;
(1.2) the source node waits for the path to respond to the RRP data packet, if the RRP data packet is received within the preset time, an effective transmission path is extracted from the RRP data packet, the validity of resource reservation is checked, if the effective transmission path is valid, the service flow f is sent along the effective transmission path, and if the effective transmission path is not valid, the service flow is rejected; if the RRP data packet is not received within the preset time, the service flow is rejected;
(2) and the intermediate node:
(2.1) judging whether the node is the destination node of the service flow f according to whether the destination node in the RDP data packet is the node number of the node, if so, jumping to the step (3.1) of executing the destination node, if not, considering the node as an intermediate node, and entering the step (2.2);
(2.2) analyzing the content in the RDP data packet, detecting whether the RDP data packet is repeated through whether the RDP with the same triple of the source node, the destination node and the service identifier is received, if the RDP data packet is the same, determining that the repeated RDP data packet is received, discarding the RDP data packet without any processing, and otherwise, entering the step (2.3);
(2.3) calculating the minimum bandwidth resource quantity requirement of the node
Figure FDA0002140863770000011
Entering the step (2.4); path pfMinimum bandwidth resource quantity requirement of kth node
Figure FDA0002140863770000012
Calculated according to the following formula:
Figure FDA0002140863770000013
in the formula, σfRepresents the maximum burst data length of the traffic flow f; rhofTo representAverage arrival rate of traffic flow f;
Figure FDA0002140863770000021
represents the maximum packet length, D, of the traffic flow ffAn end-to-end delay constraint threshold for traffic flow f,
Figure FDA0002140863770000022
is the difference between the current time and the RDP send timestamp; k represents a node number, the node number of the source node is k equal to 1, when k is equal to 1,
Figure FDA0002140863770000023
the bandwidth requirement of the service flow is met;
(2.4) searching all links meeting the time delay constraint optimal network benefit routing algorithm, calculating routing metrics on the links, storing the node number into a path node recording space reserved in an RDP data packet, storing the routing metrics of the corresponding links into a path routing metric attribute recording space, changing an RDP sending timestamp, updating the RDP data packet, forwarding the updated RDP data packet to the next node along the links meeting the time delay constraint optimal network benefit routing algorithm, after receiving the RDP data packet, jumping to the step (2), executing a step of an intermediate node, and if no link meeting the time delay constraint optimal network benefit routing algorithm exists, discarding the RDP data packet;
the method specifically comprises the following steps: when the node is path pfWhen the node is the kth node, K is more than or equal to 1, and each link e from the kth node to the neighbor node is processed as follows:
(2.4.1), judging whether the link e from the kth node to the neighbor node meets the first path pruning leaf constraint
Figure FDA0002140863770000024
Wherein the content of the first and second substances,
Figure FDA0002140863770000025
Figure FDA0002140863770000026
representing the minimum remaining bandwidth on k-1 links before the current time,
Figure FDA0002140863770000027
indicating the minimum remaining bandwidth at the kth node at the current time, when k is 1,
Figure FDA0002140863770000028
equal to the traffic flow bandwidth requirement value, if not, ending, if yes, entering step (2.4.2);
(2.4.2) computing Link e relative to Path pfDelay bound reliability parameter of
Figure FDA0002140863770000029
Figure FDA00021408637700000210
Wherein the content of the first and second substances,
Figure FDA00021408637700000211
indicates that link e is in
Figure FDA00021408637700000212
Probability of continuous connectivity;
Figure FDA00021408637700000213
indicating that under the condition of persistent connection, the link e is
Figure FDA00021408637700000214
The bandwidth resource provided for the service flow f is continuously greater than g (p)f) The probability of (d); t is the current time of day and t is,
Figure FDA00021408637700000215
indicating the transmission start time, τ, of the traffic flow ffDuration of the traffic flow;
(2.43) constraining the reliability parameter according to the time delay
Figure FDA00021408637700000216
Calculating the route metric of the traffic flow f on the link e
Figure FDA0002140863770000031
And checking whether link e satisfies a second path pruning constraint:
Figure FDA0002140863770000032
if not, ending, otherwise, considering link e as the link satisfying the time delay constraint optimal network benefit routing algorithm, and the routing metric on the link is
Figure FDA0002140863770000033
Route measurement of traffic flow f on link e
Figure FDA0002140863770000034
The calculation formula of (2) is as follows:
Figure FDA0002140863770000035
in the formula (I), the compound is shown in the specification,
Figure FDA0002140863770000036
is pfRoute metric, ω, for traffic flow f for link e' of the first K-1 nodesfQoS priority weighting for the service flow f with a value range of [0, 1%]，
Figure FDA0002140863770000037
Represents a path pfThe product of the reliability parameters of the links previously passing through K-1 nodes,
Figure FDA0002140863770000038
ωiQoS priority weighting for service flow i with value range of [0,1]ξ is defined as [0,1 ]]The interference weighting parameter in the range, i is the number of a certain traffic flow of all the N traffic flows passing through the link e,
Figure FDA0002140863770000039
representing the reliability parameter of the ith service flow when the ith service flow passes through the link e;
(2.5) waiting for the RRP packet, and when the intermediate node receives the RRP packet, showing that the intermediate node is the finally determined effective path p of the traffic flow ffAccording to the service flow bandwidth requirement corresponding to the node recorded in the RRP data packet, implementing resource reservation and sending the RRP data packet to the effective path pfThe upstream neighbor node performs corresponding steps according to whether the upstream neighbor node is a source node or an intermediate node;
(3) and the destination node:
(3.1) receiving and storing RDP data packets, extracting the routing metric attribute in all the received RDP data packets within a certain time range, and selecting the RDP data packet with the maximum routing metric attribute, wherein the path node information in the RDP data packet is the effective path pfExtracting the effective path pfAnd corresponding route measurement attribute, generates RRP data packet, and sends the RRP data packet to effective path p according to path node information in RRP data packetfThe upstream neighbor node performs corresponding steps according to whether the upstream neighbor node is the source node or the intermediate node.
2. The optimal network benefit delay constraint routing method for the low-orbit information network according to claim 1, wherein the certain time range in the step (3.1) is set to be more than 2 times of the reference path delay from the source node to the destination node.
CN201611124356.1A 2016-12-08 2016-12-08 Low-orbit information network optimal network benefit time delay constraint routing method Active CN107070794B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611124356.1A CN107070794B (en) 2016-12-08 2016-12-08 Low-orbit information network optimal network benefit time delay constraint routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611124356.1A CN107070794B (en) 2016-12-08 2016-12-08 Low-orbit information network optimal network benefit time delay constraint routing method

Publications (2)

Publication Number Publication Date
CN107070794A CN107070794A (en) 2017-08-18
CN107070794B true CN107070794B (en) 2020-04-10

Family

ID=59618976

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611124356.1A Active CN107070794B (en) 2016-12-08 2016-12-08 Low-orbit information network optimal network benefit time delay constraint routing method

Country Status (1)

Country Link
CN (1) CN107070794B (en)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107979409B (en) * 2017-12-21 2020-11-20 北京九天微星科技发展有限公司 Inter-orbit satellite communication routing method and device
CN110166366B (en) 2018-02-14 2023-02-28 华为技术有限公司 Network congestion control method, device and system
CN110138437B (en) * 2019-04-03 2021-04-20 西安建筑科技大学 Satellite communication network key link sequence detection method based on time delay performance
CN110139173B (en) * 2019-05-07 2020-03-27 北京邮电大学 Network domain division method for reducing end-to-end time delay of optical transport network
CN112769696B (en) * 2019-11-06 2023-09-26 中兴通讯股份有限公司 Routing method, network controller, system and storage medium
CN111147413B (en) * 2019-12-31 2022-09-09 东方红卫星移动通信有限公司 Short-time burst demodulation method for low-earth-orbit satellite
CN111726338B (en) * 2020-05-19 2021-07-13 中国科学院信息工程研究所 Link flooding attack protection method and device
CN112468449B (en) * 2020-11-06 2022-11-01 中国电子科技集团公司电子科学研究院 Method for optimizing and configuring backtracking security controlled network access channel resources
CN112600763B (en) * 2020-12-09 2022-08-19 西安邮电大学 Low-cost flow distribution implementation method capable of guaranteeing delay
CN113037632B (en) * 2021-02-26 2021-12-17 中国电子科技集团公司第五十四研究所 Space-based network resource scheduling method based on path identification
CN114585044A (en) * 2022-01-26 2022-06-03 中国人民解放军国防科技大学 Path selection method and router
CN115022227B (en) * 2022-06-12 2023-07-21 长沙理工大学 Data transmission method and system based on circulation or rerouting in data center network
CN114980199B (en) * 2022-07-13 2022-11-01 鹏城实验室 Data transmission control method for multi-communication link fusion and satellite communication system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101969396A (en) * 2010-09-02 2011-02-09 北京邮电大学 Time delay and bandwidth resource-based relay selection method
CN103260210A (en) * 2013-05-31 2013-08-21 北京新岸线移动多媒体技术有限公司 Building method, system and device of multi-hop routing in multi-hop network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101969396A (en) * 2010-09-02 2011-02-09 北京邮电大学 Time delay and bandwidth resource-based relay selection method
CN103260210A (en) * 2013-05-31 2013-08-21 北京新岸线移动多媒体技术有限公司 Building method, system and device of multi-hop routing in multi-hop network

Also Published As

Publication number Publication date
CN107070794A (en) 2017-08-18

Similar Documents

Publication Publication Date Title
CN107070794B (en) Low-orbit information network optimal network benefit time delay constraint routing method
EP3039817B1 (en) Determination and use of link performance measures
CN101026509B (en) End-to-end low available bandwidth measuring method
Altman et al. A stochastic model of TCP/IP with stationary random losses
US8644164B2 (en) Flow-based adaptive private network with multiple WAN-paths
US20050232227A1 (en) Method and apparatus for characterizing an end-to-end path of a packet-based network
Ribeiro et al. pathchirp: Efficient available bandwidth estimation for network paths
JP4153321B2 (en) Service quality-aware handoff trigger
KR20150089853A (en) Traffic split control method and apparatus in heterogeneous wireless networks
CN102461093B (en) Method of managing a traffic load
CN113194037B (en) Traffic scheduling method and device
CN108337032A (en) A method of the latency measurement deviation quantization in SDSN and latency prediction
US20230051166A1 (en) Delay Sensitive Network Estimation System
Houidi et al. Constrained deep reinforcement learning for smart load balancing
CN107171957B (en) Self-adaptive DTN routing algorithm based on resource limited condition
CN102224713A (en) A method for estimation of residual bandwitdth
KR20120040270A (en) Estimation method for loss rates in a packetized network
Huang et al. An adaptive multipath routing for leo satellite network
CN114039654B (en) Routing method based on load balancing for large-scale LEO satellite network
Xu et al. A bandwidth adaptive method for estimating end-to-end available bandwidth
Herrera-Alonso et al. Improving TCP Vegas fairness in presence of backward traffic
CN109067668B (en) Global network acceleration link construction method based on intelligent balanced distribution
Yu et al. Estimating Available Bandwidth Using Overloading Stream with Variable Packet Size
Wakeman et al. A combined admission and congestion control scheme for variable bit rate video
Kang et al. On estimating tight-link bandwidth characteristics over multi-hop paths

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