Multi-user multi-terminal time slot allocation method and system
Through the tree-shaped hierarchical data structure and multi-priority scheduling strategy, time slot resources are dynamically allocated in a multi-user and multi-terminal communication system, the problems of low resource utilization and unfair allocation are solved, and efficient resource management and multi-level distinction services are realized. , improving system performance and user experience.
Patent Information
- Application Number
- CN202410828657.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-25
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2044-06-25
AI Technical Summary
The existing time slot allocation method has problems such as low resource utilization, unfair resource allocation, large communication delay, and insufficient multi-layer distinction services in multi-user and multi-terminal communication systems, which is difficult to meet the needs of users of different levels.
The tree-shaped hierarchical data structure and multi-priority scheduling strategy are adopted to dynamically allocate time slot resources through hierarchical scheduling and token bucket algorithms to ensure the rational use of resources and the guarantee of different service levels.
It improves resource utilization and communication service quality, enhances system flexibility and performance, ensures fairness and adaptability of resource allocation, and improves user experience and system performance.
Smart Images

Figure CN118524068B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of satellite communication technology, in particular to a multi-user multi-terminal time slot allocation method and system. Background Art
[0002] There is no existing time slot allocation scheme designed for this multi-user multi-terminal communication system. Currently, common technologies such as TDMA (time division multiple access) and CDMA (code division multiple access) are used to implement time slot allocation. In these schemes, time slots are usually allocated to each terminal in advance or dynamically allocated according to a certain algorithm. These methods have some defects:
[0003] Fixed allocation or static allocation: Some solutions use a fixed time slot allocation method, that is, allocating time slots to each terminal in advance, which may lead to low resource utilization, especially when the number of terminals and communication load vary greatly. Other solutions use a static dynamic allocation method, but lack the ability to respond to dynamic changes in the system in real time.
[0004] Resource allocation fairness: In a multi-user and multi-terminal communication system, ensuring the fairness of resource allocation is also an important issue. Existing methods may have unfair resource allocation, that is, some users or terminals may occupy a large amount of communication resources for a long time, resulting in the communication needs of other users or terminals not being met.
[0005] Long delay: Some existing solutions fail to fully consider the communication delay when allocating time slots, which may cause long communication delays for some terminals, affecting user experience and system performance.
[0006] Multi-layer differentiated services: In a multi-user multi-terminal communication system, there are usually different levels of users or terminals, and their requirements for communication resources may be different. For example, some users may need real-time communication services with low latency, while others may have higher bandwidth requirements but less stringent latency requirements. Existing methods may not be sophisticated or flexible enough to differentiate the service quality of users of different levels.
[0007] In summary, the existing time slot allocation technology for multi-user and multi-terminal communication systems, in addition to considering issues such as time slot allocation flexibility, resource utilization and communication delay, also needs to solve challenges such as multi-layer differentiated services, service quality assurance and resource allocation fairness, so as to improve the performance of the overall communication system and user experience. Summary of the invention
[0008] In order to solve the problems existing in the prior art, the purpose of the present invention is to provide a multi-user multi-terminal time slot allocation method and system, which optimizes the performance of the communication system and the user experience.
[0009] To achieve the above object, the technical solution adopted by the present invention is: a multi-user multi-terminal time slot allocation method, comprising the following steps:
[0010] Step 1, initialization and configuration: When the system starts, initialize the scheduler and start preparing the scheduling task; divide the scheduling level into layers according to the preset configuration information, and build a tree-like hierarchical data structure. From the low layer to the high layer, they are service type, terminal layer and user layer. Each node in each layer represents a user, terminal or service type, and the service type node is a leaf node, which stores the actual time slot resource request information;
[0011] Step 2: Hierarchical scheduling: The scheduling work is carried out according to the hierarchical structure, traversing from the lowest level to the highest level, processing the lowest level first, and then gradually traversing to the upper levels;
[0012] Step 3, node processing: In each level, the scheduler prioritizes the activated leaf nodes with the highest priority, which store the time slot request information of the terminal's service type data; if the time slot request of the current node is zero, it means that the node is not used, and the scheduler removes it from the scheduling queue and updates the status of the current level for subsequent scheduling; then, continue to search for the next node until a node with a time slot request is found;
[0013] Step 4, scheduling end condition: When a node's time slot request is not zero, the scheduler will allocate a time slot to the node and check whether the node's quota can still support continued scheduling; if the quota is insufficient, the scheduler will reset the node's quota and start scheduling the next node of the same priority; if the node's request is fully allocated, the scheduler will mark it as completed and update the node status according to the token bucket algorithm; the scheduling end condition is that all levels of scheduling are completed, or the time slot resources have been fully allocated; if the end condition is not met, the scheduler will continue to return to the hierarchical scheduling point to continue scheduling until the end condition is met.
[0014] As a further improvement of the present invention, in step 1, in the tree-like hierarchical data structure, the sum of the bandwidth of each child node is less than or equal to the bandwidth of its parent node. If a node does not occupy bandwidth resources, nodes at the same level can borrow bandwidth from each other; and different node priorities are defined for nodes at different levels.
[0015] As a further improvement of the present invention, in step 2, if the current level is not the lowest level, it means that this scheduling is in a borrowing mode, and it is necessary to search for available resources in the lower levels.
[0016] As a further improvement of the present invention, in step 4, updating the node state according to the token bucket algorithm specifically includes:
[0017] Assume that the rate of bucket P is greater than the rate of bucket C;
[0018] When the P bucket token of a node is less than the threshold, it means that the peak rate has been reached and the node cannot schedule time slot resources, and it is colored red;
[0019] When the tokens in bucket C are greater than the threshold and the tokens in bucket P are less than the threshold, it means that there are still tokens in bucket P, but there are no tokens in bucket C. Therefore, the committed rate is exceeded but the peak rate is not exceeded. The data can be sent and will be colored yellow.
[0020] When the number of tokens in bucket C is less than the threshold, it means that there are still tokens in bucket C and bucket P, which can be sent and will be colored green.
[0021] Each time a time slot resource is scheduled, the color of the current node needs to be updated according to the token bucket algorithm, and the number of tokens in its parent node needs to be recursively updated. The color of the node is used to determine whether to deactivate the node and remove it from the scheduling queue.
[0022] The present invention also provides a multi-user multi-terminal time slot allocation system, which is used to implement the multi-user multi-terminal time slot allocation method as described above, and the system comprises:
[0023] User terminal management module: used to manage all user terminal devices in the system, including adding, deleting, and updating, to ensure that the communication needs of each terminal can be effectively identified;
[0024] Terminal demand analysis module: Analyzes the communication needs of each terminal based on the rate information applied by the terminal, including information on communication quality requirements, service priority, and bandwidth requirements;
[0025] Data classification module: IP data is classified and associated with the corresponding terminal. Then, according to the classification rules configured on the terminal, different priorities, service levels, rates, and delay requirements are distinguished to facilitate subsequent multi-layer service scheduling and time slot allocation.
[0026] Multi-layer service scheduling module: according to the terminal information provided by the user terminal management module and the rate demand information provided by the terminal demand analysis module, it schedules data of different service levels or priorities to realize multi-layer differentiated services;
[0027] Time slot allocation module: According to the scheduling results provided by the multi-layer service scheduling module, dynamically allocate communication time slot resources to each terminal to meet the communication needs of different terminals, ensure service quality and improve the utilization of communication resources.
[0028] Optimize resource utilization: Through the tree-structured scheduling scheme, the present invention can manage and allocate communication resources more flexibly to ensure the rational use of resources. The total bandwidth of each node cannot exceed that of its parent node, and nodes can borrow bandwidth from each other, thereby maximizing resource utilization.
[0029] Improve communication service quality: Adopting multi-layer differentiated services and multi-priority scheduling strategies can effectively guarantee the communication quality of different service levels or priorities. The business layer has the highest priority, followed by the terminal layer, and so on, ensuring that the communication needs of key services or high-priority users are met in a timely manner.
[0030] Enhanced system flexibility: The tree-structure scheduling scheme adopted in the present invention is flexible and can dynamically adjust the scheduling structure and priority settings according to system and user requirements to adapt to different scenarios and application requirements.
[0031] Improve communication system performance: By optimizing resource utilization and improving communication service quality, the present invention can significantly improve the overall performance of the communication system. The communication system can maintain stable performance while meeting more user and business needs.
[0032] Ensure fairness in resource allocation: The tree-structure scheduling scheme and multi-priority scheduling strategy are adopted to ensure fairness in resource allocation and prevent some users or terminals from occupying a large amount of resources for a long time and affecting the communication services of other users.
[0033] Strong adaptability: Since this technical solution has a clear structure and clear scheduling logic, it has strong adaptability and can flexibly respond to multi-user and multi-terminal communication systems of different scales and complexities, as well as different communication environments and scenario requirements.
[0034] The beneficial effects of the present invention are:
[0035] The present invention achieves an improvement in the performance of the communication system by optimizing resource utilization, improving the quality of communication services, and enhancing system flexibility, and brings significant effects and advantages to the development and application of multi-user multi-terminal communication systems. BRIEF DESCRIPTION OF THE DRAWINGS
[0036] Figure 1 A flowchart of time slot scheduling in an embodiment of the present invention;
[0037] Figure 2 is a scheduling relationship diagram in an embodiment of the present invention;
[0038] Figure 3 A node coloring graph in an embodiment of the present invention;
[0039] Figure 4 4 is a system block diagram of an embodiment of the present invention. DETAILED DESCRIPTION
[0040] The embodiments of the present invention are described in detail below with reference to the accompanying drawings.
[0041] Example
[0042] like Figure 1 As shown, a MF-TDMA multi-user multi-terminal time slot allocation method, wherein the scheduling method steps are as follows:
[0043] 1. Initialization and configuration: When the system starts, the scheduler is initialized and begins to prepare for scheduling tasks. During this process, the system builds a tree-like data structure based on the preset configuration information, and each node represents a user, terminal or service type. Among these nodes, service type nodes play a special role. They are leaf nodes that store actual time slot resource request information.
[0044] 2. Hierarchical scheduling: Scheduling is done in a hierarchical structure, traversing from low to high levels. The lowest level is processed first, and then gradually moves downwards. If the current level is not the lowest level, it means that this scheduling is in borrowing mode, and it is necessary to look for available resources in the lower levels.
[0045] 3. Node processing: In each level, the scheduler gives priority to the activated leaf nodes with the highest priority. These nodes store the time slot request information of the terminal's business type data. If the time slot request of the current node is zero, it means that the node is not used. The scheduler will activate it and update the status of the current level for subsequent scheduling. Then, continue to search for the next node until a node with a time slot request is found.
[0046] 4. Scheduling end condition: When a node's time slot request is not zero, the scheduler will allocate a time slot to the node and check whether the node's quota can still support continued scheduling. If the quota is insufficient, the scheduler will reset the node's quota and start scheduling the next node of the same priority. If the node's request is fully allocated, the scheduler will mark it as completed and update the node status according to the token bucket algorithm. The condition for the end of scheduling can be that all levels of scheduling are completed, or that all time slot resources have been allocated. If the end condition is not met, the scheduler will continue to return to the hierarchical scheduling point and continue scheduling until the end condition is met.
[0047] like Figure 2As shown, the MF-TDMA multi-user multi-terminal time slot allocation method, this embodiment introduces a tree-structured scheduling scheme, and divides the system scheduling level into four layers: resource layer, user layer, terminal layer and service layer. The scheduling order is from the service layer to the resource layer, ensuring that the service layer has the highest priority, followed by the terminal layer, and so on. In this structure, the sum of the bandwidth of each child node cannot exceed the bandwidth of its parent node. If a node does not occupy bandwidth resources, the nodes can borrow bandwidth from each other. In addition, 8 priorities are set for nodes at different levels, and different node priorities can be defined to ensure that real-time data, key terminals, and key users are transmitted first, among which the service layer has the highest priority, followed by the terminal layer, and so on. Through this scheduling structure, time slot resources can be managed more effectively, and the overall performance and service quality of communication can be improved.
[0048] like Figure 3 As shown, the method of updating the node status using the token bucket algorithm steps are as follows:
[0049] Generally speaking, the rate of the P bucket is greater than the rate of the C bucket.
[0050] When the P bucket token of a node is less than the threshold, it means that the peak rate has been reached and the node cannot schedule time slot resources, and it is colored red.
[0051] When the tokens in bucket C are greater than the threshold and the tokens in bucket P are less than the threshold, it means that there are still tokens in bucket P, but bucket C has no tokens. Therefore, the committed rate is exceeded but the peak rate is not exceeded. The datagram can be sent and will be colored yellow.
[0052] When the number of tokens in bucket C is less than the threshold, it means that there are still tokens in bucket C and bucket P that can be sent, and they will be colored green.
[0053] Each time a time slot resource is scheduled, the color of the current node needs to be updated according to the token bucket algorithm, and the number of tokens in its parent node needs to be recursively updated. The color of the node is used to determine whether to deactivate the node and remove it from the scheduling queue.
[0054] like Figure 4 As shown, this embodiment also provides a multi-user multi-terminal time slot allocation system, which includes a user terminal management module, a terminal demand analysis module, a data classification module, a multi-layer service scheduling module, and a time slot allocation module.
[0055] User terminal management module: used to manage all user terminal devices in the system, including adding, deleting, updating and other functions, to ensure that the communication needs of each terminal can be effectively identified.
[0056] Terminal demand analysis module: Analyzes the communication needs of each terminal based on the rate information applied by the terminal, including information on communication quality requirements, service priority, bandwidth requirements, etc.
[0057] Data classification module: IP data is classified and associated with the corresponding terminal. Then, according to the classification rules configured in the terminal, different priorities, service levels, rates, delays and other requirements are distinguished to facilitate subsequent multi-layer service scheduling and time slot allocation.
[0058] Multi-layer service scheduling module: according to the terminal information provided by the user terminal management module and the rate requirement information provided by the terminal requirement analysis module, it schedules data of different service levels or priorities to realize multi-layer differentiated services.
[0059] Time slot allocation module: According to the scheduling results provided by the multi-layer service scheduling module, dynamically allocate communication time slot resources to each terminal to meet the communication needs of different terminals, ensure service quality and improve the utilization of communication resources.
[0060] The above-mentioned embodiments only express the specific implementation of the present invention, and the description thereof is relatively specific and detailed, but it cannot be understood as limiting the scope of the present invention. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention.
Claims
1. A multi-user multi-terminal time slot allocation method, It is characterized in that The following steps are involved: Step 1: Initialization and configuration: When the system starts, initialize the scheduler and start preparing scheduling tasks; The scheduling level is hierarchized according to the preset configuration information to construct a tree-like hierarchical data structure. From the low level to the high level, they are service type, terminal level and user level. Each node in each level represents a user, terminal or service type. The service type node is a leaf node, which stores the actual time slot resource request information. Step 2: Hierarchical scheduling: The scheduling work is carried out according to the hierarchical structure, traversing from the lowest level to the highest level, processing the lowest level first, and then gradually traversing to the upper levels; Step 3, node processing: In each level, the scheduler prioritizes the activated leaf nodes with the highest priority, which store the time slot request information of the terminal's service type data; if the time slot request of the current node is zero, it means that the node is not used, and the scheduler removes it from the scheduling queue and updates the status of the current level for subsequent scheduling; then, continue to search for the next node until a node with a time slot request is found; Step 4, Scheduling end condition: When a node's time slot request is not zero, the scheduler will allocate a time slot to the node and check whether the node's quota can still support continued scheduling; If the quota is insufficient, the scheduler will reset the node's quota and start scheduling the next node of the same priority. If the node's request is fully allocated, the scheduler will mark it as completed and update the node status according to the token bucket algorithm. The condition for the end of scheduling is that the scheduling of all levels is completed or the time slot resources have been fully allocated. If the end condition is not met, the scheduler will continue to return to the hierarchical scheduling point to continue scheduling until the end condition is met.
2. The multi-user multi-terminal time slot allocation method according to claim 1, It is characterized in that In step 1, in the tree-like hierarchical data structure, the sum of the bandwidth of each child node is less than or equal to the bandwidth of its parent node. If a node does not occupy bandwidth resources, nodes at the same level can borrow bandwidth from each other; and different node priorities are defined for nodes at different levels.
3. The multi-user multi-terminal time slot allocation method according to claim 1, It is characterized in that In step 2, if the current level is not the lowest level, it means that this scheduling is in borrowing mode and it is necessary to look for available resources in the lower level.
4. The multi-user multi-terminal time slot allocation method according to claim 1, It is characterized in that In step 4, updating the node status according to the token bucket algorithm specifically includes: Assume that the rate of bucket P is greater than the rate of bucket C; When the P bucket token of a node is less than the threshold, it means that the peak rate has been reached and the node cannot schedule time slot resources, and it is colored red; When the tokens in bucket C are greater than the threshold and the tokens in bucket P are less than the threshold, it means that there are still tokens in bucket P, but there are no tokens in bucket C. Therefore, the committed rate is exceeded but the peak rate is not exceeded. The data can be sent and will be colored yellow. When the number of tokens in bucket C is less than the threshold, it means that there are still tokens in bucket C and bucket P, which can be sent and will be colored green. Each time a time slot resource is scheduled, the color of the current node needs to be updated according to the token bucket algorithm, and the number of tokens in its parent node needs to be recursively updated. The color of the node is used to determine whether to deactivate the node and remove it from the scheduling queue.
5. A multi-user multi-terminal time slot allocation system, It is characterized in that Used to implement the multi-user multi-terminal time slot allocation method according to any one of claims 1 to 4, the system comprises: User terminal management module: used to manage all user terminal devices in the system, including adding, deleting, and updating, to ensure that the communication needs of each terminal can be effectively identified; Terminal demand analysis module: Analyzes the communication needs of each terminal based on the rate information applied by the terminal, including information on communication quality requirements, service priority, and bandwidth requirements; Data classification module: IP data is classified and associated with the corresponding terminal. Then, according to the classification rules configured on the terminal, different priorities, service levels, rates, and delay requirements are distinguished to facilitate subsequent multi-layer service scheduling and time slot allocation. Multi-layer service scheduling module: according to the terminal information provided by the user terminal management module and the rate demand information provided by the terminal demand analysis module, it schedules data of different service levels or priorities to realize multi-layer differentiated services; Time slot allocation module: According to the scheduling results provided by the multi-layer service scheduling module, dynamically allocate communication time slot resources to each terminal to meet the communication needs of different terminals, ensure service quality and improve the utilization of communication resources.
Citation Information
Patent Citations
Vehicle-mounted ad hoc network self-adaptive time slot distributing method based on a time division multiple address (TDMA)
CN103096327A
Resource allocation method and device
CN110912736A
Apparatus and method for scheduling traffic data in abroadband wireless access communication system
KR1020050118599A
Traffic class capacity allocation in computer networks
US20160021596A1
