CN113518459B - Resource scheduling processing method and device and electronic equipment - Google Patents
Resource scheduling processing method and device and electronic equipment Download PDFInfo
- Publication number
- CN113518459B CN113518459B CN202110793452.XA CN202110793452A CN113518459B CN 113518459 B CN113518459 B CN 113518459B CN 202110793452 A CN202110793452 A CN 202110793452A CN 113518459 B CN113518459 B CN 113518459B
- Authority
- CN
- China
- Prior art keywords
- member user
- user
- uplink
- scheduling priority
- downlink
- 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
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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
-
- 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
Abstract
The embodiment of the invention provides a resource scheduling processing method, a device and electronic equipment, wherein the method comprises the steps of obtaining user information corresponding to each member user, respectively distributing a user identification code to the user information corresponding to each member user, obtaining call information of each member user according to the user identification code of each member user, determining a resident cell library corresponding to each member user according to occupied cell information contained in the call information, determining scheduling priority of each member user according to preset scheduling processing rules and the resident cell library corresponding to each member user, and dynamically distributing network resources for each member user and non-member users according to the scheduling priority of each member user. This embodiment improves the rationality of the network resource allocation.
Description
Technical Field
The embodiment of the invention relates to the technical field of data processing, in particular to a resource scheduling processing method and device and electronic equipment.
Background
With the development of the mobile network age, the user experience becomes an important factor for checking the transmission effect of the mobile network.
In the prior art, normal operation of each node in a mobile communication network can be ensured by optimizing a wireless radio frequency signal, optimizing a wireless parameter strategy, repairing a key fault site and the like, so that user experience is ensured.
However, when the normal operation of each node in the mobile communication network is ensured by means of optimizing the wireless radio frequency signals, optimizing the wireless parameter strategies, repairing the key fault sites and the like, the operation is performed for all users, and the rationality of network resource allocation is reduced.
Disclosure of Invention
The embodiment of the invention provides a resource scheduling processing method, a device and electronic equipment, which are used for improving the rationality of network resource allocation.
In a first aspect, an embodiment of the present invention provides a method for processing resource scheduling, including:
acquiring user information corresponding to each member user, and respectively distributing a user identification code for the user information corresponding to each member user;
acquiring call information of each member user according to the user identification code of each member user, and determining a resident cell library corresponding to each member user according to the occupied cell information contained in the call information;
determining the scheduling priority of each member user according to a preset scheduling processing rule and a resident cell library corresponding to each member user;
and dynamically distributing network resources for each member user and the non-member users according to the scheduling priority of each member user.
Optionally, the determining the resident cell library corresponding to each member user according to the occupied cell information contained in the call information includes:
acquiring occupied cell information in a preset period in the call information, wherein the occupied cell information comprises a cell identifier;
sorting occupied cells corresponding to the occupied cell information according to the cell identification;
starting from preset position occupied cells in the ordered occupied cells, acquiring preset number of occupied cells, and obtaining resident cell libraries corresponding to each member user.
Optionally, the determining the scheduling priority of each member user according to a preset scheduling processing rule and the resident cell library corresponding to each member user includes:
acquiring an uplink and downlink lowest rate threshold value, uplink and downlink traffic volume and a number of wireless resource control connection users corresponding to the resident cell library from a preset three-party system;
and determining the scheduling priority of each member user according to a preset scheduling processing rule, an uplink and downlink minimum rate threshold value, uplink and downlink traffic volume and the number of wireless resource control connection users corresponding to the resident cell library.
Optionally, the determining the scheduling priority of each member user according to a preset scheduling processing rule, and an uplink and downlink lowest rate threshold, an uplink and downlink traffic volume and a radio resource control connection user number corresponding to the resident cell library includes:
according to the expression:
Determining a scheduling priority value;
wherein, the liquid crystal display device comprises a liquid crystal display device,
represents the average traffic corresponding to the upstream data in period T,/>
Representing the average of the downlink data correspondence in period TTraffic, alpha UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, D aUL Indicating the total traffic of the cell corresponding to the uplink data in the period T, D aDL Indicating the total traffic of the cell corresponding to the downlink data in the period T, R aUL Indicating the number of users to which uplink data is correspondingly accessed in a period T, R aDL Indicating the number of users correspondingly accessed to downlink data in period T, D vipUL Representing the traffic corresponding to the uplink data of the member user in the period T, D vipDL Representing the traffic corresponding to the downlink data of the member user in the period T;
according to the expression:
determining the uplink and downlink scheduling priority weighting factors of each member user;
wherein F is UL The weighting factor of the uplink scheduling priority is represented, and the value range is (b UL ，a UL ]，F DL The weighting factor of the downlink scheduling priority is represented, and the value range is (b DL ，a DL ]，α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, e represents a natural constant, V UL Representing minimum guaranteed rate corresponding to uplink data, V DL Representing minimum guaranteed rate corresponding to downlink data, S UL Representing current user perceived uplink rate, S DL Representing the current user perceived downlink rate;
and determining the scheduling priority of each member user according to the uplink and downlink scheduling priority weighting factors of each member user.
Optionally, after dynamically allocating network resources for each member user and non-member users according to the scheduling priority of each member user, the method further includes:
determining total resources required by each member user within a preset duration;
and if the total resources exceed the preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirements of each member user.
Optionally, after dynamically allocating network resources for each member user and non-member users according to the scheduling priority of each member user, the method further includes:
generating a network resource allocation detail prompt;
and sending the network resource allocation detail prompt to terminal equipment for display.
In a second aspect, an embodiment of the present invention provides a resource scheduling processing apparatus, including:
the acquisition module is used for acquiring the user information corresponding to each member user and respectively distributing a user identification code to the user information corresponding to each member user;
the processing module is used for acquiring the calling information of each member user according to the user identification code of each member user, and determining a resident cell library corresponding to each member user according to the occupied cell information contained in the calling information;
the processing module is further used for determining the scheduling priority of each member user according to a preset scheduling processing rule and a resident cell library corresponding to each member user;
the processing module is further configured to dynamically allocate network resources for each member user and non-member users according to the scheduling priorities of the member users.
In a third aspect, an embodiment of the present invention provides an electronic device, including: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing computer-executable instructions stored in the memory causes the at least one processor to perform the resource scheduling method of any one of the first aspect.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where computer-executable instructions are stored, and when executed by a processor, implement the resource scheduling processing method according to any one of the first aspects.
In a fifth aspect, embodiments of the present invention provide a computer program product comprising a computer program which, when executed by a processor, implements the resource scheduling processing method according to the first aspect and the various possible designs of the first aspect.
After the scheme is adopted, user information corresponding to each member user can be firstly allocated with a user identification code respectively, call information of each member user can be obtained according to the user identification code of each member user, resident cell libraries corresponding to each member user can be determined according to occupied cell information contained in the call information, scheduling priority of each member user can be determined according to preset scheduling processing rules and resident cell libraries corresponding to each member user, network resources are dynamically allocated to each member user and non-member user according to the scheduling priority of each member user, scheduling priority of each member user is determined according to the call information of each member user and the preset scheduling processing rules, and then the use condition of the member user can not be ensured under the condition that the network resources are insufficient is reduced according to the mode that the scheduling priority allocates resources for the member user and the non-member user, and further the rationality of network resource allocation is improved.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
Fig. 1 is a schematic diagram of an application system of a resource scheduling processing method according to an embodiment of the present invention;
fig. 2 is a flow chart of a resource scheduling processing method according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a method for scheduling resources according to another embodiment of the present invention;
fig. 4 is a schematic structural diagram of a resource scheduling processing device according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a hardware structure of an electronic 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.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims and in the above drawings, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be capable of including other sequential examples in addition to those illustrated or described. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In the prior art, in a conventional processing manner of guaranteeing user experience, normal operation of each node in a mobile communication network can be guaranteed generally through the manners of optimizing a wireless radio frequency signal, optimizing a wireless parameter strategy, repairing a key fault site, hard-soft capacity expansion cell, temporarily starting a communication vehicle, adding a macro station, a small station, indoor division resources and the like. By way of example, the preset sites can be set as key sites, and when the key sites fail, the failed key sites need to be repaired in time, so that the use experience of users is guaranteed. However, when the normal operation of each node in the mobile communication network is ensured by means of optimizing the wireless radio frequency signals, optimizing the wireless parameter strategies, repairing the key fault sites and the like, the operation is carried out for all users. The method has the advantages that the requirements of meeting users are required to be met preferentially, but the network resources obtained by allocation are the same for member users and non-member users in the existing processing mode, the use experience of the member users cannot be guaranteed preferentially under the condition that the network resources are insufficient, and the rationality of network resource allocation is reduced.
Based on the technical problems, the scheduling priority of each member user is determined according to the call information of each member user and the preset scheduling processing rule, and then resources are allocated to the member user and the non-member user according to the scheduling priority, so that the technical effects that the situation that the use experience of the member user cannot be ensured under the condition of insufficient network resources is reduced, and the rationality of network resource allocation is improved are achieved.
Fig. 1 is a schematic architecture diagram of an application system of a resource scheduling processing method according to an embodiment of the present invention, where, as shown in fig. 1, the application system may include: at least one terminal device 101, a server 102 and a database 103. Wherein each terminal device 101 corresponds to a member information, and each member information corresponds to a user identification code, which may correspond to call information of each member user stored in the database 103. After the server obtains the user identification code of the terminal device 101, call information corresponding to the user identification code may be obtained from the database 103 according to the user identification code, and further processed according to the call information, so as to determine the scheduling priority of each member user, and dynamically allocate network resources for each member user and non-member users according to the scheduling priority of each member user.
The terminal device 101 may be a smart phone, a wearable device, or a device that may be equipped with a SIM card.
The technical scheme of the invention is described in detail below by specific examples. The following embodiments may be combined with each other, and some embodiments may not be repeated for the same or similar concepts or processes.
Fig. 2 is a flow chart of a resource scheduling processing method according to an embodiment of the present invention, where the method of the present embodiment may be executed by the server 102, as shown in fig. 2, and the method of the present embodiment may include:
s201: user information corresponding to each member user is obtained, and a user identification code is respectively allocated to the user information corresponding to each member user.
In this embodiment, in order to preferentially ensure the use experience of the member users, before allocating network resources to the member users, user information corresponding to each member user may be acquired, and then a user identification code may be allocated to the user information corresponding to each member user, where the corresponding member user may be uniquely identified by the user identification code.
The subscriber identity may be an IMSI (International Mobile Subscriber Identification Number, international mobile subscriber identity).
In addition, the user information corresponding to each member user may include a host number of the member user, basic information of the member user (which may be, for example, a user name, a sex, an identification number, a cell phone number, etc.), a member on time, a member expiration time, etc.
S202: and acquiring call information of each member user according to the user identification code of each member user, and determining a resident cell library corresponding to each member user according to the occupied cell information contained in the call information.
In this embodiment, after determining the user identification code of each member user, the call information of each member user can be acquired by the user identification code. The call information of the member user may be acquired through the user identification code in various manners, and an exemplary method may be to acquire the call information of the member user corresponding to the user identification code through an existing third party platform (for example, an end-to-end analysis platform). Another may be to obtain call information of the member user corresponding to the user identification code from the database.
After the call information of each member user is obtained, the resident cell library corresponding to each member user can be determined according to the occupied cell information contained in the call information, and further, the resident cell library corresponding to each member user can be determined according to the occupied cell information contained in the call information, which specifically includes:
and acquiring occupied cell information in a preset period in the call information, wherein the occupied cell information comprises a cell identifier.
And sequencing the occupied cells corresponding to the occupied cell information according to the cell identification.
Starting from preset position occupied cells in the ordered occupied cells, acquiring preset number of occupied cells, and obtaining resident cell libraries corresponding to each member user.
Specifically, each call information includes corresponding occupied cell information, and specifically, the occupied cell information may be a base station identifier and a cell identifier (for example, may be a cell ID number). The preset period can be set according to the actual application scene user definition, and the preset period can be an arbitrary value in 5-8 days by way of example. After the occupied cell information in the preset period is obtained, the occupied cells corresponding to the occupied cell information can be ordered according to the cell identification, namely, the corresponding occupied cells can be determined through the cell identification, then the occupied cells are ordered according to the number of each occupied cell, and the first N cells with the largest number are obtained from the ordered occupied cells and used as the resident cell library of the member user. Wherein, N may be set according to the actual application scenario customization, and illustratively, N may be any value from 5 to 10.
Further, the resident cell libraries corresponding to different member users may be the same or different, or may be partially the same (i.e. there are overlapping resident cells in the resident cell libraries), which is not specifically limited herein.
In addition, the preset period may have a situation that the setting time is too long or too short, in order to improve the accuracy of the preset period setting, the accuracy of the preset period setting may be determined according to the determined number of resident cells in the resident cell library corresponding to each member user, if the number of resident cells is greater than the first preset threshold, the preset period setting is indicated to be too long, and if the number of resident cells is less than the second preset threshold, the preset period setting is indicated to be too short, and the preset period corresponding needs to be adjusted. The first preset threshold is greater than the second preset threshold, and specific values of the first preset threshold and the second preset threshold can be set according to the actual application scene in a self-defining mode.
S203: and determining the scheduling priority of each member user according to a preset scheduling processing rule and a resident cell library corresponding to each member user.
In this embodiment, after determining the resident cell library corresponding to each member user, the scheduling priority of each member user may be determined according to a preset scheduling processing rule and the resident cell library corresponding to each member user.
Further, determining the scheduling priority of each member user according to a preset scheduling processing rule and a resident cell library corresponding to each member user may specifically include:
and acquiring an uplink and downlink minimum rate threshold value, uplink and downlink traffic and the number of wireless resource control connection users corresponding to the resident cell library from a preset three-party system.
And determining the scheduling priority of each member user according to a preset scheduling processing rule, an uplink and downlink minimum rate threshold value, uplink and downlink traffic volume and the number of wireless resource control connection users corresponding to the resident cell library.
Specifically, when determining the scheduling priority of each member user, the scheduling priority of each member user may be correspondingly determined according to the specific network resource information of the resident cell library corresponding to each member user. The specific network resource information of the resident cell library may include an uplink and downlink minimum rate threshold, uplink and downlink traffic, and the number of radio resource control connection users.
Further, determining the scheduling priority of each member user according to a preset scheduling processing rule, and an uplink and downlink minimum rate threshold value, uplink and downlink traffic and a radio resource control connection user number corresponding to the resident cell library may specifically include:
according to the expression:
Determining a scheduling priority value;
wherein, the liquid crystal display device comprises a liquid crystal display device,
represents the average traffic corresponding to the upstream data in period T,/>
Represents the average traffic corresponding to the downlink data in period T, α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, D aUL Indicating the total traffic of the cell corresponding to the uplink data in the period T, D aDL Indicating the total traffic of the cell corresponding to the downlink data in the period T, R aUL Indicating the number of users to which uplink data is correspondingly accessed in a period T, R aDL Indicating the number of users correspondingly accessed to downlink data in period T, D vipUL Representing the traffic corresponding to the uplink data of the member user in the period T, D vipDL Representing the traffic corresponding to the downlink data of the member user in the period T;
according to the expression:
determining the uplink and downlink scheduling priority weighting factors of each member user;
wherein F is UL The weighting factor of the uplink scheduling priority is represented, and the value range is (b UL ，a UL ]，F DL The weighting factor of the downlink scheduling priority is represented, and the value range is (b DL ，a DL ]，α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, e represents a natural constant, V UL Representing minimum guaranteed rate corresponding to uplink data, V DL Representing minimum guaranteed rate corresponding to downlink data, S UL Representing current user perceived uplink rate, S DL Indicating the current user perceived downlink rate.
And determining the scheduling priority of each member user according to the uplink and downlink scheduling priority weighting factors of each member user.
Specifically, a scheduling priority weighting factor dynamic function can be established by using the scheduling priority value function, and uplink and downlink scheduling priority weighting factors in a period are dynamically calculated. And the larger the uplink and downlink scheduling priority weighting factors are, the larger the scheduling priority of the member users is.
S204: and dynamically distributing network resources for each member user and the non-member users according to the scheduling priority of each member user.
In this embodiment, after the scheduling priority of each member user is obtained, network resources may be dynamically allocated to each member user and non-member users according to the scheduling priority of each member user. Further, the higher the scheduling priority of the member user, i.e. the priority of allocating the required resources for the member user, so as to meet the resource requirement of the member user, while the scheduling priority of the non-member user is the lowest, after meeting the network resource requirements of other member users with high priority, the remaining network resources can be allocated to the non-member user.
In addition, sometimes the network resources required by the member users are less, at the moment, most of the network resources can be distributed to the non-member users, the network requirements of the member users are preferentially ensured, and meanwhile, the network requirements of the non-member users are considered under the condition that the service requirements of the member users are not high in bandwidth, so that the maximization of the resource utilization and the rationalization of the resource utilization are realized.
In addition, the scheduling priority of each member user can be dynamically updated once every preset period, so that the accuracy of network resources distributed to each member user and non-member users is improved, and the use experience of the users is further improved.
After the scheme is adopted, the user information corresponding to each member user can be firstly allocated with a user identification code respectively, then the calling information of each member user can be obtained according to the user identification code of each member user, the resident cell library corresponding to each member user can be determined according to the occupied cell information contained in the calling information, then the scheduling priority of each member user can be determined according to the preset scheduling processing rule and the resident cell library corresponding to each member user, network resources are dynamically allocated to each member user and non-member users according to the scheduling priority of each member user, the scheduling priority of each member user is determined according to the calling information of each member user and the preset scheduling processing rule, then the resource allocation mode for each member user and non-member user according to the scheduling priority is realized, the situation that the use experience of each member user cannot be ensured under the condition of insufficient network resources is reduced, and the rationality of network resource allocation is further improved.
The examples of the present specification also provide some specific embodiments of the method based on the method of fig. 2, which is described below.
Fig. 3 is a flowchart of a resource scheduling processing method according to another embodiment of the present invention, as shown in fig. 3, after S204, the method of this embodiment may include:
s301: and determining the total resources required by each member user within a preset time period.
S302: and if the total resources exceed the preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirements of each member user.
In this embodiment, after network resources are dynamically allocated to each member user and non-member users according to the scheduling priority of each member user, because the network resources required by each member user may vary greatly, the total resources required by each member user within a preset duration may be determined, then the total resources required by each member user within the preset duration are compared with a preset resource threshold, and if the total resources exceed the preset resource threshold, the scheduling priority of each member user is increased according to a preset adjustment rule to meet the resource requirements of each member user. The resource threshold may be set according to the actual application scenario, which is not defined in detail herein.
In addition, in another embodiment, after dynamically allocating network resources to each member user and non-member users according to their scheduling priorities, the method may further include:
generating a network resource allocation detail hint.
And sending the network resource allocation detail prompt to terminal equipment for display.
In this embodiment, after network resources are allocated to the member users and the non-member users, a network resource allocation detail prompt may be generated, where the network resource allocation detail prompt includes specific network resource conditions allocated to each member user and the non-member user, and then the network resource allocation detail prompt may be sent to a terminal device for display, so that an operation and maintenance person may timely grasp the network resource allocation conditions.
Based on the same idea, the embodiment of the present disclosure further provides a device corresponding to the method, and fig. 4 is a schematic structural diagram of a resource scheduling processing device provided by the embodiment of the present disclosure, as shown in fig. 4, may include:
the acquiring module 401 is configured to acquire user information corresponding to each member user, and allocate a user identification code to the user information corresponding to each member user.
And the processing module 402 is configured to obtain call information of each member user according to the user identification code of each member user, and determine a resident cell library corresponding to each member user according to the occupied cell information included in the call information.
In this embodiment, the processing module 402 is further configured to:
and acquiring occupied cell information in a preset period in the call information, wherein the occupied cell information comprises a cell identifier.
And sequencing the occupied cells corresponding to the occupied cell information according to the cell identification.
Starting from preset position occupied cells in the ordered occupied cells, acquiring preset number of occupied cells, and obtaining resident cell libraries corresponding to each member user.
The processing module 402 is further configured to determine a scheduling priority of each member user according to a preset scheduling processing rule and a resident cell library corresponding to each member user.
In this embodiment, the processing module 402 is further configured to:
and acquiring an uplink and downlink minimum rate threshold value, uplink and downlink traffic and the number of wireless resource control connection users corresponding to the resident cell library from a preset three-party system.
And determining the scheduling priority of each member user according to a preset scheduling processing rule, an uplink and downlink minimum rate threshold value, uplink and downlink traffic volume and the number of wireless resource control connection users corresponding to the resident cell library.
Further, the processing module 402 is further configured to:
according to the expression:
Determining a scheduling priority value;
wherein, the liquid crystal display device comprises a liquid crystal display device,
represents the average traffic corresponding to the upstream data in period T,/>
Represents the average traffic corresponding to the downlink data in period T, α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, D aUL Indicating the total traffic of the cell corresponding to the uplink data in the period T, D aDL Indicating the total traffic of the cell corresponding to the downlink data in the period T, R aUL Indicating the number of users to which uplink data is correspondingly accessed in a period T, R aDL Indicating the number of users correspondingly accessed to downlink data in period T, D vipUL Representing the traffic corresponding to the uplink data of the member user in the period T, D vipDL And the traffic corresponding to the downlink data of the member user in the period T is represented.
According to the expression:
and determining the uplink and downlink scheduling priority weighting factors of the member users.
Wherein F is UL The weighting factor of the uplink scheduling priority is represented, and the value range is (b UL ，a UL ]，F DL The weighting factor of the downlink scheduling priority is represented, and the value range is (b DL ，a DL ]，α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, e represents a natural constant, V UL Representing minimum guaranteed rate corresponding to uplink data, V DL Representing minimum guaranteed rate corresponding to downlink data, S UL Representing current user perceived uplink rate, S DL Indicating the current user perceived downlink rate.
And determining the scheduling priority of each member user according to the uplink and downlink scheduling priority weighting factors of each member user.
The processing module 402 is further configured to dynamically allocate network resources for the member users and the non-member users according to the scheduling priorities of the member users.
Furthermore, in another embodiment, the processing module 402 is further configured to:
and determining the total resources required by each member user within a preset duration.
And if the total resources exceed the preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirements of each member user.
Furthermore, in another embodiment, the processing module 402 is further configured to:
generating a network resource allocation detail hint.
And sending the network resource allocation detail prompt to terminal equipment for display.
The device provided by the embodiment of the present invention can implement the method of the embodiment shown in fig. 2, and its implementation principle and technical effects are similar, and will not be described herein.
Fig. 5 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present invention, as shown in fig. 5, an apparatus 500 provided in this embodiment includes: at least one processor 501 and a memory 502. The processor 501 and the memory 502 are connected by a bus 503.
In a specific implementation, at least one processor 501 executes computer-executable instructions stored in the memory 502, so that at least one processor 501 performs the method in the above-described method embodiment.
The specific implementation process of the processor 501 may refer to the above-mentioned method embodiment, and its implementation principle and technical effects are similar, and this embodiment will not be described herein again.
In the embodiment shown in fig. 5, it should be understood that the processor may be a central processing unit (english: central Processing Unit, abbreviated as CPU), or may be other general purpose processors, digital signal processors (english: digital Signal Processor, abbreviated as DSP), application specific integrated circuits (english: application Specific Integrated Circuit, abbreviated as ASIC), or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in a processor for execution.
The memory may comprise high speed RAM memory or may further comprise non-volatile storage NVM, such as at least one disk memory.
The bus may be an industry standard architecture (Industry Standard Architecture, ISA) bus, an external device interconnect (Peripheral Component Interconnect, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, the buses in the drawings of the present application are not limited to only one bus or one type of bus.
The embodiment of the invention also provides a computer readable storage medium, wherein the computer readable storage medium stores computer execution instructions, and when a processor executes the computer execution instructions, the resource scheduling processing method of the method embodiment is realized.
The embodiment of the invention also provides a computer program product, which comprises a computer program, wherein the computer program realizes the resource scheduling processing method when being executed by a processor.
The computer readable storage medium described above may be implemented by any type of volatile or non-volatile memory device or combination thereof, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk, or optical disk. A readable storage medium can be any available medium that can be accessed by a general purpose or special purpose computer.
An exemplary readable storage medium is coupled to the processor such the processor can read information from, and write information to, the readable storage medium. In the alternative, the readable storage medium may be integral to the processor. The processor and the readable storage medium may reside in an application specific integrated circuit (Application Specific Integrated Circuits, ASIC for short). The processor and the readable storage medium may reside as discrete components in a device.
Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the method embodiments described above may be performed by hardware associated with program instructions. The foregoing program may be stored in a computer readable storage medium. The program, when executed, performs steps including the method embodiments described above; and the aforementioned storage medium includes: various media that can store program code, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention.
Claims (7)
1. A resource scheduling processing method, characterized by comprising:
acquiring user information corresponding to each member user, and respectively distributing a user identification code for the user information corresponding to each member user;
acquiring call information of each member user according to the user identification code of each member user, and determining a resident cell library corresponding to each member user according to the occupied cell information contained in the call information;
determining the scheduling priority of each member user according to a preset scheduling processing rule and a resident cell library corresponding to each member user;
dynamically distributing network resources for each member user and non-member users according to the scheduling priority of each member user;
the determining the scheduling priority of each member user according to a preset scheduling processing rule and the resident cell library corresponding to each member user comprises the following steps:
acquiring an uplink and downlink lowest rate threshold value, uplink and downlink traffic volume and a number of wireless resource control connection users corresponding to the resident cell library from a preset three-party system;
determining the scheduling priority of each member user according to a preset scheduling processing rule, an uplink and downlink lowest rate threshold value, uplink and downlink traffic volume and a wireless resource control connection user number corresponding to the resident cell library;
the determining the scheduling priority of each member user according to a preset scheduling processing rule, and an uplink and downlink minimum rate threshold value, uplink and downlink traffic and a radio resource control connection user number corresponding to the resident cell library, includes:
according to the expression:
Determining a scheduling priority value;
wherein, the liquid crystal display device comprises a liquid crystal display device,
represents the average traffic corresponding to the upstream data in period T,/>
Represents the average traffic corresponding to the downlink data in period T, α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, D αUL Indicating the total traffic of the cell corresponding to the uplink data in the period T, D αDL Indicating the total traffic of the cell corresponding to the downlink data in the period T, r αUL Indicating the number of users to which uplink data is correspondingly accessed in a period T, R αDL Indicating the number of users correspondingly accessed to downlink data in period T, D vipUL Representing the traffic corresponding to the uplink data of the member user in the period T, D vipDL Representing the traffic corresponding to the downlink data of the member user in the period T;
according to the expression:
determining the uplink and downlink scheduling priority weighting factors of each member user;
wherein F is UL The weighting factor of the uplink scheduling priority is represented, and the value range is (b UL ,α UL ]，F DL The weighting factor of the downlink scheduling priority is represented, and the value range is (b DL ,α DL ]，α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, e represents a natural constant, V UL Representing minimum guaranteed rate corresponding to uplink data, V DL Representing minimum guaranteed rate corresponding to downlink data, S UL Representation ofCurrent user perceived uplink rate, S DL Representing the current user perceived downlink rate;
and determining the scheduling priority of each member user according to the uplink and downlink scheduling priority weighting factors of each member user.
2. The method of claim 1, wherein the determining the resident cell library corresponding to each member user according to the occupied cell information included in the call information includes:
acquiring occupied cell information in a preset period in the call information, wherein the occupied cell information comprises a cell identifier;
sorting occupied cells corresponding to the occupied cell information according to the cell identification;
starting from preset position occupied cells in the ordered occupied cells, acquiring preset number of occupied cells, and obtaining resident cell libraries corresponding to each member user.
3. The method according to any one of claims 1-2, further comprising, after said dynamically allocating network resources to said member users and non-member users according to said member users' scheduling priorities:
determining total resources required by each member user within a preset duration;
and if the total resources exceed the preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirements of each member user.
4. The method according to any one of claims 1-2, further comprising, after said dynamically allocating network resources to said member users and non-member users according to said member users' scheduling priorities:
generating a network resource allocation detail prompt;
and sending the network resource allocation detail prompt to terminal equipment for display.
5. A resource scheduling processing apparatus, comprising:
the acquisition module is used for acquiring the user information corresponding to each member user and respectively distributing a user identification code to the user information corresponding to each member user;
the processing module is used for acquiring the calling information of each member user according to the user identification code of each member user, and determining a resident cell library corresponding to each member user according to the occupied cell information contained in the calling information;
the processing module is further used for determining the scheduling priority of each member user according to a preset scheduling processing rule and a resident cell library corresponding to each member user;
the processing module is further used for dynamically distributing network resources for each member user and non-member users according to the scheduling priority of each member user;
the processing module is further configured to:
acquiring an uplink and downlink lowest rate threshold value, uplink and downlink traffic volume and a number of wireless resource control connection users corresponding to the resident cell library from a preset three-party system;
determining the scheduling priority of each member user according to a preset scheduling processing rule, an uplink and downlink lowest rate threshold value, uplink and downlink traffic volume and a wireless resource control connection user number corresponding to the resident cell library;
the processing module is further configured to:
according to the expression:
Determining a scheduling priority value;
wherein, the liquid crystal display device comprises a liquid crystal display device,
represents the average traffic corresponding to the upstream data in period T,/>
Represents the average traffic corresponding to the downlink data in period T, α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, D αUL Indicating the total traffic of the cell corresponding to the uplink data in the period T, D αDL Indicating the total traffic of the cell corresponding to the downlink data in the period T, R αUL Indicating the number of users to which uplink data is correspondingly accessed in a period T, R αDL Indicating the number of users correspondingly accessed to downlink data in period T, D vipUL Representing the traffic corresponding to the uplink data of the member user in the period T, D vipDL Representing the traffic corresponding to the downlink data of the member user in the period T;
according to the expression:
determining the uplink and downlink scheduling priority weighting factors of each member user;
wherein F is UL The weighting factor of the uplink scheduling priority is represented, and the value range is (b UL ,α UL ]，F DL The weighting factor of the downlink scheduling priority is represented, and the value range is (b DL ,α DL ]，α UL Representing a scheduling priority value, alpha, corresponding to uplink data DL Represents a scheduling priority value corresponding to downlink data, e represents a natural constant, V UL Representing minimum guaranteed rate corresponding to uplink data, V DL Representing minimum guaranteed rate corresponding to downlink data, S UL Representing current user perceived uplink rate, S DL Representing the current user perceived downlink rate;
and determining the scheduling priority of each member user according to the uplink and downlink scheduling priority weighting factors of each member user.
6. An electronic device, comprising: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing computer-executable instructions stored in the memory causes the at least one processor to perform the resource scheduling processing method of any one of claims 1 to 4.
7. A computer-readable storage medium having stored therein computer-executable instructions which, when executed by a processor, implement the resource scheduling processing method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110793452.XA CN113518459B (en) | 2021-07-14 | 2021-07-14 | Resource scheduling processing method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110793452.XA CN113518459B (en) | 2021-07-14 | 2021-07-14 | Resource scheduling processing method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113518459A CN113518459A (en) | 2021-10-19 |
| CN113518459B true CN113518459B (en) | 2023-07-04 |
Family
ID=78066849
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110793452.XA Active CN113518459B (en) | 2021-07-14 | 2021-07-14 | Resource scheduling processing method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113518459B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2312902A1 (en) * | 2008-08-07 | 2011-04-20 | Sharp Kabushiki Kaisha | Small base station device, base station device, mobile station device, and mobile communication system |
| CN103428883A (en) * | 2013-08-30 | 2013-12-04 | 京信通信系统（中国）有限公司 | Dispatching method and equipment of physical downlink control channel resources |
| CN104066183A (en) * | 2013-03-21 | 2014-09-24 | 中兴通讯股份有限公司 | Method and apparatus for mapping and demodulating channel |
| CN105517179A (en) * | 2015-12-25 | 2016-04-20 | 上海华为技术有限公司 | Wireless resource scheduling method and scheduler |
| CN111770581A (en) * | 2020-06-30 | 2020-10-13 | 广东电网有限责任公司 | Power communication network wireless resource scheduling method and device |
| CN112584486A (en) * | 2019-09-30 | 2021-03-30 | 华为技术有限公司 | Communication method and device |
| CN113038401A (en) * | 2019-12-23 | 2021-06-25 | 中国移动通信集团陕西有限公司 | Differentiated resource scheduling method and device, computing equipment and computer storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101929307B1 (en) * | 2011-04-11 | 2018-12-17 | 삼성전자 주식회사 | method and apparatus to control UE Cell reselection priority while UE is in CSG cell |
| US10231168B2 (en) * | 2014-02-11 | 2019-03-12 | Alcatel Lucent | Method and apparatus for idle user equipment redistribution in a HetNet for load balance |
| KR20180035638A (en) * | 2016-09-29 | 2018-04-06 | 삼성전자주식회사 | Method and apparatus of data transfer mode with/without rrc connection |
-
2021
- 2021-07-14 CN CN202110793452.XA patent/CN113518459B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2312902A1 (en) * | 2008-08-07 | 2011-04-20 | Sharp Kabushiki Kaisha | Small base station device, base station device, mobile station device, and mobile communication system |
| CN104066183A (en) * | 2013-03-21 | 2014-09-24 | 中兴通讯股份有限公司 | Method and apparatus for mapping and demodulating channel |
| CN103428883A (en) * | 2013-08-30 | 2013-12-04 | 京信通信系统（中国）有限公司 | Dispatching method and equipment of physical downlink control channel resources |
| CN105517179A (en) * | 2015-12-25 | 2016-04-20 | 上海华为技术有限公司 | Wireless resource scheduling method and scheduler |
| CN112584486A (en) * | 2019-09-30 | 2021-03-30 | 华为技术有限公司 | Communication method and device |
| CN113038401A (en) * | 2019-12-23 | 2021-06-25 | 中国移动通信集团陕西有限公司 | Differentiated resource scheduling method and device, computing equipment and computer storage medium |
| CN111770581A (en) * | 2020-06-30 | 2020-10-13 | 广东电网有限责任公司 | Power communication network wireless resource scheduling method and device |
Non-Patent Citations (2)
| Title |
|---|
| "A random access scheme based on dynamic allocation of PRACH resources for smart grid communication";Fenghua Peng等;《2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN)》;全文 * |
| "关于5G移动通信系统无线资源调度探讨";林汀;《现代计算机(专业版)》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113518459A (en) | 2021-10-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110769038B (en) | Server scheduling method and device, storage medium and electronic equipment | |
| CN111147395B (en) | Network resource adjusting method and device | |
| WO2011088785A1 (en) | Method and device for adjusting service processing resources in a multi-mode base station system | |
| CN105791254B (en) | Network request processing method and device and terminal | |
| CN111654879B (en) | Business push method, device, control equipment and storage medium | |
| US11102145B2 (en) | Resource sharing method, computer device, and storage medium | |
| CN113726586B (en) | Network slice deployment method, device, server and computer readable storage medium | |
| CN113518459B (en) | Resource scheduling processing method and device and electronic equipment | |
| KR102639977B1 (en) | Resource allocation method, resource allocation device, base station and terminal | |
| CN108601098B (en) | Network system identification method and device of dual-card terminal | |
| CN114844791B (en) | Cloud service automatic management and distribution method and system based on big data and storage medium | |
| CN109067817B (en) | Media content flow distribution method and device, electronic equipment and server | |
| CN111669765B (en) | Network capacity expansion method and device, control equipment and storage medium | |
| CN115794396A (en) | Resource allocation method, system and electronic equipment | |
| CN113453285B (en) | Resource adjusting method, device and storage medium | |
| CN110337112A (en) | Terminal access method and device | |
| CN114928849A (en) | Base station deployment method and device, electronic equipment and storage medium | |
| CN111315023B (en) | Uplink wireless resource allocation method and device | |
| CN112995982B (en) | Method, device, server and storage medium for scheduling cloud SIM card | |
| CN111800446B (en) | Scheduling processing method, device, equipment and storage medium | |
| CN114173396A (en) | Method and device for determining terminal networking time, electronic equipment and storage medium | |
| CN113468442A (en) | Resource bit flow distribution method, computing device and computer storage medium | |
| CN112954744A (en) | Access control method and device for mobile terminal | |
| CN111757386B (en) | Download control method and device | |
| CN106793115B (en) | Bandwidth allocation method and device |
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 |