CN110691039A - Satellite-borne multichannel multi-terminal self-adaptive scheduling method and system - Google Patents
Satellite-borne multichannel multi-terminal self-adaptive scheduling method and system Download PDFInfo
- Publication number
- CN110691039A CN110691039A CN201910971213.1A CN201910971213A CN110691039A CN 110691039 A CN110691039 A CN 110691039A CN 201910971213 A CN201910971213 A CN 201910971213A CN 110691039 A CN110691039 A CN 110691039A
- Authority
- CN
- China
- Prior art keywords
- terminal
- data
- routing table
- priority
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000009432 framing Methods 0.000 claims abstract description 27
- 238000012545 processing Methods 0.000 claims description 39
- 230000003044 adaptive effect Effects 0.000 claims description 16
- 230000008569 process Effects 0.000 claims description 12
- 230000003068 static effect Effects 0.000 claims description 8
- 238000007781 pre-processing Methods 0.000 claims description 6
- 238000013461 design Methods 0.000 abstract description 6
- 230000006870 function Effects 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- 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/18521—Systems of inter linked satellites, i.e. inter satellite service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
- H04L1/0007—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
-
- 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/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
Abstract
The invention provides a satellite-borne multi-channel multi-terminal self-adaptive scheduling method and a satellite-borne multi-channel multi-terminal self-adaptive scheduling system, which comprises a two-dimensional routing table generated in a self-adaptive mode; refreshing the cache data volume information of each load link in real time according to a priority algorithm, and determining the priority order of each load link for receiving scheduling according to the cache data volume; polling and scheduling output data in each cache according to the priority order according to the received effective data enable and the two-dimensional routing table; calculating the framing length by combining the load rate processed by the terminal; verifying whether the total rate of the received scheduling data meets the requirement of a scheduling algorithm, if not, sending an error mark, and automatically updating a two-dimensional routing table; and performing self-adaptive framing on the output data in the cache and transmitting the framed data to a demand terminal by combining a two-dimensional routing table. The invention realizes the free scheduling of multiple channels and multiple terminals, reduces the average waiting time of the terminals, improves the fairness of each load link service and can realize the design of 100 percent throughput rate.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a satellite-borne multichannel multi-terminal self-adaptive scheduling method and system.
Background
With the increasing load data and transmission scale of satellites, higher and higher requirements are put forward on the storage capacity, storage rate and real-time rapid processing and positioning of information of the satellite-borne memory. How to flexibly and quickly store and intelligently retrieve multi-channel large-capacity load data makes the satellite transmit the most valuable information under the limit of limited bandwidth particularly important.
The new generation scheduling system not only needs larger capacity and more ports, but also puts higher requirements on performances such as delay, throughput rate and fairness of switching: 1) there is a need to be able to process (receive, cache, forward) more port data simultaneously; 2) there is a need to be able to achieve higher port rates; 3) there is a need to enable shorter link data exchange delays; 4) there is a need to be able to adapt to different load requirements. However, the conventional scheduling method has difficulty in satisfying the above requirements. In the method, the first-come first-served scheduling method may cause one data stream to occupy all buffer space, so that the service of other link data is rejected. The round-robin scheduling method requires that each link be serviced in a round-robin fashion, which results in unfairness between links due to the inconsistent speed of each link. In the scheduling method based on the priority, if the priority is determined, the scheduling attribute cannot be autonomously changed any more, and the flexibility is poor. Therefore, the existing satellite-borne scheduling method has obvious defects in the aspects of flexibility and fairness in the multipath multi-terminal load data processing.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a satellite-borne multichannel multi-terminal self-adaptive scheduling method and system.
The invention provides a satellite-borne multichannel multi-terminal self-adaptive scheduling method, which comprises the following steps:
step 1: generating a two-dimensional routing table in a self-adaptive manner according to the two-dimensional routing table instruction;
step 2: calculating the buffer data amount Bi of each load link according to the priority instruction, and determining the priority order Vi of each load link according to the buffer data amount Bi;
and step 3: polling and scheduling output data in each cache according to the received effective data enable Ai and the two-dimensional routing table on each load link and the priority order;
and 4, step 4: calculating the framing length in a self-adaptive manner by combining the load rate processed by the terminal;
and 5: verifying whether the total input rate of each load link required by the terminal in different rate modes meets the processing rate requirement of a scheduling algorithm or not through the sizes of Ci and Di, if not, sending an error sign, and automatically updating a two-dimensional routing table; ci represents the time required for outputting one frame of payload data in the corresponding link buffer through a data terminal output interface; di represents the maximum time for allowing the single link to cache data output after data preprocessing;
step 6: and framing the output data in the cache, and sending the framed data to a specified terminal by combining the two-dimensional routing table.
Optionally, the step 1 of adaptively updating the two-dimensional routing table means that the two-dimensional routing table is dynamically updated according to the maximum processing speed of the terminal and the sum of bandwidths of the required processing channels; the maximum processing speed of the terminal is the sum of maximum rates of the terminal allowed input data selected according to a two-dimensional routing table; the sum of the bandwidth of the processing channel required by the terminal is the sum of the bandwidth of all the load links which are selected according to the two-dimensional routing table and need to be processed by the terminal.
Optionally, the method further comprises:
if the sum of the processing bandwidths required by the terminal is less than the maximum processing speed of the terminal, executing the scheduling requirement of the two-dimensional routing table;
if the sum of the processing bandwidths required by the terminal is greater than the maximum processing speed of the terminal, automatically shielding the load data of the maximum rate, automatically updating the two-dimensional routing table, and simultaneously sending a rate error mark until the total bandwidth is less than the maximum processing speed of the terminal, and executing the scheduling requirement.
Optionally, in the step 2, the link with the larger buffer data amount Bi has higher priority; and if the link cache data size is the same, according to a default priority order.
Optionally, in step 4, the framing length of the output data is adaptively changed in combination with the load rate processed by the terminal, where the framing length is in direct proportion to the average speed at which the terminal needs to process data input of each link, and the larger the average speed is, the larger the framing length of the output data is.
The invention also provides a satellite-borne multichannel multi-terminal adaptive scheduling system, which is used for executing the satellite-borne multichannel multi-terminal adaptive scheduling method and comprises the following steps:
the two-dimensional routing table generating module is used for generating a two-dimensional routing table required by a scheduling algorithm according to the two-dimensional routing table instruction;
the priority determining module is used for determining the priority sequence in a mode of combining the static priority and the dynamic priority; the static priority is a fixed priority mode executed according to the instruction requirement through an upper priority instruction; the dynamic priority is a priority mode which determines a priority order Vi according to the size of the data amount Bi of each channel data buffer and specifies that the link with larger buffer data amount has higher priority;
the polling scheduling module is used for polling and scheduling the output data in each cache according to the effective data enable Ai already received on each load link and the two-dimensional routing table and the priority order;
the frame length determining module is used for calculating the framing length by combining the load rate processed by the terminal;
the verification module is used for verifying the correctness of the scheduling algorithm according to the sizes of the Ci and the Di and automatically updating the two-dimensional routing table; ci represents the time required for outputting one frame of payload data in the corresponding link buffer through a data terminal output interface; di represents the maximum time for allowing the single link to cache data output after data preprocessing;
and the sending module is used for framing the output data in the cache and sending the framed data to the designated terminal by combining the two-dimensional routing table.
Compared with the prior art, the invention has the following beneficial effects:
the satellite-borne multi-channel multi-terminal self-adaptive scheduling method and system provided by the invention realize the free scheduling of multi-channel multi-terminals, reduce the waiting time of the terminals, improve the fairness of each load link service, realize the design of 100% throughput rate, meet the general design requirements of multi-load, multi-terminal and multi-link and provide reference and technical support for the future inter-satellite networking and multi-target identification technology through the technologies of dynamic and static priorities, a self-adaptive terminal routing two-dimensional table, self-adaptive framing and the like.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
fig. 1 is a structural diagram of an eight-payload link eight-terminal adaptive scheduling system according to an embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that it would be obvious to those skilled in the art that various changes and modifications can be made without departing from the spirit of the invention. All falling within the scope of the present invention.
The invention provides a satellite-borne multi-channel multi-terminal self-adaptive scheduling method, which comprises the following steps:
step 1: and generating a two-dimensional routing table according to the two-dimensional routing table instruction, judging the total input rate of each load link required by the terminal in different rate modes and the processing rate of a scheduling algorithm, and refreshing the two-dimensional routing table in a self-adaptive manner.
In this embodiment, the adaptively generating the two-dimensional routing table means that the adaptive updating of the two-dimensional routing table is completed according to the maximum processing speed of the terminal and the sum of the bandwidths of the required processing channels. In this embodiment, the maximum processing speed of the terminal is the sum of the maximum rates of the terminals selected according to the two-dimensional routing table and allowed to input data. And the sum of the bandwidth of the processing channel required by the terminal is the sum of the bandwidth of several load links which are determined by the terminal according to the two-dimensional routing table.
Specifically, if the sum of the processing bandwidths required by the terminals is less than the maximum processing speed of the terminals, the two-dimensional routing table scheduling requirement is executed. If the sum of the processing bandwidths required by the terminal is greater than the maximum processing speed of the terminal, automatically shielding the load data of the maximum rate, automatically updating the two-dimensional routing table, simultaneously sending a rate error mark, executing in a circulating way until the total bandwidth is less than the maximum processing speed of the terminal, and then executing the scheduling requirement.
Step 2: and calculating the buffer data amount Bi of each load link according to the priority instruction, and determining the priority order Vi of each load link according to the buffer data amount Bi.
In this embodiment, in addition to the fixed priority, the priority order may also be determined by the size of the data amount buffered in each current link, and the link with the larger buffered data amount has the higher priority. When the buffer data size is the same, the buffer data size is executed according to the default priority.
In this embodiment, the static priority and the dynamic priority are combined, and are one-way optimal and several-way optimal strategies generated according to the priority instruction, and the priority can be dynamically and autonomously updated according to the size of the cache data volume. The optimal path determined by the static priority is not influenced by the dynamic priority, and the priority level of the static priority is higher than the dynamic priority.
And step 3: and polling and scheduling the output data in each buffer according to the priority order according to the effective data enable Ai and the two-dimensional routing table which are received on each load link.
And 4, step 4: and calculating the length of the framing according to the load rate processed by the terminal.
In this embodiment, the framing length of the output data is adaptively changed, the framing length is in direct proportion to the average speed at which the terminal needs to process data input of each link, and the larger the average speed is, the larger the framing length of the output data is.
And 5: verifying the correctness of the scheduling algorithm through the sizes of the Ci and the Di, and automatically updating the two-dimensional routing table in real time; ci represents the time required for outputting one frame of payload data in the corresponding link buffer through a data terminal output interface; di represents the maximum time allowed for single link buffered data output after data pre-processing.
Step 6: and performing self-adaptive framing on the output data in the cache, and sending the framed data to a specified terminal by combining with the two-dimensional routing table.
In the embodiment, quintuple Ti (Ai, Bi, Ci, Di, Vi) is adopted for unified modeling to represent data information of each channel; wherein:
ai in the quinary method Ti indicates that a certain amount of valid data has been received in the link buffer and that the data frame can be sent to the algorithmic processing in its entirety. And the Ai is initially 0, is pulled high after being effective, and is kept at a high level until the buffer effective data is output below a certain amount and does not meet the output requirement.
Bi in the quinary method Ti represents the size of valid data which is received by the link buffer in the existing mode. The buffer design will automatically increase the effective data amount of one frame when receiving the effective data frame end, and after the effective data packet is output from the link buffer, Bi will automatically decrease until it is 0.
Ci in the quinary method Ti is the time required for outputting one frame of payload data in the link buffer by a data terminal output interface, and the parameter is set for comparing the maximum allowable service time of the link at the moment, namely whether one frame of data in the link buffer can be output in the maximum allowable service time.
Di in the quinary method Ti represents the maximum time for allowing the single link to buffer the data output after the data is preprocessed, and the time for receiving the service of any link data must be less than the time length, otherwise, the data overload condition will occur.
Vi in the quinary method Ti is a priority design of an expression algorithm, the priority design can be one-way optimal or several-way optimal according to the upper note instruction, and meanwhile, the priority can be dynamically and automatically updated according to the size of the cache data volume.
Fig. 1 is a structural diagram of an adaptive scheduling system with eight load links and eight terminals according to an embodiment of the present invention; as shown in fig. 1, taking 8 link data as an example, the link data includes eight load links, eight terminal processors, a priority instruction, a terminal requirement instruction, and an adaptive scheduling algorithm. Since the external conditions of the adaptive algorithm are all changeable at any time, the present invention will be described with specific parameters at a certain time as conditions.
Specifically, the input rate of the load is not fixed and unchanged, at a certain time, the average rates of the loads 1 to 8 are 500Mbps, 200Mbps, 700Mbps, 1Gbps, 300Mbps, 500Mbps, 150Mbps and 900Mbps respectively, since most of the payload data is discontinuous data at present, the number of caches in each load link is also small or large, the payload data packets that have been received by the caches 1 to 8 at the time are 6G, 7G, 3G, 5G, 0G, 5G, 4G and 2G respectively, and the maximum capacity of the cache in the example is 8G.
Eight terminal processors, and the maximum data processing capacity of each terminal is 1.6 Gbps.
And the priority instruction determines a priority sequence for the priority instruction, one or more optimal paths can be completed according to functional requirements, and the priority instruction at the moment is 00001000, which represents that one optimal path is the fourth path.
A terminal demand instruction, which determines the load data to be processed by each terminal for the terminal demand instruction, wherein the terminal demand instruction at the time is as follows:
00101100_10100001_00101000_01010011_00001110_10000011_00011000_01010100；
the instruction indicates that the terminal 1 needs to process third, fifth and seventh load data, the terminal 2 needs to process fourth and fifth load data, the terminal 3 needs to process first, second and eighth load data, the terminal 4 needs to process second, third and fourth load data, the terminal 5 needs to process first, second, fifth and seventh load data, the terminal 6 needs to process fourth and sixth load data, the terminal 7 needs to process first, sixth and eighth load data, and the terminal 8 needs to process third, fourth and sixth load data.
The adaptive scheduling algorithm is implemented at the above time as follows:
s1: according to the terminal demand instruction, calculating the total input rate of the load link needing to be processed by each terminal at the moment, wherein the total input rate needing to be processed by each terminal is 1.15Gbps, 1.3Gbps, 1.6Gbps, 1.9Gbps, 1.15Gbps, 1.5Gbps, 1.9Gbps and 2.2Gbps respectively, the maximum speed of terminal processing is 16Gbps, the total input rate needing to be processed by each terminal 4, 7 and 8 is greater than the maximum processing speed of the terminal, the algorithm automatically shields the load data with the maximum rate in the load link needing to be processed, and a two-dimensional routing table is generated in a self-adaptive mode.
| Load 8 | Load 7 | Load 6 | Load 5 | Load 4 | Load 3 | Load 2 | Load 1 | |
| Terminal 8 scheduling request | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 |
| Terminal 7 scheduling request | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
| Terminal 6 scheduling request | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
| Terminal 5 scheduling request | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 |
| Terminal 4 scheduling request | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
| Terminal 3 scheduling request | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
| Terminal 2 scheduling request | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 |
| Terminal 1 scheduling request | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
S2: the calculated links buffer data Bi and are compared, B2 > B1 > B4 is B6 > B7 > B3 > B8 > B5, and the priority order Vi corresponding to the moment is determined in combination with a priority instruction, and V4 > V2 > V1 > V6 > V7 > V3 > V8 > V5.
S3: according to the output enable Ai at the moment of each load link, a1 is 1, a2 is 1, A3 is 0, a4 is 1, a5 is 0, a6 is 1, a7 is 1, and A8 is 0, the data in the corresponding buffer is read and output to the terminal in combination with the priority sequence, the task performed at the moment is that the data in the load 6 link buffer outputs one frame to the terminal 8, the data in the load 1 link buffer outputs one frame to the terminal 7, the data in the load 4 link buffer outputs one frame to the terminal 6, the data in the load 2 link buffer outputs one frame to the terminal 5, the data in the load 2 link buffer outputs one frame to the terminal 4, the data in the load 2 link buffer outputs one frame to the terminal 3, the data in the load 4 link outputs one frame to the buffer terminal 2, and the data in the load 7 link buffer outputs one frame to the terminal 1. The payload link may output the same data to several different terminals simultaneously.
S4: and the framing length of each terminal is calculated by combining the input rate of the load link being processed by the terminal in a self-adaptive manner, and the framing lengths of the terminals from 1 to 8 are respectively 2Kbits, 10Kbits, 2Kbits, 10Kbits, 5Kbits and 5 Kbits.
S5: calculating the time Ci required by outputting effective data of one frame in each link buffer, and solving by the following formula:
in the formula: vso is the terminal maximum data processing capacity. Meanwhile, the maximum time Di allowed for single-link cache data output after data preprocessing is calculated, and the maximum time Di is obtained through the following formula:
Di＝min(D1，D2，D3，D4，D5，D6，D7，D8)
where Vsi is 1.6Gbps because the interface for loading data input to the algorithm in this example is the same interface as the algorithm output to the terminal. Because Vso is Vsi, and the frame length of each terminal is far smaller than the residual capacity of each link buffer, all Ci are far smaller than Di, the algorithm realization condition is met, and the two-dimensional routing table does not need to be updated by sending error flags.
S6: and carrying out self-adaptive framing on the data output by the cache according to the framing length, and sending the framed data to a specified terminal for processing according to a two-dimensional routing table.
Further, the enabling of each load link is pulled up, a threshold value of the cache capacity is set, when the cache data in the link is larger than the threshold value, the link caches the request output, the enabling is pulled up to be 1, and the enabling is pulled down to be 0 when the enabling is smaller than the threshold value. In the example, the threshold is 4Gbit, the data in the buffer is more than 4Gbit, and the output can be pulled high.
Further, calculating the framing length from Vin(Mbps) × 1(s)/(1Mbit × 100) rounded, where Vin is the load input rate.
It should be noted that, the steps in the satellite-borne multi-channel multi-terminal adaptive scheduling method provided by the present invention may be implemented by using corresponding modules, devices, units, etc. in the satellite-borne multi-channel multi-terminal adaptive scheduling system, and those skilled in the art may refer to the technical scheme of the system to implement the step flow of the method, that is, the embodiments in the system may be understood as preferred examples for implementing the method, and are not described herein again.
Those skilled in the art will appreciate that, in addition to implementing the system and its various devices provided by the present invention in purely computer readable program code means, the method steps can be fully programmed to implement the same functions by implementing the system and its various devices in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Therefore, the system and various devices thereof provided by the invention can be regarded as a hardware component, and the devices for realizing various functions included in the system can also be regarded as structures in the hardware component; means for performing the functions may also be regarded as structures within both software modules and hardware components for performing the methods.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes or modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention. The embodiments and features of the embodiments of the present application may be combined with each other arbitrarily without conflict.
Claims (6)
1. A satellite-borne multi-channel multi-terminal self-adaptive scheduling method is characterized by comprising the following steps:
step 1: generating a two-dimensional routing table in a self-adaptive manner according to the two-dimensional routing table instruction;
step 2: calculating the buffer data amount Bi of each load link according to the priority instruction, and determining the priority order Vi of each load link according to the buffer data amount Bi;
and step 3: polling and scheduling output data in each cache according to the received effective data enable Ai and the two-dimensional routing table on each load link and the priority order;
and 4, step 4: calculating the framing length in a self-adaptive manner by combining the load rate processed by the terminal;
and 5: verifying whether the total input rate of each load link required by the terminal in different rate modes meets the processing rate requirement of a scheduling algorithm or not through the sizes of Ci and Di, if not, sending an error sign, and automatically updating a two-dimensional routing table; ci represents the time required for outputting one frame of payload data in the corresponding link buffer through a data terminal output interface; di represents the maximum time for allowing the single link to cache data output after data preprocessing;
step 6: and framing the output data in the cache, and sending the framed data to a specified terminal by combining the two-dimensional routing table.
2. The satellite-borne multichannel multi-terminal adaptive scheduling method according to claim 1, wherein the step 1 of adaptively updating the two-dimensional routing table means that the dynamic update of the two-dimensional routing table is completed according to the maximum processing speed of the terminal and the sum of bandwidths of required processing channels; the maximum processing speed of the terminal is the sum of maximum rates of the terminal allowed input data selected according to a two-dimensional routing table; the sum of the bandwidth of the processing channel required by the terminal is the sum of the bandwidth of all the load links which are selected according to the two-dimensional routing table and need to be processed by the terminal.
3. The satellite-borne multichannel multi-terminal adaptive scheduling method according to claim 1, further comprising:
if the sum of the processing bandwidths required by the terminal is less than the maximum processing speed of the terminal, executing the scheduling requirement of the two-dimensional routing table;
if the sum of the processing bandwidths required by the terminal is greater than the maximum processing speed of the terminal, automatically shielding the load data of the maximum rate, automatically updating the two-dimensional routing table, and simultaneously sending a rate error mark until the total bandwidth is less than the maximum processing speed of the terminal, and executing the scheduling requirement.
4. The satellite-borne multichannel multi-terminal adaptive scheduling method according to claim 1, wherein in step 2, the higher the buffer data amount Bi, the higher the priority of the link; and if the link cache data size is the same, according to a default priority order.
5. The on-board multichannel multi-terminal adaptive scheduling method according to claim 1, wherein in step 4, the framing length of the output data is adaptively changed in combination with the load rate processed by the terminal, the framing length is in direct proportion to the average speed at which the terminal needs to process each link data input, and the larger the average speed is, the larger the framing length of the output data is.
6. An on-board multichannel multi-terminal adaptive scheduling system for performing the on-board multichannel multi-terminal adaptive scheduling method according to any one of claims 1 to 5, the system comprising:
the two-dimensional routing table generating module is used for generating a two-dimensional routing table required by a scheduling algorithm according to the two-dimensional routing table instruction;
the priority determining module is used for determining the priority sequence in a mode of combining the static priority and the dynamic priority; the static priority is a fixed priority mode executed according to the instruction requirement through an upper priority instruction; the dynamic priority is a priority mode which determines a priority order Vi according to the size of the data amount Bi of each channel data buffer and specifies that the link with larger buffer data amount has higher priority;
the polling scheduling module is used for polling and scheduling the output data in each cache according to the effective data enable Ai already received on each load link and the two-dimensional routing table and the priority order;
the frame length determining module is used for calculating the framing length by combining the load rate processed by the terminal;
the verifying module is used for verifying the correctness of the scheduling algorithm according to the sizes of the Ci and the Di; and automatically updating the two-dimensional routing table; ci represents the time required for outputting one frame of payload data in the corresponding link buffer through a data terminal output interface; di represents the maximum time for allowing the single link to cache data output after data preprocessing;
and the sending module is used for framing the output data in the cache and sending the framed data to the designated terminal by combining the two-dimensional routing table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910971213.1A CN110691039A (en) | 2019-10-09 | 2019-10-09 | Satellite-borne multichannel multi-terminal self-adaptive scheduling method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910971213.1A CN110691039A (en) | 2019-10-09 | 2019-10-09 | Satellite-borne multichannel multi-terminal self-adaptive scheduling method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110691039A true CN110691039A (en) | 2020-01-14 |
Family
ID=69112351
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910971213.1A Pending CN110691039A (en) | 2019-10-09 | 2019-10-09 | Satellite-borne multichannel multi-terminal self-adaptive scheduling method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110691039A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111417112A (en) * | 2020-02-19 | 2020-07-14 | 成都四相致新科技有限公司 | Distributed OTA gateway networking and terminal access method and OTA upgrading system |
| CN113364514A (en) * | 2021-05-31 | 2021-09-07 | 上海航天计算机技术研究所 | High-speed baseband data processing device applied to satellite platform |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301024A (en) * | 2014-09-12 | 2015-01-21 | 上海卫星工程研究所 | Satellite-borne multi-load data frame transmission system |
-
2019
- 2019-10-09 CN CN201910971213.1A patent/CN110691039A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301024A (en) * | 2014-09-12 | 2015-01-21 | 上海卫星工程研究所 | Satellite-borne multi-load data frame transmission system |
Non-Patent Citations (1)
| Title |
|---|
| 潘乐乐等: "基于Serdes 星载多通道自适应调度算法研究", 《中国科技论文在线》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111417112A (en) * | 2020-02-19 | 2020-07-14 | 成都四相致新科技有限公司 | Distributed OTA gateway networking and terminal access method and OTA upgrading system |
| CN113364514A (en) * | 2021-05-31 | 2021-09-07 | 上海航天计算机技术研究所 | High-speed baseband data processing device applied to satellite platform |
| CN113364514B (en) * | 2021-05-31 | 2022-08-26 | 上海航天计算机技术研究所 | High-speed baseband data processing device applied to satellite platform |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9426099B2 (en) | Router, method for controlling router, and program | |
| CN110248417B (en) | Resource allocation method and system for communication service in power Internet of things | |
| CN109905329B (en) | Task type aware flow queue self-adaptive management method in virtualization environment | |
| CN108446179B (en) | Weight priority Task scheduling method based on load balancing mechanism | |
| CN110691039A (en) | Satellite-borne multichannel multi-terminal self-adaptive scheduling method and system | |
| CN111245743B (en) | Information processing method, storage medium, gateway and automobile | |
| CN111181873B (en) | Data transmission method, data transmission device, storage medium and electronic equipment | |
| US20120177036A1 (en) | Simple fairness protocols for daisy chain interconnects | |
| US10467161B2 (en) | Dynamically-tuned interrupt moderation | |
| AU2013347470B2 (en) | Traffic management scheduling method and apparatus | |
| CN104935524A (en) | Link delay control-based light load balancing method for multipath network | |
| JP2001197110A (en) | Traffic control method | |
| US11063876B2 (en) | Automatically cycling among packet traffic flows subjecting them to varying drop probabilities in a packet network | |
| EP3063969A1 (en) | System and method for traffic engineering using link buffer status | |
| US10367751B2 (en) | Distributing and rate limiting packets among multiple paths in a single stage switching topology to a reordering node | |
| CN106372013A (en) | Remote memory access method, apparatus and system | |
| US11201829B2 (en) | Technologies for pacing network packet transmissions | |
| CN209803775U (en) | Data processing apparatus | |
| CN113992707A (en) | Data transmission method and device, vehicle-mounted Ethernet equipment and storage medium | |
| CN114785744B (en) | Data processing method, device, computer equipment and storage medium | |
| CN102833162B (en) | The method of adjustment of number of buffer and device | |
| US20230283575A1 (en) | Allocation of Shared Reserve Memory to Queues in a Network Device | |
| CN112822125B (en) | Method, device, equipment and storage medium for transmitting service flow | |
| US11146496B2 (en) | Relay device | |
| CN113132264B (en) | Security calculation control method, data packet processing method, device and system thereof |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200114 |
|
| RJ01 | Rejection of invention patent application after publication |