CN113518459A - Resource scheduling processing method and device and electronic equipment - Google Patents

Resource scheduling processing method and device and electronic equipment Download PDF

Info

Publication number
CN113518459A
CN113518459A CN202110793452.XA CN202110793452A CN113518459A CN 113518459 A CN113518459 A CN 113518459A CN 202110793452 A CN202110793452 A CN 202110793452A CN 113518459 A CN113518459 A CN 113518459A
Authority
CN
China
Prior art keywords
member user
user
scheduling
uplink
preset
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
Application number
CN202110793452.XA
Other languages
Chinese (zh)
Other versions
CN113518459B (en
Inventor
梁光贤
董事
罗敏妍
彭英明
邓雄伟
王小林
黄婷
梁立新
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202110793452.XA priority Critical patent/CN113518459B/en
Publication of CN113518459A publication Critical patent/CN113518459A/en
Application granted granted Critical
Publication of CN113518459B publication Critical patent/CN113518459B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention provides a resource scheduling processing method, a device and electronic equipment, wherein the method comprises the steps of acquiring user information corresponding to each member user, respectively allocating a user identification code to 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, determining a resident cell library corresponding to each member user according to occupied cell information contained in the call information, 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, and dynamically allocating network resources to each member user and non-member users according to the scheduling priority of each member user. The embodiment improves the rationality of network resource allocation.

Description

Resource scheduling processing method and device and electronic equipment
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 era, 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 through modes of optimization of a radio frequency signal, optimization of a radio parameter strategy, repair of a critical 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 through the optimization of the radio frequency signals, the optimization of the radio parameter strategy, the repair of the critical fault site and the like, all the nodes are operated facing 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 resource scheduling processing device and electronic equipment, and aims to improve the rationality of network resource allocation.
In a first aspect, an embodiment of the present invention provides a method for resource scheduling processing, including:
acquiring user information corresponding to each member user, and respectively allocating a user identification code to 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 occupied cell information contained in the call information;
determining the dispatching priority of each member user according to a preset dispatching processing rule and a resident cell bank 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.
Optionally, the determining the resident cell bank 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;
sequencing occupied cells corresponding to the occupied cell information according to the cell identification;
and acquiring a preset number of occupied cells from the preset position occupied cells in the sorted occupied cells to obtain a resident cell library 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 bank corresponding to each member user includes:
acquiring an uplink and downlink minimum rate threshold, uplink and downlink service volume and a wireless resource control connection user number corresponding to the resident cell library from a preset three-party system;
and determining the dispatching priority of each member user according to a preset dispatching processing rule, and the uplink and downlink minimum rate threshold, the uplink and downlink service 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 the uplink and downlink minimum rate threshold, the uplink and downlink traffic volume, and the number of radio resource control connection users corresponding to the residential cell library includes:
according to the expression:
Figure BDA0003161928700000021
and
Figure BDA0003161928700000022
determining a scheduling priority value;
wherein the content of the first and second substances,
Figure BDA0003161928700000023
represents the average traffic corresponding to the uplink data in the period T,
Figure BDA0003161928700000024
represents the average traffic, alpha, corresponding to the downlink data in the period TULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating scheduling priority, D, corresponding to downlink dataaULIndicates the total cell traffic corresponding to the uplink data in the period T, DaDLIndicates the total cell traffic, R, corresponding to the downlink data in the period TaULThe number of users, R, of the corresponding access of the uplink data in the period T is representedaDLRepresenting the number of users correspondingly accessed to downlink data in the period T, DvipULRepresenting the traffic corresponding to the uplink data of the member user in the period T, DvipDLRepresenting the corresponding traffic of downlink data of the member user in a period T;
according to the expression:
Figure BDA0003161928700000031
Figure BDA0003161928700000032
determining uplink and downlink scheduling priority weighting factors of all member users;
wherein, FULRepresents the weighting factor of the uplink scheduling priority and has the value range of (b)UL，aUL]，FDLRepresents a weighting factor of the downlink scheduling priority, and has a value range of (b)DL，aDL]，αULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating scheduling priority value corresponding to downlink dataE represents a natural constant, VULIndicating the minimum guaranteed rate, V, corresponding to the uplink dataDLIndicating the minimum guaranteed rate, S, corresponding to the downlink dataULIndicating the current user perceived uplink rate, SDLRepresenting the current user perceived downlink rate;
and determining the dispatching priority of each member user according to the uplink and downlink dispatching priority weighting factor of each member user.
Optionally, after dynamically allocating network resources to the member users and the non-member users according to the scheduling priorities of the member users, the method further includes:
determining total resources required by each member user within a preset time length;
and if the total resource exceeds a preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirement of each member user.
Optionally, after dynamically allocating network resources to the member users and the non-member users according to the scheduling priorities of the member users, the method further includes:
generating a network resource allocation detail prompt;
and sending the network resource allocation detail prompt to a terminal device for displaying.
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 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 occupied cell information contained in the calling information;
the processing module is further configured to determine a scheduling priority of each member user according to a preset scheduling processing rule and a resident cell bank corresponding to each member user;
the processing module is further configured to dynamically allocate network resources to the member users and the 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 the computer-executable instructions stored by the memory causes the at least one processor to perform the method of resource scheduling processing according to any of the first aspects.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer executing instruction is stored, and when a processor executes the computer executing instruction, the method for scheduling and processing resources according to any one of the first aspect is implemented.
In a fifth aspect, an embodiment of the present invention provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for resource scheduling processing according to the first aspect and various possible designs of the first aspect is implemented.
The embodiment of the invention provides a resource scheduling processing method, a device and electronic equipment, after adopting the scheme, user information corresponding to each member user can be firstly distributed, a user identification code is respectively distributed to the user information corresponding to each member user, then calling information of each member user can be obtained according to the user identification code of each member user, a resident cell bank corresponding to each member user is determined according to occupied cell information contained in the calling information, then the scheduling priority of each member user can be determined according to a preset scheduling processing rule and the resident cell bank corresponding to each member user, network resources are dynamically distributed to each member user and non-member users according to the scheduling priority of each member user, and the scheduling priority of each member user is determined according to the calling information of each member user and the preset scheduling processing rule, and then, according to the scheduling priority, the method for allocating resources to the member users and the non-member users reduces the situation that the use experience of the member users cannot be guaranteed under the condition that the network resources are insufficient, and further improves the rationality of network resource allocation.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic structural diagram of an application system of a resource scheduling processing method according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a resource scheduling processing method according to an embodiment of the present invention;
fig. 3 is a flowchart illustrating a resource scheduling processing method according to another embodiment of the present invention;
fig. 4 is a schematic structural diagram of a resource scheduling processing apparatus 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 technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the invention described herein are 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 mode for ensuring user experience, normal operation of each node in a mobile communication network can be generally ensured through optimization of a radio frequency signal, optimization of a wireless parameter strategy, repair of a critical fault site, expansion of a hard cell and a soft cell, temporary start of a communication vehicle, newly added macro station + small station + indoor resources and the like. Illustratively, which sites are set as key sites can be preset, and when a key site fails, the failed key site needs to be repaired in time, so that the use experience of a user is guaranteed. However, when the normal operation of each node in the mobile communication network is ensured by the optimization of the radio frequency signal, the optimization of the radio parameter strategy, the repair of the critical fault site and the like, the operation is performed for all users. That is, the requirement of the user for meeting needs to be met preferentially, but the existing processing mode is the same for the member user and the non-member user, so that the use experience of the member user cannot be guaranteed preferentially under the condition that the network resource is 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 calling information of each member user and the preset scheduling processing rule, and then the resources are allocated to the member users and the non-member users according to the scheduling priority, so that the technical effects that the condition that the use experience of the member users cannot be guaranteed under the condition that the network resources are insufficient is reduced, and the reasonability of network resource allocation is improved are achieved.
Fig. 1 is a schematic structural diagram of an application system of a resource scheduling processing method according to an embodiment of the present invention, and as shown in fig. 1, the application system may include: at least one terminal device 101, a server 102 and a database 103. Each terminal device 101 corresponds to a member information, and each member information corresponds to a user identification code, which may correspond to the call information of each member user stored in the database 103. After the server acquires the user identification code of the terminal device 101, the server may acquire call information corresponding to the user identification code from the database 103 according to the user identification code, further process the call information, determine the scheduling priority of each member user, and dynamically allocate network resources to each member user and non-member user according to the scheduling priority of each member user.
The terminal device 101 may be a smart phone, a wearable device, or other device capable of installing a SIM card.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 2 is a flowchart illustrating a resource scheduling processing method according to an embodiment of the present invention, where the method according to the embodiment may be executed by the server 102, as shown in fig. 2, the method according to the embodiment may include:
s201: and acquiring user information corresponding to each member user, and respectively allocating a user identification code 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 the network resources are allocated to the member users, the user information corresponding to each member user may be acquired, and then a user identification code is allocated to the user information corresponding to each member user, so that the corresponding member users can be uniquely identified by the user identification codes.
The Subscriber identity may be an IMSI (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 (for example, a user name, a gender, an identification number, a mobile phone number, and the like), a member activation time, a member expiration time, and the like.
S202: and acquiring the calling information of each member user according to the user identification code of each member user, and determining a resident cell bank corresponding to each member user according to the occupied cell information contained in the calling information.
In this embodiment, after determining the user identification code of each member user, the call information of each member user can be acquired through the user identification code. There are various ways to obtain the call information of the member user through the user identification code, and for example, one way may be to obtain the call information of the member user corresponding to the user identification code through an existing third-party platform (e.g., an end-to-end analysis platform). Another method may be to obtain the call information of the member user corresponding to the user identification code from the database.
After the call information of each member user is acquired, a resident cell bank corresponding to each member user may be determined according to occupied cell information included in the call information, and further, determining a resident cell bank corresponding to each member user according to occupied cell information included in the call information may specifically include:
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.
And acquiring a preset number of occupied cells from the preset position occupied cells in the sorted occupied cells to obtain a resident cell library 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, a cell ID number). The preset period can be set according to the actual application scene in a self-defined manner, and exemplarily, the preset period can be any value in 5 to 8 days. After the occupied cell information in the preset period is obtained, the occupied cells corresponding to the occupied cell information can be sequenced according to the cell identifiers, that is, the corresponding occupied cells can be determined according to the cell identifiers, then the occupied cells are sequenced according to the number of the occupied cells, and the top N cells with the largest number are obtained from the sequenced occupied cells and serve as the resident cell library of the member user. N may be set according to the actual application scenario, and for example, N may be any value from 5 to 10.
Further, the residential cell libraries corresponding to different member users may be the same, may also be different, and may also be partially the same (i.e. there are overlapping residential cells in the residential cell libraries), which is not specifically limited herein.
In addition, the preset period may have an excessively long or short setting time, and in order to improve the accuracy of the preset period setting, the accuracy of the preset period setting may be determined according to the number of the determined resident cells in the resident cell library corresponding to each member user, if the number of the resident cells is greater than a first preset threshold, the preset period setting is indicated to be excessively long, and if the number of the resident cells is less than a second preset threshold, the preset period setting is indicated to be excessively short, and the preset period setting needs to be adjusted correspondingly. The first preset threshold is larger than the second preset threshold, and the specific numerical values of the first preset threshold and the second preset threshold can be set according to the practical application scene in a self-defined mode.
S203: and determining the dispatching priority of each member user according to a preset dispatching processing rule and a resident cell bank corresponding to each member user.
In this embodiment, after determining the resident cell bank corresponding to each member user, the scheduling priority of each member user may be determined according to the preset scheduling processing rule and the resident cell bank corresponding to each member user.
Further, determining the scheduling priority of each member user according to a preset scheduling processing rule and the resident cell bank corresponding to each member user may specifically include:
and acquiring the uplink and downlink minimum rate threshold, the uplink and downlink service volume and the number of wireless resource control connection users corresponding to the resident cell library from a preset three-party system.
And determining the dispatching priority of each member user according to a preset dispatching processing rule, and the uplink and downlink minimum rate threshold, the uplink and downlink service 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 pool corresponding to each member user. The specific network resource information of the residential cell pool may include the minimum rate threshold of the uplink and downlink, the uplink and downlink traffic volume, 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 the uplink and downlink minimum rate threshold, the uplink and downlink traffic volume, and the number of radio resource control connection users corresponding to the residential cell pool, which may specifically include:
according to the expression:
Figure BDA0003161928700000091
and
Figure BDA0003161928700000092
determining a scheduling priority value;
wherein the content of the first and second substances,
Figure BDA0003161928700000093
represents the average traffic corresponding to the uplink data in the period T,
Figure BDA0003161928700000094
represents the average traffic, alpha, corresponding to the downlink data in the period TULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating scheduling priority, D, corresponding to downlink dataaULIndicates the total cell traffic corresponding to the uplink data in the period T, DaDLIndicates the total cell traffic, R, corresponding to the downlink data in the period TaULThe number of users, R, of the corresponding access of the uplink data in the period T is representedaDLRepresenting the number of users correspondingly accessed to downlink data in the period T, DvipULRepresenting the traffic corresponding to the uplink data of the member user in the period T, DvipDLRepresenting the corresponding traffic of downlink data of the member user in a period T;
according to the expression:
Figure BDA0003161928700000095
Figure BDA0003161928700000096
determining uplink and downlink scheduling priority weighting factors of all member users;
wherein, FULRepresents the weighting factor of the uplink scheduling priority and has the value range of (b)UL，aUL]，FDLRepresents a weighting factor of the downlink scheduling priority, and has a value range of (b)DL，aDL]，αULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating the scheduling priority value corresponding to the downlink data, e indicating a natural constant, VULIndicating the minimum guaranteed rate, V, corresponding to the uplink dataDLIndicating the minimum guaranteed rate, S, corresponding to the downlink dataULIndicating the current user perceived uplink rate, SDLIndicating the current user perceived downlink rate.
And determining the dispatching priority of each member user according to the uplink and downlink dispatching priority weighting factor of each member user.
Specifically, a dynamic function of the scheduling priority weighting factor can be established by using the scheduling priority function, and the uplink and downlink scheduling priority weighting factors in the period are dynamically calculated. And the larger the weighting factor of the uplink and downlink scheduling priority is, the larger the scheduling priority of the member user is.
S204: and dynamically distributing network resources for each member user and 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 can be dynamically allocated to each member user and non-member users according to the scheduling priority of each member user. Furthermore, the higher the scheduling priority of the member user is, the resource required by the member user is preferentially allocated to the member user, so that the resource requirement of the member user is met, but the scheduling priority of the non-member user is the lowest, and after the network resource requirement of other member users with high priorities is met, the rest network resource can be allocated to the non-member user.
In addition, sometimes, network resources required by the member user are less, most of the network resources can be distributed to the non-member users, the network requirements of the member user are guaranteed preferentially, meanwhile, the network requirements of the non-member users are considered under the condition that the service requirement bandwidth of the member user is not high, and the maximization of resource utilization and the rationalization of resource utilization are achieved.
In addition, the dynamic scheduling priority of each member user can be 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 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 is determined according to the occupied cell information contained in the calling information, then the dispatching priority of each member user can be determined according to the preset dispatching processing rule and the resident cell library corresponding to each member user, then the network resources are dynamically allocated to each member user and the non-member users according to the dispatching priority of each member user, the dispatching priority of each member user is determined according to the calling information of each member user and the preset dispatching processing rule, and then the resources are allocated to the member users and the non-member users according to the dispatching priority, the situation that the use experience of the member user cannot be guaranteed under the condition that the network resources are insufficient is reduced, and the rationality of network resource allocation is further improved.
Based on the method of fig. 2, the present specification also provides some specific embodiments of the method, which are described below.
Fig. 3 is a flowchart illustrating a resource scheduling processing method according to another embodiment of the present invention, as shown in fig. 3, after S204, the method according to this embodiment may include:
s301: and determining the total resource required by each member user within a preset time length.
S302: and if the total resource exceeds a preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirement of each member user.
In this embodiment, after dynamically allocating network resources to each member user and a non-member user according to the scheduling priority of each member user, since the network resources required by the member users may be greatly changed, the total resources required by each member user within a preset time duration may be determined, then the total resources required by each member user within the preset time 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 by self-defining according to an actual application scenario, and is not limited in detail here.
In addition, in another embodiment, after dynamically allocating network resources to each member user and non-member users according to the scheduling priority of each member user, the method may further include:
and generating a network resource allocation detail prompt.
And sending the network resource allocation detail prompt to a terminal device for displaying.
In this embodiment, after allocating network resources 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 of the member users and the non-member users, and then the network resource allocation detail prompt may be sent to the terminal device for display, so that the operation and maintenance staff may timely master the network resource allocation conditions.
Based on the same idea, an embodiment of this specification further provides a device corresponding to the foregoing method, and fig. 4 is a schematic structural diagram of the resource scheduling processing device provided in the embodiment of the present invention, as shown in fig. 4, the method may include:
the obtaining module 401 is configured to obtain user information corresponding to each member user, and allocate a user identification code to the user information corresponding to each member user.
A processing module 402, configured to obtain call information of each member user according to the user identifier of each member user, and determine a resident cell pool corresponding to each member user according to 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.
And acquiring a preset number of occupied cells from the preset position occupied cells in the sorted occupied cells to obtain a resident cell library 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 the lowest speed threshold values of the uplink and the downlink, the uplink and the downlink service volumes and the number of the wireless resource control connection users corresponding to the resident cell library from a preset three-party system.
And determining the dispatching priority of each member user according to a preset dispatching processing rule, and the uplink and downlink minimum rate threshold, the uplink and downlink service 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:
Figure BDA0003161928700000121
and
Figure BDA0003161928700000122
determining a scheduling priority value;
wherein the content of the first and second substances,
Figure BDA0003161928700000123
represents the average traffic corresponding to the uplink data in the period T,
Figure BDA0003161928700000124
represents the average traffic, alpha, corresponding to the downlink data in the period TULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating scheduling priority, D, corresponding to downlink dataaULIndicates the total cell traffic corresponding to the uplink data in the period T, DaDLIndicates the total cell traffic, R, corresponding to the downlink data in the period TaULThe number of users, R, of the corresponding access of the uplink data in the period T is representedaDLRepresenting the number of users correspondingly accessed to downlink data in the period T, DvipULRepresenting the traffic corresponding to the uplink data of the member user in the period T, DvipDLAnd the traffic corresponding to the downlink data of the member user in the period T is represented.
According to the expression:
Figure BDA0003161928700000125
Figure BDA0003161928700000126
and determining the uplink and downlink scheduling priority weighting factor of each member user.
Wherein, FULRepresents the weighting factor of the uplink scheduling priority and has the value range of (b)UL，aUL]，FDLRepresents a weighting factor of the downlink scheduling priority, and has a value range of (b)DL，aDL]，αULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating the scheduling priority value corresponding to the downlink data, e indicating a natural constant, VULIndicating the minimum guaranteed rate, V, corresponding to the uplink dataDLIndicating the minimum guaranteed rate, S, corresponding to the downlink dataULIndicating the current user perceived uplink rate, SDLIndicating the current user perceived downlink rate.
And determining the dispatching priority of each member user according to the uplink and downlink dispatching priority weighting factor of each member user.
The processing module 402 is further configured to dynamically allocate network resources to the member users and the non-member users according to the scheduling priorities of the member users.
Moreover, in another embodiment, the processing module 402 is further configured to:
and determining the total resource required by each member user within a preset time length.
And if the total resource exceeds a preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirement of each member user.
Moreover, in another embodiment, the processing module 402 is further configured to:
and generating a network resource allocation detail prompt.
And sending the network resource allocation detail prompt to a terminal device for displaying.
The apparatus provided in the embodiment of the present invention may implement the method in the embodiment shown in fig. 2, and the implementation principle and the technical effect are similar, which are not described herein again.
Fig. 5 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present invention, and as shown in fig. 5, a device 500 according to the embodiment includes: at least one processor 501 and memory 502. The processor 501 and the memory 502 are connected by a bus 503.
In a specific implementation, the at least one processor 501 executes the computer-executable instructions stored in the memory 502, so that the at least one processor 501 executes the method in the above-described method embodiments.
For a specific implementation process of the processor 501, reference may be made to the above method embodiments, which implement the similar principle and technical effect, and this embodiment is not described herein again.
In the embodiment shown in fig. 5, it should be understood that the Processor may be a Central Processing Unit (CPU), other general purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. 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, or in a combination of the hardware and software modules within the processor.
The memory may comprise high speed RAM memory and may also include non-volatile storage NVM, such as at least one disk memory.
The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, the buses in the figures of the present application are not limited to only one bus or one type of bus.
The embodiment of the present invention further provides a computer-readable storage medium, where a computer execution instruction is stored in the computer-readable storage medium, and when a processor executes the computer execution instruction, the resource scheduling processing method according to the above method embodiment is implemented.
An embodiment of the present invention further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for scheduling and processing resources as described above is implemented.
The computer-readable storage medium 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 or optical disk. Readable storage media can be any available media 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. Of course, the readable storage medium may also be an integral part of the processor. The processor and the readable storage medium may reside in an Application Specific Integrated Circuits (ASIC). Of course, the processor and the readable storage medium may also reside as discrete components in the apparatus.
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (10)

