CN114286447B - Scheduling priority adjustment method, equipment and storage medium - Google Patents
Scheduling priority adjustment method, equipment and storage medium Download PDFInfo
- Publication number
- CN114286447B CN114286447B CN202111614237.5A CN202111614237A CN114286447B CN 114286447 B CN114286447 B CN 114286447B CN 202111614237 A CN202111614237 A CN 202111614237A CN 114286447 B CN114286447 B CN 114286447B
- Authority
- CN
- China
- Prior art keywords
- data packets
- historical
- target user
- scheduling priority
- index
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000011218 segmentation Effects 0.000 claims abstract description 18
- 238000004891 communication Methods 0.000 abstract description 23
- 230000006870 function Effects 0.000 description 13
- 238000010586 diagram Methods 0.000 description 9
- 230000005540 biological transmission Effects 0.000 description 8
- 238000013461 design Methods 0.000 description 6
- 238000012423 maintenance Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 230000006978 adaptation Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 102100022734 Acyl carrier protein, mitochondrial Human genes 0.000 description 1
- 101000678845 Homo sapiens Acyl carrier protein, mitochondrial Proteins 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000006386 memory function Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method, equipment and storage medium for adjusting scheduling priority, which relate to the technical field of communication and are used for solving the problem of more data packet segmentation, and comprise the following steps: acquiring the number of service data packets of a target user and the number of segmented data packets in a historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets; determining a historical subcontracting index of a target user according to the number of the service data packets and the number of the segmented data packets; the historical subcontracting index is used for reflecting the segmentation degree of the corresponding business data packet of the target user in the historical time period; and under the condition that the historical subcontracting index is larger than a preset threshold value, the scheduling priority of the target user is improved.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a storage medium for adjusting a scheduling priority.
Background
The existing network is a packet forwarding network, and after receiving all data packets corresponding to data to be transmitted, a receiving end starts to process the data to be transmitted. In order to improve the utilization of the computing resources of the receiving end, the wireless communication system needs to forward all data packets of the data to be transmitted to the receiving end at one time as much as possible.
However, the resources of the wireless communication system are limited, and the base station device cannot allocate the limited resources to one user, so that all data packets of the user are forwarded at one time. When the resources allocated by the base station device to the user cannot forward all the data packets of the data to be transmitted of the user at one time, some data packets are sent in segments, for example, a part of one data packet is sent first, and the rest part waits to be allocated to the network resources again and then is sent.
In addition, the existing scheduling algorithm generally sets scheduling priority for the service user according to the signal intensity corresponding to the terminal of the service user, so that even if the current network resource can forward all data packets of one user at one time, if the scheduling priority of the user is lower, the base station equipment cannot allocate network resources for the user preferentially, and the problem of data packet segmentation of the user still can be caused. Thus, the existing wireless communication system cannot reduce the segmentation of the data packet, and further cannot improve the computing resource utilization of the receiving end.
Disclosure of Invention
The invention provides a scheduling priority adjustment method, equipment and a storage medium, which are used for reducing the number of segmented data packets.
In order to achieve the above purpose, the invention adopts the following technical scheme:
In a first aspect, a method for adjusting a scheduling priority is provided, including: acquiring the number of service data packets of a target user and the number of segmented data packets in a historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets; determining a historical subcontracting index of a target user according to the number of the service data packets and the number of the segmented data packets; the historical subcontracting index is used for reflecting the segmentation degree of the corresponding business data packet of the target user in the historical time period; and under the condition that the historical subcontracting index is larger than a preset threshold value, the scheduling priority of the target user is improved.
Optionally, determining the historical packetization index of the target user according to the number of service data packets and the number of segmented data packets includes: and inputting the number of the business data packets and the number of the segmented data packets into a preset first formula, and outputting the historical subcontracting index of the target user.
Optionally, the first formula satisfies:
Wherein M (T) represents a historical packetization index, sigma tSched (i) represents the number of segmented data packets, l (T) represents the number of service data packets, alpha represents a preset coefficient, and alpha >0.
Optionally, in the case that the historical packetization index is greater than a preset threshold, increasing the scheduling priority of the indicated user includes:
Under the condition that the historical subcontracting index is larger than a preset threshold value, acquiring the current scheduling priority of the target user; and according to the current scheduling priority and a preset second formula, improving the scheduling priority of the target user.
Optionally, the second formula satisfies:
Pn＝Pi×(1+β)
Wherein P i represents the current scheduling priority, β represents a preset coefficient, β >0, and P n represents the adjusted scheduling priority.
In a second aspect, a base station apparatus is provided, including an acquisition unit, a determination unit, and an adjustment unit; the acquisition unit is used for acquiring the number of the service data packets of the target user and the number of the segmented data packets in the historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets; the determining unit is used for determining the historical subcontracting index of the target user according to the number of the business data packets and the number of the segmented data packets; the historical subcontracting index is used for reflecting the segmentation degree of the corresponding business data packet of the target user in the historical time period; and the adjusting unit is used for improving the scheduling priority of the target user under the condition that the historical subcontracting index is larger than a preset threshold value.
Optionally, the determining unit is specifically configured to: and inputting the number of the business data packets and the number of the segmented data packets into a preset first formula, and outputting the historical subcontracting index of the target user.
Optionally, the first formula satisfies:
Wherein M (T) represents a historical packetization index, sigma tSched (i) represents the number of segmented data packets, l (T) represents the number of service data packets, alpha represents a preset coefficient, and alpha >0.
Optionally, the adjusting unit is specifically configured to: under the condition that the historical subcontracting index is larger than a preset threshold value, acquiring the current scheduling priority of the target user; and according to the current scheduling priority and a preset second formula, improving the scheduling priority of the target user.
Optionally, the second formula satisfies:
Pn＝Pi×(1+β)
Wherein P i represents the current scheduling priority, β represents a preset coefficient, β >0, and P n represents the adjusted scheduling priority.
In a third aspect, there is provided a computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer, cause the computer to perform the scheduling priority adjustment method of the first aspect described above.
In a fourth aspect, there is provided a base station apparatus including: a processor and a memory; wherein the memory is configured to store one or more programs, the one or more programs including computer-executable instructions that, when executed by the base station apparatus, cause the base station apparatus to perform the method for adjusting scheduling priority of the first aspect.
The technical scheme provided by the invention has at least the following beneficial effects: the base station equipment firstly acquires the number of service data packets of a target user and the number of segmented data packets in a historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets. And then the base station equipment determines the historical subcontracting index of the target user according to the number of the service data packets and the number of the segmentation data packets, so as to obtain the segmentation degree of the service data packets corresponding to the target user in the historical time period. The larger the historical packetization index, the more segmented packets that are generated by the service packets under the target user. And under the condition that the historical subcontracting index is larger than a preset threshold value, the scheduling priority of the user is improved. After the scheduling priority of the target user is improved, the base station equipment preferentially allocates network resources for the target user, so that limited network resources can be preferentially used by the target user, further, the service data packets of the target user are completely transmitted, and the number of the segmented data packets is reduced.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic structural diagram of a communication system according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a network protocol stack according to an embodiment of the present invention;
Fig. 3 is a flowchart illustrating a method for adjusting scheduling priority according to an embodiment of the present invention;
Fig. 4 is a schematic flow chart of a base station device processing downlink data according to an embodiment of the present invention;
Fig. 5 is a second flowchart of a method for adjusting scheduling priority according to an embodiment of the present invention;
Fig. 6 is a flowchart illustrating a method for adjusting scheduling priority according to an embodiment of the present invention;
Fig. 7 is a schematic structural diagram of a base station device according to an embodiment of the present invention;
Fig. 8 is a schematic diagram of a base station device according to a second embodiment of the present invention;
fig. 9 is a schematic diagram of a base station device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that, in the embodiments of the present invention, words such as "exemplary" or "such as" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "e.g." in an embodiment should not be taken as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete fashion.
It should be noted that, in the embodiment of the present invention, "english: of", "corresponding" english: corresponding, relevant "and" corresponding "english: corresponding" may be used in a mixed manner, and it should be noted that the meaning of the expression is consistent when the distinction is not emphasized.
In order to clearly describe the technical solution of the embodiments of the present invention, in the embodiments of the present invention, the terms "first", "second", etc. are used to distinguish the same item or similar items having substantially the same function and effect, and those skilled in the art will understand that the terms "first", "second", etc. are not limited in number and execution order.
The related art relating to the embodiment of the present application will be described below.
In the related art, data transmission between terminals is realized by means of a packet forwarding network. For example, before the first terminal transmits data to the second terminal, the second terminal may send a maximum transmission unit (maximum rransmission unit, MTU) message to the first terminal indicating the maximum size of data service units that it can receive; when the first terminal sends data to the second terminal through the network side, the first terminal divides the complete data into a plurality of data packets conforming to the MTU, and sends the data packets to the second terminal through the network side. If the MTU message indicates that the maximum size of the data service unit that the second terminal can receive is 1.5Kb, the first terminal may divide a complete data (the data size is 4.5 Kb) into 3 data packets of 1.5Kb, and send the data packets to the network side, where the data packets are forwarded to the second terminal by the network side.
Based on the packet forwarding network, the second terminal needs to receive all data packets corresponding to the data, and then the second terminal can process the data. Because the second terminal receives all the data packets corresponding to the data for a long time, its computing resources are in an idle state, which will lower the computing resource utilization rate of the second terminal. On the other hand, when the first terminal transmits data to the second terminal through the network side, in order to avoid congestion of the transmission link, the network side generally uses a congestion control algorithm to enable multiple terminals to share the bandwidth of the transmission link between the first terminal and the second terminal, which further increases the time for transmitting data, further increases the time for the computing resource of the second terminal to be in an idle state, and the utilization rate of the computing resource is lower.
Based on the above phenomena, it is required that the wireless communication system forwards all data packets of the data to be transmitted to the receiving end at one time as much as possible. However, the resources of the wireless communication system are limited, and the base station device cannot allocate the limited resources to one user entirely, so as to support that all data packets of the data to be transmitted sent by the user are forwarded at one time. When the resources allocated by the base station device to the user cannot forward all the data packets of the data to be transmitted of the user at one time, some data packets are sent in segments, for example, a part of one data packet is sent first, and the rest part waits to be allocated to the network resources again and then is sent. In addition, the existing scheduling algorithm generally sets scheduling priority for the service user according to the signal intensity corresponding to the terminal of the service user, so that even if the current network resource can forward all data packets of one user at one time, if the scheduling priority of the user is lower, the base station equipment cannot allocate network resources for the user preferentially, and the problem of data packet segmentation of the user still can be caused.
The method for adjusting the scheduling priority provided by the embodiment of the invention can be applied to a communication system of a wireless network. Fig. 1 shows a schematic diagram of a configuration of the communication system. As shown in fig. 1, the communication system 10 includes a base station apparatus 101 and a server 102. Wherein the base station apparatus 101 is connected to a server 102.
The base station device 101 may be a base station (gNode B, gNB) in 5G communication, an evolved base station (evolutional eNodeB) in evolved LTE, or other devices with relay functions, etc.
Server 102 may be a cloud server, or other server device with storage capabilities.
The base station device 101 is configured to obtain, from the server 102, the number of service data packets of the target user in the historical period of time and the number of segment data packets; the base station device 101 is further configured to determine a historical packetization index of the target user according to the number of service data packets and the number of segmented data packets; in the case where the historic packetization index is greater than the preset threshold, the base station apparatus 101 increases the scheduling priority of the indicated target user.
The base station apparatus 101 communicates with the target user through a network protocol stack. As shown in fig. 2, the network protocol stack includes a service data adaptation protocol (SERVICE DATA adaptation protocol, SDAP) layer, a packet data convergence protocol (PACKET DATA convergence protocol, PDCP) layer, a radio link control (radio link controlstructure, RLC) layer, a medium access control (medium access control, MAC) layer, and a Physical (PHY) layer.
Wherein, the PDCP layer communicates with the MAC layer through a logical channel of the RLC layer, and data received by the RLC layer from the PDCP layer or data transmitted to the PDCP layer is called RLC SDU or PDCP PDU; the RLC layer receives data from or transmits data to the MAC layer is called RLC PDU or MAC SDU. Here a protocol data unit (protocol data unit, PDU) is used to indicate that data is to be transmitted according to the relevant protocol, and a service data unit (SERVICE DATA unit, SDU) is used to carry the transmitted data.
The following describes a method for adjusting scheduling priority according to an embodiment of the present invention in detail with reference to the accompanying drawings.
As shown in fig. 3, the method for adjusting scheduling priority provided by the embodiment of the present invention includes the following steps S201 to S204:
S201, the base station equipment acquires the number of service data packets of the target user and the number of segmented data packets in the historical time period.
Wherein, the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets.
It should be noted that in practical applications, a service data packet may be divided into a plurality of segment data packets. If all the service data packets of the target user are not transmitted in a segmented mode in the historical time period, the number of the service data packets is equal to that of the segmented data packets.
Specifically, based on the network protocol stack architecture shown in fig. 2, as shown in fig. 4, a flow diagram of downlink data of a base station device passing through all protocol layers shown in fig. 2 is provided, three internet protocol (internet protocol, IP) packets are given, namely an IP packet x, an IP packet y and an IP packet z, and fig. 4 shows a process of transmitting the IP packets through each protocol layer. As shown in fig. 4, the RLC entity may Segment RLC PDUs according to a transmission instruction sent by the MAC entity, such as two RLC PDU segments in fig. 2, when transmitting data packets to the MAC layer. The transport instruction may indicate a transport block size.
It should be noted that, the IP packet in fig. 4 is a service packet in the embodiment of the present invention, and the segmented RLC PDU Segment is a segmented packet in the embodiment of the present invention.
As a possible implementation manner, after the target user initiates a service transmission request to the base station device, the base station device obtains the number of service data packets and the number of segmented data packets of the target user in the historical time period from the server according to the identification of the target user.
The size of the history period is set in the base station device in advance by the operation and maintenance personnel. For example, the historical time period may be one week or one month, which is not limited by the embodiment of the present invention.
For example, after the user a initiates a service transmission request to the base station device, the base station device obtains the number of service data packets and the number of segment data packets of the user a in the last week from the server.
S202, the base station equipment determines the historical packetization index of the target user according to the number of the service data packets and the number of the segmented data packets.
The historical subcontracting index is used for reflecting the segmentation degree of the corresponding business data packet of the target user in the historical time period.
As a possible implementation manner, after obtaining the number of service data packets and the number of segmented data packets of the target user, the base station device queries the number level of the service data packets in a preset list including the corresponding relationship between the number range and the level according to the number of the service data packets, and queries the number level of the segmented data packets in a preset list including the corresponding relationship between the number range and the level according to the number of the segmented data packets. And then, the base station equipment determines the ratio of the number level of the segmented data packets to the number level of the service data packets as the historical subcontracting index of the target user.
The number of the service data packets is 10, and the corresponding number level of the service data packets is 1 level; the number of the segmented data packets is 20, and the number level of the corresponding segmented data packets is 2; the historical subcontracting index corresponds to 2.
The more the number of the segmented data packets is, the higher the corresponding number level of the segmented data packets is; similarly, the greater the number of service data packets, the higher the corresponding service data packet number level. Therefore, the greater the number of segmented data packets, the greater the historical packetization index, i.e., the greater the segmentation level of the service data packets of the target user.
As another possible implementation manner, the base station device calculates, according to the historical packetization index formula, the number of service data packets of the obtained target user and the historical packetization index corresponding to the number of the segmented data packets.
It should be noted that the historical subcontracting index formula is set in the base station device in advance by the operation and maintenance personnel.
The specific implementation manner of this step may specifically refer to the following description of the embodiments of the present invention, which is not repeated herein.
S203, the base station equipment judges whether the historical packetization index is larger than a preset threshold value.
The preset threshold is preset in the base station device by an operation and maintenance personnel.
As one possible implementation manner, after determining the historical subcontracting index of the target user, the base station device compares the historical subcontracting index with a preset threshold value, and determines whether the historical subcontracting index is greater than the preset threshold value.
And S204, under the condition that the historical subcontracting index is larger than a preset threshold value, the base station equipment improves the scheduling priority of the target user.
As a possible implementation manner, in the case that the historical packetization index is greater than the preset threshold, the base station device increases the scheduling priority of the target user according to the preset fixed value.
The fixed value is preset in the base station device by the operation and maintenance personnel.
As another possible implementation manner, in the case that the historical packetization index is greater than the preset threshold, the base station device increases the scheduling priority of the target user according to a preset formula.
The specific implementation manner of this step may specifically refer to the following description of the embodiments of the present invention, which is not repeated herein.
Optionally, the base station device does not adjust the scheduling priority of the target user in the case where the historical packetization index is less than or equal to a preset threshold.
In one design, in order to determine the historical subcontracting index of the target user, as shown in fig. 5, the embodiment of the present invention provides S202 described above, which specifically includes S2021 described below.
S2021, the base station equipment inputs the number of the service data packets and the number of the segmented data packets into a preset first formula, and outputs the historical packetization index of the target user.
It should be noted that the first formula is set in the base station device by the operation and maintenance personnel in advance.
As a possible implementation manner, after the base station device obtains the number of service data packets and the number of segmentation data packets of the target user, the base station device inputs the number of service data packets and the number of segmentation data packets into a preset first formula and outputs a historical packetization index of the target user.
Optionally, the first formula satisfies:
Wherein M (T) represents a historical packetization index, sigma tSched (i) represents the number of segmented data packets, l (T) represents the number of service data packets, alpha represents a preset coefficient, and alpha >0.
It will be appreciated that the more traffic packets are fragmented, the greater the number of fragmented packets, i.e. the greater Σtsided (i), the greater M (T), indicating a higher degree of fragmentation of the traffic packets for the target user.
In one design, in order to improve the scheduling priority of the illustrated user, as shown in fig. 6, the above S204 provided in the embodiment of the present invention specifically includes the following S2041-S2042.
S2041, the base station equipment acquires the current scheduling priority of the target user under the condition that the historical packetization index is larger than a preset threshold value.
It should be noted that, the current scheduling priority is set by the base station device according to the instantaneous transmission speed of the user and the current throughput of the base station device; the current scheduling priority may also be set for the base station device according to the signal strength of the user.
As a possible implementation manner, in the case that the historical packetization index is greater than the preset threshold, the base station device obtains the current scheduling priority set for the target user by itself.
S2042, the base station equipment improves the scheduling priority of the target user according to the current scheduling priority and a preset second formula.
As a possible implementation manner, after the base station device obtains the current scheduling priority of the target user, the base station device inputs the current scheduling priority into a preset second formula to obtain an output result, and the base station device improves the scheduling priority of the user according to the output result.
Optionally, the second formula satisfies:
Pn＝Pi×(1+β)
Wherein P i represents the current scheduling priority, β represents a preset coefficient, β >0, and P n represents the adjusted scheduling priority.
It will be appreciated that since β >0, the base station apparatus gets a scheduling priority greater than the current priority according to the second formula.
The technical scheme provided by the embodiment at least brings the following beneficial effects: the base station equipment firstly acquires the number of service data packets of a target user and the number of segmented data packets in a historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets. And then the base station equipment determines the historical subcontracting index of the target user according to the number of the service data packets and the number of the segmentation data packets, so as to obtain the segmentation degree of the service data packets corresponding to the target user in the historical time period. The larger the historical packetization index, the more segmented packets that are generated by the service packets under the target user. And under the condition that the historical subcontracting index is larger than a preset threshold value, the scheduling priority of the user is improved. After the scheduling priority of the target user is improved, the base station equipment preferentially allocates network resources for the target user, so that limited network resources can be preferentially used by the target user, further, the service data packets of the target user are completely transmitted, and the number of the segmented data packets is reduced.
The foregoing embodiments mainly describe the solutions provided by the embodiments of the present invention from the perspective of the apparatus (device). It will be appreciated that, in order to implement the above-mentioned method, the apparatus or device includes hardware structures and/or software modules corresponding to each of the method flows, and these hardware structures and/or software modules corresponding to each of the method flows may constitute a material information determining apparatus. Those of skill in the art will readily appreciate that the various illustrative algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The embodiment of the invention can divide the functional modules of the device or the equipment according to the method example, for example, the device or the equipment can divide each functional module corresponding to each function, or two or more functions can be integrated in one processing module. The integrated modules may be implemented in hardware or in software functional modules. It should be noted that, in the embodiment of the present invention, the division of the modules is schematic, which is merely a logic function division, and other division manners may be implemented in actual implementation.
Fig. 7 shows a possible configuration diagram of the base station apparatus in the case of dividing the respective functional modules with the respective functions. As shown in fig. 7, the base station apparatus 30 provided in the embodiment of the present invention includes an acquisition unit 301, a determination unit 302, and an adjustment unit 303.
An obtaining unit 301, configured to obtain the number of service data packets and the number of segment data packets of the target user in the historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets.
A determining unit 302, configured to determine a historical packetization index of the target user according to the number of service data packets and the number of segment data packets; the historical subcontracting index is used for reflecting the segmentation degree of the corresponding business data packet of the target user in the historical time period.
And the adjusting unit 303 is configured to increase the scheduling priority of the target user when the historical packetization index is greater than a preset threshold.
Optionally, the determining unit 302 is specifically configured to: and inputting the number of the business data packets and the number of the segmented data packets into a preset first formula, and outputting the historical subcontracting index of the target user.
Optionally, the first formula satisfies:
Wherein M (T) represents a historical packetization index, sigma tSched (i) represents the number of segmented data packets, l (T) represents the number of service data packets, alpha represents a preset coefficient, and alpha >0.
Optionally, the adjusting unit 303 is specifically configured to: under the condition that the historical subcontracting index is larger than a preset threshold value, acquiring the current scheduling priority of the target user; and according to the current scheduling priority and a preset second formula, improving the scheduling priority of the target user.
Optionally, the second formula satisfies:
Pn＝Pi×(1+β)
Wherein P i represents the current scheduling priority, β represents a preset coefficient, β >0, and P n represents the adjusted scheduling priority.
In the case of implementing the functions of the integrated modules in the form of hardware, the embodiment of the present invention provides a possible schematic structural diagram of the base station apparatus involved in the above embodiment. As shown in fig. 8, a base station apparatus 40 is configured to reduce the number of segmented data packets, for example, to perform the scheduling priority adjustment method shown in fig. 2. The base station device 40 comprises a processor 401, a memory 402 and a bus 403. The processor 401 and the memory 402 may be connected by a bus 403.
The processor 401 is a control center of the base station apparatus, and may be one processor or a collective term of a plurality of processing elements. For example, the processor 401 may be a general-purpose central processing unit (central processing unit, CPU), or may be other general-purpose processors. Wherein the general purpose processor may be a microprocessor or any conventional processor or the like.
As one example, processor 401 may include one or more CPUs, such as CPU 0 and CPU 1 shown in fig. 6.
Memory 402 may be, but is not limited to, read-only memory (ROM) or other type of static storage device that can store static information and instructions, random access memory (random access memory, RAM) or other type of dynamic storage device that can store information and instructions, or electrically erasable programmable read-only memory (EEPROM), magnetic disk storage or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
As a possible implementation, the memory 402 may exist separately from the processor 401, and the memory 402 may be connected to the processor 401 through the bus 403, for storing instructions or program codes. When the processor 401 invokes and executes the instructions or the program codes stored in the memory 402, the method for adjusting the scheduling priority provided by the embodiment of the invention can be implemented.
In another possible implementation, the memory 402 may also be integrated with the processor 401.
Bus 403 may be an industry standard architecture (Industry Standard Architecture, ISA) bus, a peripheral component interconnect (PERIPHERAL COMPONENT INTERCONNECT, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The bus may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in fig. 8, but not only one bus or one type of bus.
Note that the structure shown in fig. 8 does not constitute a limitation of the base station apparatus 40. In addition to the components shown in fig. 8, the base station apparatus 40 may include more or less components than shown, or certain components may be combined, or a different arrangement of components.
As an example, in connection with fig. 7, the acquisition unit 301, the determination unit 302, and the adjustment unit 303 in the base station apparatus realize the same functions as those of the processor 401 in fig. 8.
Optionally, as shown in fig. 8, the base station apparatus 40 provided in the embodiment of the present invention may further include a communication interface 404.
A communication interface 404 for connecting with other devices via a communication network. The communication network may be an ethernet, a radio access network, a wireless local area network (wireless local area networks, WLAN), etc. The communication interface 404 may include a receiving unit for receiving data and a transmitting unit for transmitting data.
In one design, the communication interface may also be integrated into the processor in the base station device provided in the embodiments of the present invention.
Fig. 9 shows another hardware structure of the base station apparatus in the embodiment of the present invention. As shown in fig. 9, the base station apparatus 50 may include a processor 501 and a communication interface 502. The processor 501 is coupled to a communication interface 502.
The function of the processor 501 may be as described above with reference to the processor 501. The processor 501 also has a memory function, and the function of the memory 502 can be referred to.
The communication interface 502 is used to provide data to the processor 501. The communication interface 502 may be an internal interface of the base station apparatus or an external interface (corresponding to the communication interface 404) of the base station apparatus.
It is noted that the structure shown in fig. 9 does not constitute a limitation of the base station apparatus 50, and the base station apparatus 50 may include more or less components than those shown in fig. 9, or may combine some components, or may be arranged differently.
From the above description of embodiments, it will be apparent to those skilled in the art that the foregoing functional unit divisions are merely illustrative for convenience and brevity of description. In practical applications, the above-mentioned function allocation may be performed by different functional units, i.e. the internal structure of the device is divided into different functional units, as needed, to perform all or part of the functions described above. The specific working processes of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which are not described herein.
The embodiment of the invention also provides a computer readable storage medium, wherein the computer readable storage medium stores instructions, when the computer executes the instructions, the computer executes each step in the method flow shown in the method embodiment.
Embodiments of the present invention provide a computer program product comprising instructions which, when executed on a computer, cause the computer to perform the method of adjusting scheduling priority in the method embodiments described above.
The computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: electrical connections having one or more wires, portable computer diskette, hard disk. Random access Memory (Random Access Memory, RAM), read-Only Memory (ROM), erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), registers, hard disk, optical fiber, portable compact disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any other form of computer-readable storage medium suitable for use by a person or persons of skill in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an Application SPECIFIC INTEGRATED Circuit (ASIC). In embodiments of the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The present invention is not limited to the above embodiments, and any changes or substitutions within the technical scope of the present invention should be covered by the scope of the present invention.
Claims (8)
1. A method for adjusting scheduling priority, comprising:
Acquiring the number of service data packets of a target user and the number of segmented data packets in a historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets;
determining a historical subcontracting index of the target user according to the number of the service data packets and the number of the segmented data packets; the historical subcontracting index is used for reflecting the segmentation degree of the corresponding business data packet of the target user in the historical time period;
under the condition that the historical subcontracting index is larger than a preset threshold value, the scheduling priority of the target user is improved;
the determining the historical subcontracting index of the target user according to the number of the service data packets and the number of the segmented data packets comprises the following steps:
Inputting the number of the service data packets and the number of the segmented data packets into a preset first formula, and outputting the historical subcontracting index of the target user;
the first formula satisfies:
Wherein M (T) represents the historical packetization index, Σtsched (i) represents the number of the segmented data packets, l (T) represents the number of the service data packets, α represents a preset coefficient, and α >0.
2. The method for adjusting scheduling priority according to claim 1, wherein the step of increasing the scheduling priority of the user in the case where the historical packetization index is greater than a preset threshold value includes:
acquiring the current scheduling priority of the target user under the condition that the historical subcontracting index is larger than a preset threshold value;
And according to the current scheduling priority and a preset second formula, improving the scheduling priority of the target user.
3. The method of claim 2, wherein the second formula satisfies:
Pn＝Pi×(1+β)
Wherein P i represents the current scheduling priority, beta represents a preset coefficient, beta >0, and P n represents the adjusted scheduling priority.
4. A base station apparatus, characterized by comprising an acquisition unit, a determination unit, and an adjustment unit;
The acquisition unit is used for acquiring the number of service data packets and the number of segmented data packets of the target user in the historical time period; the number of the segmented data packets is greater than or equal to the number of the service data packets; one service data packet corresponds to one or more segment data packets;
the determining unit is used for determining the historical subcontracting index of the target user according to the number of the business data packets and the number of the segmented data packets; the historical subcontracting index is used for reflecting the segmentation degree of the corresponding business data packet of the target user in the historical time period;
the adjusting unit is used for improving the scheduling priority of the target user under the condition that the historical subcontracting index is larger than a preset threshold value;
The determining unit is specifically configured to:
Inputting the number of the service data packets and the number of the segmented data packets into a preset first formula, and outputting the historical subcontracting index of the target user;
the first formula satisfies:
Wherein M (T) represents the historical packetization index, Σtsched (i) represents the number of the segmented data packets, l (T) represents the number of the service data packets, α represents a preset coefficient, and α >0.
5. The base station device according to claim 4, wherein the adjusting unit is specifically configured to:
acquiring the current scheduling priority of the target user under the condition that the historical subcontracting index is larger than a preset threshold value;
And according to the current scheduling priority and a preset second formula, improving the scheduling priority of the target user.
6. The base station apparatus of claim 5, wherein the second formula satisfies:
Pn＝Pi×(1+β)
Wherein P i represents the current scheduling priority, beta represents a preset coefficient, beta >0, and P n represents the adjusted scheduling priority.
7. A computer readable storage medium storing one or more programs, wherein the one or more programs comprise instructions, which when executed by a computer, cause the computer to perform the scheduling priority adjustment method of any of claims 1-3.
8. A base station apparatus, comprising: a processor and a memory; wherein the memory is configured to store one or more programs, the one or more programs comprising computer-executable instructions that, when executed by the base station apparatus, cause the base station apparatus to perform the scheduling priority adjustment method of any of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111614237.5A CN114286447B (en) | 2021-12-27 | 2021-12-27 | Scheduling priority adjustment method, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111614237.5A CN114286447B (en) | 2021-12-27 | 2021-12-27 | Scheduling priority adjustment method, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114286447A CN114286447A (en) | 2022-04-05 |
| CN114286447B true CN114286447B (en) | 2024-08-02 |
Family
ID=80876118
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111614237.5A Active CN114286447B (en) | 2021-12-27 | 2021-12-27 | Scheduling priority adjustment method, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114286447B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115955443B (en) * | 2022-09-29 | 2024-05-17 | 中国联合网络通信集团有限公司 | Resource scheduling method, device and storage medium |
| CN115941612B (en) * | 2022-11-14 | 2024-05-17 | 中国联合网络通信集团有限公司 | Data processing method, device and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104427623A (en) * | 2013-08-30 | 2015-03-18 | 中国移动通信集团设计院有限公司 | Service scheduling method and service scheduling device |
| CN112804710A (en) * | 2021-01-04 | 2021-05-14 | 腾讯科技（深圳）有限公司 | Data transmission method and device, computer readable medium and electronic equipment |
Family Cites Families (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103312441B (en) * | 2012-03-15 | 2017-11-17 | 华为技术有限公司 | Data pack transmission method and system, sending ending equipment and receiving device |
| US9967300B2 (en) * | 2012-12-10 | 2018-05-08 | Alcatel Lucent | Method and apparatus for scheduling adaptive bit rate streams |
| WO2015041711A1 (en) * | 2013-09-20 | 2015-03-26 | Yottaa, Inc. | Systems and methods for managing loading priority or sequencing of fragments of a web object |
| CN104519075A (en) * | 2013-09-26 | 2015-04-15 | 中兴通讯股份有限公司 | Data transmission method and device |
| WO2016110326A1 (en) * | 2015-01-08 | 2016-07-14 | Siemens Aktiengesellschaft | Method and apparatus for transmitting data in a data network using at least two different transmission modes with fragmentation |
| EP3703423A4 (en) * | 2017-11-14 | 2020-10-28 | Huawei Technologies Co., Ltd. | Data transmission method, network device, and server |
| CN108064086B (en) * | 2017-12-07 | 2020-09-11 | 深圳创维数字技术有限公司 | Bandwidth allocation method and device, computer equipment and storage medium |
| CN108055348B (en) * | 2017-12-26 | 2020-02-07 | Oppo广东移动通信有限公司 | Method for adjusting data transmission priority and related equipment |
| CN110099448B (en) * | 2018-01-31 | 2023-01-13 | 华为技术有限公司 | Communication method and device |
| CN110139239B (en) * | 2018-02-09 | 2021-03-16 | 电信科学技术研究院有限公司 | Method and terminal for service transmission |
| DE102018206780B4 (en) * | 2018-05-02 | 2024-08-14 | Volkswagen Aktiengesellschaft | Method and computer program for sending a data packet, method and computer program for receiving a data packet, communication unit and motor vehicle with communication unit |
| CN108848530B (en) * | 2018-07-10 | 2020-09-18 | 网宿科技股份有限公司 | Method and device for acquiring network resources and scheduling server |
| CN109257610B (en) * | 2018-09-28 | 2020-11-27 | 浙江麦能网教育科技有限公司 | Media low-delay communication method and system for internet remote education |
| CN111147395B (en) * | 2019-12-25 | 2022-05-24 | 中国联合网络通信集团有限公司 | Network resource adjusting method and device |
| CN113840385A (en) * | 2020-06-24 | 2021-12-24 | 华为技术有限公司 | Service transmission method and device |
| CN112243298B (en) * | 2020-10-14 | 2023-06-20 | 中国联合网络通信集团有限公司 | Scheduling method and device |
| CN112804711B (en) * | 2021-01-04 | 2024-05-07 | 腾讯科技（深圳）有限公司 | Data transmission method, data transmission device, computer readable medium and electronic equipment |
-
2021
- 2021-12-27 CN CN202111614237.5A patent/CN114286447B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104427623A (en) * | 2013-08-30 | 2015-03-18 | 中国移动通信集团设计院有限公司 | Service scheduling method and service scheduling device |
| CN112804710A (en) * | 2021-01-04 | 2021-05-14 | 腾讯科技（深圳）有限公司 | Data transmission method and device, computer readable medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114286447A (en) | 2022-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3554125B1 (en) | Data processing method, apparatus and system | |
| CN108259383B (en) | Data transmission method and network equipment | |
| WO2018201833A1 (en) | Uplink resource allocation method and device | |
| US8532030B2 (en) | Techniques for initiating communication in a wireless network | |
| CN114286447B (en) | Scheduling priority adjustment method, equipment and storage medium | |
| CN110225553B (en) | Data distribution method, device and system | |
| CN110474854B (en) | Resource allocation method and device | |
| US9713167B2 (en) | Multistage hierarchical packet scheduling | |
| EP3814898A1 (en) | Technologies for cross-layer task distribution | |
| US11258717B2 (en) | Method for sending service packet, network device, and system | |
| US11129048B2 (en) | Data transmission method, base station, and wireless communications device | |
| KR102275579B1 (en) | Method and apparatus for providing differentiated transmitting services | |
| CN110944358B (en) | Data transmission method and device | |
| EP3364617B1 (en) | Service scheduling method and apparatus, and network device | |
| WO2014094310A1 (en) | Resource scheduling method and device | |
| CN108633088A (en) | The method and apparatus of scheduling of resource | |
| WO2014117347A1 (en) | Data scheduling method and apparatus | |
| CN111066272B (en) | Packet delay reduction in mobile radio access networks | |
| CN102711183B (en) | Method and device for controlling packet sending rate of user | |
| CN113891398B (en) | Resource determination method, equipment and storage medium | |
| JP2016146542A (en) | Control device, communication device, control method and program | |
| CN117014379A (en) | Code rate control method, device, electronic equipment and storage medium | |
| CN112492635B (en) | Determination method and device for scheduling priority | |
| CN113453285B (en) | Resource adjusting method, device and storage medium | |
| CN116800675A (en) | Flow control method, device, equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |