CN112565014B - Satellite network end-to-end time delay upper bound acquisition method based on network algorithm - Google Patents
Satellite network end-to-end time delay upper bound acquisition method based on network algorithm Download PDFInfo
- Publication number
- CN112565014B CN112565014B CN202011405235.0A CN202011405235A CN112565014B CN 112565014 B CN112565014 B CN 112565014B CN 202011405235 A CN202011405235 A CN 202011405235A CN 112565014 B CN112565014 B CN 112565014B
- Authority
- CN
- China
- Prior art keywords
- delay
- node
- upper bound
- satellite
- network
- 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
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000004422 calculation algorithm Methods 0.000 title claims description 22
- 238000004364 calculation method Methods 0.000 claims abstract description 9
- 230000005540 biological transmission Effects 0.000 claims description 17
- 230000007774 longterm Effects 0.000 claims description 7
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 3
- 230000002776 aggregation Effects 0.000 claims description 3
- 238000004220 aggregation Methods 0.000 claims description 3
- 238000004088 simulation Methods 0.000 description 15
- 238000004458 analytical method Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 229910052741 iridium Inorganic materials 0.000 description 2
- GKOZUEZYRPOHIO-UHFFFAOYSA-N iridium atom Chemical compound [Ir] GKOZUEZYRPOHIO-UHFFFAOYSA-N 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000003012 network analysis Methods 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/06—Airborne or Satellite Networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- General Physics & Mathematics (AREA)
- Environmental & Geological Engineering (AREA)
- Radio Relay Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a satellite network end-to-end time delay upper bound acquisition method based on network calculation, which comprises the following steps: acquiring link delay; obtaining time delay among nodes by utilizing network calculation; obtaining an end-to-end delay upper bound according to the link delay and the delay between nodes; the application obtains the propagation delay by calculating the inter-satellite distance, sets the arrival curve and the service curve of the node and combines the satellite network method to obtain the end-to-end delay upper bound of the satellite network, and can provide support for network QoS control.
Description
Technical Field
The application relates to the field of satellite network end-to-end time delay upper bound analysis, in particular to a satellite network end-to-end time delay upper bound acquisition method based on network algorithm.
Background
In recent years, satellite networks have been widely used because of their large transmission capacity, long communication distance, no influence of terrain and natural disasters, etc., and have become a beneficial supplement to terrestrial communications, and are also an important means for realizing global seamless coverage. However, satellite networks incur a larger delay than terrestrial networks, and the end-to-end delay of the network is one of the most important parameters for the quality of service (Quality of Service, qoS) of the network, and the accuracy of the boundary analysis directly affects the level of guarantee of the QoS of the network.
At present, the delay performance analysis of the network mainly comprises methods such as queuing theory, network calculation and the like. The use of queuing theory methods requires more accurate traffic and service methods for network performance analysis, which are difficult to obtain for the current increasingly complex network morphology and traffic flow characteristics. The network algorithm adopts an upper bound to describe the arrival process of the service flow and a lower bound to describe the service process, so that the QoS performance bound of the service flow is obtained, and the analysis method is more flexible. However, in the satellite network, since the link propagation delay changes periodically and the changes cannot be ignored, if the conventional network analysis method is directly applied to the satellite network, the propagation delay will be uniformly valued, which inevitably faces the challenge of calculation accuracy. In addition, in order to obtain an end-to-end delay upper bound, the traditional delay boundary calculation is excessively amplified to queue delay, so that the calculated delay boundary is greatly different from the actual delay, and the performance of a QoS control algorithm based on network calculation is affected. Therefore, how to analyze and accurately solve the end-to-end time delay upper bound of the satellite network by using the network algorithm becomes an important concern.
Disclosure of Invention
In view of the problem that the existing time delay upper bound analysis method can not accurately solve the end-to-end time delay upper bound problem of the satellite network, the application provides a satellite network end-to-end time delay upper bound acquisition method based on network algorithm, so as to ensure that support can be provided for network QoS control.
In order to achieve the above purpose, the technical scheme of the application is as follows: a satellite network end-to-end time delay upper bound acquisition method based on network algorithm comprises the following steps:
acquiring link delay;
obtaining time delay among nodes by utilizing network calculation;
and obtaining an end-to-end delay upper bound according to the link delay and the delay between nodes.
Further, the acquiring the link delay specifically includes: let R be the earth radius, h A ,h B The orbital heights of satellite a and satellite B,the longitude and latitude of the satellite point below the satellite A and the satellite B respectively; inter-satellite link length d BA Expressed as:
wherein the method comprises the steps of
Obtaining the link delay D through the inter-satellite link length and the light speed c l The method comprises the following steps:
further, the obtaining the time delay between the nodes by using the network algorithm specifically includes:
m-2 intermediate nodes exist between a node 1 and a node m in the satellite network, when a service flow A (t) arrives at the node, the service flow A (t) is limited by a token bucket with the node parameter of (r, b), namely, the service flow A (t) is constrained by an arrival curve alpha (t) =rt+b of the node, b is burst traffic, and r is the long-term average rate of a data flow;
for traffic flow a (t), the service curve provided by the nodes in the path is:
wherein C represents the service rate provided by the node, and T represents the service delay of the data packet at the node; the delay parameter is considered to be the packet processing delay, so the delay between network nodes is expressed as:
T＝L/C (2)
where L represents the maximum packet length.
Further, if there are n traffic flows, it is assumed that traffic flow a i (t), i=1, 2, …, n is assigned a weight ω i Then assign to traffic flow a i Service rate C of (t) i Is that
Using C in the above formula i The curve obtained by substituting C in the formula (1) is a certain traffic flow A i Business service profile of (t).
Further, assume a traffic flow A i (t) through node p, the arrival curve of the node is alpha, the service curve is beta, the delay D of the traffic flow through the node p Is that
Wherein W is t Peak rate for the link from the previous node to the current node; t (T) i Representing traffic flow A i (t) service delay at node p; b i For burst traffic of a certain node r i A long term average rate for a node;
from the joint solution of arrival curves and service curvesThen substituting the arrival curve alpha (t) and (1) - (3) into the formula to obtain the single-node time delay upper bound D p The method comprises the following steps:
the rate of the traffic stream reaches the peak rate W of the link bandwidth t Resulting in a rapid aggregation of a large amount of traffic at the node and a queuing of the large amount of traffic due to the limited processing power of the node, resulting in a maximum delay of this period, i.e. when W t t＝r i t+b i At the time, thereby obtainingTime delay D p Reaching the maximum value, therefore:
further, in the satellite network, the end-to-end delay includes a variable delay and a fixed delay, where the variable delay includes a queuing delay and a link propagation delay buffered by a system at the node; the fixed delay includes a transmission delay within the node, i.e., the time required for the node to enter data from the node to the transmitter when transmitting the data.
Further, assume a traffic flow A i (t) sequentially passing through m knotsThe arrival curves in the nodes are in turn alpha i I=1, 2, …, m, the service curve of the system is β in turn i I=1, 2, …, m, the propagation delay between two adjacent nodes is in turnThe transmission delay of the intermediate node is as follows in sequence: />Then the end-to-end delay upper bound D 1→m The method comprises the following steps:
1) When m=1, the single node delay upper bound D p Or (5) obtaining the end-to-end time delay upper bound D 1 The method comprises the steps of carrying out a first treatment on the surface of the When m=2, deducing the time delay of the 1 st node from the horizontal deviationAfter passing through node 1, the output flow is affected by the propagation delay of the link when passing through the link, so the arrival curve of the output flow when reaching node 2Reach it to curve alpha 2 Substituting the formula (t) and the formula (1) into a horizontal deviation deduction formula to solve the time delay of the node to obtain the time delay of the node is as follows:
the end-to-end delay between the 1 st and 2 nd nodes is:
2) When m=k-1, the end-to-end delay upper bound is:
3) When m=k, the arrival curve of the kth node isBy single-node delay upper bound D p The delay of the kth node is obtained as follows:
end-to-end delay D from node 1 to node k 1→k Time delay D equal to the first k-1 nodes 1→k-1 And the delay D of the kth node k The sum of, i.e
Wherein,is the sum of propagation delay on the link and transmission delay of the intermediate node; transmission delay D of intermediate node f For D f ＝sN i Wherein the constant s is the transmission delay of a node, N i Is the number of path hops.
The application has advantages over existing methods in terms of: the application obtains the propagation delay by calculating the inter-satellite distance, sets the arrival curve and the service curve of the node and combines the satellite network method to obtain the end-to-end delay upper bound of the satellite network. By comparison, the upper bound of the end-to-end time delay of the satellite network obtained by the application is closer to an imitation value than that of the traditional method, and can provide support for network QoS control.
Drawings
FIG. 1 is a schematic diagram of inter-satellite link lengths;
FIG. 2 is an end-to-end network model diagram;
FIG. 3 is a diagram of an iridium star base topology;
FIG. 4 is a graph of end-to-end delay versus path node number;
FIG. 5 is a graph of end-to-end delay versus service rate;
FIG. 6 is a graph of end-to-end delay versus weight;
fig. 7 is a graph of end-to-end delay versus burst size.
Detailed Description
The application is described in further detail below with reference to the attached drawings and to specific embodiments: the application will be further described by way of examples.
Example 1
The embodiments of the present application are implemented based on the technical solutions of the present application, and detailed embodiments and specific operation procedures are given in the present application, but the scope of protection of the present application is not limited to the following embodiments.
The embodiment provides a satellite network end-to-end time delay upper bound acquisition method based on network algorithm, which comprises the following steps:
1. acquiring link delay;
in particular, since the inter-satellite link is an important component of the satellite network, it enables connection of all network nodes without relying on ground equipment, combining the satellites as a whole. Let R be the earth radius, h A ,h B The orbital heights of satellite a and satellite B,the longitude and latitude of the satellite lower points of the satellite A and the satellite B can be obtained by ephemeris; inter-satellite link length d BA Expressed as:
wherein the method comprises the steps of
Through inter-satellite linksLength and speed of light c, obtaining link delay D l The method comprises the following steps:
2. obtaining time delay among nodes by utilizing network calculation;
specifically, m-2 intermediate nodes exist between a node 1 and a node m in the satellite network, when a service flow A (t) arrives at the node, the service flow A (t) is limited by a token bucket with the node parameter of (r, b), namely, the service flow A (t) is constrained by an arrival curve alpha (t) =rt+b of the node, b is burst traffic, and r is the long-term average rate of data flow;
for the service flow A (t), each passing node provides a certain service capability for the service flow; therefore, for any network node, no matter what queue scheduling algorithm is adopted, the node can be assumed to provide a rate-delay service curve for the data stream as service guarantee for the data stream; thus, the service curve provided by the nodes in the path is as follows:
wherein C represents the service rate provided by the node, and T represents the service delay of the data packet at the node; the delay parameter may be considered as a packet processing delay, so the delay between network nodes is expressed as:
T＝L/C (2)
where L represents the maximum packet length.
3. And obtaining an end-to-end delay upper bound according to the link delay and the delay between nodes.
In particular, since in a satellite network there will be a plurality of traffic flows a i (t) arrive at one node at the same time. Assuming that the traffic flows are independent of each other and share the link bandwidth W, the traffic flows can be served correspondingly, and bandwidth allocation is performed according to the weights allocated to the traffic flows. If there are n traffic flows, assume traffic flow A i (t), i=1, 2, …, nWeight is omega i Then assign to traffic flow a i Service rate C of (t) i Is that
Using C in the above formula i The curve obtained by substituting C in the formula (1) is a certain traffic flow A i Business service profile of (t).
Assume a traffic flow a i (t) through node p, the arrival curve of the node is alpha, the service curve is beta, the delay D of the traffic flow through the node p Is that
Wherein W is t Peak rate for the link from the previous node to the current node; t (T) i Representing traffic flow A i (t) service delay at node p; b i For burst traffic of a certain node r i A long term average rate for a node;
from the joint solution of arrival curves and service curvesThen substituting the arrival curve alpha (t) and (1) - (3) into the formula to obtain the single-node time delay upper bound D p The method comprises the following steps:
the traditional single-node queuing delay upper bound isBecause we consider the average rate to be lower than the serving rate of the node, i.e. r i ≤C i . Therefore, the above is amplified to +.>Such excessively amplified queuing delay can cause a larger difference between the calculated delay boundary and the actual delay, and affect the performance of the QoS control algorithm based on network algorithm. The rate of the traffic stream reaches the peak rate W of the link bandwidth t Resulting in a rapid aggregation of a large amount of traffic at the node and a queuing of the large amount of traffic due to the limited processing power of the node, resulting in a maximum delay of this period, i.e. when W t t＝r i t+b i In this case, a +.>Time delay D p Reaching the maximum value, therefore:
in a satellite network, the end-to-end delay comprises a variable delay and a fixed delay, wherein the variable delay comprises queuing delay and link propagation delay of a system cache at a node; the fixed delay includes a transmission delay within the node, i.e., the time required for the node to enter data from the node to the transmitter when transmitting the data.
Assume a traffic flow a i (t) sequentially passing through m nodes, the arrival curves in the nodes being sequentially alpha i I=1, 2, …, m, the service curve of the system is β in turn i I=1, 2, …, m, the propagation delay between two adjacent nodes is in turnThe transmission delay of the intermediate node is as follows in sequence: />Then the end-to-end delay upper bound D 1→m The method comprises the following steps:
1) When m=1, the number of the m groups,by single-node delay upper bound D p Or (5) obtaining the end-to-end time delay upper bound D 1 The method comprises the steps of carrying out a first treatment on the surface of the When m=2, deducing the time delay of the 1 st node from the horizontal deviationAfter passing through node 1, the output flow is affected by the propagation delay of the link when passing through the link, so the arrival curve of the output flow when reaching node 2Reach it to curve alpha 2 Substituting the formula (t) and the formula (1) into a horizontal deviation deduction formula to solve the time delay of the node to obtain the time delay of the node is as follows:
the end-to-end delay between the 1 st and 2 nd nodes is:
2) When m=k-1, the end-to-end delay upper bound is:
3) When m=k, the arrival curve of the kth node isBy single-node delay upper bound D p The delay of the kth node is obtained as follows:
end-to-end delay D from node 1 to node k 1→k Time delay D equal to the first k-1 nodes 1→k-1 And the delay D of the kth node k The sum of, i.e
Wherein,is the sum of propagation delay on the link and transmission delay of the intermediate node; transmission delay D of intermediate node f For D f ＝sN i Wherein the constant s is the transmission delay of a node, N i Is the number of path hops.
In order to verify the effectiveness and feasibility of the satellite network end-to-end time delay upper bound acquisition method based on network algorithm, which is provided by the application, an iridium constellation is used as a network model, and a token bucket is adopted to be compared with the method provided by the application and the traditional time delay method respectively. The ISL (Inter Satellite Link) link bandwidth between satellites is 500Mb/s, the long-term average rate of data flow is 80Mb/s, the burst quantity of data flow is 200kbits, the service rate of the system is 100Mb/s, the transmission delay of two adjacent nodes is set to 0.2ms, the average size of the packet is 1000bits, and the simulation time is set to 1000s.
1. Relation between number of path nodes and end-to-end time delay
As can be seen from fig. 4, when the number of end-to-end nodes of the satellite network increases, both the theoretical delay and the simulation delay increase, and the end-to-end delay based on the token bucket is higher than the theoretical value of the method provided by the application. This is because: first, the application is based on the end-to-end time delay upper bound analysis method of the satellite network, considers the characteristics that the satellite network node changes along with time and the propagation time delay changes along with the time. Secondly, the time delay when the link is at the peak rate is used as the upper bound of the queuing time delay of the link, and the end-to-end time delay upper bound of the satellite network is calculated and obtained more accurately. In addition, as the number of nodes in the path increases, the time delay obtained by simulation is more and more similar to the theoretical time delay upper bound of the method provided by the application, and the result reflects that when the number of nodes on the link is more, the network algorithm can reflect the real network time delay performance.
2. Relationship between service rate and end-to-end delay
In fig. 5, the number of nodes in the end-to-end path is set to 7. As can be seen from the figure, when the service rate value is smaller, the delay difference between the simulation value and the theory is larger, because the link is overloaded, the network congestion is caused, the delay difference between the simulation value and the theory is larger, the network situation turns good along with the increase of the service rate, the delay difference between the simulation value and the theory is gradually reduced, and especially after the service rate reaches 400Mb/s, the delay difference between the simulation value and the theory is smaller, and is more similar to the theoretical value obtained by the method.
3. Relation between weight and end-to-end delay
When the number of nodes in the end-to-end path is 7, it can be seen from fig. 6 that both the theoretical delay and the simulation delay decrease with increasing traffic weight value, and the trend of such decrease becomes flatter and flatter. This is because as the traffic weight value increases, the service rate of the node increases, resulting in a decrease in latency with the increase in traffic weight value. But at weight values less than 0.5 the delay drops faster, whereas at weight values greater than 0.5 it tends to flatten out. This is because as the node services, the network tends to stabilize, so that the corresponding data flows are served correspondingly, resulting in a smooth delay. The network end-to-end delay simulation value is more and more similar to the upper bound of the delay theoretical value obtained by the method, so that the satellite network delay upper bound obtained based on network algorithm derivation is verified to better reflect the earth satellite network performance.
4. Relation between burst quantity and end-to-end time delay
When the number of nodes in the end-to-end path is 7, it can be seen from fig. 7 that as the burst size increases, the end-to-end simulation delay value increases. In the initial stage of simulation, the end-to-end simulation delay value increases too fast, and when a certain burst value is reached, the end-to-end delay tends to be gentle and approaches a theoretical value. This is because the network is unstable in the initial stage of the simulation, and the burst size is increasing at this time, resulting in a faster delay growth rate, and after the network is relatively stable, the delay growth is slow as the burst size increases, and there is load balancing capability between nodes.
By using different indexes to carry out simulation analysis, the satellite network end-to-end time delay upper bound acquisition method based on network algorithm provided by the application is closer to a simulation value than the traditional method, and can provide support for network QoS control.
While the application has been described with reference to the preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the application as defined by the appended claims.
Claims (5)
1. The satellite network end-to-end time delay upper bound acquisition method based on network algorithm is characterized by comprising the following steps:
acquiring link delay;
obtaining time delay among nodes by utilizing network calculation;
obtaining an end-to-end delay upper bound according to the link delay and the delay between nodes;
the link delay acquisition specifically includes: let R be the earth radius, h A ,h B The orbital heights of satellite a and satellite B,the longitude and latitude of the satellite point below the satellite A and the satellite B respectively; inter-satellite link length d BA Expressed as:
wherein the method comprises the steps of
Obtaining a chain through the inter-satellite link length and the light speed cRoad delay D l The method comprises the following steps:
the obtaining the time delay between the nodes by utilizing the network algorithm specifically comprises the following steps:
m-2 intermediate nodes exist between a node 1 and a node m in the satellite network, when a service flow A (t) arrives at the node, the service flow A (t) is limited by a token bucket with the node parameter of (r, b), namely, the service flow A (t) is constrained by an arrival curve alpha (t) =rt+b of the node, b is burst traffic, and r is the long-term average rate of a data flow;
for traffic flow a (t), the service curve provided by the nodes in the path is:
wherein C represents the service rate provided by the node, and T represents the service delay of the data packet at the node; the delay parameter is considered to be the packet processing delay, so the delay between network nodes is expressed as:
T＝L/C (2)
where L represents the maximum packet length.
2. The method for acquiring the end-to-end delay upper bound of a satellite network based on network algorithm as recited in claim 1, wherein if there are n traffic flows, it is assumed that traffic flow A i (t), i=1, 2, …, n is assigned a weight ω i Then assign to traffic flow a i Service rate C of (t) i Is that
Using C in the above formula i The curve obtained by substituting C in the formula (1) is a certain traffic flow A i Business service profile of (t).
3. The method for obtaining the end-to-end delay upper bound of a satellite network based on network algorithm as recited in claim 1, wherein a service flow a is assumed i (t) through node p, the arrival curve of the node is alpha, the service curve is beta, the delay D of the traffic flow through the node p Is that
Wherein W is t Peak rate for the link from the previous node to the current node; t (T) i Representing traffic flow A i (t) service delay at node p; b i For burst traffic of a certain node r i A long term average rate for a node;
from the joint solution of arrival curves and service curvesThen substituting the arrival curve alpha (t) and (1) - (3) into the formula to obtain the single-node time delay upper bound D p The method comprises the following steps:
the rate of the traffic stream reaches the peak rate W of the link bandwidth t Resulting in a rapid aggregation of a large amount of traffic at the node and a queuing of the large amount of traffic due to the limited processing power of the node, resulting in a maximum delay of this period, i.e. when W t t＝r i t+b i At the time, thereby obtainingTime delay D p Reaching the maximum value, therefore:
4. the method for obtaining the end-to-end delay upper bound of the satellite network based on the network algorithm according to claim 1, wherein in the satellite network, the end-to-end delay comprises a variable delay and a fixed delay, and the variable delay comprises queuing delay and link propagation delay cached by a system at a node; the fixed delay includes a transmission delay within the node, i.e., the time required for the node to enter data from the node to the transmitter when transmitting the data.
5. The method for obtaining the end-to-end delay upper bound of a satellite network based on network operations as recited in claim 4, wherein a traffic flow A is assumed i (t) sequentially passing through m nodes, the arrival curves in the nodes being sequentially alpha i I=1, 2, …, m, the service curve of the system is β in turn i I=1, 2, …, m, the propagation delay between two adjacent nodes is in turnThe transmission delay of the intermediate node is as follows in sequence: />Then the end-to-end delay upper bound D 1→m The method comprises the following steps:
1) When m=1, the single node delay upper bound D p Or (5) obtaining the end-to-end time delay upper bound D 1 The method comprises the steps of carrying out a first treatment on the surface of the When m=2, deducing the time delay of the 1 st node from the horizontal deviationAfter passing through node 1, the output flow is affected by the propagation delay of the link when passing through the link, so the arrival curve alpha of the output flow when reaching node 2 2 (t)＝r 2 (t+D l1 )+b 2 The method comprises the steps of carrying out a first treatment on the surface of the Reach it to curve alpha 2 Substituting the formula (t) and the formula (1) into a horizontal deviation deduction formula to solve the time delay of the node to obtain the time delay of the node is as follows:
the end-to-end delay between the 1 st and 2 nd nodes is:
2) When m=k-1, the end-to-end delay upper bound is:
3) When m=k, the arrival curve of the kth node isBy single-node delay upper bound D p The delay of the kth node is obtained as follows:
end-to-end delay D from node 1 to node k 1→k Time delay D equal to the first k-1 nodes 1→k-1 And the delay D of the kth node k The sum of, i.e
Wherein,is the sum of propagation delay on the link and transmission delay of the intermediate node; transmission delay D of intermediate node f For D f ＝sN i Wherein the constant s is the transmission delay of a node, N i Is the number of path hops.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011405235.0A CN112565014B (en) | 2020-12-04 | 2020-12-04 | Satellite network end-to-end time delay upper bound acquisition method based on network algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011405235.0A CN112565014B (en) | 2020-12-04 | 2020-12-04 | Satellite network end-to-end time delay upper bound acquisition method based on network algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112565014A CN112565014A (en) | 2021-03-26 |
| CN112565014B true CN112565014B (en) | 2023-11-07 |
Family
ID=75048579
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011405235.0A Active CN112565014B (en) | 2020-12-04 | 2020-12-04 | Satellite network end-to-end time delay upper bound acquisition method based on network algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112565014B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114884557B (en) * | 2022-03-25 | 2023-07-25 | 重庆邮电大学 | Satellite time sensitive network path selection method based on network algorithm |
| CN116566903B (en) * | 2023-07-05 | 2023-09-26 | 南京信息工程大学 | End-to-end time delay analysis method for converging flow of heterogeneous links of finger control network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2303000A1 (en) * | 2000-03-23 | 2001-09-23 | William M. Snelgrove | Establishing and managing communications over telecommunication networks |
| JP2007104677A (en) * | 2005-09-30 | 2007-04-19 | Fujitsu Ltd | Node delay prediction method and apparatus, and delay guarantee method and apparatus |
| CA2623315A1 (en) * | 2007-03-27 | 2008-06-10 | Verint Systems Ltd. | Communication link interception using link fingerprint analysis |
| CN106571883A (en) * | 2016-07-04 | 2017-04-19 | 长春理工大学 | Random network calculation method for satellite network performance evaluation |
| CN108337032A (en) * | 2018-01-12 | 2018-07-27 | 西安交通大学 | A method of the latency measurement deviation quantization in SDSN and latency prediction |
| CN110739991A (en) * | 2019-10-21 | 2020-01-31 | 大连大学 | QoS-based satellite network end-end communication reliability analysis method |
-
2020
- 2020-12-04 CN CN202011405235.0A patent/CN112565014B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2303000A1 (en) * | 2000-03-23 | 2001-09-23 | William M. Snelgrove | Establishing and managing communications over telecommunication networks |
| JP2007104677A (en) * | 2005-09-30 | 2007-04-19 | Fujitsu Ltd | Node delay prediction method and apparatus, and delay guarantee method and apparatus |
| CA2623315A1 (en) * | 2007-03-27 | 2008-06-10 | Verint Systems Ltd. | Communication link interception using link fingerprint analysis |
| CN106571883A (en) * | 2016-07-04 | 2017-04-19 | 长春理工大学 | Random network calculation method for satellite network performance evaluation |
| CN108337032A (en) * | 2018-01-12 | 2018-07-27 | 西安交通大学 | A method of the latency measurement deviation quantization in SDSN and latency prediction |
| CN110739991A (en) * | 2019-10-21 | 2020-01-31 | 大连大学 | QoS-based satellite network end-end communication reliability analysis method |
Non-Patent Citations (1)
| Title |
|---|
| 基于随机网络演算的无线传感器网络延时研究;胡博;王淖;易向阳;王高才;;计算机工程与设计(09);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112565014A (en) | 2021-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112565014B (en) | Satellite network end-to-end time delay upper bound acquisition method based on network algorithm | |
| CN107070794B (en) | Low-orbit information network optimal network benefit time delay constraint routing method | |
| US6609002B1 (en) | Method and apparatus for predictive QoS routing for broad band low earth satellite networks | |
| CN108337032B (en) | Method for delay measurement deviation quantification and delay prediction in SDSN (software development network) | |
| WO2000024164A1 (en) | Method and apparatus for network control | |
| CN105515880A (en) | Token bucket traffic shaping method suitable for fusion network | |
| CN111464225A (en) | Satellite routing load balancing algorithm based on source routing | |
| CN113259993A (en) | Cross-layer routing method and communication system based on MEO/LEO double-layer satellite network | |
| CN111162830A (en) | Satellite-ground data transmission routing method based on track forecast | |
| CN107171957B (en) | Self-adaptive DTN routing algorithm based on resource limited condition | |
| Liming et al. | A load balancing routing method based on real time traffic in LEO satellite constellation space networks | |
| CN107911843A (en) | A kind of node cut-in method of energy capture Sensor Network load balancing | |
| CN114640387B (en) | Improved laser-microwave mixed inter-satellite routing method | |
| Boriboon et al. | Optimized routing protocol for broadband hybrid satellite constellation communication IP network system | |
| CN114301845B (en) | Self-adaptive data center network transmission protocol selection method | |
| CN111835640B (en) | Shortest time delay routing method based on continuous time aggregation graph | |
| US20230247484A1 (en) | Adaptive load balancing in a satellite network | |
| Cello et al. | Coldsel: A selection algorithm to mitigate congestion situations over nanosatellite networks | |
| Wang et al. | End-to-end stochastic qos performance under multi-layered satellite network | |
| Urquizo Medina et al. | QoS routing for LEO satellite networks | |
| Wu et al. | Utility Maximization in Satellite Networks Using Onboard Caching | |
| KR20190020952A (en) | Effective bandwidth calculating device for assure the QoS of real-time voice in Geostationary Orbit Satellite and method of resource allocation thereof | |
| US20240073741A1 (en) | Traffic Shaping for Hybrid Satellite/Terrestrial Wide Area Networks | |
| CN103001741B (en) | Multi-path based deep space file seepage transmission method | |
| Ma | A Traffic Balancing Multicasting Algorithm for Low Earth Orbit Satellite Networks |
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 |