## 1 Introduction  
In recent years, space exploration activities such as deep space exploration, manned spaceflight, and satellite development have become increasingly active globally. The returned data cover various services, including engineering telemetry, physiological telemetry, engineering control, scientific observation, scientific experiments, delayed playback, audio, video, etc. [1]. These data exhibit significant heterogeneity in service types, transmission rates, and QoS requirements. These developments have placed higher demands on the real-time performance and reliability of space data systems. In response, the Consultative Committee for Space Data Systems (CCSDS) established the Advanced Orbiting System (AOS) protocol. The AOS protocol allows multiple data packets with a similar QoS to be multiplexed within the same virtual channel. These data packets are segmented and encapsulated into fixed-length Multiplexing Protocol Data Units (MPDUs), which are then assembled into complete frames with added control information to improve the spatial link multiplexing efficiency. To provide a comprehensive background and highlight the motivation for this study, we first review the existing research on AOS framing algorithms, which can be broadly categorized into three types as follows: isochronous, high-efficiency, and adaptive framing algorithms. The principle of isochronous frame generation is to set a fixed framing threshold. Regardless of the number of incoming packets, the framing occurs once the set framing time is reached. If the total number of incoming packets does not meet the MPDU length, idle packets are used for padding [2; 3; 4]. For example, for the ON/OFF source arrival model obeying the Pareto distribution in an AOS, [PERSON] et al. established the isochronous frame generation method. They obtained the calculation formulas of average packet delay and MPDU average multiplexing efficiency, which verified the feasibility of the isochronous frame generation algorithm in AOS [3]. However, for non-delay-sensitive packets, using the isochronous frame generation algorithm may result in a low frame multiplexing efficiency due to the less stringent timing requirements. As a result, high-efficiency frame generation algorithms were proposed. The principle of high-efficiency frame generation is that, in continuous packet arrival scenarios, a frame is generated and transmitted only when the accumulated packet length reaches the length of an MPDU [5; 6; 7]. For example, [PERSON] et al. studied the simplified calculation method of the average frame generation time and the average packet delay in the efficient frame generation algorithm. For the case where the packet arrival rate is the Poisson distribution, they used the Erlang distribution to obtain a clearer correlation between performance indicators [7]. However, the standards for the framing algorithms in the aforementioned two methods are too rigid. In contrast, the adaptive frame generation algorithm can be controlled by pre-setting the framing threshold and MPDU length. Specifically, when the frame waiting time is less than the set threshold value or the MPDU area has been filled with arriving packets, the frame is encapsulated and sent immediately. When the frame waiting time reaches the maximum threshold and the MPDU buffer is not filled, the idle packet is used to complete the entire transmission frame [8; 9; 10; 11]. [PERSON] et al. studied the adaptive frame generation algorithm in the AOS protocol and provided an effective method of calculating the information transmission rate [9]. [PERSON] et al. proposed an adaptive frame generation algorithm based on wavelet neural network traffic prediction. Under certain delay constraints, the algorithm can adaptively adjust the frame time according to the traffic prediction results [11]. However, most of these algorithms need to set relevant parameters in advance, such as framing time threshold, number of iterations, etc., which cannot interact with the environment in real time.