1. A resource scheduling processing method is characterized by comprising the following steps:
acquiring user information corresponding to each member user, and respectively allocating a user identification code to 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 occupied cell information contained in the call information;
determining the dispatching priority of each member user according to a preset dispatching processing rule and a resident cell bank 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.
2. The method of claim 1, wherein the determining the resident cell pool corresponding to each member user according to the occupied cell information included in the call information comprises:
acquiring occupied cell information in a preset period in the call information, wherein the occupied cell information comprises a cell identifier;
sequencing occupied cells corresponding to the occupied cell information according to the cell identification;
and acquiring a preset number of occupied cells from the preset position occupied cells in the sorted occupied cells to obtain a resident cell library corresponding to each member user.
3. The method of claim 1, wherein determining the scheduling priority of each member user according to a preset scheduling processing rule and a resident cell pool corresponding to each member user comprises:
acquiring an uplink and downlink minimum rate threshold, uplink and downlink service volume and a wireless resource control connection user number corresponding to the resident cell library from a preset three-party system;
and determining the dispatching priority of each member user according to a preset dispatching processing rule, and the uplink and downlink minimum rate threshold, the uplink and downlink service volume and the number of wireless resource control connection users corresponding to the resident cell library.
4. The method of claim 3, wherein the determining the scheduling priority of each member user according to a preset scheduling processing rule, and the minimum uplink and downlink rate threshold, the uplink and downlink traffic volume, and the number of radio resource control connection users corresponding to the residential cell pool comprises:
according to the expression:
Figure FDA0003161928690000011
and
Figure FDA0003161928690000012
determining a scheduling priority value;
wherein the content of the first and second substances,
Figure FDA0003161928690000021
represents the average traffic corresponding to the uplink data in the period T,
Figure FDA0003161928690000022
represents the average traffic, alpha, corresponding to the downlink data in the period TULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating scheduling priority, D, corresponding to downlink dataaULIndicates the total cell traffic corresponding to the uplink data in the period T, DaDLIndicates the total cell traffic, R, corresponding to the downlink data in the period TaULThe number of users, R, of the corresponding access of the uplink data in the period T is representedaDLRepresenting the number of users correspondingly accessed to downlink data in the period T, DvipULRepresenting the traffic corresponding to the uplink data of the member user in the period T, DvipDLRepresenting the corresponding traffic of downlink data of the member user in a period T;
according to the expression:
Figure FDA0003161928690000023
Figure FDA0003161928690000024
determining uplink and downlink scheduling priority weighting factors of all member users;
wherein, FULRepresents the weighting factor of the uplink scheduling priority and has the value range of (b)UL，aUL]，FDLRepresents a weighting factor of the downlink scheduling priority, and has a value range of (b)DL，aDL]，αULIndicating the scheduling priority, alpha, corresponding to the uplink dataDLIndicating the scheduling priority value corresponding to the downlink data, e indicating a natural constant, VULIndicating the minimum guaranteed rate, V, corresponding to the uplink dataDLIndicating the minimum guaranteed rate, S, corresponding to the downlink dataULIndicating the current user perceived uplink rate, SDLRepresenting the current user perceived downlink rate;
and determining the dispatching priority of each member user according to the uplink and downlink dispatching priority weighting factor of each member user.
5. The method according to any of claims 1-4, further comprising, after said dynamically allocating network resources to said member users and non-member users according to their scheduling priorities:
determining total resources required by each member user within a preset time length;
and if the total resource exceeds a preset resource threshold, adjusting the scheduling priority of each member user according to a preset adjustment rule so as to meet the resource requirement of each member user.
6. The method according to any of claims 1-4, further comprising, after said dynamically allocating network resources to said member users and non-member users according to their scheduling priorities:
generating a network resource allocation detail prompt;
and sending the network resource allocation detail prompt to a terminal device for displaying.
7. A resource scheduling processing apparatus, comprising:
the acquisition module is used for acquiring the user information corresponding to each member user and 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 occupied cell information contained in the calling information;
the processing module is further configured to determine a scheduling priority of each member user according to a preset scheduling processing rule and a resident cell bank corresponding to each member user;
the processing module is further configured to dynamically allocate network resources to the member users and the non-member users according to the scheduling priorities of the member users.
8. An electronic device, comprising: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing the computer-executable instructions stored by the memory causes the at least one processor to perform the method of resource scheduling processing of any of claims 1 to 6.
9. A computer-readable storage medium having stored thereon computer-executable instructions which, when executed by a processor, implement the resource scheduling processing method of any one of claims 1 to 6.
10. A computer program product comprising a computer program, characterized in that the computer program realizes the resource scheduling processing method according to any one of claims 1 to 6 when executed by a processor.
CN202110793452.XA 2021-07-14 2021-07-14 Resource scheduling processing method and device and electronic equipment Active CN113518459B (en)

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 true CN113518459A (en) 2021-10-19
CN113518459B 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 (10)

