Data transmission method and device, electronic equipment and storage medium
By giving priority to data transmission requests in the high-speed rail communication system and sorting them, the problem of data transmission load balancing in the high-speed rail scenario is solved, efficient resource allocation and network stability are achieved, and user experience and system performance are improved.
Patent Information
- Application Number
- CN202411072494.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-06
- Publication Date
- 2024-11-29
AI Technical Summary
In high-speed rail scenarios, due to high-speed mobile and variable communication environments, data transmission load balancing is difficult to achieve. Multi-core processors need to ensure balance in task allocation when processing carrier frequency tasks in parallel. The existing DMA instruction queue management strategy cannot be effectively optimized. Resources, causing high-priority services to be blocked by low-priority services, affecting the performance and user experience of the communication system.
By assigning user priority and service priority to each data transmission request on the network side and storing it in a matching cache, user priority and service priority sorting is ensured that high-priority requests are processed in a timely manner and dynamic adjustments are made. Resource allocation, prioritize meeting high-priority users and business needs, and avoid network congestion.
It realizes the balancing management of data transmission load in high-speed mobile environments such as high-speed rail, improves network efficiency and stability, ensures timely processing of high-priority services, avoids network congestion, and improves user experience and system performance.
Smart Images

Figure CN119052858A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of communication technology, and in particular to a data transmission method, device, electronic device and storage medium. Background Art
[0002] With the popularization of 4G / 5G networks, their applications in satellite, autonomous driving, high-speed rail and other fields are becoming more and more critical. In China, the rapid development of high-speed rail networks and huge passenger flow provide broad application prospects for 5G technology. The particularity of high-speed rail scenarios, such as high-speed movement and changing communication environments, requires communication systems to have efficient processing capabilities and flexible resource allocation. To this end, multi-core processors and PCIe (PCI Express Interface) interface function acceleration cards are used to parallel process carrier tasks and computing-intensive services to improve system performance.
[0003] In high-speed rail scenarios, the rapid movement of trains and changes in the communication environment pose challenges to the continuity and stability of communications. At the same time, the management of different carrier frequencies and service priorities requires efficient resource scheduling. When multi-core processors process carrier frequency tasks in parallel, they must ensure balanced task distribution. Although the DMA (Direct Memory Access) unit of the accelerator card provides multiple DMA instruction queues and engines, how to optimize these resources to achieve efficient device virtualization and parallel processing of DMA instructions to ensure balanced data transmission load is still a technical problem that needs to be solved. Summary of the invention
[0004] The present application provides a data transmission method, device, electronic device and storage medium, aiming to solve the problem of data transmission load balancing in high-speed rail scenarios.
[0005] In a first aspect, an embodiment of the present application provides a data transmission method, which is applied to a network side, including:
[0006] Receive a data transmission request from a user side, each data transmission request carries configuration information and a service type identifier;
[0007] For each received data transmission request, assign a user priority according to its configuration information and assign a service priority according to its service type; and store the data transmission request in a cache matching its service priority, each service priority corresponding to a cache;
[0008] The stored data transmission requests are sorted by user priority within each cache, and each data transmission request is distributed in an orderly manner according to the business priority and user priority.
[0009] In a second aspect, the present application further provides a data transmission device, applied to a network side, comprising:
[0010] A receiving module, used to receive a data transmission request from a user side, each data transmission request carries configuration information and a service type identifier;
[0011] an allocation module, for assigning a user priority to each received data transmission request according to its configuration information and a service priority according to its service type; and storing the data transmission request in a cache matching its service priority, each service priority corresponding to a cache;
[0012] The scheduling module is used to sort the stored data transmission requests according to user priority within each cache, and to perform orderly distribution of each data transmission request according to business priority and user priority.
[0013] In a third aspect, the present application provides a data transmission method, applied to a user side, comprising:
[0014] Sending a data transmission request to the network side, the data transmission request carrying configuration information and a service type identifier;
[0015] Receive the current channel quality and priority list fed back by the network side, where the priority list includes user priority and service priority, where the user priority is assigned by the network side based on the configuration information of its data transmission request, and the service priority is determined based on its service type, so that the network side stores the data transmission request in a cache that matches its service priority. Each service priority corresponds to a cache. Within each cache, the network side sorts the stored data transmission requests based on the user priority, and performs orderly distribution for each data transmission request in combination with the service priority and user priority.
[0016] In a fourth aspect, the present application provides a data transmission method, applied to a user side, comprising:
[0017] A sending module, used to send a data transmission request to the network side, where the data transmission request carries configuration information and a service type identifier;
[0018] A receiving module is used to receive the current channel quality and priority list fed back by the network side, the priority list including user priority and service priority, wherein the user priority is allocated by the network side according to the configuration information of its data transmission request, and the service priority is determined according to its service type, so that the network side stores the data transmission request in a cache matching its service priority, each service priority corresponds to a cache, and within each cache, the network side sorts the stored data transmission requests according to the user priority, and performs orderly distribution for each data transmission request in combination with the service priority and the user priority.
[0019] In a fifth aspect, the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, wherein when the processor executes the computer program, the steps of the data transmission method as described in any one of the first aspects are implemented.
[0020] In a sixth aspect, the present application provides a non-transitory computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the data transmission method as described in any one of the first aspects are implemented.
[0021] The data transmission method, device, electronic device and storage medium provided in the present application are intended to solve the data transmission load balancing problem caused by high-speed movement and high-density user access in the high-speed rail scenario. For each received data transmission request, the network side assigns user priority based on configuration information, and assigns service priority based on the service type. The data transmission request is stored in a cache that matches its service priority, and each service priority corresponds to a cache, which helps to isolate requests of different service types and avoid high-priority services being blocked by low-priority services, thereby improving the overall network efficiency. In addition, the stored data transmission requests are sorted by user priority within each cache, and each data transmission request is distributed in an orderly manner according to the service priority and user priority, ensuring that even in high-speed rail scenarios where the number of users fluctuates greatly, data flows can be effectively managed to avoid network congestion.
[0022] Therefore, this application can dynamically adjust resource allocation to give priority to the needs of high-priority users and services while maintaining network stability and efficiency. It is suitable for high-speed mobile environments such as high-speed railways and can effectively solve the problem of data transmission load balancing. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, a brief introduction will be given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0024] Figure 1 This is a schematic diagram of DMA instruction queue management;
[0025] Figure 2 This is a schematic diagram of DMA instruction execution;
[0026] Figure 3 It is a schematic diagram of the allocation of carrier frequency data to different DMA engines;
[0027] Figure 4is a schematic diagram of the data transmission method of the present application;
[0028] Figure 5 is a schematic diagram of DMA data transmission provided in Example 1 of the present application;
[0029] Figure 6 is a flow chart of a data transmission method provided in Embodiment 1 of the present application;
[0030] Figure 7 is a schematic diagram of DMA data transmission provided in Example 2 of the present application;
[0031] Figure 8 is a flow chart of a data transmission method provided in Embodiment 2 of the present application;
[0032] Fig. 9 is a flowchart of a data transmission method provided in Embodiment 3 of the present application;
[0033] Fig.10 It is a schematic diagram of DMA transmission provided in Embodiment 4 of the present application;
[0034] Fig.11 is a flow chart of a data transmission method provided in Embodiment 4 of the present application;
[0035] Fig.12 It is a structural block diagram of the data transmission device provided by the present application;
[0036] Fig.13 It is a schematic diagram of the communication between the network side and the user side provided by the present application;
[0037] Fig.14 It is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0038] In the embodiments of the present application, the term "and / or" describes the association relationship of the associated objects, indicating that three relationships may exist. For example, A and / or B may represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the associated objects before and after are in an "or" relationship.
[0039] In the embodiments of the present application, the term "plurality" refers to two or more than two, and other quantifiers are similar.
[0040] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0041] The technical terms involved in this application are explained below.
[0042] DMA (Direct Memory Access) technology allows hardware subsystems (such as hard disk controllers, network cards, or sound cards) to transfer data directly to memory without CPU intervention, thereby improving data processing efficiency, reducing CPU load, and optimizing system performance. DMA supports high-speed transmission of large blocks of data by reducing CPU participation and interruption in data transmission, and is suitable for scenarios such as video playback, data backup, and network communication. Its workflow includes the external device sending a transfer request to the DMA controller, and the DMA controller directly performs data transfer between the device and the memory after obtaining bus control. After completion, it releases bus control and notifies the CPU that the transfer is complete.
[0043] Please refer to Figure 1 , Figure 1 It is DMA instruction queue management. Carrier Frequency is the radio frequency for transmitting signals, and each carrier frequency carries a specific service or data stream. In order to process this data efficiently, the multi-core processor adopts a specific task allocation strategy, that is, each processor core is specifically assigned to process a specific carrier frequency. For example, processor core 0 is responsible for processing all data and tasks of carrier frequency 0, while processor core 1 focuses on processing carrier frequency 1. This one-to-one allocation method realizes parallel processing between processor cores and carrier frequencies, significantly improving the efficiency and speed of data processing. In scenarios such as high-speed rail wireless communications that require processing large amounts of data and high-priority services, by matching processor cores and carrier frequencies, it can ensure that the data on each carrier frequency is processed in a timely and effective manner, thereby optimizing the overall performance and meeting the communication needs in high-speed mobile environments.
[0044] In order to achieve parallel data transmission of multi-carrier services, the system allocates one or more DMA instruction queues for each carrier. For example, processor core 0 allocates DMA instruction queue 0 for carrier 0, and processor core M allocates DMA instruction queue N-1 and DMA instruction queue N for carrier M. The internal memory of the accelerator card and the internal memory of the server are two different storage systems. When performing a specific task, data can be exchanged between the internal memory of the server and the internal memory of the accelerator card through the DMA engine. The DMA instruction queue is a linked list cache area stored in the internal memory of the accelerator card, which is used to store DMA instructions. Each DMA instruction queue has a fixed maximum capacity, that is, the number of DMA instructions that can be accommodated is limited. The queue manages the enqueue and dequeue operations of DMA instructions through the head pointer and the tail pointer. Each processor core can understand the number of DMA instructions to be distributed in the queue through these two pointers. When DMA data transmission is required, the processor core will enqueue the corresponding DMA instruction into the specified DMA instruction queue, and then the DMA controller will distribute these DMA instructions to a certain DMA engine for execution.
[0045] For example, Figure 1 In the example, DMA instructions in DMA instruction list 0 are distributed to DMA engine 0 and DMA engine L for execution, and DMA instructions in DMA instruction list 1 are distributed to DMA engine 0 for execution. The execution rules of DMA instructions in different DMA engines are as follows:
[0046] 1) DMA instructions from different instruction queues are assigned to different DMA engines, and these DMA instructions can be executed in an out-of-order manner. This means that the execution order of instructions from different queues is not restricted.
[0047] 2) DMA instructions from the same DMA instruction queue are executed in order only when they are processed by the same engine; if they are assigned to different DMA engines, they are executed out of order. This means that if instructions in the same queue are assigned to different engines, their execution order may be disrupted.
[0048] Please refer to Figure 2 , Figure 2 This is a schematic diagram of DMA instruction execution. If DMA instruction 0 in the DMA instruction queue is assigned to DMA engine 0, and DMA instruction 1 is assigned to DMA engine 1, since the execution of different DMA engines is out of order, if DMA engine 0 is blocked, DMA instruction 1 may be executed first and DMA instruction 0 may be executed later.
[0049] Although the DMA instructions in the DMA engine are executed out of order, the completion logic of the DMA controller will reorder the DMA completion operations according to the order of the instruction queue. This means that even if DMA instruction 1 is executed first, the DMA controller will wait for DMA instruction 0 to complete and set the corresponding completion status flag before setting the completion status flag of DMA instruction 1. This mechanism will cause the DMA instructions at the back of the same DMA instruction queue to be blocked by the instructions at the front, even if the latter DMA instructions have completed execution. It can be seen that when instructions in the same queue are assigned to different engines, there will be problems with the order of execution.
[0050] Please refer to Figure 3 , Figure 3 This is a schematic diagram of how carrier frequency data is allocated to different DMA engines. In the high-speed rail wireless communication scenario, there are two problems:
[0051] First, there is the problem of load balancing of data transmission at different carrier frequencies.
[0052] When the data transmission load of each carrier frequency is unbalanced, some carrier frequencies may need to transmit a large amount of data, resulting in a large number of DMA instructions to be distributed accumulating in the corresponding DMA instruction queue, approaching or reaching the maximum capacity of the queue, forming a transmission bottleneck.
[0053] At the same time, other carrier frequencies may transmit a small amount of data, and the number of instructions to be distributed in their DMA instruction queues is very small, resulting in these carrier frequencies being relatively idle and resources not being fully utilized, resulting in resource waste.
[0054] If congested carrier frequencies need to process high-priority services, while idle carrier frequencies need to process low-priority services, this imbalance will cause the processing of high-priority services to be delayed, thereby affecting the user experience of the entire high-speed rail communication system.
[0055] Second, there is the problem of data transmission load balancing on the same carrier frequency.
[0056] In the application scenario of high-speed rail wireless communication, which is very sensitive to delay, different types of services may be provided even on the same carrier frequency, among which some data (such as synchronization signals) have high priority. If these high-priority data are blocked by low-priority data transmission, it will cause transmission delay of high-priority data, affecting the performance of the communication system and user experience.
[0057] The data load balancing problem mentioned above requires providing a management strategy for optimizing the DMA command queue to ensure that data of different priorities on different carrier frequencies and the same carrier frequency are transmitted in a timely manner, avoiding transmission bottlenecks and resource waste, so as to improve the performance and user experience of the high-speed rail wireless communication system. Therefore, this application provides a management strategy for the DMA command queue to solve the above problems. Please refer to Figure 4 , Figure 4 Schematic diagram of a data transmission method of the present application, a data transmission method, applied to the network side, comprising:
[0058] S410, receiving a data transmission request from a user side, each data transmission request carries configuration information and a service type identifier.
[0059] Specifically, the user side (such as high-speed rail) can send one or more configuration information to the network side (such as base station) in the form of user granularity, train granularity, or seat granularity on each train. The configuration information includes at least one of train attributes, train schedule, seat type, and map information.
[0060] For example, Table 1 shows that the user side sends configuration information to the network side at user granularity:
[0061] user Train attributes Train Schedule Seat Type Map Information User A Passenger Transport high speed First class seats Ordinary road section User B Passenger Transport high speed Second Class Seats Ordinary road section User C Passenger Transport ordinary First class seats Ordinary road section
[0062] For example, Table 2 shows the configuration information sent by the user side to the base station at the granularity of the train number:
[0063] Train Train attributes Map Information High-speed train A Passenger Transport Ordinary road section High-speed train B Freight Ordinary road section Ordinary train C Passenger Transport Ordinary road section
[0064] For example, Table 3 shows the configuration information sent by the user side to the base station at the agent granularity:
[0065] Train Train attributes Seat Level Map Information High-speed train A Passenger Transport First class seats Ordinary road section High-speed train A Passenger Transport Second Class Seats Ordinary road section Ordinary train B Passenger Transport First class seats Ordinary road section Ordinary train B Passenger Transport Second Class Seats Ordinary road section
[0066] S420, for each received data transmission request, assign a user priority according to its configuration information, and assign a service priority according to its service type; and store the data transmission request in a cache matching its service priority, each service priority corresponding to a cache.
[0067] Specifically, the network side can assign different user priorities, namely Pu (Priority of user), to different users according to different scenarios. Different service priorities, namely Pt (Priority of transmission), are pre-set for data transmission of different service types on each carrier frequency. Cache is allocated for each Pt priority.
[0068] According to the scenario requirements of the service type, initialize the Pt priority of different service types on each carrier frequency. The Pt priority is set from 0 to M-1, where 0 is the lowest priority and M-1 is the highest priority. And allocate a corresponding cache for each priority level, forming a one-to-one mapping with the Pt priority, which is used to store data transmission requests of different Pt priorities.
[0069] For example, the service priorities include a first service priority, a second service priority, a third service priority, and a fourth service priority from low to high levels, as follows:
[0070] 1) Responsible for the data transmission of the transmission time interval synchronization message of the media access control layer (MAC) and the physical layer (PHY), and is given the highest fourth service priority to ensure the accuracy and timeliness of network synchronization.
[0071] 2) User terminal (UE) data transmission on the physical uplink shared channel (PUSCH) that needs to establish a radio resource control (RRC) connection request service has its priority set to the third service priority to support the critical connection establishment process.
[0072] 3) The priority of all user terminal (UE) data transmissions belonging to the physical random access channel (PRACH) and physical uplink control channel (PUCCH) of semi-static scheduling is set to the second service priority to meet the data transmission requirements under semi-static scheduling.
[0073] 4) Data transmission of other business types is set to the lowest first business priority to meet the needs of general data transmission. Through this clear priority system, the system can reasonably allocate resources and processing order according to the importance and characteristics of different business types, ensuring priority processing of key businesses and optimization of network performance.
[0074] Specifically, the MAC (Medium Access Control) layer sets Pu priorities for different user UEs (User Equipment) based on specific scenario requirements and combined with scheduling algorithms. Pu priorities range from 0 to N-1, where 0 is the lowest priority and N-1 is the highest priority. In the scenario of high-speed rail operation, the system can allocate Pu priorities to user UEs based on train attributes, train schedules, seat types, map information, train operation time periods and sections, and other information. The details are as follows:
[0075] 1) Train attributes: Users on the train heading to the accident site for rescue and relief have the highest priority.
[0076] 2) Train type: Users on express trains have higher priority than users on ordinary trains.
[0077] 3) Seat type: users of first-class seats have higher priority than users of second-class seats (this can be the distinction between first-class and second-class seats in the current railway operation system, or first-class and second-class seats can be set to distinguish the quality of communication services).
[0078] 4) Map information: For example, a train user running on a section with good channel quality outside a tunnel has a higher priority than a train user running on a section with poor channel quality inside a tunnel, because it is difficult to ensure a good communication environment when running inside a tunnel.
[0079] The MAC layer sends the Pu priority of the user UE together with other configuration information of the user UE from the MAC layer to the physical layer. The physical layer receives the user's configuration information and identifies the user's Pu priority. For data transmission requests of the same service type (i.e., the same Pt priority), users with higher Pu priority have the right to transmit data before other users with lower Pu priority.
[0080] S430 , sorting the stored data transmission requests according to user priority within each cache, and performing orderly distribution on each data transmission request according to the service priority and the user priority.
[0081] Specifically, the data transmission requests in the cache may be sorted as follows:
[0082] When a new data transmission request enters the cache, its associated user priority is obtained; starting from the head of the linked list, the user priority of the new request is compared with the user priority of the first node in the linked list; if the user priority of the new request is higher than the user priority of the current node, the linked list will continue to be traversed backwards; if the user priority of the new request is lower than or equal to the user priority of the current node, the current node position will be determined as the insertion point of the new request; at the determined insertion point position, a new data transmission request node is inserted, and the pointer relationship between the nodes before and after the insertion point is adjusted accordingly.
[0083] Through these steps, the network side can sort the data transmission requests according to their Pu priority, ensuring that high-priority requests are located at a front position in the linked list and are processed first.
[0084] In some embodiments, the data transmission method further includes:
[0085] S440, continuously monitor the user side channel communication quality, and dynamically adjust the corresponding user priority for data transmission requests whose channel communication quality is continuously lower than a preset threshold within a continuous preset transmission time interval; assign each data transmission request to a corresponding data transmission instruction queue based on the service priority and the adjusted user priority.
[0086] The network side can also feed back the current channel quality and the priority list information of each user to the user side. The user side schedules and manages users of different priorities based on the priority list information fed back by the network side and the user's service type, such as voice, video, data, etc., giving priority to meeting the resource scheduling needs of high-priority users and ensuring the quality of key services. When network congestion occurs, a certain amount of bandwidth resources is reserved for high-priority users to ensure that the bandwidth needs of high-priority users are met.
[0087] For the information in Table 1 above, the network side feeds back the priority of each user to the user side, and the user side provides corresponding services to the users according to the priority from high to low. Specifically, for example, if the priority in Table 1 from high to low is user A, user B and user C, user A will be provided with communication services first, followed by user B and user C. Or compared with users B and C, user A will use resources with better channel quality for communication.
[0088] For the information in Table 2 above, the network side provides services to the user side according to the priority. Specifically, for example, if the priority in Table 2 is Train A, Train C, and Train B from high to low, the network side will first provide communication services to the users of Train A, followed by the users of Train C and Train B. Or compared with the users of Trains B and C, the users of Train A will use resources with better channel quality for communication.
[0089] For the information in Table 3 above, the network side feeds back the priority of each car to the user side, and the user side provides corresponding services to users in different seats according to the priority from high to low. Specifically, for example, in Train A and Train B in Table 3, users in first-class seats will receive communication services first, followed by users in second-class seats. Or for Train A and Train B, users in first-class seats will use resources with better channel quality for communication than users in second-class seats.
[0090] For example, in a high-speed rail environment, user UEs exhibit a wide range of mobility, high-speed movement, and complexity of the environment they pass through. In order to cope with special situations, such as sudden signal interference or a sharp drop in communication quality caused by a failure in the RF antenna of the user equipment, the physical layer can evaluate the channel communication quality of each user UE based on the channel estimation results for each user UE. For user UEs whose channel communication quality continues to deteriorate, the physical layer can adjust their Pu priority in a timely manner and lower their priority to optimize overall communication efficiency and stability.
[0091] In some embodiments, the data transmission method further includes:
[0092] S450, configuring a sequence dependency flag for each data transmission request, the sequence dependency flag being used to identify whether there is a dependency relationship between the current data transmission request of the current user on the current carrier frequency and the previous data transmission request thereof in terms of execution sequence;
[0093] On the premise that the user priority and the service priority are the same, if there is an execution order dependency between the current data transmission request and the previous data transmission request, the current data transmission request will be distributed to the same data instruction queue as the previous data transmission request.
[0094] If there is no execution order dependency between the current data transmission request and the previous data transmission request, each data instruction queue is polled, the number of data instructions queued to be distributed in each data instruction queue is calculated and compared, and then the data instruction queue with the least number of data instructions to be distributed is selected, and the data instructions generated by this data transmission request are added to the selected data instruction queue.
[0095] During the service processing, when the user UE has a data transmission demand, the corresponding cache is found according to the Pt priority corresponding to the service type of the data transmission, and the data transmission request is stored in the corresponding cache according to the Pt priority. The data transmission request is defined as a structure, which at least includes one or more of the transmission type, source address, destination address, data length, carrier identifier, user identifier, user priority, service priority, sequence dependency flag, and data transmission instruction queue identifier. Among them, the sequence dependency flag, represented by f, can identify whether there is a dependency relationship between the current data transmission request of the current user on the current carrier and the previous data transmission request in terms of execution order. If this data transmission request is an independent data transmission request, the sequence dependency flag f is set to 0; if this data transmission request depends on the previous data transmission request, the sequence dependency flag f is set to 1.
[0096] In some embodiments, the data transmission method further includes:
[0097] S460, continuously monitors the data transmission request status in each cache, and regularly counts the number of data transmission requests to be distributed in each cache according to a preset time interval, and calculates the ratio of high priority to low priority data transmission requests to be distributed based on the statistical results; if the ratio is greater than or equal to a preset threshold value, the preset dynamic adjustment mechanism is executed to achieve balanced processing of data transmission requests of different priorities.
[0098] Specifically, according to the characteristics of wireless communication in the high-speed rail scenario, the Pu priority of each user UE can be dynamically adjusted. When there is a data transmission requirement on the carrier frequency, the data transmission requests are first saved to the corresponding cache according to their service priorities, and the priority weights are calculated according to the proportion of the data transmission requirements of each cache; then the data transmission instructions are dynamically allocated to the appropriate data transmission instruction queues to achieve the purpose of optimizing data transmission.
[0099] In the case where the high-priority data transmission demand is too large, it may cause the low-priority data transmission requests to not be executed for a long time, thus affecting the overall performance and fairness of the system. To solve this problem, this application provides a dynamic adjustment mechanism as follows:
[0100] Every T transmission time intervals (for example, T = 10), the system will count the number of data transmission requests to be distributed in each cache once. Based on this statistical data, the system calculates the ratio W of the high-priority (Pt >= M / 2) to low-priority (Pt < M / 2) data cache transmission requirements to be distributed. When the ratio W of the high-priority data transmission demand to be distributed to the low-priority data transmission demand to be distributed is greater than a threshold value, the DMA transmission ratio weights wt of each priority are calculated according to the value of W, and the data transmission requests are taken out from the corresponding cache in turn according to the weights, so as to ensure that even in the case of a large high-priority demand, resources can be reasonably allocated and low-priority requests can be avoided from being ignored for a long time.
[0101] For example, assuming that the Pt priority is set to four levels, that is, M = 4, and the value range of the Pt priority is 0 - 3, which are: the first Pt priority, the second Pt priority, the third Pt priority, and the fourth Pt priority, the steps of the dynamic adjustment mechanism are as follows:
[0102] 1) Count the cache request amounts of each priority:
[0103] Record the amount of data transmission requests to be distributed in the cache corresponding to Pt = 0, denoted as S0.
[0104] Record the amount of data transmission requests to be distributed in the cache corresponding to Pt = 1, denoted as S1.
[0105] Record the amount of data transmission requests to be distributed in the cache corresponding to Pt = 2, denoted as S2.
[0106] Record the amount of data transmission requests to be distributed in the cache corresponding to Pt = 3, denoted as S3.
[0107] 2) Classify the priorities into high priorities and low priorities:
[0108] Pt=0 and Pt=1 are classified as low priority, and the total amount of DMA data transfer requests to be distributed with low priority is calculated, which is recorded as S_low=S0+S1.
[0109] Pt=2 and Pt=3 are classified as high priority, and the total amount of high priority DMA data transfer requests to be distributed is calculated and recorded as S_high=S2+S3.
[0110] 3) Calculate the priority ratio:
[0111] Calculate the ratio of high priority to low priority data transmission requests to be distributed, recorded as W = S_high / S_low = (S2+S3) / (S0+S1). Assuming that the preset distribution quantity of S0 to S3 is: S0=2, S1=4, S2=12, S3=18, then calculate W=S_high / S_low=(12+18) / (2+4)=5:1.
[0112] In this embodiment, the threshold value of the data transmission requests to be distributed with high priority and low priority can be set to 5:1. If the ratio of the data transmission requests to be distributed with high priority and low priority is greater than or equal to the threshold value (i.e., 5:1), the weight of each priority ratio wt=S3:S2:S1:S0=18:12:4:2=9:6:2:1 is calculated, so the number of distribution times N_pt allocated to each cache is:
[0113] The number of times N_pt3=9 of distributing data transmission requests is allocated to the cache corresponding to Pt=3.
[0114] The number of data transmission request distributions N_pt2=6 is allocated to the cache corresponding to Pt=2.
[0115] The number of times N_pt1=2 of distributing data transmission requests is allocated to the cache corresponding to Pt=1.
[0116] The number of times N_pt0=1 of distributing data transmission requests is allocated to the cache corresponding to Pt=0.
[0117] Then, execute the data transfer request distribution as follows:
[0118] 9 data transmission requests are taken out successively from the cache corresponding to the highest Pt priority (Pt=3), and data instructions are generated and distributed to the appropriate data instruction queues.
[0119] Six data transmission requests are successively taken out from the cache corresponding to the second highest priority (Pt=2), and data instructions are generated and distributed to the appropriate data instruction queue.
[0120] Two data transmission requests are taken out successively from the cache corresponding to the higher priority (Pt=1), and data instructions are generated and distributed to the appropriate data instruction queue.
[0121] A data transmission request is taken out from the cache corresponding to the low priority (Pt=0), a data instruction is generated and distributed to the appropriate data instruction queue.
[0122] According to the above sequence, the distribution of data transmission requests is executed cyclically in sequence to ensure that the data transmission requests are reasonably allocated and processed according to the priority ratio weight wt.
[0123] Therefore, through the above method of periodically counting and dynamically adjusting priority weights, the system can better balance data transmission requests of different priorities, optimize resource allocation, and improve the overall efficiency and responsiveness of the system.
[0124] In summary, the data transmission method described in the present application aims to establish a data transmission priority arbitration and data instruction distribution mechanism between the priority transmission request cache and the data instruction queue. Specifically, first, the data transmission request is taken out from the cache with the highest Pt priority in sequence. If the order dependency flag is 0, the queue with the least number of data instructions to be distributed (i.e., the idlest) is found by polling each data instruction queue. The data instruction queue ID is recorded, and the data transmission request is generated into the queue of the DMA instruction. For a data transmission request with a sequence dependency flag of 1 (indicating that there is a sequence dependency), if the sequence dependency flag of the previous data transmission is 0, the data instruction queue ID is queried and recorded according to the above method; if the sequence dependency flag of the previous data transmission is 1, the request is distributed to the same data instruction queue as the previous data transmission, and the queue ID is recorded. Secondly, after the data transmission request in the highest priority cache is distributed, the data transmission request is obtained and distributed from other caches corresponding to the Pt priority in order from high to low. When the ratio of the data transmission requests to be distributed with high priority to the data transmission requests to be distributed with low priority exceeds a preset threshold, the data transmission ratio weights of each priority level will be calculated based on the ratio value. Based on the ratio weights, the system will dynamically adjust the order of taking data transmission requests from each cache to ensure that low-priority data transmission requests can receive appropriate responses even when the demand is unbalanced.
[0125] Through this mechanism, the present application can effectively manage and optimize the distribution of data transmission requests, ensuring that high-priority requests are given priority while also taking into account the response of low-priority requests, thereby improving the performance and fairness of the overall system.
[0126] The present application is described in detail below by taking a DMA data transmission request as an example.
[0127] Embodiment 1:
[0128] Please refer to Figure 5 , Figure 5 It is a schematic diagram of DMA data transmission provided in Example 1 of the present application. This embodiment involves two carrier frequencies and four user UEs, and the order-dependent flag f of all DMA data transmission requests is 0. The system provides 5G communication services for high-speed rail passengers, including control plane signaling and user plane data transmission and reception. According to the service type of the data, the system sets four levels of Pt priority for the service type on each carrier frequency, ranging from 0 to 3, where 0 is the lowest priority and 3 is the highest priority. The specific priority settings are as follows:
[0129] Responsible for the data transmission of MAC layer and physical layer transmission time interval synchronization messages, the priority is set to the highest, that is, Pt = 3. The user UE data transmission of the PUSCH channel that needs to establish an RRC connection request service has the second highest priority, that is, Pt = 2. The priority of all user UE data transmission belonging to the PRACH and PUCCH channels of semi-static scheduling is set to a higher priority, that is, Pt = 1. The data type transmission priority of other services is set to a low priority, that is, Pt = 0.
[0130] The MAC layer sets different DMA data transmission user priorities for different UE users according to the train schedule and the configuration information of the user UE. In this embodiment, it is assumed that UE0 is a user on the emergency train, and the Pu priority is set to the highest, that is, Pu = 3. UE1 is a user on the express train, the communication service level is first-class, and the Pu priority is the second highest, that is, Pu = 2. UE2 is a user on the express train, the communication service level is second-class, and the Pu priority is higher, that is, Pu = 1. UE3 is a user on the ordinary train, the service level is ordinary, and the Pu priority is the lowest, that is, Pu = 0.
[0131] For DMA data transmission requests of the same service type, that is, the Pt priority level is the same, users with high Pu priority have the right to transmit data in priority to other users with lower Pu priority. For example, within the same transmission time interval, both user UE1 and user UE2 need to establish an RRC connection request service, and the service priorities of UE1 and UE2 are the same, that is, the service priority of UE1 is Pt=1, and the service priority of UE2 is Pt=1. However, UE1 is located in a first-class seat with communication service quality, and the user priority of UE1 is Pu=2; UE2 is located in a second-class seat with communication service quality, and the user priority of UE2 is Pu=1. UE1 and UE2 have the same Pt priority, but UE1's Pu priority is higher than UE2's Pu priority, so all DMA data transmission requests of UE1 have higher priorities than all DMA data transmission requests of UE2, so UE1 has the right to transmit data in priority.
[0132] It should be noted that the user priority Pu of the user UE can be adjusted. The MAC layer can determine whether the Pu priority of each user UE needs to be adjusted in a certain period of time based on scheduling, map information, train schedule and other information. For example, within the same transmission time interval, the MAC layer determines that the carriage where the user UE1 is located has entered the tunnel at this time, and the communication quality may be significantly deteriorated. The MAC layer will reduce the Pu priority of the user UE1, that is, the Pu priority of UE1 will be reduced from Pu=2 to Pu=1; at the same time, the carriage where the user UE2 is located is outside the tunnel, and the channel quality is unlikely to change dramatically, so its original Pu priority is maintained, that is, Pu=1 for the user UE2. The purpose is to reduce the interference of users with deteriorating channel quality on the DMA data transmission of the entire system.
[0133] Please refer to Figure 6 , Figure 6 1 is a flow chart of a data transmission method provided in Embodiment 1 of the present application, wherein the data transmission method comprises:
[0134] S601, initializing the Pt priority of different service types transmitted on each carrier frequency.
[0135] For example, according to the specific scenario requirements, the system initializes the Pt priority of each carrier frequency for different service data types, Pt = 0 to 3, and allocates a corresponding cache for each Pt priority level, that is, 4 caches, each cache corresponding to a Pt priority.
[0136] S602: The physical layer receives the user configuration information sent by the MAC layer and identifies the Pu priority of the user.
[0137] Specifically, the MAC layer passes the user UE's Pu priority and other related configuration information to the physical layer. After receiving this configuration information, the physical layer can identify and process the specific level of the user's Pu priority to ensure appropriate resource allocation and service quality assurance for users of different priorities at the physical layer.
[0138] S603: Store the DMA data transmission request into a corresponding buffer according to the Pt priority.
[0139] For example, when user UEs of various carrier frequencies have DMA data transmission requirements, the corresponding cache is found according to the Pt priority required for transmission, and the DMA data transmission request is stored in the corresponding cache according to the Pt priority. That is, the DMA data transmission request of Pt=0 is stored in the cache corresponding to Pt=0; the DMA data transmission request of Pt=1 is stored in the cache corresponding to Pt=1; the DMA data transmission request of Pt=2 is stored in the cache corresponding to Pt=2; and the DMA data transmission request of Pt=3 is stored in the cache corresponding to Pt=3.
[0140] S604: The cache internally sorts the DMA data transmission requests according to the Pu priority.
[0141] Specifically, after the DMA data transfer request is stored in the corresponding cache, the DMA data transfer request is sorted according to the Pu priority within the cache. The specific method is:
[0142] A pointer linked list is maintained for each cache. The linked list consists of a series of nodes. Each node stores a pointer to a DMA data transfer request and contains a pointer to the next node. When a new DMA data transfer request is stored, the Pu priority of the DMA data transfer request corresponding to each node is traversed from the beginning of the pointer linked list. If the Pu priority of the new DMA data transfer request is greater than the Pu priority of the DMA data transfer request of this node, the new DMA data transfer request node is inserted and the pointer of the corresponding node is modified.
[0143] S605 , according to the priority order of Pt, starting from the highest priority, the DMA data transmission requests are taken out from the corresponding cache in sequence to generate DMA instructions.
[0144] Specifically, starting from the cache corresponding to the highest Pt priority (such as Pt=3), the system reads the DMA data transfer requests therein in sequence, and generates corresponding DMA instructions according to the parameters of these DMA data transfer requests to ensure that high-priority DMA data transfer requests are processed in a timely manner.
[0145] S606, polling each DMA instruction queue, selecting the idlest DMA instruction queue, and distributing the DMA instruction to the DMA instruction queue.
[0146] Specifically, since this embodiment does not consider the case where the sequence dependency flag f is 1 (the case where the sequence dependency flag f is 1 is shown in Embodiment 2), that is, all DMA instructions have no dependency on the execution order, and can be assigned to different DMA instruction queues. The method for the system to select a DMA instruction queue ID for a DMA instruction is:
[0147] The system polls each DMA instruction queue, calculates the number of DMA instructions that have been queued and are waiting to be distributed in each DMA instruction queue, selects the DMA instruction queue with the least number (i.e., the idlest), records the DMA instruction queue ID, and queues the DMA instruction into this DMA instruction queue.
[0148] S607, the DMA controller takes out the DMA instruction from the DMA instruction queue, distributes it to the DMA engine for execution.
[0149] Specifically, after all DMA data transfer requests in the cache corresponding to the high Pt priority have been distributed, the system will read and distribute DMA data transfer requests from the caches with lower priorities in turn. For example, when all DMA data transfer requests in the cache corresponding to Pt=3 have been distributed, the system will turn to the caches corresponding to Pt=2 and Pt=1, continue to read and distribute DMA data transfer requests therein, and finally perform the same operation from the cache corresponding to Pt=0. This process will continue to loop to ensure that DMA data transfer requests of all priorities can be processed. At the same time, the DMA controller is responsible for taking DMA instructions from the DMA instruction queue and distributing these DMA instructions to the DMA engine for execution to complete the data transfer task.
[0150] Embodiment 2:
[0151] Please refer to Figure 7 , Figure 7 Schematic diagram of DMA data transmission provided in Embodiment 2 of the present application. In this embodiment, the system is configured with two carrier frequencies and four user UEs, and involves a situation where the sequence dependency flag f of some DMA data transmission requests is 1. Compared with the first embodiment, this embodiment introduces a judgment and processing mechanism for the sequence dependency of DMA data transmission requests to ensure that when processing DMA data transmission requests with sequence dependency, the execution order can be maintained, thereby improving the reliability and efficiency of data transmission.
[0152] Please refer to Figure 8 , Figure 8 1 is a flow chart of a data transmission method provided in Embodiment 2 of the present application. A data transmission method includes:
[0153] S801, initializing the Pt priority of different service types transmitted on each carrier frequency.
[0154] For example, according to the specific scenario requirements, the system initializes the Pt priority of each carrier frequency for different service data types, Pt = 0 to 3, and allocates a corresponding cache for each Pt priority level, that is, 4 caches, each cache corresponding to a Pt priority.
[0155] S802, the physical layer receives the user configuration information sent by the MAC layer, and identifies the user Pu priority.
[0156] Specifically, the MAC layer passes the user UE's Pu priority and other related configuration information to the physical layer. After receiving this configuration information, the physical layer can identify and process the specific level of the user's Pu priority to ensure appropriate resource allocation and service quality assurance for users of different priorities at the physical layer.
[0157] S803: Store the DMA data transmission request into a corresponding buffer according to the Pt priority.
[0158] For example, when user UEs of various carrier frequencies have DMA data transmission requirements, the corresponding cache is found according to the Pt priority required for transmission, and the DMA data transmission request is stored in the corresponding cache according to the Pt priority. That is, the DMA data transmission request of Pt=0 is stored in the cache corresponding to Pt=0; the DMA data transmission request of Pt=1 is stored in the cache corresponding to Pt=1; the DMA data transmission request of Pt=2 is stored in the cache corresponding to Pt=2; and the DMA data transmission request of Pt=3 is stored in the cache corresponding to Pt=3.
[0159] S804: The cache internally sorts the DMA data transmission requests according to the Pu priority.
[0160] Specifically, after the DMA data transfer request is stored in the corresponding cache, the DMA data transfer request is sorted according to the Pu priority within the cache. The specific method is:
[0161] A pointer linked list is maintained for each cache. The linked list consists of a series of nodes. Each node stores a pointer to a DMA data transfer request and contains a pointer to the next node. When a new DMA data transfer request is stored, the Pu priority of the DMA data transfer request corresponding to each node is traversed from the beginning of the pointer linked list. If the Pu priority of the new DMA data transfer request is greater than the Pu priority of the DMA data transfer request of this node, the new DMA data transfer request node is inserted and the pointer of the corresponding node is modified.
[0162] S805 , according to the priority order of Pt, starting from the highest priority, the DMA data transmission requests are taken out from the corresponding cache in sequence to generate DMA instructions.
[0163] Specifically, starting from the cache corresponding to the highest Pt priority (such as Pt=3), the system reads the DMA data transfer requests therein in sequence, and generates corresponding DMA instructions according to the parameters of these DMA data transfer requests to ensure that high-priority DMA data transfer requests are processed in a timely manner.
[0164] S806, determining whether the sequence dependency flag f of the DMA data transmission request is equal to 1.
[0165] If the order-dependent flag f of the DMA data transfer request=1, execute S807; otherwise, execute S808.
[0166] S807, determining whether the DMA transfer order dependency flag f of the previous DMA transfer order with the same priority level Pt and Pu is equal to 1.
[0167] If the DMA transfer order dependency flag f=1, where the previous Pt priority and Pu priority are the same, then S808 is executed; otherwise, S809 is executed.
[0168] S808, the system distributes the current DMA data transmission request to the same DMA instruction queue as the previous DMA data transmission request.
[0169] S809, the system polls each DMA instruction queue, calculates the number of DMA instructions queued to be distributed in each DMA instruction queue, selects the DMA instruction queue with the least number (i.e., the idlest), records the DMA instruction queue ID, and queues the DMA instruction into this DMA instruction queue.
[0170] S810, the DMA controller takes out a DMA instruction from the DMA instruction queue, distributes it to the DMA engine for execution.
[0171] Through the above steps, the system can effectively manage DMA data transmission requests with sequence dependency, ensuring the sequence of data transmission and the stability of system operation.
[0172] Embodiment three:
[0173] In this embodiment, the system is configured with two carrier frequencies and four user UEs, and faces a situation where the communication quality of at least one user UE deteriorates sharply. Compared with the previous embodiment 1 and embodiment 2, this embodiment introduces a mechanism based on channel quality estimation to dynamically adjust the Pu priority of the user UE. This improvement is intended to respond to changes in channel quality in real time, optimize resource allocation, and ensure that stable service quality can be provided when the communication environment changes.
[0174] Please refer to Fig. 9 , Fig. 9 It is a flowchart of the data transmission method of embodiment 3 of the present application.
[0175] S901, initializing the Pt priority of different service types transmitted on each carrier frequency.
[0176] For example, according to the specific scenario requirements, the system initializes the Pt priority of each carrier frequency for different service data types, Pt = 0 to 3, and allocates a corresponding cache for each Pt priority level, that is, 4 caches, each cache corresponding to a Pt priority.
[0177] S902: The physical layer receives the user configuration information sent by the MAC layer and identifies the Pu priority of the user.
[0178] Specifically, the MAC layer passes the user UE's Pu priority and other related configuration information to the physical layer. After receiving this configuration information, the physical layer can identify and process the specific level of the user's Pu priority to ensure appropriate resource allocation and service quality assurance for users of different priorities at the physical layer.
[0179] S903, each cell performs channel estimation and calculates a signal to interference ratio.
[0180] Specifically, in each transmission time interval, the physical layer uses the SIR (Signal to Interference Ratio) of the PUSCH (Physical Uplink Shared Channel) channel estimation to evaluate the channel quality of the user UE and identify the UE with the worst channel quality.
[0181] For example, if the decoding results of all user UEs are correct, the UE with the lowest SIR value is selected. If the decoding results of all user UEs fail, the UE with the lowest SIR value is also selected. If some user UEs are successfully decoded and some user UEs fail to decode, the UE with the lowest SIR value is selected from the user UEs that failed to decode.
[0182] The decoding result refers to the information obtained by the receiving end (such as user equipment UE) after decoding the received signal in the communication system. In wireless communication, the sending end encodes and modulates the data into a wireless signal and sends it out, and the receiving end needs to demodulate and decode the received signal to restore the original data information.
[0183] Successful decoding means that the receiver successfully recovers the original data from the received signal, which means that the signal quality is good enough and is not affected by serious interference or noise. The decoding algorithm can correctly restore the information sent by the sender.
[0184] Decoding failure means that the receiver cannot correctly recover the original data from the received signal. This may be because the signal is severely interfered with or affected by noise, or the signal strength is too weak, causing the decoding algorithm to fail to work correctly and thus unable to restore the information sent by the sender.
[0185] S904, determining whether the current information processing involves multiple users.
[0186] Because if there is only one user, there is no possibility that the user blocks other users, so there is no need to adjust its pu priority.
[0187] If the information processing involves multiple users, execute S905; otherwise, execute 907.
[0188] S905: Determine whether the Pu priority of the user needs to be adjusted based on the SIR.
[0189] Specifically, when the SIR value of a certain user UE is continuously the lowest for N (eg, N=10) consecutive transmission time intervals, it indicates that the channel quality of the user continues to deteriorate. The system will make adjustments according to the Pu priority of the user UE and execute S906; otherwise, execute 907.
[0190] S906: Adjust the Pu priority of the user UE and update the Pu priority of the user UE.
[0191] Specifically, if the Pu priority of the user UE is already the lowest among all UEs, its Pu priority is maintained unchanged; if the Pu priority of the user UE is not the lowest among all UEs, its Pu priority is lowered, such as by one level (ie, Pu-1).
[0192] When the SIR value of the user UE is no longer the lowest for N consecutive transmission time intervals, the system will increase its user priority, such as restoring its Pu priority, that is, raising its user priority by one level. This mechanism aims to allocate limited DMA resources to users with good channel quality first, thereby improving DMA transmission efficiency and enhancing user experience.
[0193] S907, storing the DMA data transmission request into a corresponding buffer according to the Pt priority.
[0194] For example, when user UEs of various carrier frequencies have DMA data transmission requirements, the corresponding cache is found according to the Pt priority required for transmission, and the DMA data transmission request is stored in the corresponding cache according to the Pt priority. That is, the DMA data transmission request of Pt=0 is stored in the cache corresponding to Pt=0; the DMA data transmission request of Pt=1 is stored in the cache corresponding to Pt=1; the DMA data transmission request of Pt=2 is stored in the cache corresponding to Pt=2; and the DMA data transmission request of Pt=3 is stored in the cache corresponding to Pt=3.
[0195] S908: The cache internally sorts the DMA data transmission requests according to the Pu priority.
[0196] Specifically, after the DMA data transfer request is stored in the corresponding cache, the DMA data transfer request is sorted according to the Pu priority within the cache. The specific method is:
[0197] A pointer linked list is maintained for each cache. The linked list consists of a series of nodes. Each node stores a pointer to a DMA data transfer request and contains a pointer to the next node. When a new DMA data transfer request is stored, the Pu priority of the DMA data transfer request corresponding to each node is traversed from the beginning of the pointer linked list. If the Pu priority of the new DMA data transfer request is greater than the Pu priority of the DMA data transfer request of this node, the new DMA data transfer request node is inserted and the pointer of the corresponding node is modified.
[0198] S909, according to the priority order of Pt, starting from the highest priority, the DMA data transmission requests are taken out from the corresponding cache in sequence to generate DMA instructions.
[0199] Specifically, starting from the cache corresponding to the highest Pt priority (such as Pt=3), the system reads the DMA data transfer requests therein in sequence, and generates corresponding DMA instructions according to the parameters of these DMA data transfer requests to ensure that high-priority DMA data transfer requests are processed in a timely manner.
[0200] S910, when the sequence dependency flag f is 0, the most idle DMA instruction queue is selected by polling for distribution; when f is 1, the DMA instruction is distributed to the same queue as the previous DMA transmission.
[0201] Specifically, the method for selecting a DMA instruction queue ID for a DMA instruction is as follows:
[0202] For DMA data transfer requests with a sequence dependency flag f of 0, the system polls each DMA instruction queue, calculates and selects the queue with the least number of instructions to be distributed (i.e., the idlest queue), records the queue ID, and queues the DMA instruction. For DMA data transfer requests with a sequence dependency flag f of 1, the system needs to ensure that these instructions are assigned to the same DMA instruction queue due to the sequence dependency. If the sequence dependency flag f of the previous DMA data transfer request is 0, the system queries and records the queue ID according to the polling method; if the sequence dependency flag f of the previous DMA data transfer request is 1, the current DMA data transfer request is distributed to the same queue as the previous one to maintain the execution order of the instructions.
[0203] The system will not turn to the low-priority cache to read and distribute DMA data transfer requests until all DMA data transfer requests in the cache corresponding to the high Pt priority are distributed. For example, when all DMA data transfer requests in the cache corresponding to Pt=3 are distributed, the system will read and distribute DMA data transfer requests from the caches corresponding to Pt=2 and Pt=1 in turn, and finally perform the same operation from the cache corresponding to Pt=0. This process will continue to loop to ensure that DMA data transfer requests of all priorities can be processed.
[0204] S911, the DMA controller takes out the DMA instruction from the DMA instruction queue, distributes it to the DMA engine and executes it.
[0205] Embodiment 4:
[0206] Please refer to Fig.10 , is a schematic diagram of DMA transmission provided in Embodiment 4 of the present application. In this embodiment, the system is configured with two carrier frequencies and four user UEs, and faces the problem of excessive DMA transmission demand of high-priority users. The solution is as follows:
[0207] Please refer to Fig.11 , Fig.11 1 is a flow chart of a data transmission method provided in Embodiment 4 of the present application. A data transmission method includes:
[0208] S1101, initializing the Pt priority of different service types transmitted on each carrier frequency.
[0209] For example, according to the specific scenario requirements, the system initializes the Pt priority of each carrier frequency for different service data types, Pt = 0 to 3, and allocates a corresponding cache for each Pt priority level, that is, 4 caches, each cache corresponding to a Pt priority.
[0210] S1102, the physical layer receives the user configuration information sent by the MAC layer, and identifies the Pu priority of the user.
[0211] Specifically, the MAC layer passes the user UE's Pu priority and other related configuration information to the physical layer. After receiving this configuration information, the physical layer can identify and process the specific level of the user's Pu priority to ensure appropriate resource allocation and service quality assurance for users of different priorities at the physical layer.
[0212] S1103, each cell performs channel estimation, calculates the signal to interference ratio, and fine-tunes the Pu priority according to the channel quality.
[0213] Specifically, in each transmission time interval, the system performs the following operations according to the decoding result and SIR value of the user UE:
[0214] 1) If all user UEs are decoded correctly, the UE with the lowest SIR value is selected;
[0215] 2) If all user UEs fail to decode, the UE with the lowest SIR value is also selected;
[0216] 3) If some user UEs decode successfully and some user UEs fail to decode, then the UE with the lowest SIR value is selected from the user UEs that failed to decode.
[0217] When the SIR value of a selected user UE is continuously the lowest for N (for example, N=10) consecutive transmission time intervals, it indicates that the channel quality of the user continues to deteriorate. At this time, the system will make adjustments based on the Pu priority of the user UE:
[0218] 1) If the Pu priority of the user UE is already the lowest among all UEs, its Pu priority is maintained unchanged;
[0219] 2) If the Pu priority of the user UE is not the lowest among all UEs, then its Pu priority is lowered, for example, by one level (ie, Pu-1).
[0220] When the SIR value of the selected user UE is no longer the lowest for N consecutive transmission time intervals, the system will increase its user priority, such as restoring its Pu priority, that is, raising it by one level. This mechanism is designed to allocate limited DMA resources to users with good channel quality first, thereby improving DMA transmission efficiency and enhancing user experience.
[0221] S1104, storing the DMA data transmission request into a corresponding buffer according to the Pt priority.
[0222] For example, when user UEs of various carrier frequencies have DMA data transmission requirements, the corresponding cache is found according to the Pt priority required for transmission, and the DMA data transmission request is stored in the corresponding cache according to the Pt priority. That is, the DMA data transmission request of Pt=0 is stored in the cache corresponding to Pt=0; the DMA data transmission request of Pt=1 is stored in the cache corresponding to Pt=1; the DMA data transmission request of Pt=2 is stored in the cache corresponding to Pt=2; and the DMA data transmission request of Pt=3 is stored in the cache corresponding to Pt=3.
[0223] S1105: The cache internally sorts the DMA data transmission requests according to the Pu priority.
[0224] Specifically, after the DMA data transfer request is stored in the corresponding cache, the DMA data transfer request is sorted according to the Pu priority within the cache. The specific method is:
[0225] Maintain a linked list of pointers for each cache. The linked list consists of a series of nodes. The content stored in each node is a pointer to a DMA data transfer request and includes a pointer to the next node. When a new DMA data transfer request is stored, traverse the linked list starting from the beginning to find the Pu priority of the DMA data transfer request corresponding to each node. If the Pu priority of the new DMA data transfer request is greater than the Pu priority of the DMA data transfer request of this node, insert the new DMA data transfer request node and modify the pointers of the corresponding nodes.
[0226] S1106, calculate the ratio W of the DMA transfer demand to be distributed with high priority to the DMA transfer demand to be distributed with low priority.
[0227] For example, in every T (e.g., T = 10) transfer time intervals, the system counts the DMA data transfer requests to be distributed in each cache and calculates the ratio W of the DMA transfer demand to be distributed with high priority (Pt >= M / 2) to the DMA transfer demand to be distributed with low priority (Pt < M / 2). Taking Pt = 0 to 3 (i.e., M = 4) in this embodiment as an example, Pt = 0 and Pt = 1 are low priorities, and Pt = 2 and Pt = 3 are high priorities. Let the DMA data transfer request quantities to be distributed corresponding to Pt = 0, Pt = 1, Pt = 2, and Pt = 3 be S0, S1, S2, and S3 respectively. Then the total quantity S_low to be distributed with low priority = S0 + S1, and the total quantity S_high to be distributed with high priority = S2 + S3. The ratio W of the DMA transfer demand to be distributed with high priority to the DMA transfer demand to be distributed with low priority = S_high / S_low = (S2 + S3) / (S0 + S1). For example, if S0 = 2, S1 = 4, S2 = 12, and S3 = 18, then W = 5:1. This ratio W will be used to adjust the DMA transfer priority weight in the subsequent steps.
[0228] S1107, determine whether the value of W = S_high / S_low is greater than or equal to the threshold.
[0229] If the value of W = S_high / S_low is greater than or equal to the threshold, execute S1108; otherwise, execute S1110.
[0230] S1108, calculate the Pt priority weight wt and allocate the distribution times N_pt of the DMA data transfer requests for each cache.
[0231] For example, to prevent the high-priority DMA data transfer request from being unable to be executed for a long time due to excessive high-priority DMA data transfer demand, the system is set to calculate the DMA transfer weights wt of each priority level according to the ratio of W when the DMA transfer demand ratio W exceeds the threshold value (for example, the threshold value in this embodiment is 5:1), and allocate the number of DMA data transfer request distribution times N_pt to each cache accordingly. For example, if wt = S3: S2: S1: S0 = 9: 6: 2: 1, then the number of DMA data transfer request distribution times N_pt3 allocated to the Pt = 3 cache is 9; the number of DMA data transfer request distribution times N_pt2 allocated to the Pt = 2 cache is 6; the number of DMA data transfer request distribution times N_pt1 allocated to the Pt = 1 cache is 2; the number of DMA data transfer request distribution times N_pt0 allocated to the Pt = 0 cache is 1.
[0232] S1109, according to the priority order of Pt priority, starting from the highest priority, DMA data transfer requests are taken out from each cache in turn according to the allocated distribution times, and DMA instructions are generated and distributed.
[0233] For example, the system takes out 9 DMA data transfer requests from the highest priority (Pt=3) cache in order of priority, generates and distributes DMA instructions; then takes out 6 DMA data transfer requests from the second highest priority (Pt=2) cache, performs the same operation; then takes out 2 DMA data transfer requests from the higher priority (Pt=1) cache; finally, takes out 1 DMA data transfer request from the low priority (Pt=0) cache. This process is repeated to ensure that DMA data transfer requests of each priority have the opportunity to be responded to.
[0234] S1110, according to the priority order of Pt, starting from the highest priority, DMA data transmission requests are taken out from the corresponding cache in sequence to generate DMA instructions.
[0235] Specifically, starting from the cache corresponding to the highest Pt priority (such as Pt=3), the system reads the DMA data transfer requests therein in sequence, and generates corresponding DMA instructions according to the parameters of these DMA data transfer requests to ensure that high-priority DMA data transfer requests are processed in a timely manner.
[0236] S1111, when the sequence dependency flag f is 0, the most idle DMA instruction queue is selected by polling for distribution; when f is 1, the DMA instruction is distributed to the same queue as the previous DMA transfer.
[0237] Specifically, the method for selecting a DMA instruction queue ID for a DMA instruction is as follows:
[0238] For DMA data transfer requests with a sequence dependency flag f of 0, the system polls each DMA instruction queue, calculates and selects the queue with the least number of instructions to be distributed (i.e., the idlest queue), records the queue ID, and queues the DMA instruction. For DMA data transfer requests with a sequence dependency flag f of 1, the system needs to ensure that these instructions are assigned to the same DMA instruction queue due to the sequence dependency. If the sequence dependency flag f of the previous DMA data transfer request is 0, the system queries and records the queue ID according to the polling method; if the sequence dependency flag f of the previous DMA data transfer request is 1, the current DMA data transfer request is distributed to the same queue as the previous one to maintain the execution order of the instructions.
[0239] The system will not turn to the low-priority cache to read and distribute DMA data transfer requests until all DMA data transfer requests in the cache corresponding to the high Pt priority are distributed. For example, when all DMA data transfer requests in the cache corresponding to Pt=3 are distributed, the system will read and distribute DMA data transfer requests from the caches corresponding to Pt=2 and Pt=1 in turn, and finally perform the same operation from the cache corresponding to Pt=0. This process will continue to loop to ensure that DMA data transfer requests of all priorities can be processed.
[0240] S1112, the DMA controller takes out the DMA instruction from the DMA instruction queue, distributes it to the DMA engine and executes it.
[0241] In summary, in the above-mentioned embodiments 1 to 4:
[0242] One embodiment focuses on a data transmission method when the order dependency flag f is 0, which solves the problem of how to efficiently allocate and schedule DMA resources when there is no order dependency during data transmission. By polling each DMA instruction queue, the system can identify and select the most idle queue for data instruction distribution, thereby optimizing resource utilization and transmission efficiency.
[0243] Embodiment 2 is a data transmission method with a sequence dependency flag f of 1. This method solves the problem of how to ensure that instructions are executed in a predetermined order when there is sequence dependency in data transmission. The system ensures the continuity and correctness of instructions by allocating related instructions to the same DMA instruction queue, thus avoiding transmission errors caused by disordered order.
[0244] Example 3 introduces a data transmission method for adjusting the user Pu priority based on SIR channel deterioration. This method solves the problem of how to dynamically adjust the user priority to optimize resource allocation when the user channel quality deteriorates. By monitoring the user's SIR value in real time, the system can identify users whose channel quality continues to deteriorate and adjust their Pu priority accordingly, ensuring that limited DMA resources are preferentially allocated to users with good channel quality, thereby improving overall transmission efficiency and user experience.
[0245] Embodiment 4 focuses on a data transmission method with excessive high-priority transmission demand. This method solves the problem of how to balance the needs of users of different priorities when the DMA transmission demand of high-priority users is too large. The system calculates the ratio of high-priority to low-priority DMA transmission demands to be distributed, and adjusts the DMA transmission weight accordingly, ensuring that low-priority users can get appropriate responses even in the case of unbalanced demands, thereby improving the fairness and efficiency of the system.
[0246] The data transmission device provided in the present application is described below. The data transmission device described below and the data transmission method described above can be referenced to each other.
[0247] Please refer to Fig.12 , Fig.12 A data transmission device 1200 , applied to a network side, includes a receiving module 1210 , an allocating module 1220 , and a scheduling module 1230 .
[0248] Exemplarily, the receiving module 1210 is used to receive a data transmission request from a user side, and each data transmission request carries configuration information and a service type identifier.
[0249] Exemplarily, the allocation module 1220 is used to assign a user priority to each received data transmission request based on its configuration information, and assign a business priority based on its business type; and store the data transmission request in a cache that matches its business priority, each business priority corresponding to a cache.
[0250] Exemplarily, the scheduling module 1230 is used to sort the stored data transmission requests according to user priority within each cache, and perform orderly distribution on each data transmission request according to the service priority and the user priority.
[0251] Exemplarily, the scheduling module 1230 is further used for:
[0252] A sequence dependency flag is configured for each data transmission request, and the sequence dependency flag is used to identify whether there is a dependency relationship between the current data transmission request of the current user on the current carrier frequency and the previous data transmission request thereof in terms of execution sequence;
[0253] On the premise that the user priority and the service priority are the same, if there is an execution order dependency between the current data transmission request and the previous data transmission request, the current data transmission request will be distributed to the same data instruction queue as the previous data transmission request.
[0254] Exemplarily, the scheduling module 1230 is further used for:
[0255] If there is no execution order dependency between the current data transmission request and the previous data transmission request, each data instruction queue is polled, the number of data instructions queued to be distributed in each data instruction queue is calculated and compared, and then the data instruction queue with the least number of data instructions to be distributed is selected, and the data instructions generated by this data transmission request are added to the selected data instruction queue.
[0256] Exemplarily, the scheduling module 1230 is further used for:
[0257] Continuously monitor the communication quality of the user side channel, and dynamically adjust the corresponding user priority for data transmission requests whose channel communication quality is continuously lower than a preset threshold within a continuous preset transmission time interval;
[0258] Each data transmission request is assigned to a corresponding data transmission instruction queue according to the service priority and the adjusted user priority.
[0259] Exemplarily, the scheduling module 1230 is further used for:
[0260] If the decoding results of all users on the user side are correct, the user with the lowest signal-to-interference ratio is selected; if the decoding results of all users on the user side fail, the user with the lowest signal-to-interference ratio is selected; if some users on the user side decode successfully and some users fail to decode, the user with the lowest interference ratio is selected from the users who failed to decode;
[0261] For the selected user with the lowest signal-to-interference ratio, if its user priority is already the lowest level among all users, its priority will be kept unchanged; otherwise, its user priority will be lowered.
[0262] Exemplarily, the scheduling module 1230 is further used for:
[0263] When the signal to interference ratio of a user whose user priority has been lowered is no longer at the lowest level within a continuous preset transmission time interval, the user priority of the user is raised.
[0264] Exemplarily, the scheduling module 1230 is further used for:
[0265] Continuously monitor the data transmission request status in each cache, and regularly count the number of data transmission requests to be distributed in each cache according to a preset time interval, and calculate the ratio of high priority to low priority data transmission requests to be distributed based on the statistical results;
[0266] If the ratio is greater than or equal to a preset threshold value, a preset dynamic adjustment mechanism is executed to achieve a balance in processing data transmission requests of different priorities.
[0267] Exemplarily, the scheduling module 1230 is further used for:
[0268] If the ratio of high-priority to low-priority data transmission requests to be distributed is greater than or equal to a preset threshold, the weight of the service priority corresponding to each cache is calculated, and based on the weight, the corresponding number of data transmission request distribution times is allocated to each cache;
[0269] In order of business priority, starting from the highest priority cache, the distribution times allocated to each cache are obtained, and the corresponding times of data transmission requests are extracted from the current cache in turn to generate data instructions.
[0270] Exemplarily, the configuration information includes at least one of train attributes, train schedule, seat type and map information.
[0271] Exemplarily, the data transmission request is defined as a structure that includes at least one or more of a transmission type, a source address, a destination address, a data length, a carrier identifier, a user identifier, a user priority, a service priority, a sequence dependency flag, and a data transmission instruction queue identifier.
[0272] Exemplarily, the scheduling module 1230 is further used for:
[0273] When a new data transmission request enters the cache, obtain its associated user priority;
[0274] Starting from the head of the linked list, compare the user priority of the new request with the user priority of the first node in the linked list;
[0275] If the user priority of the new request is higher than the user priority of the current node, the traversal will continue backward along the linked list; if the user priority of the new request is lower than or equal to the user priority of the current node, the current node position will be determined as the insertion point of the new request;
[0276] At the determined insertion point position, a new data transmission request node is inserted, and the pointer relationship between the nodes before and after the insertion point is adjusted accordingly.
[0277] Exemplarily, the service priorities include a first service priority, a second service priority, a third service priority and a fourth service priority from low to high levels; among them, data transmission responsible for transmission time interval synchronization messages of the media access control layer and the physical layer is assigned the highest fourth service priority; user terminal data transmission on a physical uplink shared channel that requires the establishment of a wireless resource control connection request service has its priority set to the third service priority; all user terminal data transmissions belonging to a physical random access channel and a physical uplink control channel of semi-static scheduling have their priority set to the second service priority; data transmission of other service types has its priority set to the lowest first service priority.
[0278] In some embodiments, the present application further provides a data transmission method, which is applied to a user side and includes:
[0279] S1310: Send a data transmission request to the network side, where the data transmission request carries configuration information and a service type identifier.
[0280] S1320, receiving the current channel quality and priority list fed back by the network side, the priority list including user priority and service priority, wherein the user priority is allocated by the network side according to the configuration information of its data transmission request, and the service priority is determined according to its service type, so that the network side stores the data transmission request in a cache matching its service priority, each service priority corresponds to a cache, and within each cache, the network side sorts the stored data transmission requests according to the user priority, and performs orderly distribution for each data transmission request in combination with the service priority and the user priority.
[0281] For example, please refer to Fig.13 , Fig.13 It is a schematic diagram of the communication between the network side and the user side provided in this application. The data transmission method also includes: the user side implements scheduling management for users of different priorities based on the channel quality information and priority list information fed back by the network side to give priority to meeting the resource scheduling needs of high-priority users.
[0282] That is to say, the user side (such as high-speed rail) will use the priority list information provided by the network side (such as base stations) to perform resource scheduling management. In this process, the user side will give priority to and meet the resource needs of those users or services with high priority. Specifically, when the network side feeds back channel quality information and a list of user priorities and service priorities to the user side, the user side will decide how to allocate and use available resources, such as bandwidth, processing power, etc., based on the list. High-priority users or services will receive more resources to ensure that they can get better service quality and faster response speed. This scheduling management strategy helps to ensure that critical tasks and important users receive priority support when resources are limited, thereby improving overall network performance and service quality.
[0283] In some embodiments, the present application further provides a data transmission method, which is applied to a user side and includes a sending module and a receiving module, wherein:
[0284] A sending module, used to send a data transmission request to the network side, where the data transmission request carries configuration information and a service type identifier;
[0285] A receiving module is used to receive the current channel quality and priority list fed back by the network side, the priority list including user priority and service priority, wherein the user priority is allocated by the network side according to the configuration information of its data transmission request, and the service priority is determined according to its service type, so that the network side stores the data transmission request in a cache matching its service priority, each service priority corresponds to a cache, and within each cache, the network side sorts the stored data transmission requests according to the user priority, and performs orderly distribution for each data transmission request in combination with the service priority and the user priority.
[0286] It should be noted here that the above-mentioned question block division device provided in the embodiment of the present application can implement all the method steps implemented in the above-mentioned method embodiment, and can achieve the same technical effect. The parts and beneficial effects of this embodiment that are the same as those in the method embodiment will not be described in detail here.
[0287] Fig.14 is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application, such as Fig.14 As shown, the electronic device may include: a processor (Processor) 1410, a communication interface (Communications Interface) 1420, a memory (Memory) 1430 and a communication bus 1440, wherein the processor 1410, the communication interface 1420, and the memory 1430 communicate with each other through the communication bus 1440. The processor 1410 may call the logic instructions in the memory 1430 to execute the data transmission method.
[0288] In addition, the logic instructions in the above-mentioned memory 1430 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art, and the computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk.
[0289] On the other hand, the present application also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the data transmission method provided by the above methods.
[0290] On the other hand, the present application also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the computer program is executed by a processor to perform the data transmission method provided above.
[0291] The embodiments of the present application provide an electronic device, a computer program product, and a processor-readable storage medium, on which the computer program stored enables the processor to implement all the method steps implemented in the above-mentioned method embodiments and to achieve the same technical effects. The parts and beneficial effects of this embodiment that are the same as those in the method embodiments will not be described in detail herein.
[0292] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.
[0293] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.
[0294] The above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application.
Claims
1. A data transmission method, characterized in that: Applied to the network side, including: Receive a data transmission request from a user side, each data transmission request carries configuration information and a service type identifier; For each received data transmission request, assign a user priority according to its configuration information and assign a service priority according to its service type; and store the data transmission request in a cache matching its service priority, each service priority corresponding to a cache; The stored data transmission requests are sorted by user priority within each cache, and each data transmission request is distributed in an orderly manner according to the business priority and user priority.
2. The data transmission method according to claim 1, characterized in that: Also includes: A sequence dependency flag is configured for each data transmission request, and the sequence dependency flag is used to identify whether there is a dependency relationship between the current data transmission request of the current user on the current carrier frequency and the previous data transmission request thereof in terms of execution sequence; On the premise that the user priority and the service priority are the same, if there is an execution order dependency between the current data transmission request and the previous data transmission request, the current data transmission request will be distributed to the same data instruction queue as the previous data transmission request.
3. The data transmission method according to claim 2, characterized in that: Also includes: If there is no execution order dependency between the current data transmission request and the previous data transmission request, each data instruction queue is polled, the number of data instructions queued to be distributed in each data instruction queue is calculated and compared, and then the data instruction queue with the least number of data instructions to be distributed is selected, and the data instructions generated by this data transmission request are added to the selected data instruction queue.
4. The data transmission method according to claim 1, characterized in that: Also includes: Continuously monitor the communication quality of the user side channel, and dynamically adjust the corresponding user priority for data transmission requests whose channel communication quality is continuously lower than a preset threshold within a continuous preset transmission time interval; Each data transmission request is assigned to a corresponding data transmission instruction queue according to the service priority and the adjusted user priority.
5. The data transmission method according to claim 4, characterized in that: Also includes: If the decoding results of all users on the user side are correct, the user with the lowest signal-to-interference ratio is selected; if the decoding results of all users on the user side fail, the user with the lowest signal-to-interference ratio is selected; if some users on the user side decode successfully and some users fail to decode, the user with the lowest interference ratio is selected from the users who failed to decode; For the selected user with the lowest signal-to-interference ratio, if its user priority is already the lowest level among all users, its priority will be kept unchanged; otherwise, its user priority will be lowered.
6. The data transmission method according to claim 5, characterized in that: Also includes: When the signal to interference ratio of a user whose user priority has been lowered is no longer at the lowest level within a continuous preset transmission time interval, the user priority of the user is raised.
7. The data transmission method according to claim 1, characterized in that: Also includes: Continuously monitor the data transmission request status in each cache, and regularly count the number of data transmission requests to be distributed in each cache according to a preset time interval, and calculate the ratio of high priority to low priority data transmission requests to be distributed based on the statistical results; If the ratio is greater than or equal to a preset threshold value, a preset dynamic adjustment mechanism is executed to achieve a balance in processing data transmission requests of different priorities.
8. The data transmission method according to claim 7, characterized in that: Also includes: If the ratio of high-priority to low-priority data transmission requests to be distributed is greater than or equal to a preset threshold, the weight of the service priority corresponding to each cache is calculated, and based on the weight, the corresponding number of data transmission request distribution times is allocated to each cache; In order of business priority, starting from the highest priority cache, the distribution times allocated to each cache are obtained, and the corresponding times of data transmission requests are extracted from the current cache in turn to generate data instructions.
9. The data transmission method according to claim 1, characterized in that: The configuration information includes at least one of train attributes, train schedule, seat type and map information.
10. The data transmission method according to claim 1, characterized in that: The data transmission request is defined as a structure that includes at least one or more of a transmission type, a source address, a destination address, a data length, a carrier identifier, a user identifier, a user priority, a service priority, a sequence dependency flag, and a data transmission instruction queue identifier.
11. The data transmission method according to claim 1, characterized in that: The step of performing user priority sorting on the stored data transmission requests within each cache comprises: When a new data transmission request enters the cache, obtain its associated user priority; Starting from the head of the linked list, compare the user priority of the new request with the user priority of the first node in the linked list; If the user priority of the new request is higher than the user priority of the current node, the traversal will continue backward along the linked list; if the user priority of the new request is lower than or equal to the user priority of the current node, the current node position will be determined as the insertion point of the new request; At the determined insertion point position, a new data transmission request node is inserted, and the pointer relationship between the nodes before and after the insertion point is adjusted accordingly.
12. The data transmission method according to claim 1, characterized in that: The service priorities include a first service priority, a second service priority, a third service priority and a fourth service priority from low to high levels; among them, data transmission responsible for transmission time interval synchronization messages of the media access control layer and the physical layer is assigned the highest fourth service priority; user terminal data transmission on the physical uplink shared channel that requires the establishment of a wireless resource control connection request service is prioritized as the third service priority; all user terminal data transmission belonging to the physical random access channel and the physical uplink control channel of semi-static scheduling is prioritized as the second service priority; data transmission of other service types is prioritized as the lowest first service priority.
13. A data transmission device, characterized in that: Applied to the network side, including: A receiving module, used to receive a data transmission request from a user side, each data transmission request carries configuration information and a service type identifier; an allocation module, for assigning a user priority to each received data transmission request according to its configuration information and a service priority according to its service type; and storing the data transmission request in a cache matching its service priority, each service priority corresponding to a cache; The scheduling module is used to sort the stored data transmission requests according to user priority within each cache, and to perform orderly distribution of each data transmission request according to business priority and user priority.
14. A data transmission method, characterized in that: Applied to the user side, including: Sending a data transmission request to the network side, the data transmission request carrying configuration information and a service type identifier; Receive the current channel quality and priority list fed back by the network side, where the priority list includes user priority and service priority, where the user priority is assigned by the network side based on the configuration information of its data transmission request, and the service priority is determined based on its service type, so that the network side stores the data transmission request in a cache that matches its service priority. Each service priority corresponds to a cache. Within each cache, the network side sorts the stored data transmission requests based on the user priority, and performs orderly distribution for each data transmission request in combination with the service priority and user priority.
15. The data transmission method according to claim 14, characterized in that: Also includes: According to the priority list information provided by the network side, scheduling management is implemented for users of different priorities to give priority to meeting the resource scheduling needs of high-priority users.
16. A data transmission method, characterized in that: Applied to the user side, including: A sending module, used to send a data transmission request to the network side, where the data transmission request carries configuration information and a service type identifier; A receiving module is used to receive the current channel quality and priority list fed back by the network side, the priority list including user priority and service priority, wherein the user priority is allocated by the network side according to the configuration information of its data transmission request, and the service priority is determined according to its service type, so that the network side stores the data transmission request in a cache matching its service priority, each service priority corresponds to a cache, and within each cache, the network side sorts the stored data transmission requests according to the user priority, and performs orderly distribution for each data transmission request in combination with the service priority and the user priority.
17. An electronic device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the steps of the data transmission method according to any one of claims 1 to 12 are implemented.
18. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the data transmission method according to any one of claims 1 to 12 are implemented.
Citation Information
Cited By
Method, medium, device and product for data transmission
CN120256350A
Method, medium, device and product for data transmission
CN120256350B
