CN113055892A - Carrier scheduling method and device, computing equipment and computer storage medium - Google Patents
Carrier scheduling method and device, computing equipment and computer storage medium Download PDFInfo
- Publication number
- CN113055892A CN113055892A CN201911378840.0A CN201911378840A CN113055892A CN 113055892 A CN113055892 A CN 113055892A CN 201911378840 A CN201911378840 A CN 201911378840A CN 113055892 A CN113055892 A CN 113055892A
- Authority
- CN
- China
- Prior art keywords
- scheduling
- volume
- sector
- reducible
- carriers
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/04—Traffic adaptive resource partitioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a carrier scheduling method, a carrier scheduling device, a computing device and a computer storage medium. Wherein, the method comprises the following steps: predicting the number of carriers required by each sector in the next scheduling period according to historical traffic data and network configuration data, and determining the number of expansion carriers and the volume-reducible sectors according to the number of carriers required by each sector in the next scheduling period; carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expansion carriers to obtain scheduling cost corresponding to the volume-reducible sectors; and generating a capacity expansion and reduction scheme according to the scheduling cost corresponding to the capacity reduction sector, and carrying out carrier scheduling according to the capacity expansion and reduction scheme. According to the scheme provided by the invention, through carrying out cost evaluation on the volume-reducible sectors and removing License according to the scheduling cost corresponding to the volume-reducible sectors, the scheduling times are effectively controlled, high load is avoided as much as possible, the increased cost caused by frequent scheduling is reduced due to the reduction of the scheduling times, and the problem of increased operation cost caused by unreasonable scheduling in the prior art is solved.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a carrier scheduling method, an apparatus, a computing device, and a computer storage medium.
Background
Telecommunication operator communication network provides conversation and internet access services for users in the area through wireless base station cell coverage, and as the user traffic and the user scale are gradually increased, the bottleneck problem of wireless resources of the coverage cell is highlighted. Due to the characteristics of the mobile communication service tide effect and the fact that base station equipment supports flexible configuration of the number of carriers (the number of the carriers can be controlled only by activating or deactivating software license), the existing carrier resources are fully utilized on the premise that carrier resources are not increased, idle carriers in a region with reduced bandwidth and service requirements are adjusted to a region with increased bandwidth and service in real time through flexible scheduling of the carrier resources, and the problem of high load of part of hot spot regions caused by service growth is solved.
When the carrier is evaluated whether to need to be subjected to capacity expansion and capacity reduction adjustment, capacity reduction and expansion operation is carried out according to a set standard, and the operation mode does not consider the operation cost rise caused by the increase of the number of capacity expansion and reduction operations.
Disclosure of Invention
In view of the above, embodiments of the present invention are proposed to provide a carrier scheduling method, apparatus, computing device and computer storage medium that overcome or at least partially solve the above problems.
According to an aspect of the embodiments of the present invention, there is provided a carrier scheduling method, including:
predicting the number of carriers required by each sector in the next scheduling period according to historical traffic data and network configuration data, and determining the number of expansion carriers and the volume-reducible sectors according to the number of carriers required by each sector in the next scheduling period;
carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expansion carriers to obtain scheduling cost corresponding to the volume-reducible sectors;
and generating a capacity expansion and reduction scheme according to the scheduling cost corresponding to the capacity reduction sector, and carrying out carrier scheduling according to the capacity expansion and reduction scheme.
According to another aspect of the embodiments of the present invention, there is provided a carrier scheduling apparatus, including:
the determining module is suitable for predicting the number of carriers required by each sector in the next scheduling period according to historical traffic data and network configuration data, and determining the number of expansion carriers and the volume-reducible sectors according to the number of the carriers required by each sector in the next scheduling period;
the cost evaluation module is suitable for carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers to obtain scheduling cost corresponding to the volume-reducible sectors;
and the scheduling module is suitable for generating a capacity expansion and reduction scheme according to the scheduling cost corresponding to the capacity reduction sector and carrying out carrier scheduling according to the capacity expansion and reduction scheme.
According to still another aspect of an embodiment of the present invention, there is provided a computing device including: the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation corresponding to the carrier scheduling method.
According to a further aspect of the embodiments of the present invention, there is provided a computer storage medium having at least one executable instruction stored therein, where the executable instruction causes a processor to perform operations corresponding to the carrier scheduling method.
According to the scheme provided by the invention, through carrying out cost evaluation on the volume-reducible sectors and removing License according to the scheduling cost corresponding to the volume-reducible sectors, the scheduling times are effectively controlled, high load is avoided as much as possible, the increased cost caused by frequent scheduling is reduced due to the reduction of the scheduling times, and the problem of increased operation cost caused by unreasonable scheduling in the prior art is solved.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and the embodiments of the present invention can be implemented according to the content of the description in order to make the technical means of the embodiments of the present invention more clearly understood, and the detailed description of the embodiments of the present invention is provided below in order to make the foregoing and other objects, features, and advantages of the embodiments of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the embodiments of the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1A shows a flowchart of a carrier scheduling method provided in an embodiment of the present invention;
FIG. 1B is a schematic diagram of scheduling cost calculation;
fig. 2 is a schematic structural diagram illustrating a carrier scheduling apparatus according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a computing device provided by an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
Fig. 1 shows a flowchart of a carrier scheduling method according to an embodiment of the present invention. As shown in fig. 1, the method comprises the steps of:
step S101, according to historical telephone traffic data and network configuration data, predicting the number of carriers required by each sector in the next scheduling period, and determining the number of capacity-expanding carriers and the capacity-reducing sectors according to the number of carriers required by each sector in the next scheduling period.
In this embodiment, historical traffic data and network configuration data may be obtained first, where the historical traffic data refers to traffic data that has been generated before the current time, that is, data generated by traffic that actually occurs in the wireless network.
After the historical traffic data and the network configuration data are obtained, the number of carriers required by each sector in the next scheduling period can be predicted according to the historical traffic data and the network configuration data, for example, the number of carriers required by each sector in the next scheduling period is predicted by an artificial intelligence algorithm.
After the number of carriers required by each sector in the next period is predicted, the number of capacity expansion carriers and the number of capacity reduction sectors can be determined according to the number of carriers required by each sector in the next scheduling period, where the number of capacity expansion carriers is the total number of carriers required to be expanded by all sectors to be expanded. The total number of sectors is determined, and the sectors needing capacity expansion are determined, so that the capacity-reducible sectors can be determined. In this embodiment, License is used for activating a carrier, and there must be License support for available carriers, for example, hardware of a carrier may support 6 carriers, and only 3 licenses can use 3 carriers. Thus, here the scheduling of carriers is actually a scheduling of License.
Intuitively, as the number of License applications increases, more spare resources are available, the License of each sector becomes more 'spare', the number of times of "borrowing" the License from other sectors is reduced, and therefore the overall scheduling number is also reduced. The License of each sector can reach self-sufficiency under the condition that the License is extremely abundant, and the scheduling times are always 0. Conversely, if the number of License commits is just enough and the number of redundant License is small, then the License needs to be scheduled frequently to maximize the utilization of each License.
In summary, too many License numbers may result in too high License purchase cost, while too few License numbers may result in very high scheduling frequency, which may result in too high operation and maintenance cost, and the carrier scheduling method of this embodiment is implemented based on the given License numbers.
And step S102, carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expansion carriers to obtain the scheduling cost corresponding to the volume-reducible sectors.
Specifically, the number of capacity expansion carriers determines the number of licenses to be removed, where the number of licenses is to be performed from the capacity reducible sector, so that after the number of capacity expansion carriers and the number of capacity reducible sectors are determined according to step S101, the cost of the capacity reducible sector can be evaluated according to the number of capacity expansion carriers, and the scheduling cost corresponding to the capacity reducible sector is obtained. The scheduling cost is measured by the time when the capacity-reducible sector generates high load after the capacity-reducible sector removes a certain number of licenses, and the later the time when the capacity-reducible sector generates high load indicates that the scheduling cost is smaller.
In an optional embodiment of the present invention, the performing cost evaluation on the volume-reducible sector according to the number of the capacity-expansion carriers to obtain a scheduling cost corresponding to the volume-reducible sector further includes: determining the number of carriers configured by a capacity-reduced sector at a scheduling time; and carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers, the number of the carriers configured by the volume-reducible sectors at the scheduling moment and the number of the carriers required by the volume-reducible sectors in the next scheduling period to obtain the scheduling cost corresponding to the volume-reducible sectors.
The carrier scheduling is a pre-scheduling process, the number of carriers configured by the volume-reducible sector at the scheduling time can be determined, and the number of carriers required by the volume-reducible sector in the next scheduling period is predicted in step S101, so that the cost of the volume-reducible sector can be evaluated according to the number of volume-reducible carriers, the number of carriers configured by the volume-reducible sector at the scheduling time, and the number of carriers required by the volume-reducible sector in the next scheduling period, and the scheduling cost corresponding to the volume-reducible sector can be obtained.
In general, a carrier scheduling corresponds to a confinement duration, which indicates that the capacity expansion of the carrier is prohibited in the duration, and the confinement duration is a duration for creating License, but for a volume-reducible sector, the volume reduction is realized at the next moment of the scheduling time. Here, the carrier confinement duration L and the number Y of activated carriers in the period of the carrier confinement duration L can be determined, where Y is the total number of carriers to be activated in the period of the confinement duration L, and for convenience of subsequent description, the current scheduling time is denoted as Ti+jJ is 0, the number of carriers configured by the volume-reducible sector at the scheduling time is X, the number of capacity-expansion carriers is R, the length of the cost evaluation window is n, and the volume-reducible sector is at Ti+L+NThe number of carriers required at a time is CNWherein N is more than or equal to 1 and less than or equal to N, and j is required to be judged whether to be equal to 0 or not; if j is 0, judging whether j is smaller than N; if j<N, assigning j to j +1 and judging whether X-R + Y is smaller than CN(ii) a If X-R + Y<CNThen determine Ti+L+jThe moment when the volume-reducible sector has high load; and calculating the scheduling cost corresponding to the volume-reducible sector based on the length n of the cost evaluation window and the j value of the moment when the volume-reducible sector has high load. For example, if the scheduling cost is E, then E ═ n-j, the scheduling cost directly reflects the early and late times of occurrence of high load, and reflects how many times of scheduling.
In the following, two volume-reducible sectors are taken as an example, volume-reducible sector 1 and volume-reducible sector 2, where: the capacity expansion carrier number is 1, that is, a License needs to be removed from the capacity-reducible sector, then R is 1, the cost estimation window N is 24, and the lock duration L is 3, the carrier numbers of the capacity-reducible sector 1 and the capacity-reducible sector 2 at the current scheduling time are both 4, and the carrier numbers predicted by the next scheduling period for the capacity-reducible sector 1 and the capacity-reducible sector 2 are shown in fig. 1B, where the numbers in the node of fig. 1B represent the carrier numbers, the numbers above the node represent the number of licenses needed to be added to the sector in the hour by the current scheduling plan, for example, +1 represents a License needed to be added to the sector in the corresponding hour.
The scheduling costs corresponding to the reducible sector 1 and the reducible sector 2 are calculated as follows:
for volume reducible sector 1:
at Ti+L+3Then, by calculating X-R + Y-4-1 +0+1+ 0-4<5, the moment when the volume-reducible sector 1 has high load is Ti+L+3When j is 3, then the scheduling cost E of the reducible sector 1 is 24-3-21
For volume reducible sector 2:
at Ti+2L+1Time, by calculating X-R + Y-4-1 +0+0+ 1-4<5, the moment when the volume-reducible sector 2 has high load is Ti+2L+1When j is 4, then the scheduling cost E of the reducible sector 2 is 24-4-20
The scheduling cost of reducible sector 2 is less than the scheduling cost of reducible sector 1.
And step S103, generating a capacity expansion and reduction scheme according to the scheduling cost corresponding to the capacity reduction sector, and carrying out carrier scheduling according to the capacity expansion and reduction scheme.
After the scheduling cost corresponding to the volume-reducible sector is obtained, an expansion-reduction scheme may be generated according to the scheduling cost, for example, the sector identifier and the expansion time of the volume-expandable sector and the sector identifier and the volume-reduction time of the volume-reducible sector may be determined according to the scheduling cost corresponding to the volume-reducible sector, the number of License required to be removed from the volume-reducible sector may also be determined, and the number of License required to be added to the volume-expandable sector may be determined, so that the expansion-reduction scheme may be generated according to the sector identifier and the expansion time of the volume-expandable sector and the sector identifier and the volume-reduction time of the volume-reducible sector, and the carrier may be scheduled according to the determined expansion-reduction scheme.
In connection with the above examples, will be at Ti+1Remove one License from reducible sector 2 at time Ti+L+1And adding License for the sector needing capacity expansion at any time.
According to the scheme provided by the invention, through carrying out cost evaluation on the volume-reducible sectors and removing License according to the scheduling cost corresponding to the volume-reducible sectors, the scheduling times are effectively controlled, high load is avoided as much as possible, the increased cost caused by frequent scheduling is reduced due to the reduction of the scheduling times, and the problem of increased operation cost caused by unreasonable scheduling in the prior art is solved.
Fig. 2 shows a schematic structural diagram of a carrier scheduling apparatus according to an embodiment of the present invention. As shown in fig. 2, the apparatus includes: a determining module 201, a cost evaluating module 202 and a scheduling module 203.
The determining module 201 is adapted to predict the number of carriers required by each sector in the next scheduling period according to the historical traffic data and the network configuration data, and determine the number of capacity-expanding carriers and the number of capacity-reducible sectors according to the number of carriers required by each sector in the next scheduling period;
the cost evaluation module 202 is adapted to perform cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers to obtain scheduling costs corresponding to the volume-reducible sectors;
and the scheduling module 203 is adapted to generate a capacity expansion and reduction scheme according to the scheduling cost corresponding to the capacity-reducible sector, and perform carrier scheduling according to the capacity expansion and reduction scheme.
Optionally, the cost evaluation module is further adapted to: determining the number of carriers configured by a capacity-reduced sector at a scheduling time;
and carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers, the number of the carriers configured by the volume-reducible sectors at the scheduling moment and the number of the carriers required by the volume-reducible sectors in the next scheduling period to obtain the scheduling cost corresponding to the volume-reducible sectors.
Optionally, the cost evaluation module is further adapted to: determining a carrier confinement duration L and the number Y of activated carriers in the time period of the carrier confinement duration L;
recording the current scheduling time as Ti+jJ is 0, the number of carriers configured by the volume-reducible sector at the scheduling time is X, the number of capacity-expansion carriers is R, the length of the cost evaluation window is n, and the volume-reducible sector is at Ti+L+NThe number of carriers required at a time is CNWherein N is more than or equal to 1 and less than or equal to N;
judging whether j is equal to 0;
if j is 0, judging whether j is smaller than N;
if j<N, assigning j to j +1 and judging whether X-R + Y is smaller than CN；
If X-R + Y<CNThen determine Ti+L+jThe moment when the volume-reducible sector has high load;
and calculating the scheduling cost corresponding to the volume-reducible sector based on the length n of the cost evaluation window and the j value of the moment when the volume-reducible sector has high load.
Optionally, the scheduling module is further adapted to: determining the sector identification and the capacity expansion time of the capacity expansion sector and the sector identification and the capacity reduction time of the capacity reduction sector according to the scheduling cost corresponding to the capacity reduction sector;
and generating an expansion and reduction scheme according to the sector identification and the expansion time of the expansion sector and the sector identification and the reduction time of the reduction sector.
According to the scheme provided by the invention, through carrying out cost evaluation on the volume-reducible sectors and removing License according to the scheduling cost corresponding to the volume-reducible sectors, the scheduling times are effectively controlled, high load is avoided as much as possible, the increased cost caused by frequent scheduling is reduced due to the reduction of the scheduling times, and the problem of increased operation cost caused by unreasonable scheduling in the prior art is solved.
An embodiment of the present invention provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction may execute the carrier scheduling method in any of the method embodiments.
Fig. 3 is a schematic structural diagram of a computing device according to an embodiment of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the computing device.
As shown in fig. 3, the computing device may include: a processor (processor), a Communications Interface (Communications Interface), a memory (memory), and a Communications bus.
Wherein: the processor, the communication interface, and the memory communicate with each other via a communication bus. A communication interface for communicating with network elements of other devices, such as clients or other servers. The processor is configured to execute a program, and may specifically execute relevant steps in the above-described carrier scheduling method embodiment for a computing device.
In particular, the program may include program code comprising computer operating instructions.
The processor may be a central processing unit CPU or an application Specific Integrated circuit asic or one or more Integrated circuits configured to implement embodiments of the present invention. The computing device includes one or more processors, which may be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.
And the memory is used for storing programs. The memory may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program may specifically be adapted to cause a processor to perform the carrier scheduling method in any of the method embodiments described above. For specific implementation of each step in the program, reference may be made to corresponding steps and corresponding descriptions in units in the foregoing carrier scheduling embodiments, which are not described herein again. It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described devices and modules may refer to the corresponding process descriptions in the foregoing method embodiments, and are not described herein again.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of embodiments of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best modes of embodiments of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that is, the claimed embodiments of the invention require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
The various component embodiments of the invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or Digital Signal Processor (DSP) may be used in practice to implement some or all of the functionality of some or all of the components according to embodiments of the present invention. Embodiments of the invention may also be implemented as apparatus or device programs (e.g., computer programs and computer program products) for performing a portion or all of the methods described herein. Such programs implementing embodiments of the present invention may be stored on computer-readable media or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. Embodiments of the invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specified otherwise.
Claims (10)
1. A carrier scheduling method comprises the following steps:
predicting the number of carriers required by each sector in the next scheduling period according to historical traffic data and network configuration data, and determining the number of expansion carriers and the volume-reducible sectors according to the number of carriers required by each sector in the next scheduling period;
carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expansion carriers to obtain scheduling cost corresponding to the volume-reducible sectors;
and generating a capacity expansion and reduction scheme according to the scheduling cost corresponding to the capacity reduction sector, and carrying out carrier scheduling according to the capacity expansion and reduction scheme.
2. The method of claim 1, wherein the performing cost evaluation on the volume-reducible sectors according to the number of the volume-expansion carriers to obtain the scheduling cost corresponding to the volume-reducible sectors further comprises:
determining the number of carriers configured by a capacity-reduced sector at a scheduling time;
and carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers, the number of the carriers configured by the volume-reducible sectors at the scheduling moment and the number of the carriers required by the volume-reducible sectors in the next scheduling period to obtain the scheduling cost corresponding to the volume-reducible sectors.
3. The method of claim 2, wherein the performing cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers, the number of carriers configured by the volume-reducible sectors at the scheduling time, and the number of carriers required by the volume-reducible sectors in the next scheduling period to obtain the scheduling cost corresponding to the volume-reducible sectors further comprises:
determining a carrier confinement duration L and the number Y of activated carriers in the time period of the carrier confinement duration L;
recording the current scheduling time as Ti+jJ is 0, the number of carriers configured by the volume-reducible sector at the scheduling time is X, the number of capacity-expansion carriers is R, the length of the cost evaluation window is n, and the volume-reducible sector is at Ti+L+NThe number of carriers required at a time is CNWherein N is more than or equal to 1 and less than or equal to N;
judging whether j is equal to 0;
if j is 0, judging whether j is smaller than N;
if j<N, assigning j to j +1 and judging whether X-R + Y is smaller than CN；
If X-R + Y<CNThen determine Ti+L+jThe moment when the volume-reducible sector has high load;
and calculating the scheduling cost corresponding to the volume-reducible sector based on the length n of the cost evaluation window and the j value of the moment when the volume-reducible sector has high load.
4. The method of any of claims 1-3, wherein the generating a capacity expansion scheme according to a scheduling cost corresponding to a capacity reducible sector further comprises:
determining the sector identification and the capacity expansion time of the capacity expansion sector and the sector identification and the capacity reduction time of the capacity reduction sector according to the scheduling cost corresponding to the capacity reduction sector;
and generating an expansion and reduction scheme according to the sector identification and the expansion time of the expansion sector and the sector identification and the reduction time of the reduction sector.
5. A carrier scheduling apparatus, comprising:
the determining module is suitable for predicting the number of carriers required by each sector in the next scheduling period according to historical traffic data and network configuration data, and determining the number of expansion carriers and the volume-reducible sectors according to the number of the carriers required by each sector in the next scheduling period;
the cost evaluation module is suitable for carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers to obtain scheduling cost corresponding to the volume-reducible sectors;
and the scheduling module is suitable for generating a capacity expansion and reduction scheme according to the scheduling cost corresponding to the capacity reduction sector and carrying out carrier scheduling according to the capacity expansion and reduction scheme.
6. The apparatus of claim 5, wherein the cost evaluation module is further adapted to:
determining the number of carriers configured by a capacity-reduced sector at a scheduling time;
and carrying out cost evaluation on the volume-reducible sectors according to the number of the volume-expandable carriers, the number of the carriers configured by the volume-reducible sectors at the scheduling moment and the number of the carriers required by the volume-reducible sectors in the next scheduling period to obtain the scheduling cost corresponding to the volume-reducible sectors.
7. The apparatus of claim 6, wherein the cost evaluation module is further adapted to: determining a carrier confinement duration L and the number Y of activated carriers in the time period of the carrier confinement duration L;
recording the current scheduling time as Ti+jJ is 0, the number of carriers configured by the volume-reducible sector at the scheduling time is X, the number of capacity-expansion carriers is R, the length of the cost evaluation window is n, and the volume-reducible sector is at Ti+L+NThe number of carriers required at a time is CNWherein N is more than or equal to 1 and less than or equal to N;
judging whether j is equal to 0;
if j is 0, judging whether j is smaller than N;
if j<N, assigning j to j +1 and judging whether X-R + Y is smaller than CN；
If X-R + Y<CNThen determine Ti+L+jThe moment when the volume-reducible sector has high load;
and calculating the scheduling cost corresponding to the volume-reducible sector based on the length n of the cost evaluation window and the j value of the moment when the volume-reducible sector has high load.
8. The apparatus of any of claims 5-7, wherein the scheduling module is further adapted to:
determining the sector identification and the capacity expansion time of the capacity expansion sector and the sector identification and the capacity reduction time of the capacity reduction sector according to the scheduling cost corresponding to the capacity reduction sector;
and generating an expansion and reduction scheme according to the sector identification and the expansion time of the expansion sector and the sector identification and the reduction time of the reduction sector.
9. A computing device, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is used for storing at least one executable instruction, and the executable instruction causes the processor to execute the operation corresponding to the carrier scheduling method of any one of claims 1-4.
10. A computer storage medium having stored therein at least one executable instruction for causing a processor to perform operations corresponding to the carrier scheduling method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378840.0A CN113055892B (en) | 2019-12-27 | 2019-12-27 | Carrier scheduling method and device, computing equipment and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378840.0A CN113055892B (en) | 2019-12-27 | 2019-12-27 | Carrier scheduling method and device, computing equipment and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113055892A true CN113055892A (en) | 2021-06-29 |
| CN113055892B CN113055892B (en) | 2022-10-18 |
Family
ID=76506843
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911378840.0A Active CN113055892B (en) | 2019-12-27 | 2019-12-27 | Carrier scheduling method and device, computing equipment and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113055892B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114513813A (en) * | 2021-12-10 | 2022-05-17 | 中国联合网络通信集团有限公司 | Load balance evaluation method and device and computer readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060291413A1 (en) * | 2003-05-21 | 2006-12-28 | Swisscom Ag | System for the dynamic allocation of carrier frequencies to a access points of a wireless local area network (wlan) |
| CN102111888A (en) * | 2011-04-06 | 2011-06-29 | 华为技术有限公司 | Channel allocation method and device and system |
| CN103379644A (en) * | 2012-04-13 | 2013-10-30 | 中国移动通信集团公司 | Carrier wave scheduling method and system |
| CN104105206A (en) * | 2013-04-12 | 2014-10-15 | 中国移动通信集团北京有限公司 | TD-SCDMA network carrier wave adjusting method, device and system |
| CN109981234A (en) * | 2017-12-28 | 2019-07-05 | 中国移动通信集团辽宁有限公司 | Self-adapting regulation method, device, equipment and the medium of dual carrier and carrier wave polymerization |
| CN110457287A (en) * | 2019-07-03 | 2019-11-15 | 北京百度网讯科技有限公司 | The scalable content processing method and device of database, computer equipment and readable medium |
-
2019
- 2019-12-27 CN CN201911378840.0A patent/CN113055892B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060291413A1 (en) * | 2003-05-21 | 2006-12-28 | Swisscom Ag | System for the dynamic allocation of carrier frequencies to a access points of a wireless local area network (wlan) |
| CN102111888A (en) * | 2011-04-06 | 2011-06-29 | 华为技术有限公司 | Channel allocation method and device and system |
| CN103379644A (en) * | 2012-04-13 | 2013-10-30 | 中国移动通信集团公司 | Carrier wave scheduling method and system |
| CN104105206A (en) * | 2013-04-12 | 2014-10-15 | 中国移动通信集团北京有限公司 | TD-SCDMA network carrier wave adjusting method, device and system |
| CN109981234A (en) * | 2017-12-28 | 2019-07-05 | 中国移动通信集团辽宁有限公司 | Self-adapting regulation method, device, equipment and the medium of dual carrier and carrier wave polymerization |
| CN110457287A (en) * | 2019-07-03 | 2019-11-15 | 北京百度网讯科技有限公司 | The scalable content processing method and device of database, computer equipment and readable medium |
Non-Patent Citations (3)
| Title |
|---|
| 刘建强等: "基于BP神经网络的4G话务预测方法研究", 《电信工程技术与标准化》, no. 06, 15 June 2019 (2019-06-15) * |
| 陈琨天: "移动通信网内载频自动调度的方法及软件实现", 《信息通信》, no. 12, 15 December 2015 (2015-12-15), pages 1 - 3 * |
| 黄海晖等: "载波智能调度系统的研发及应用", 《电信工程技术与标准化》, no. 05, 15 May 2019 (2019-05-15) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114513813A (en) * | 2021-12-10 | 2022-05-17 | 中国联合网络通信集团有限公司 | Load balance evaluation method and device and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113055892B (en) | 2022-10-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113377540A (en) | Cluster resource scheduling method and device, electronic equipment and storage medium | |
| CN111756550B (en) | Block chain consensus method and device | |
| CN110532092A (en) | Reso urce matching method, device and equipment | |
| CN106371889B (en) | Method and device for realizing high-performance cluster system of scheduling mirror image | |
| CN110808914A (en) | Access request processing method and device and electronic equipment | |
| CN104239156A (en) | External service call method and system | |
| CN111104227A (en) | Resource control method and device of K8s platform and related components | |
| CN106815080A (en) | Distributed diagram data treating method and apparatus | |
| CN105824705B (en) | A kind of method for allocating tasks and electronic equipment | |
| CN110764930B (en) | Request or response processing method and device based on message mode | |
| CN113055892B (en) | Carrier scheduling method and device, computing equipment and computer storage medium | |
| CN110929195B (en) | Data caching strategy determining method and device and electronic equipment | |
| CN112888021B (en) | Task unloading method for avoiding interruption in Internet of vehicles | |
| CN109992392A (en) | A kind of calculation resource disposition method, device and Resource Server | |
| CN110633113A (en) | Method and system for starting application program, storage medium and mobile device | |
| CN109450684B (en) | Method and device for expanding physical node capacity of network slicing system | |
| Ray et al. | Trace-driven modeling and verification of a mobility-aware service allocation and migration policy for mobile edge computing | |
| CN113807539B (en) | Machine learning and graphic computing power high multiplexing method, system, medium and terminal | |
| CN116467065A (en) | Algorithm model training method and device, electronic equipment and storage medium | |
| CN115185658A (en) | Task unloading scheduling method based on time and communication reliability and related product | |
| CN113946489A (en) | Data acquisition method, system, device and storage medium | |
| CN114518932A (en) | Method, system, computing device and storage medium for scheduling function service | |
| CN110362769A (en) | A kind of data processing method and device | |
| CN117707797B (en) | Task scheduling method and device based on distributed cloud platform and related equipment | |
| CN117785457A (en) | Resource management method, device, equipment and 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 |