CN114884557A - Satellite time-sensitive network path selection method based on network calculation - Google Patents
Satellite time-sensitive network path selection method based on network calculation Download PDFInfo
- Publication number
- CN114884557A CN114884557A CN202210297890.1A CN202210297890A CN114884557A CN 114884557 A CN114884557 A CN 114884557A CN 202210297890 A CN202210297890 A CN 202210297890A CN 114884557 A CN114884557 A CN 114884557A
- Authority
- CN
- China
- Prior art keywords
- satellite
- time
- sensitive
- network
- scheduling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- 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/121—Shortest path evaluation by minimising delays
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention relates to the technical field of satellite time-sensitive network communication, in particular to a satellite time-sensitive network path selection method based on network calculation; the method comprises the steps that an intra-satellite wired and inter-satellite wireless multi-node joint scheduling in a satellite network is constructed into a serial-parallel queuing model; constructing a time-sensitive service flow arrival curve according to the periodically generated characteristics of the time-sensitive service flow in the satellite network; establishing a wired and wireless integrated scheduling service curve by combining an intra-satellite wired scheduling mechanism and an inter-satellite wireless scheduling mechanism; on the basis of a network calculation theory, an end-to-end delay boundary analysis model is constructed by combining a relative motion rule of satellites, and the end-to-end delay boundary performance between any two satellites in a satellite network is deduced; selecting an optimal transmission path meeting the time delay constraint according to the end-to-end time delay requirement set by the time sensitive service flow; the method realizes the selection of the time delay of the time-sensitive service stream transmission path according to the requirement in the satellite network and has wide application prospect.
Description
Technical Field
The invention relates to the technical field of satellite time-sensitive network communication, in particular to a satellite time-sensitive network path selection method based on network calculation.
Background
Time-sensitive services such as missile early warning, satellite measurement and control, operational response, remote instruction control, emergency communication and the like based on a satellite network provide very strict requirements for the certainty of end-to-end time delay of data transmission, and the services require that a data packet is delivered within bounded and lower time. For example, if the transmitted control command does not arrive within a predetermined time during the battle command, the enemy target cannot be hit precisely, and the battle mission fails. By certainty, it is meant that the end-to-end delay of each transmission of the time sensitive traffic is predictable and jitter is small, e.g., in microseconds. For the time-sensitive service, the end-to-end time delay is regarded as one of the most important performance indexes, and the effective analysis of the end-to-end time delay performance can provide a theoretical basis for selecting a transmission path meeting the time-sensitive service time delay requirement.
Network calculus theory is widely used for network performance calculation and analysis, and mainly calculates delay and traffic backlog boundaries through minimum and theoretical calculations. The research of the existing network calculus theory in the satellite network focuses on inter-satellite link delay analysis and random delay upper bound analysis of a data relay satellite network, and the methods assume that service flow obeys Poisson distribution. However, in the more extensive satellite time-sensitive networks in the future, these analysis methods are obviously not suitable for time-sensitive service performance analysis. Regarding Time-Sensitive service delay performance analysis, network calculus is also introduced for Time-Sensitive network (TSN) related research in the prior art to perform delay performance analysis. In the prior art, time delay upper bound analysis is mainly performed from the aspects of service flow characteristics, a switch node scheduling mechanism and the like, end-to-end time delay analysis of a ground wired network is mainly concerned, and a multi-hop wireless network is not involved.
Although the existing network operation theory research provides an effective solution for end-to-end delay analysis, the existing network operation research in the TSN network focuses on the influence of different scheduling mechanisms of the ground wired network on end-to-end delay, and is not related to the end-to-end delay analysis of the time sensitive service in the multi-hop wireless link. In a satellite network, not only the node scheduling mechanism will affect the end-to-end delay, but also the inter-satellite link time-varying characteristic and the multi-node resource joint scheduling will affect the end-to-end delay analysis.
In summary, the existing network operation analysis method cannot solve the problem of end-to-end delay analysis of the time-sensitive service in the satellite time-sensitive network, so that a transmission path meeting the delay requirement cannot be selected for the time-sensitive service flow.
Disclosure of Invention
In view of the problems in the prior art, the invention constructs a satellite network end-to-end time delay analysis model facing time-sensitive services, and provides a satellite time-sensitive network path selection method based on network calculation; the method comprises the steps that according to the connection condition between satellite nodes, an intra-satellite wired and inter-satellite wireless multi-node combined scheduling process in a satellite network is constructed into a serial-parallel queuing model; constructing a time-sensitive service flow arrival curve model according to the periodic generation characteristic of the time-sensitive service flow in the satellite network; establishing a wired and wireless fusion scheduling service curve model based on the serial-parallel queuing model and combining an intra-satellite wired scheduling mechanism and an inter-satellite wireless scheduling mechanism; based on a network calculation theory, simultaneously combining a satellite relative motion rule, constructing an end-to-end delay boundary analysis model according to a time-sensitive service flow arrival curve model and a wired and wireless fusion scheduling service curve model, and obtaining the end-to-end delay boundary performance between any two satellites in a satellite network; and selecting an optimal transmission path meeting the delay constraint by combining an end-to-end delay boundary analysis model according to the end-to-end delay requirement set by the time-sensitive service flow.
According to the satellite time-sensitive network path selection method based on network calculation, firstly, intra-satellite wired and inter-satellite wireless multi-node joint scheduling is constructed into a serial-parallel queuing model according to the connection condition between satellite network nodes, then a time-sensitive service flow arrival curve and a fusion scheduling service curve are deduced according to time-sensitive service arrival characteristics and a wired and wireless fusion scheduling mechanism, secondly, end-to-end time delay between any two satellites is obtained through calculation based on a network calculation theory and an inter-satellite distance, and finally, an optimal transmission path meeting time delay constraint is selected from reachable paths according to the end-to-end time delay requirement of the time-sensitive service, so that the network resource utilization rate is improved while the end-to-end time delay requirement of the time-sensitive service flow is met.
The invention has the following advantages and beneficial effects:
the satellite time-sensitive network path selection method based on network calculation is not limited to end-to-end time delay analysis any more, but further expands the application of network calculation in a satellite network, and can provide a new solution for path selection of time-sensitive services; the invention comprehensively considers the relevant parameter information of the time-sensitive service flow characteristic in the satellite network, the internal and external scheduling mechanisms of the satellite nodes, the relative motion rule of the satellite and the like which influence the end-to-end time delay, and calculates the time delay between any two nodes in the network on the basis of the network calculation as a theoretical basis, thereby quickly selecting a transmission path meeting the time delay constraint under the condition of knowing the requirements of the source node, the target node and the end-to-end time delay, simultaneously improving the utilization rate of network resources and having wide application prospect.
Drawings
FIG. 1 is a diagram illustrating a routing scenario for a satellite time-sensitive network with wireless and wired convergence, according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for selecting a satellite time-sensitive network path based on network calculus as employed in the present invention;
FIG. 3 illustrates a wired and wireless converged scheduling network model used in an embodiment of the present invention;
fig. 4 is a diagram illustrating the maximum latency at the start of a source satellite node backlog period in accordance with 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.
Fig. 1 is a diagram of a routing scenario of a satellite time-sensitive network with wired and wireless convergence, which is adopted in the embodiment of the present invention. In order to provide end-to-end delay certainty guarantee service for time-sensitive services in a satellite network, an IEEE 802.1Qbv scheduling mechanism is adopted in a satellite node, and a Time Division Multiple Access (TDMA) scheduling mechanism is adopted in an inter-satellite wireless link. As can be seen from fig. 1, under the condition of a given source node and a given destination node, a time-sensitive service stream can be transmitted through several different paths, and then it is a problem to be mainly solved by the present invention that an end-to-end delay requirement of the time-sensitive service can be satisfied only by selecting which path to transmit.
On the premise of the above-mentioned wired and wireless converged satellite time-sensitive network, fig. 2 shows a flow chart of a method for selecting a satellite time-sensitive network path based on network calculation in the embodiment of the present invention, as shown in fig. 2, the method includes the following steps:
101. according to the connection condition between satellite nodes, constructing an intra-satellite wired and inter-satellite wireless multi-node combined scheduling process in a satellite network into a serial-parallel queuing model;
in the embodiment of the invention, intra-satellite wired and inter-satellite wireless multi-node joint scheduling can be constructed into a serial-parallel queuing model according to the connection condition between satellite nodes, and the model is specifically represented as a wired and wireless converged scheduling network model shown in fig. 3. The memory and transmitter inside the satellite node can be modeled as a queue and server, respectively, and the wireless scheduling of inter-satellite links can be equivalent to a wireless server. From the flow direction of the traffic flow, the traffic flow arriving in the satellite network can be divided into two types, a through flow and a cross flow. The through flow refers to a time-sensitive traffic flow transmitted from a source satellite to a destination satellite, the cross flow refers to an aggregate flow from other satellite nodes except the through flow in a current satellite node, and the aggregate flow has two states of arrival and departure at the satellite node.
The satellite network topology may be represented by a directed graph G (V, E), where a set of nodes V is represented by a series of satellite segmentsThe point is formed, and the edge set E is formed by a series of inter-satellite wireless links supporting full-duplex communication. Wireless link edge set in satellite network due to certain association relation between nodes and edges
And through a plurality of paired satellite nodes (v) m ,v n ) Determining, i.e. E ≡ (v) m ,v n )|v m ,v n E.g. V, m is not equal to n, and inter-satellite wireless link edge e m,n ＝(v m ,v n )。
Let A (t) represent [0, t]The cumulative arrival process of time sensitive traffic flow in the time period. For intermediate satellite node V m ，Aagg m (t) represents the arrival process of the converged stream converged to the satellite node by other satellite nodes except the through stream, S m (t) and SW m (t) indicates intra-satellite wired and inter-satellite wireless links at [0, t, respectively]Service procedures in time slots, D m (t) shows the departure procedure of the time-sensitive traffic stream after internal cable scheduling in the satellite, A m+1 (t) denotes the next hop satellite node V m+1 Is reached. Due to time-sensitive traffic flow at the current node V m The leaving process of the current satellite node can not be directly used as the input process of the next-hop satellite node, namely D m (t)≠A m+1 (t)。
102. Constructing a time-sensitive service flow arrival curve model according to the periodic generation characteristic of the time-sensitive service flow in the satellite network;
in order to accurately describe the service flow arrival model, an arrival curve conforming to the actual service characteristics needs to be established according to the arrival characteristics of the time-sensitive service flow. Time-sensitive traffic in a satellite network usually shows a switching characteristic, and the traditional poisson-based distribution model cannot accurately describe the arrival characteristic of the traffic. According to the characteristic that the time-sensitive service flow in the satellite network generates periodically, namely a single time-sensitive flow generates data packets periodically at a certain time interval, the time-sensitive service flow f is constructed i Arrival curve alpha at time t i (t) is:
wherein the content of the first and second substances,
denotes rounding up, p i Representing a fixed time interval of time-sensitive stream generation, B i Representing the fixed frame length generated by the time-sensitive stream during a cycle.
It can be understood that the time-sensitive traffic flow arrival curve model of this embodiment may be implemented based on a serial-parallel queuing model, or may be implemented according to an existing queuing model, which is not specifically limited in the present invention.
103. Establishing a wired and wireless fusion scheduling service curve model based on the serial-parallel queuing model and combining an intra-satellite wired scheduling mechanism and an inter-satellite wireless scheduling mechanism;
in the embodiment of the invention, different scheduling mechanisms are adopted in the intra-satellite and the inter-satellite, wherein an IEEE 802.1Qbv scheduling mechanism is adopted in the satellite node. When the service flows reach the input ports of the satellite nodes, the satellite nodes distribute the service flows to corresponding output ports through the processing of the internal switching structures of the nodes according to the pre-configured routing paths and the corresponding forwarding ports. The output port puts the arriving service in different queues to wait for being scheduled according to the priority mark carried in the data packet, and the time-sensitive service has the highest priority attribute.
The intra-satellite cable scheduling service curve is mainly influenced by input streams from other satellite nodes and the length of a cable service window of the node, and is based on the maximum waiting time W at the beginning of a traffic backlog period at the satellite node and the minimum service length omega of the cable time slot scheduling window min Establishing an intra-satellite time-sensitive service curve based on IEEE 802.1Qbv scheduling:
wherein, beta T,w (t) represents a classic TDMA service curve; t is Qbv Cycles are performed for the gated list in the IEEE 802.1Qbv scheduling mechanism.
The maximum wait time W at the beginning of the traffic backlog period is defined as the maximum time a data frame needs to wait at the beginning of the backlog period. For a source satellite node, the data stream arriving at that node is randomly generated, independent of the scheduled time slots and periods from the previous hop satellite node. Therefore, the maximum waiting time at the beginning of the backlog period is related to the arrival time of the data frame and the scheduling period of the node. As shown in fig. 4, at the beginning of the backlog period, if the maximum frame arrives at time t and the remaining service time in the current timeslot is slightly less than the transmission time required by the maximum frame, the transmission needs to be postponed until the next cycle, so that the maximum waiting time W is generated. The maximum latency at the start of the source satellite node backlog period is expressed as follows:
wherein the content of the first and second substances,
is the maximum frame length T at the output port of the source satellite node SS SS And w SS Respectively representing the window scheduling period and the time slot length of an output port of a source satellite node, wherein R is the transmission rate of a wired link in a satellite.
For a relay satellite node, the scheduling of the node is constrained by the time of transmission from the previous hop of the node, so the time when the backlog period starts cannot be any time, but is constrained by the arrival of the previous hop of the satellite node. The maximum waiting time at the beginning of the backlog period of the relay satellite node is as follows:
wherein, t * Representing the earliest possible start time of the backlog, from the earliest time of arrival t of data at the node E Determination of t O Indicating the door open time of the output port service window of the relay satellite node.
Minimum service length omega of wired time slot scheduling window min Depending on the maximum frame length and the minimum frame length through the port. Minimum service length omega min Is represented as follows:
ω min ＝max{w P -l max /R,l min /R}
wherein l max And l min Respectively representing a maximum frame length and a minimum frame length, omega P The window length is scheduled for the time slot.
The inter-satellite wireless TDMA scheduling mechanism provides periodic on-off service for time sensitive traffic, and thus, the service curve can be expressed as:
wherein, C is the transmission rate of the wireless link, T is the TDMA dispatching cycle, and omega is the service window length of the wireless dispatching;
the series equivalence theorem: let the data flow A (t) flow through H serially connected network nodes in turn to obtain service, if these serially connected nodes are A (t), the service curve provided by A (t) is beta in turn 1 (t),β 2 (t),…,β H (t), the service curve β (t) provided by the whole series system for A (t) satisfies:
combining the correlation between the wired and wireless scheduling mechanisms of the satellite nodes and the series equivalent theorem, the wired and wireless fusion scheduling service curve beta of the satellite nodes cov (t) can be expressed as:
further, combining an intra-satellite wired IEEE 802.1Qbv scheduling mechanism with inter-satellite wirelessA TDMA scheduling mechanism establishes a wired and wireless fusion scheduling service curve of a satellite node; combining the interrelation between the satellite node intra-satellite wired scheduling mechanism and the inter-satellite wireless scheduling mechanism, and obtaining the service curves beta of the N parallel nodes according to the parallel relation between the network nodes P (t) is expressed as:
β P (t)＝β cov1 (t)+β cov2 (t)+...+β covN (t)
wherein, beta covn (t) represents the service curve for the nth parallel node, N ∈ [1, 2.. N]。
The invention can effectively carry out joint description and characterization on the connection relation between the network nodes and the satellite node scheduling mechanism through the serial-parallel queuing model.
104. Based on a network calculation theory, simultaneously combining a satellite relative motion rule, constructing an end-to-end delay boundary analysis model according to a time-sensitive service flow arrival curve model and a wired and wireless fusion scheduling service curve model, and obtaining the end-to-end delay boundary performance between any two satellites in a satellite network;
in a satellite network, a plurality of reachable paths exist between any two satellites, and the end-to-end time delay on any reachable path is calculated through a network calculus theory so as to provide a theoretical basis for path selection. When the time-sensitive service flow is transmitted in a satellite network, the time-sensitive service flow can reach a destination end only through a multi-hop wireless link, and the end-to-end time delay is influenced by factors such as the characteristics of the satellite wireless link, a node scheduling mechanism, the time slot allocation of the wireless link, the transmission rate and the like. Delay (t) of time-sensitive service after service of M wired and wireless converged satellite nodes meets
Delay(t)≤H(α,β)＝sup t≥0 {inf{d≥0:α(t)≤β 1M (t+d)}}
Time sensitive traffic flow a 1 (t) service curve beta obtained by sequentially passing through M wired and wireless fusion satellite nodes connected in series 1M Satisfies the following conditions:
when multi-satellite node joint resource allocation is carried out, time-sensitive data flow is set to reach a destination terminal through M satellites m Representing the mth transmission link that passes through the streaming path, and the total number of hops from the source end to the destination end is M-1, i.e. M-1 radio transmission links are experienced in total. The end-to-end delay calculation formula is as follows:
wherein, the first and the second end of the pipe are connected with each other,
representing the transmission delay of the cable link, by a single satellite node S i Transmission rate of
And the amount B of time sensitive data flow. D Queu_total Representing the total queuing delay resulting from the joint allocation of multi-node resources.
105. And selecting an optimal transmission path meeting the delay constraint by combining an end-to-end delay boundary analysis model according to the end-to-end delay requirement set by the time-sensitive service flow.
In the embodiment of the invention, under the condition of giving the time-sensitive service flow source node and the destination node, the time delay between any reachable paths is calculated according to an end-to-end time delay calculation method based on network calculation. Suppose a time sensitive traffic flow f i The end-to-end delay requirement of
The source satellite node is
The destination satellite node is
The reachable path set of the time-sensitive service flow is
G denotes the maximum reachable path number. According to the end-to-end delay calculation formula, all reachable paths can be obtained from the end-to-end delay set
Due to the influence of time-sensitive service delay requirements and link load conditions, not every link can meet the transmission requirements of the time-sensitive service. Therefore, it is desirable to combine end-to-end delay and link load conditions from the reachable path set G i The best transmission path satisfying the time delay constraint is selected. The reachable path link load set calculated according to the traffic volume carried by the existing link in the network is represented as follows:
obtaining the time-sensitive service flow reachable path end-to-end time delay set
And set of link loads L i The best path selection is performed in the case of (1).
If it is not
G is more than or equal to 1 and less than or equal to G, and the G is placed in the candidate path set CS; then, links which do not exist in the candidate paths are removed from the link load set by combining the candidate path set, and a candidate path set based on the link load is obtained; the candidate paths are ranked according to the link load from low to high, and the link with the lowest load is selected as the optimal transmission path
The time-sensitive service transmission path selected based on network calculation in the embodiment of the invention not only can meet the end-to-end time delay requirement of the time-sensitive service flow, but also can avoid network congestion and improve the utilization rate of network resources.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (9)
1. A satellite time-sensitive network path selection method based on network calculation is characterized by comprising the steps of constructing an intra-satellite wired and inter-satellite wireless multi-node joint scheduling process in a satellite network into a serial-parallel queuing model according to the connection condition between satellite nodes; constructing a time-sensitive service flow arrival curve model according to the periodic generation characteristic of the time-sensitive service flow in the satellite network; establishing a wired and wireless fusion scheduling service curve model based on the serial-parallel queuing model and combining an intra-satellite wired scheduling mechanism and an inter-satellite wireless scheduling mechanism; based on a network calculation theory, simultaneously combining a satellite relative motion rule, constructing an end-to-end delay boundary analysis model according to a time-sensitive service flow arrival curve model and a wired and wireless fusion scheduling service curve model, and obtaining the end-to-end delay boundary performance between any two satellites in a satellite network; and selecting an optimal transmission path meeting the time delay constraint by combining an end-to-end time delay boundary analysis model according to the end-to-end time delay requirement set by the time-sensitive service flow.
2. The method of claim 1, wherein the process of constructing the series-parallel queuing model comprises equivalently modeling a memory and a transmitter inside a satellite node as a queue and a server, respectively, and equivalently modeling wireless scheduling of inter-satellite links between the satellite nodes as a wireless server; a multi-node joint scheduling mechanism of the satellite network is constructed into a serial-parallel queuing model according to service flow directions in the satellite network, including through flow and cross flow, combined with an intra-satellite wired scheduling mechanism and an inter-satellite wireless scheduling mechanism.
3. The method of claim 1, wherein the process of constructing the time-sensitive traffic flow arrival curve model comprises constructing the time-sensitive traffic flow f according to a periodically generated characteristic of the time-sensitive traffic flow in the satellite network, that is, a single time-sensitive flow periodically generates data packets at certain time intervals i Arrival curve alpha at time t i (t) is:
wherein the content of the first and second substances,
denotes rounding up, p i Representing a fixed time interval of time-sensitive stream generation, B i Representing the fixed frame length generated by the time-sensitive stream during a cycle.
4. The method according to claim 1, wherein the process of constructing the wired and wireless converged scheduling service curve model comprises establishing a wired and wireless converged scheduling service curve of a satellite node in combination with an intra-satellite wired IEEE 802.1Qbv scheduling mechanism and an inter-satellite wireless TDMA scheduling mechanism; combining the interrelation between the satellite node intra-satellite wired scheduling mechanism and the inter-satellite wireless scheduling mechanism and the series equivalent theorem, the satellite node wired and wireless fusion scheduling service curve beta cov (t) is expressed as:
wherein, beta Qbv (t) represents the time-sensitive traffic service curve of the in-satellite wired IEEE 802.1Qbv scheduling mechanism; beta is a TDMA And (t) represents a time-sensitive traffic service curve of an inter-satellite wireless TDMA scheduling mechanism.
5. The method for selecting a satellite time-sensitive network path based on network calculus as claimed in claim 1, wherein the process of constructing the wired and wireless converged scheduling service curve model further comprises establishing a wired and wireless converged scheduling service curve of a satellite node in combination with an intra-satellite wired IEEE 802.1Qbv scheduling mechanism and an inter-satellite wireless TDMA scheduling mechanism; combining the interrelation between the satellite node intra-satellite wired scheduling mechanism and the inter-satellite wireless scheduling mechanism, and obtaining the service curves beta of the N parallel nodes according to the parallel relation between the network nodes P (t) is expressed as:
β P (t)＝β cov1 (t)+β cov2 (t)+...+β covN (t)
wherein, beta covn (t) represents the service curve for the nth parallel node, N ∈ [1, 2.. N]。
6. The method of claim 4 or 5, wherein the time-sensitive service curve of the IEEE 802.1Qbv scheduling mechanism is influenced by the input stream from other satellite nodes and the length of the cable service window of the node, and is based on the maximum waiting time W at the start of the traffic backlog at the satellite node and the minimum service length ω of the cable time slot scheduling window min Establishing an intra-satellite time-sensitive service curve based on IEEE 802.1Qbv scheduling:
wherein, beta T,w (t) represents a classic TDMA service curve; t is Qbv Cycles are performed for the gated list in the IEEE 802.1Qbv scheduling mechanism.
7. The method according to claim 4 or 5, wherein the time-sensitive traffic service curve of the inter-satellite wireless TDMA scheduling mechanism comprises the inter-satellite wireless TDMA scheduling mechanism providing periodic on-off service for the time-sensitive traffic, whereby the service curve is expressed as:
wherein, C is the transmission rate of the wireless link, T is the TDMA scheduling period, and ω is the service window length of the wireless scheduling.
8. The method according to claim 1, wherein the process of constructing the end-to-end delay boundary analysis model includes calculating the sum of processing, queuing and transmission delay experienced by the time-sensitive traffic on any section of transmission path based on a network calculus theory, calculating inter-satellite propagation delay according to a satellite relative motion rule, and obtaining the end-to-end delay boundary performance between any two satellites by combining a delay calculation formula and network topology information.
9. The method according to claim 1 or 8, wherein the selecting the optimal transmission path satisfying the delay constraint in combination with the end-to-end delay boundary analysis model comprises selecting the optimal transmission path satisfying the delay constraint from reachable paths according to the end-to-end delay boundary and link load conditions under the condition of the source node and the destination node of the time sensitive service stream and the end-to-end delay requirement, so that the end-to-end delay requirement of the time sensitive service stream can be satisfied, and the network resource utilization rate can be improved.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210297890.1A CN114884557B (en) | 2022-03-25 | 2022-03-25 | Satellite time sensitive network path selection method based on network algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210297890.1A CN114884557B (en) | 2022-03-25 | 2022-03-25 | Satellite time sensitive network path selection method based on network algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114884557A true CN114884557A (en) | 2022-08-09 |
| CN114884557B CN114884557B (en) | 2023-07-25 |
Family
ID=82666681
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210297890.1A Active CN114884557B (en) | 2022-03-25 | 2022-03-25 | Satellite time sensitive network path selection method based on network algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114884557B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
| CN116566903A (en) * | 2023-07-05 | 2023-08-08 | 南京信息工程大学 | End-to-end time delay analysis method for converging flow of heterogeneous links of finger control network |
| CN117674961A (en) * | 2023-11-20 | 2024-03-08 | 航天恒星科技有限公司 | Low orbit satellite network time delay prediction method based on space-time feature learning |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140111355A1 (en) * | 2012-03-18 | 2014-04-24 | Manish Dinkarrao Kulkarni | Mobile Location and Time Sensitive Messaging Platform |
| CN104065576A (en) * | 2014-07-07 | 2014-09-24 | 武汉大学 | Label switching method in dynamic MPLS satellite network |
| CN105009648A (en) * | 2013-03-13 | 2015-10-28 | 高通股份有限公司 | Using motion to improve local wireless network connectivity |
| CN105228209A (en) * | 2015-08-24 | 2016-01-06 | 哈尔滨工业大学 | A kind of distributed GEO/LEO hybrid network method for routing based on dummy node |
| CN106571883A (en) * | 2016-07-04 | 2017-04-19 | 长春理工大学 | Random network calculation method for satellite network performance evaluation |
| CN106792970A (en) * | 2017-02-17 | 2017-05-31 | 重庆邮电大学 | A kind of vehicle self-organizing network route selection method |
| US20190191130A1 (en) * | 2017-12-14 | 2019-06-20 | Sichuan University | Kind of partially reliable transmission method based on hidden markov model |
| US20200349488A1 (en) * | 2013-10-24 | 2020-11-05 | Planet Labs, Inc. | Satellite Scheduling System |
| US20210092640A1 (en) * | 2019-09-23 | 2021-03-25 | Hughes Network Systems, Llc | Next generation global satellite system with mega-constellations |
| CN112565014A (en) * | 2020-12-04 | 2021-03-26 | 大连大学 | Satellite network end-to-end delay upper bound acquisition method based on network calculus |
| CN112733303A (en) * | 2019-10-11 | 2021-04-30 | 中国科学院沈阳自动化研究所 | Multi-strategy industrial TSN shaper modeling method based on deterministic network calculation |
| CN112866028A (en) * | 2021-01-20 | 2021-05-28 | 重庆邮电大学 | Time slot allocation method for satellite time-sensitive network with wired and wireless integration |
| CN112887226A (en) * | 2021-01-26 | 2021-06-01 | 重庆邮电大学 | Method for managing and scheduling satellite time-sensitive network queue with wired and wireless integration |
| CN113098713A (en) * | 2021-03-29 | 2021-07-09 | 大连大学 | End-to-end reliability assessment method for spatial information network |
| CN113615239A (en) * | 2019-02-13 | 2021-11-05 | 瑞典爱立信有限公司 | Wireless time sensitive networking |
| CN113783756A (en) * | 2020-09-29 | 2021-12-10 | 北京航空航天大学 | Network performance evaluation method of traffic queuing based on CBS shaping mechanism |
-
2022
- 2022-03-25 CN CN202210297890.1A patent/CN114884557B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140111355A1 (en) * | 2012-03-18 | 2014-04-24 | Manish Dinkarrao Kulkarni | Mobile Location and Time Sensitive Messaging Platform |
| CN105009648A (en) * | 2013-03-13 | 2015-10-28 | 高通股份有限公司 | Using motion to improve local wireless network connectivity |
| US20200349488A1 (en) * | 2013-10-24 | 2020-11-05 | Planet Labs, Inc. | Satellite Scheduling System |
| CN104065576A (en) * | 2014-07-07 | 2014-09-24 | 武汉大学 | Label switching method in dynamic MPLS satellite network |
| CN105228209A (en) * | 2015-08-24 | 2016-01-06 | 哈尔滨工业大学 | A kind of distributed GEO/LEO hybrid network method for routing based on dummy node |
| CN106571883A (en) * | 2016-07-04 | 2017-04-19 | 长春理工大学 | Random network calculation method for satellite network performance evaluation |
| CN106792970A (en) * | 2017-02-17 | 2017-05-31 | 重庆邮电大学 | A kind of vehicle self-organizing network route selection method |
| US20190191130A1 (en) * | 2017-12-14 | 2019-06-20 | Sichuan University | Kind of partially reliable transmission method based on hidden markov model |
| CN113615239A (en) * | 2019-02-13 | 2021-11-05 | 瑞典爱立信有限公司 | Wireless time sensitive networking |
| US20210092640A1 (en) * | 2019-09-23 | 2021-03-25 | Hughes Network Systems, Llc | Next generation global satellite system with mega-constellations |
| CN112733303A (en) * | 2019-10-11 | 2021-04-30 | 中国科学院沈阳自动化研究所 | Multi-strategy industrial TSN shaper modeling method based on deterministic network calculation |
| CN113783756A (en) * | 2020-09-29 | 2021-12-10 | 北京航空航天大学 | Network performance evaluation method of traffic queuing based on CBS shaping mechanism |
| CN112565014A (en) * | 2020-12-04 | 2021-03-26 | 大连大学 | Satellite network end-to-end delay upper bound acquisition method based on network calculus |
| CN112866028A (en) * | 2021-01-20 | 2021-05-28 | 重庆邮电大学 | Time slot allocation method for satellite time-sensitive network with wired and wireless integration |
| CN112887226A (en) * | 2021-01-26 | 2021-06-01 | 重庆邮电大学 | Method for managing and scheduling satellite time-sensitive network queue with wired and wireless integration |
| CN113098713A (en) * | 2021-03-29 | 2021-07-09 | 大连大学 | End-to-end reliability assessment method for spatial information network |
Non-Patent Citations (5)
| Title |
|---|
| MAN OUYANG: "Multi-path Transmission Scheme Based on Segment Control in Low-Earth-Orbit Satellite Network", 《2021 IEEE 22ND INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING(HPSR)》 * |
| YU ZHU: "Double-layer Satellite Communication Network Routing Algorithm Based on priority and failure probability", 《2019 15TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC)》 * |
| 徐川: "有线无线融合的卫星时间敏感网络流调度研究", 《电子与信息学报》, vol. 44, no. 3, pages 1014 - 1023 * |
| 王娟: "面向LEO／GEO卫星网络的多路径多业务路由策略", 《南京邮电大学学报(自然科学版)》, vol. 37, no. 6, pages 36 - 43 * |
| 王敏: "基于随机网络演算的空间网络性能分析", 《中国优秀硕士学位论文全文数据库-信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
| CN116566903A (en) * | 2023-07-05 | 2023-08-08 | 南京信息工程大学 | End-to-end time delay analysis method for converging flow of heterogeneous links of finger control network |
| 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 |
| CN117674961A (en) * | 2023-11-20 | 2024-03-08 | 航天恒星科技有限公司 | Low orbit satellite network time delay prediction method based on space-time feature learning |
| CN117674961B (en) * | 2023-11-20 | 2024-05-28 | 航天恒星科技有限公司 | Low orbit satellite network time delay prediction method based on space-time feature learning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114884557B (en) | 2023-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114884557A (en) | Satellite time-sensitive network path selection method based on network calculation | |
| Cicconetti et al. | Bandwidth balancing in multi-channel IEEE 802.16 wireless mesh networks | |
| CN107294852B (en) | Network routing method using topology dispersed short path set | |
| US20220150159A1 (en) | Control device, switch device and methods | |
| CN110048949B (en) | Communication method based on TTE network capacity estimation | |
| Goyal et al. | A scheduling and call admission control algorithm for WiMax mesh network with strict QoS guarantee | |
| Chilwan et al. | Modeling and delay analysis for SDN-based 5G edge clouds | |
| USH2103H1 (en) | Packet scheduling based on message length | |
| CN102202344B (en) | Cross-layer congestion control method based on game theory in wireless Mesh network | |
| Leung et al. | A resequencing model for high-speed packet-switching networks | |
| CN113438156B (en) | Time deterministic multi-path routing method based on time expansion diagram | |
| Cappanera et al. | Link scheduling with end-to-end delay constraints in wireless mesh networks | |
| KR100369562B1 (en) | Emulated weighted fair queueing algorithm for high-speed integrated service networks and the scheduler therefor | |
| He et al. | A feedback control scheme for resource allocation in wireless multi-hop ad hoc networks | |
| Baranda et al. | BP-MR: Backpressure Routing for the Heterogeneous Multi-radio Backhaul of Small Cells | |
| Nsoh et al. | Routing and link scheduling with QoS in IEEE 802.16 mesh networks | |
| Rao et al. | Scheduling and routing of real-time multimedia traffic in packet-switched networks | |
| Heinz et al. | Shortest Path Awareness in Delay-Based Routing | |
| Liu et al. | An Improved Contact Graph Routing Algorithm Based on Delay Constraints | |
| Shi et al. | Design of Buffer Queue in Low-Orbit Satellite Network Based on Average Route Hops | |
| Lee et al. | Delay tolerant mobility aware routing/mobility dissemination protocol for the airborne network | |
| Kurth et al. | Delay properties of opportunistic back-pressure routing in CSMA-based wireless mesh networks | |
| Sharma et al. | Providing QoS to real and data applications in WiMAX mesh networks | |
| Wei et al. | Design of 802.16 WIMAX Based Radio Access Network | |
| Zhou et al. | Flow control and scheduling for shared FIFO queues over wireless 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 |