* Cited by examiner, † Cited by third party
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
US20120258750A1 (en) * 2011-04-11 2012-10-11 Samsung Electronics Co. Ltd. Method and apparatus for effectively controlling cell reselection priority of user equipment in csg cell
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
US20150230141A1 (en) * 2014-02-11 2015-08-13 Alcatel Lucent Method and apparatus for idle user equipment redistribution in a hetnet for load balance
CN105517179A (en) * 2015-12-25 2016-04-20 上海华为技术有限公司 Wireless resource scheduling method and scheduler
US20200037345A1 (en) * 2016-09-29 2020-01-30 Samsung Electronics Co., Ltd. Method and apparatus for transmitting data in rrc deactivated or activated state
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

Patent Citations (10)

* Cited by examiner, † Cited by third party
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
US20120258750A1 (en) * 2011-04-11 2012-10-11 Samsung Electronics Co. Ltd. Method and apparatus for effectively controlling cell reselection priority of user equipment in csg cell
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
US20150230141A1 (en) * 2014-02-11 2015-08-13 Alcatel Lucent Method and apparatus for idle user equipment redistribution in a hetnet for load balance
CN105517179A (en) * 2015-12-25 2016-04-20 上海华为技术有限公司 Wireless resource scheduling method and scheduler
US20200037345A1 (en) * 2016-09-29 2020-01-30 Samsung Electronics Co., Ltd. Method and apparatus for transmitting data in rrc deactivated or activated state
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)

