Spaceborne message scheduling method and device of space-based data link

Abstract

The invention provides a spaceborne message scheduling method and device of a space-based data link, and belongs to the field of space-based data links. The method comprises that spaceborne messages of the space-based data link are received, and arranged in different queues according to the application priority of the messages; the extraction sequence and to-be-distributed resource corresponding to the messages are determined according to service types of the received messages; according to the determined extraction sequence, messages with the same service type are extracted from each queue; and according to the determined to-be-distributed resource, the extracted messages are scheduled. Different types of the messages in the queue are processed in a balanced way, the channel utilization rate is improved, the fairness among the queues is improved, and the total service capability of the network is improved.

Description

technical field [0001] A space-based data link spaceborne message scheduling method and device of the present invention belong to the technical field of space-based data link. Background technique [0002] Related message scheduling methods for data links usually include the following: [0003] (1) The message scheduling method of the ground traditional data link: in the ground traditional data link, the terminal machines have a peer-to-peer composition structure, and each terminal machine sends messages in the exclusive time slot allocated during planning, in the form of broadcasting, and The terminal machine can receive the message sent by the terminal machine. In this method, there is no autonomous message scheduling between terminals, and the timing and cycle of sending messages are completed through pre-planned tasks. For a single terminal, messages are sent in a first-in-first-out manner, that is, FIFO; [0004] (2) Tactical data link dynamic polling scheduling algo...

AI Technical Summary

Problems solved by technology

[0008] The above (1) method has inflexible scheduling and low channel utilization; in the (2) method, the data link control station controls the data transmission timing of all slave stations based on prediction; in the (3) method, if there is a long-term High-priority data packets, low-priority data packets will be "starved to death" due to long-term non-service, which seriously affects the fairness between queues and greatly reduces the overall service performance of the network; (4) In the method, because the length of the data packets is not fixed, the long data packets in the queue may get more bandwidth resources and services than the short data packets, and the "fairness" between the queues is limited to a certain extent. Performance such as delay and jitter cannot be guaranteed, and this method cannot take into account various types of messages; the fifth method lacks consideration for various characteristics of messages

Images