CN112911708A - Resource allocation method, server and storage medium - Google Patents
Resource allocation method, server and storage medium Download PDFInfo
- Publication number
- CN112911708A CN112911708A CN201911133214.5A CN201911133214A CN112911708A CN 112911708 A CN112911708 A CN 112911708A CN 201911133214 A CN201911133214 A CN 201911133214A CN 112911708 A CN112911708 A CN 112911708A
- Authority
- CN
- China
- Prior art keywords
- task
- data transmission
- temporary
- uplink
- groups
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
Abstract
The embodiment of the invention relates to the technical field of communication, and discloses a resource allocation method, a server and a storage medium. In the embodiment of the invention, the resource allocation method comprises the steps of identifying users with communication requirements with a base station with a Mobile Edge Computing (MEC) function; grouping an uplink task and a downlink task of a user to obtain a plurality of task groups which are sequentially arranged so as to allow a base station to sequentially complete data transmission of the plurality of task groups in a time division multiplexing mode in a full duplex mode; each task group comprises at least one of an uplink task and a downlink task, the uplink task and the downlink task of the same MEC calculation unloading user in the user are divided into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located. The technical scheme of the embodiment of the invention can reduce the total system time delay in the MEC scene.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a resource allocation method, a server and a storage medium.
Background
With the explosive growth of the number of mobile devices, various emerging application services such as mobile video streaming, augmented reality, virtual reality, and auto-driving bring unprecedented data traffic to mobile communication networks. However, the mobile terminal often does not have strong computing power, and for these application services with low latency and high computation amount, it is difficult for the local computing of the mobile terminal to ensure the service quality.
Mobile Edge Computing (MEC) can provide a source of computing, storage, and communication at the network Edge. The mobile user may offload their computing tasks to the MEC server for computing. Because the MEC server is close to the user terminal and has relatively strong computing power, the MEC can provide low-delay and high-bandwidth services for the mobile user. In an MEC system, transmission delay is an important component that affects the total delay of the system; the user unloads the task to the MEC server to execute the processes of task uploading, task calculation and result downloading, wherein the transmission delay of the uploading and downloading processes has great influence on the total delay of the MEC system. With the increasing of MEC calculation and uninstallation users, the total time delay of the MEC system is also increased in the current half-duplex mode, which seriously affects the timeliness of data transmission.
Disclosure of Invention
The embodiment of the invention aims to provide a resource allocation method, a server and a storage medium, which can reduce the total system time delay under an MEC scene.
To solve the above technical problem, an embodiment of the present invention provides a resource allocation method, including: identifying a user having a communication need with a base station having a mobile edge computing, MEC, function; grouping the uplink tasks and the downlink tasks of the users to obtain a plurality of task groups which are sequentially arranged so as to allow the base station to sequentially complete data transmission of the task groups in a time division multiplexing mode in a full duplex mode; each task group comprises at least one of the uplink task and the downlink task, the uplink task and the downlink task of the same MEC calculation unloading user in the user are divided into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located.
An embodiment of the present invention further provides a server, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the above method.
Compared with the prior art, the embodiment of the invention groups the uplink tasks and the downlink tasks of all users to obtain a plurality of task groups which are sequentially arranged, so as to allow the base station to complete the data transmission of the task groups in a time division multiplexing mode in a full duplex mode; the method comprises the steps that an upstream task and a downstream task of the same MEC calculation unloading user are divided into different task groups, and the task group where the upstream task is located is arranged in front of the task group where the downstream task is located. That is, in the present application, an uplink task and a downlink task form a task group and complete data transmission of the task group in a full duplex mode, and the grouping manner in the present application allows normal data transmission between a user and a base station in an MEC scenario, so that the total system delay in the MEC scenario can be reduced.
In one example, the grouping of the uplink task and the downlink task of the user to obtain a plurality of task groups arranged in sequence includes: combining the uplink task and the downlink task to obtain a plurality of temporary task groups; each temporary task group comprises one uplink task and one downlink task, each uplink task exists in a plurality of temporary task groups, and each downlink task exists in a plurality of temporary task groups; estimating a data transmission time difference between each of the temporary task groups in a full-duplex mode and a half-duplex mode; and determining a plurality of task groups which are sequentially arranged based on the data transmission time difference of each temporary task group. The embodiment provides a specific way of determining a plurality of task groups which are sequentially arranged; the data transmission time difference between the task group in the full-duplex mode and the task group in the half-duplex mode can embody the time saved by the task group in the full-duplex mode relative to the data transmission in the half-duplex mode, so that the task group can be screened out based on the data transmission time difference, and the task group with the total time delay as small as possible can be screened out.
In one example, the estimating a data transmission time difference between each of the temporary task groups in the full-duplex mode and the half-duplex mode includes estimating a data transmission time length of each of the task groups in the full-duplex mode and a minimum data transmission time length of each of the temporary task groups in the half-duplex mode according to at least a preset maximum transmission power for transmitting data and a data transmission amount of each of the temporary task groups; and calculating the difference value of the minimum data transmission time length of each temporary task group in the full-duplex mode and the minimum data transmission time length of each temporary task group in the half-duplex mode, and taking the difference value as the data transmission time difference of each temporary task group. The present embodiment provides a specific way to estimate the difference in data transmission time between full duplex mode and half duplex mode for each temporary task group.
In one example, the minimum data transmission duration of each temporary task group in the full-duplex mode is estimated based on a binary search method according to at least a preset maximum transmission power for transmitting data and a data transmission amount of each task group. The embodiment provides a specific way for estimating the minimum data transmission duration of each temporary task group in the full-duplex mode; the time complexity of the binary search method is low, so that the estimation can be carried out quickly, and the total time delay of the system is further reduced.
In one example, in the estimating of the minimum data transmission duration of each temporary task group in the full-duplex mode based on the binary search method, the optimal transmission power corresponding to each temporary task group is also estimated; and the base station and the user of each temporary task group complete the data transmission of each temporary task group based on the optimal transmitting power, wherein the time consumption is the minimum data transmission time length. In this embodiment, in addition to configuring the combination of the uplink task and the downlink task, the optimal transmit power and the minimum data transmission duration may also be configured.
In an example, the determining, based on the data transmission time difference of each of the temporary task groups, a plurality of the task groups arranged in sequence, and determining the plurality of the task groups arranged in sequence based on a greedy algorithm. The embodiment provides a specific way for estimating and determining a plurality of task groups arranged in sequence; the greedy algorithm is less time complex, so that screening can be performed faster, and the total time delay of the system is further reduced.
In one example, the resource allocation method is performed periodically; and identifying all users having communication requirements with the base station in the current period from the users having communication requirements with the base station having the mobile edge computing MEC function.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the figures in which like reference numerals refer to similar elements and which are not to scale unless otherwise specified.
FIG. 1 is a flow chart of a resource allocation method according to a first embodiment of the present invention;
fig. 2 is a schematic diagram of a user terminal communicating with a base station in a MEC scenario according to a first embodiment of the present invention;
FIG. 3 is a flow chart of a resource allocation method according to a second embodiment of the present invention;
fig. 4 is a block diagram of a server according to a third embodiment of the present invention.
DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention will be described in detail with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that in various embodiments of the invention, numerous technical details are set forth in order to provide a better understanding of the present application. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not constitute any limitation to the specific implementation manner of the present invention, and the embodiments may be mutually incorporated and referred to without contradiction.
A first embodiment of the present invention relates to a resource allocation method. The specific flow is shown in figure 1.
102, grouping an uplink task and a downlink task of a user to obtain a plurality of task groups which are sequentially arranged, so as to allow a base station to sequentially complete data transmission of the plurality of task groups in a time division multiplexing mode in a full duplex mode;
each task group comprises at least one of an uplink task and a downlink task, the uplink task and the downlink task of the same MEC calculation unloading user in the user are divided into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located.
The following describes the implementation details of the resource allocation method of the present embodiment in detail, and the following is only provided for the convenience of understanding and is not necessary for implementing the present embodiment.
The resource allocation method of the embodiment can be applied to a server, and the server is arranged in a base station with a mobile edge computing MEC function; wherein, the MEC function of the base station can be integrated in the server, or can be realized by a separate MEC server located in the base station.
A user needs to communicate with a base station, and usually sends a communication request through a user terminal, wherein the communication request may include a task type and a data transmission amount of a task; the task type may reflect the user type, for example, the task type is an individual uplink task, and then the user is a normal uplink user; the task type is an individual downlink task, and then the user is a common downlink user; the task type is an MEC computation offload task, and then the user is an MEC computation offload user; the MEC calculates the unloading task and comprises an uplink task and a downlink task. Fig. 2 is a schematic diagram of communication between a user terminal and a base station in an MEC scenario, where the diagram includes a normal uplink user a, a normal downlink user B, and an MEC computation offload user C.
The server can regard the user receiving the communication request as a user having a communication demand with the base station; it should be noted that in this embodiment, data is transmitted in a time division multiplexing manner, that is, each user is time division multiplexed on the same channel; therefore, all users identified by the server as having a communication demand with the base station are users sharing the same channel; thus, in step 101, the server can identify all users that have a communication need with the base station and share the same channel. The identified users may include normal uplink users and normal downlink users in addition to the MEC computation offload users.
In an example, the server may periodically execute the resource allocation method of this embodiment with a preset duration as a cycle; in this case, all users having a communication demand with the base station are identified from among the users accessing the same channel of the base station in the current period each time.
In step 102, each of the plurality of task groups arranged in sequence includes at least one of an uplink task and a downlink task, that is, an uplink task and a downlink task may be divided into one group, an uplink task may be independently divided into one group, or a downlink task may be independently divided into one group; and the uplink task and the downlink task of the same MEC calculation unloading user are divided into different task groups, and the task group where the uplink task is arranged in front of the task group where the downlink task is arranged. In this embodiment, users of each task group transmit data on the same channel in a time division multiplexing manner in a full duplex mode, and an uplink task and a downlink task of the same MEC computation offload user cannot be executed at the same time, so that the uplink task and the downlink task of the same MEC computation offload user cannot be divided into the same task group. In addition, each task is only allocated to one task group, since each task needs to be executed only once.
Recording the number of the uplink tasks as M, the number of the downlink tasks as N and the number of the task groups as K; in one example, if the number M of the upstream tasks is different from the number N of the downstream tasks, a task group including only the upstream tasks or only the downstream tasks exists in the K task groups; for example, if M is smaller than N, a task group including only an uplink task exists in the K task groups; and if N is smaller than M, a task group only containing the downlink task exists in the K task groups.
In addition, in step 102, the K task groups are also sorted, and since the uplink task of the same MEC calculation offload user needs to be executed before the downlink task, the sorted K task groups need to meet the requirement that the task group where the uplink task of the same MEC calculation offload user is located is arranged in front of the task group where the downlink task of the MEC calculation offload user is located. Based on the grouping and the arrangement of each task group, the base station can complete the data transmission of the K task groups in a time division multiplexing mode according to the arrangement sequence of the K task groups in a full duplex mode. The user terminal may transmit data to the base station based on a preset transmit power to complete an uplink task, and the base station may also transmit data to the user terminal based on a preset transmit power to complete a downlink task. The time occupied by each task group is the larger of the data transmission time of the uplink task and the data transmission time of the downlink task in the task group.
In this embodiment, an uplink task and a downlink task of a user are grouped to obtain a plurality of task groups which are sequentially arranged, so as to allow the base station to complete data transmission of the plurality of task groups in a time division multiplexing manner in a full duplex mode; the method comprises the steps that an upstream task and a downstream task of the same MEC calculation unloading user are divided into different task groups, and the task group where the upstream task is located is arranged in front of the task group where the downstream task is located. That is, in the present application, an uplink task and a downlink task form a task group and complete data transmission of the task group in a full duplex mode, and the grouping manner in the present application allows normal data transmission between a user and a base station in an MEC scenario, so that the total system delay in the MEC scenario can be reduced.
A second embodiment of the present invention relates to a resource allocation method. The second embodiment is substantially the same as the first embodiment, with the main differences being: the second embodiment provides another specific way of obtaining K task groups arranged in sequence; fig. 3 is a flowchart illustrating a resource allocation method according to a second embodiment of the present invention.
In step 201, a user having a communication requirement with a base station having a mobile edge computing MEC function is identified. This step is similar to step 101 in the first embodiment, and is not described here again.
202, grouping an uplink task and a downlink task of a user to obtain a plurality of task groups which are sequentially arranged; comprising the following substeps:
a substep 2011 of combining the uplink task and the downlink task of the user and obtaining a plurality of temporary task groups; each temporary task group comprises an uplink task and a downlink task, each uplink task exists in a plurality of temporary task groups, and each downlink task exists in a plurality of temporary task groups;
and a substep 2013 of determining a plurality of task groups arranged in sequence based on the data transmission time difference of each temporary task group.
The following is a detailed description of each of the above substeps.
In sub-step 2011, it is assumed that the user identified in step 201 includes: n MEC computation offload users, P common uplink users and Q common downlink users, each MEC computation offload user having an uplink task and a downlink task, each common uplink user having an uplink task, and each common downlink user having a downlink task, then the number of temporary task groups may be: l ═ P + N (Q + N) -N. That is, the uplink task of each common uplink user can be combined with any one downlink task to form a temporary task group; each MEC calculates the upstream task of the uninstalling user, and can be combined with any downstream task except the downstream task of the MEC calculation uninstalling user to form a temporary task group; the downlink task of each common downlink user can be combined with any uplink task to form a temporary task group; each MEC calculates the downstream tasks of the off-load users and can be combined with any one of the upstream tasks except the upstream tasks of the MEC calculation off-load users to form a temporary task group.
In sub-step 2012, for each temp task group, the difference in data transmission time between the temp task group in full duplex mode and half duplex mode is estimated. In one example, the minimum data transmission duration in the full-duplex mode and the minimum data transmission duration in the half-duplex mode of each temporary task group can be estimated at least according to the preset maximum transmission power for transmitting data and the data transmission quantity of each temporary task group; and calculating the difference value of the minimum data transmission time length of each temporary task group in the full-duplex mode and the minimum data transmission time length of each temporary task group in the half-duplex mode, and taking the difference value as the data transmission time difference of each temporary task group.
The minimum data transmission duration of each temporary task group in full duplex mode may be estimated, for example, using a binary search method, as follows.
Recording an uplink task in the temporary task group as m and recording a downlink task as n; then, each temporary task group needs to satisfy the following condition:
wherein, tm,nIndicates the data transmission duration occupied by the temporary task group (m, n), B indicates the channel bandwidth,
and
representing the transmitting power of the user terminal executing the uplink task and the transmitting power of the base station executing the downlink task in the temporary task group (m, n);
hm,nwhich represents the power gain of the channel and,
the data transmission quantity of the uplink task and the data transmission quantity of the downlink task are represented;
respectively representing the maximum transmitting power of an uplink task and the maximum transmitting power of a downlink task, and alpha represents the full-duplex self-interference elimination ratio of a base station segment.
T assigned for each temporary task groupm,nAt a minimum, it can be determined first
And
one of (1) is taken as the maximum value, i.e. order
Or order
Namely, the optimal transmitting power corresponding to one task is the maximum power value allowed by the system; and a binary search method is adopted to obtain another optimal value of power, namely the optimal transmitting power of another task. The end condition of the binary search method is that the difference value of the solutions searched for twice in the adjacent two times is within a preset error interval.
As above, grouping temporary tasks using a binary search method
And
after all the values are determined, the minimum data transmission time of the temporary task group in the full duplex mode can be obtained and recorded as
I.e. represents the minimum delay that can be achieved for the data transmission of the temporary task group. Therefore, the time consumed for the base station and the user of each temporary task group to complete the data transmission of each temporary task group based on the optimal transmission power is the minimum data transmission time length.
The minimum data transmission duration of each temporary task group in the half-duplex mode refers to the sum of the minimum data transmission duration of an uplink task in the temporary task group and the minimum data transmission duration of a downlink task in the temporary task group; the minimum data transmission duration of the uplink task or the downlink task may be, for example, the minimum data transmission duration of the uplink task is the transmission data amount of the uplink task/the maximum transmission power of the uplink task; and the minimum data transmission time length of the downlink task is the transmission data volume of the downlink task/the maximum transmission power of the downlink task. The minimum transmission data duration of the uplink task m and the minimum transmission data duration of the downlink task n can be respectively recorded as
The minimum data transmission duration of the temporary task group in the full-duplex mode and the data transmission time difference in the half-duplex mode can be expressed as:
in sub-step 2013, a greedy algorithm may be based on the screening to obtain K task groups. In particular, the greedy algorithm may comprise the following steps.
Step 3.1:
substep 3.1.1, screening out a first class of task groups from all currently existing temporary task groups (when substep 3.1.1 is executed for the first time, L currently existing temporary task groups are available), wherein each task group in the first class of task groups comprises: and calculating the uplink tasks of the uninstalled users and the downlink tasks of the common downlink users by the common uplink users or the MEC.
Substep 3.1.2, screening out a temporary task group with the largest data transmission time difference from the first task group, and taking the temporary task group as a screened first task group K1(m1, n 1); wherein, the minimum data transmission duration, the optimal transmit power of the uplink task, and the optimal transmit power of the downlink task of the task group K1(m1, n1) in the full-duplex mode are determined in the substep 2012 above; and the optimal transmitting power of the uplink task can be sent to the user terminal to which the uplink task belongs, so that the subsequent user terminal can transmit data to the base station based on the optimal transmitting power in the uplink task.
Substep 3.1.3, deleting the temporary task group including the ascending task m1 and the descending task n1 from all the temporary task groups currently existing (L temporary task groups currently existing when substep 3.1.3 is executed for the first time).
Substep 3.1.3, if it is determined that the up task m1 in K1 is the up task of the MEC calculation offload user, then step 3.2 is entered.
Step 3.2:
substep 3.2.1, selecting a second type of task group from the temporary task groups left after substep 3.1.3 is performed, each temporary task group in the second type of task group comprising: the MEC calculates the downstream task n2 of the offload user;
substep 3.2.2, screening out a temporary task group with the largest data transmission time difference from the second task group as a screened out second task group K2(m2, n 2);
substep 3.2.3, deleting the temporary task group including the upstream task m2 and the downstream task n2 from the temporary task groups left after substep 3.1.3, at which point L-2 temporary task groups remain.
Substep 3.2.4, if the upstream task m2 in the task group K2 is judged to be the upstream task of another MEC for calculating the uninstalled user, returning to the step 3.2; and if the uplink task m2 in the task group K2 is judged to be the uplink task of the ordinary uplink user, returning to the step 3.1.
And (4) continuously and circularly calculating through the step 3.1 and the step 3.2 until all the K task groups which are sequentially arranged are selected.
In the embodiment, the optimal transmitting power of each task group is searched by adopting a binary search method, and the minimum data transmission time length of each task group is determined based on the optimal transmitting power; screening out K task groups which are sequentially arranged based on a greedy algorithm; because the time complexity of the binary search method and the greedy algorithm is low, the time consumption generated in the calculation process of resource allocation can be greatly reduced, and the total time delay of the system in the MEC scene is greatly reduced. However, the present embodiment does not limit this, in other examples, other algorithms may be used for calculation, and in general, an algorithm with a time complexity smaller than the polynomial time may be used.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
A third embodiment of the present invention relates to a server, as shown in fig. 4, including:
at least one processor 401; and the number of the first and second groups,
a memory 402 communicatively coupled to the at least one processor 401; wherein the content of the first and second substances,
the memory 402 stores instructions executable by the at least one processor 401 to enable the at least one processor 401 to perform the above-described resource allocation method.
Wherein, the server is arranged in the base station.
Where the memory 402 and the processor 401 are coupled by a bus, which may include any number of interconnected buses and bridges that couple one or more of the various circuits of the processor 401 and the memory 402 together. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor 401 may be transmitted over a wireless medium via an antenna, which may receive the data and transmit the data to the processor 401.
The processor 401 is responsible for managing the bus and general processing and may provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. And memory 402 may be used to store data used by processor 401 in performing operations.
A fourth embodiment of the present invention relates to a computer-readable storage medium storing a computer program. The computer program realizes the above-described method embodiments when executed by a processor.
That is, those skilled in the art can understand that all or part of the steps in the method of the above embodiments can be implemented by a program to instruct related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, etc.) or a processor (Krocessor) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific embodiments for practicing the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
Claims (10)
1. A method for resource allocation, comprising:
identifying a user having a communication need with a base station having a mobile edge computing, MEC, function;
grouping the uplink tasks and the downlink tasks of the users to obtain a plurality of task groups which are sequentially arranged so as to allow the base station to sequentially complete data transmission of the task groups in a time division multiplexing mode in a full duplex mode;
each task group comprises at least one of the uplink task and the downlink task, the uplink task and the downlink task of the same MEC calculation unloading user in the user are divided into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located.
2. The method according to claim 1, wherein the grouping the uplink tasks and the downlink tasks of all the users to obtain a plurality of task groups arranged in sequence comprises:
combining the uplink task and the downlink task to obtain a plurality of temporary task groups; each temporary task group comprises one uplink task and one downlink task, each uplink task exists in a plurality of temporary task groups, and each downlink task exists in a plurality of temporary task groups;
estimating a data transmission time difference between each of the temporary task groups in a full-duplex mode and a half-duplex mode;
and determining a plurality of task groups which are sequentially arranged based on the data transmission time difference of each temporary task group.
3. The method of claim 2, wherein the estimating a difference between data transmission time in full-duplex mode and data transmission time in half-duplex mode for each of the temporary task groups comprises:
estimating the minimum data transmission time length of each temporary task group in a full-duplex mode and the minimum data transmission time length of each temporary task group in a half-duplex mode at least according to the preset maximum transmitting power for transmitting data and the data transmission quantity of each task group;
and calculating the difference value of the minimum data transmission time length of each temporary task group in the full-duplex mode and the minimum data transmission time length of each temporary task group in the half-duplex mode, and taking the difference value as the data transmission time difference of each temporary task group.
4. The method according to claim 3, wherein the minimum data transmission duration in the full-duplex mode of each temporary task group is estimated based on at least a preset maximum transmission power for transmitting data and a data transmission amount of each task group, and the minimum data transmission duration in the full-duplex mode of each temporary task group is estimated based on a binary search method.
5. The method according to claim 4, wherein in the estimating the minimum data transmission duration of each of the temporary task groups in the full-duplex mode based on the binary search method, the optimal transmit power corresponding to each of the temporary task groups is also estimated;
and the base station and the user of each temporary task group complete the data transmission of each temporary task group based on the optimal transmitting power, wherein the time consumption is the minimum data transmission time length.
6. The method according to claim 2, wherein the determining of the plurality of sequentially arranged task groups is based on the data transmission time difference of each of the temporary task groups, and the determining of the plurality of sequentially arranged task groups is based on a greedy algorithm.
7. The resource allocation method according to claim 1, wherein the resource allocation method is performed periodically; and identifying all users having communication requirements with the base station in the current period from the users having communication requirements with the base station having the mobile edge computing MEC function.
8. A server, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of resource allocation according to any one of claims 1 to 7.
9. The server according to claim 8, wherein the server is disposed in the base station.
10. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the resource allocation method of any one of claims 1 to 7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911133214.5A CN112911708A (en) | 2019-11-19 | 2019-11-19 | Resource allocation method, server and storage medium |
| PCT/CN2020/120161 WO2021098403A1 (en) | 2019-11-19 | 2020-10-10 | Resource allocation method, server, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911133214.5A CN112911708A (en) | 2019-11-19 | 2019-11-19 | Resource allocation method, server and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112911708A true CN112911708A (en) | 2021-06-04 |
Family
ID=75981027
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911133214.5A Pending CN112911708A (en) | 2019-11-19 | 2019-11-19 | Resource allocation method, server and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112911708A (en) |
| WO (1) | WO2021098403A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117119596A (en) * | 2023-10-24 | 2023-11-24 | 唐人通信技术服务股份有限公司 | Quality control method and system for communication transmission line |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114138453B (en) * | 2021-10-18 | 2022-10-28 | 中标慧安信息技术股份有限公司 | Resource optimization allocation method and system suitable for edge computing environment |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10638372B2 (en) * | 2017-06-01 | 2020-04-28 | Huawei Technologies Co., Ltd. | Geographic dispersion of radio access network (RAN) node functions |
| US10645615B2 (en) * | 2017-11-17 | 2020-05-05 | Hon Hai Precision Industry Co., Ltd. | Method and apparatus for establishing bearers in a wireless communication system |
| CN108600002B (en) * | 2018-04-17 | 2021-02-26 | 浙江工业大学 | Mobile edge calculation and distribution decision method based on semi-supervised learning |
| CN108809695B (en) * | 2018-04-28 | 2021-07-06 | 国网浙江省电力有限公司电力科学研究院 | Distributed uplink unloading strategy facing mobile edge calculation |
| CN108920280B (en) * | 2018-07-13 | 2021-06-11 | 哈尔滨工业大学 | Mobile edge computing task unloading method under single-user scene |
-
2019
- 2019-11-19 CN CN201911133214.5A patent/CN112911708A/en active Pending
-
2020
- 2020-10-10 WO PCT/CN2020/120161 patent/WO2021098403A1/en active Application Filing
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117119596A (en) * | 2023-10-24 | 2023-11-24 | 唐人通信技术服务股份有限公司 | Quality control method and system for communication transmission line |
| CN117119596B (en) * | 2023-10-24 | 2024-01-05 | 唐人通信技术服务股份有限公司 | Quality control method and system for communication transmission line |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021098403A1 (en) | 2021-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110896355B (en) | Network slice selection method and device | |
| EP2202924B1 (en) | Methods and apparatus for enhanced delivery of content over a data network | |
| US10652360B2 (en) | Access scheduling method and apparatus for terminal, and computer storage medium | |
| JP2013059048A (en) | Methods and systems for resizing multimedia content based on quality and rate information | |
| KR20080100224A (en) | Methods and systems for resizing multimedia content based on quality and rate information | |
| US11902108B2 (en) | Dynamic adaptive network | |
| JP7171710B2 (en) | RBG division method and user terminal | |
| CN110674942A (en) | Bandwidth management method and device, electronic equipment and readable storage medium | |
| CN110267276B (en) | Network slice deployment method and device | |
| CN109743751B (en) | Resource allocation method and device for wireless access network | |
| CN112911708A (en) | Resource allocation method, server and storage medium | |
| CN112868265A (en) | Network resource management method, management device, electronic device and storage medium | |
| CN115103450A (en) | Multi-service time slot distribution method and equipment | |
| CN110351843B (en) | Resource allocation indicating method, resource allocation obtaining method, base station and user terminal | |
| CN112867088A (en) | Dynamic adjustment method and system for cloud-edge-end communication architecture | |
| CN110139371B (en) | Resource allocation method, terminal and network side equipment | |
| CN109951506B (en) | Method and equipment for evaluating performance of storage cluster | |
| US20220264601A1 (en) | Feedback channel mapping method and apparatus, device, and storage medium | |
| CN114978273A (en) | Satellite-ground load balancing processing method and ground control center | |
| CN114125859A (en) | Method, device and system for spectrum sharing | |
| CN111385902A (en) | Data scheduling method and device | |
| KR102288700B1 (en) | Method and apparatus for wireless communication using memory storing information of user equipment | |
| CN115878306A (en) | HQOS speed limiting method, device, single board and storage medium | |
| CN117676709A (en) | Data grooming method, device and system | |
| CN117014055A (en) | Channel capacity determining method and related equipment |
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 |