* Cited by examiner, † Cited by third party
Title
FENGHUA PENG等: ""A random access scheme based on dynamic allocation of PRACH resources for smart grid communication"", 《2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN)》 *
林汀: ""关于5G移动通信系统无线资源调度探讨"", 《现代计算机(专业版)》 *

Also Published As

Publication number Publication date
CN113518459B (en) 2023-07-04

Similar Documents

Publication Publication Date Title
CN110769038B (en) Server scheduling method and device, storage medium and electronic equipment
CN107577533A (en) Resource allocation method and Related product
CN110290024B (en) Method, device and equipment for testing strategy before online
WO2011088785A1 (en) Method and device for adjusting service processing resources in a multi-mode base station system
CN109819023B (en) Distributed transaction processing method and related product
CN114844791B (en) Cloud service automatic management and distribution method and system based on big data and storage medium
CN114614989A (en) Feasibility verification method and device of network service based on digital twin technology
CN112566187A (en) Bandwidth allocation method, device, computer equipment and computer readable storage medium
CN113067907B (en) Method and related equipment for addressing edge application
CN106254516B (en) Load balancing method and device
CN110677838A (en) Service distribution method and device
CN113518459B (en) Resource scheduling processing method and device and electronic equipment
CN110351849B (en) Resource allocation method and device, base station and terminal
CN114928849B (en) Base station deployment method and device, electronic equipment and storage medium
CN110337112A (en) Terminal access method and device
CN113329411B (en) Wireless network planning method and device
CN115278778A (en) Communication network frequency reduction method and device, electronic equipment and storage medium
CN113258679B (en) Power grid monitoring system channel distribution method based on server instance capacity reduction
CN111669765A (en) Network capacity expansion method and device, control equipment and storage medium
CN111757386B (en) Download control method and device
CN112148497A (en) Disk resource management method and device and electronic equipment
CN112822792A (en) Distribution method, device, equipment and storage medium of bearing identification
CN107105452B (en) Load balancing method and device based on PUCCH
CN113709715B (en) Slice resource allocation method, apparatus, computer device and storage medium
CN113891385B (en) Method, device and equipment for detecting link state of network equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant