CN107690195A - A kind of Multi net voting Resource co-allocation method - Google Patents

A kind of Multi net voting Resource co-allocation method Download PDF

Info

Publication number
CN107690195A
CN107690195A CN201610629151.2A CN201610629151A CN107690195A CN 107690195 A CN107690195 A CN 107690195A CN 201610629151 A CN201610629151 A CN 201610629151A CN 107690195 A CN107690195 A CN 107690195A
Authority
CN
China
Prior art keywords
user
users
mbr
gbr
prbnum
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
CN201610629151.2A
Other languages
Chinese (zh)
Other versions
CN107690195B (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.)
Putian Information Technology Co Ltd
Original Assignee
Putian Information Technology 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 Putian Information Technology Co Ltd filed Critical Putian Information Technology Co Ltd
Priority to CN201610629151.2A priority Critical patent/CN107690195B/en
Publication of CN107690195A publication Critical patent/CN107690195A/en
Application granted granted Critical
Publication of CN107690195B publication Critical patent/CN107690195B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention provides a kind of Multi net voting Resource co-allocation method, including：Step 1, according to user buffering situation and data to be transferred amount, user is confirmed the validity；Step 2, according to effective amount, current control channel unit can distributing user number and the maximum scheduling number of users of OM configurations, determine available subscribers number；Step 3, according to available subscribers number, system bandwidth and bearer rate, distributing user benchmark physics radio bearer quantity.The present processes have caching number of users to be scheduled to be associated by available resources number and actually, meanwhile, for requirement of the different user to speed, limited resource is more reasonably distributed, limited number of resources is given into different user by user's request；On the premise of the rate requirement of high-priority users is met, surplus resources are actively distributed to other users and are scheduled.

Description

A kind of Multi net voting Resource co-allocation method
Technical field
The present invention relates to communication technical field, more particularly, to a kind of Multi net voting Resource co-allocation method.
Background technology
Long Term Evolution LTE system carries out the scheduling of user data by the way of shared resource, and this scheduling mode can be with High degree utilizes wireless communication resources, but this mode needs larger control information expense.In LTE system, cancel The VoIP business of the voice service of whole circuit domains, instead data field, using shared resource allocation scheduling mode, every time Transmission is required for related control information, limits the number of users that LTE system can be supported simultaneously.
For eNB MAC layer, when to traffic assignments resource to be activated is newly accessed, therefore, to assure that the resource of distribution Resource occupation will not occur with other allocated business to conflict.Traditional algorithm is the minimum public affairs according to the already present SPS cycles Multiple, traversal current time, this algorithm needed to spend more time to look into until all resources in the least common multiple period Ask resource, heavy system burden.Under Large Copacity scene, resource allocation is chaotic, and it is not high to be distributed into power, and it is broken easily to produce resource Piece.
In addition, when existing resource is distributed, the high user of priority has overwhelming superiority, and scheduling occurs in low priority user Postpone long or hungry to death without scheduling for a long time situation.The corresponding coordination system is not carried out for the resource of different dimensions, So as to all resources be shared and be distributed.For the available resource in part, the use that can not be scheduled with needs Family is managed collectively, and can not realize more efficiently resource shunting, it is difficult to ensures that the resource of the user of low priority uses.
Meanwhile during scheduling of resource and use, do not consider the use speed of resource typically, and only consider priority and Occupancy, from the management and distribution without progress intelligence, dynamic resources flowing amount, there is huge from whole resource allocation Big waste.
The content of the invention
The present invention provides a kind of Multi net voting resource joint for overcoming above mentioned problem or solving the above problems at least in part Distribution method.
According to an aspect of the present invention, there is provided a kind of Multi net voting Resource co-allocation method, including：
Step 1, according to user buffering situation and data to be transferred amount, user is confirmed the validity；
Step 2, can distributing user number and the maximum scheduling user of OM configurations according to effective amount, current control channel unit Number, determines available subscribers number；
Step 3, according to available subscribers number, system bandwidth and bearer rate, distributing user benchmark physics radio bearer quantity.
Wherein, the step 3 further comprises：
Dispatched according to priority height, under the premise of ensureing high-priority users speed, all users share frequency domain money equally per frame Source；
By estimating user's data to be transferred amount in advance, based on user's request, frequency domain resource is distributed.
Wherein, the step 1 further comprises：
Step 11, polling data radio bearer DRB user buffering situation, do not come based on all cachings for empty user true Recognize effective amount；
Step 12, judge whether user's data to be transferred amount meets validated user buffer requirement, to determine whether being effective Family.
Wherein, the step 2 further comprises：
Step 21, based on all validated users, effective amount is updated；
Step 22, according to system bandwidth and CCE length situations, obtaining current control channel unit CCE can distributing user number；
Step 23, the maximum scheduling number of users of OM configurations is obtained；
Step 24, using the effective amount, can be in distributing user number and maximum scheduling number of users minimum value as can Use number of users.
Wherein, the step 3 further comprises：
When the available subscribers number is identical with a preceding available subscribers number, all DRB carryings of traverse user, carrying is obtained most Small guaranteed rate GBR and maximum guaranteed rate MBR, determine that DRB carryings meet GBR and the MBR requirements obtained；
Distributed according to benchmark PrbNum, and ensure GBR rate limit of the data volume not less than configuration of schedulable, MBR limits System ensures at real resources distribution.
Wherein, the step 3 further comprises：
When the available subscribers number is identical with a preceding available subscribers number, all DRB carryings of traverse user, carrying is obtained most Small guaranteed rate GBR and maximum guaranteed rate MBR, determine that DRB carryings are unsatisfactory for GBR and the MBR requirements obtained；
More times of distribution PrbNum, ensure that the data volume of schedulable meets the GBR rate limits of configuration, MBR is limited in truly Ensured at resource allocation.
Wherein, the step 3 further comprises：
When the available subscribers number and a preceding available subscribers number differ, according to presently described available subscribers number and currently System bandwidth, it is determined that the benchmark PrbNum of each user distribution；
Obtained according to the MCS of user and PrbNum and recommend Tblength sizes；
All DRB carryings of traverse user, obtain and carry minimum guaranteed rate GBR and maximum guaranteed rate MBR, it is determined that should Whether DRB carryings meet the GBR obtained and MBR requirements；
When meeting, distributed according to benchmark PrbNum, and ensure GBR speed limit of the data volume not less than configuration of schedulable System, MBR are limited at real resources distribution and ensured；
When being unsatisfactory for, more times of distribution PrbNum, ensure that the data volume of schedulable meets the GBR rate limits of configuration, MBR limits System ensures at real resources distribution.
Wherein, in the step 11, the caching situation according to reporting of user Buffer Status Report BSR update or according to PDCP is delivered to the renewal of wireless chain control layer RLC data volumes.
Wherein, the step 12 further comprises：
User participated in it is preceding when once calculating, as user cache buffer>TbSize/4, confirm as validated user；
User was not engaged in preceding when once calculating, user cache buffer>TbSize/2, confirm as validated user；
Wherein, TbSize is the user base physical radio carrying quantity PrbNum and user tune once calculated before Data to be transferred amount obtained by exponent number Mcs processed；Caching buffer is the data to be transferred amount of the last user's renewal.
The application proposes a kind of resource allocation methods, can accomplish the shared of each dimension resource (such as frequency spectrum, time slot) and Distribution, realizes more efficient intelligent flow management and control and shunting mechanism, so as to better meet following 5G high performance networks Demand.
The present processes have caching number of users to be scheduled to be associated by available resources number and actually, high according to priority Low-key degree, on the premise of ensureing that high-priority users preferentially use resource, low priority user is allowed to complete to dispatch earlier.Meanwhile For requirement of the different user to speed, limited resource is more reasonably distributed, limited number of resources is given by user's request Different user；On the premise of the rate requirement of high-priority users is met, surplus resources are actively distributed to other users and entered Row scheduling.
Brief description of the drawings
A kind of Multi net voting resource chain according to embodiments of the present invention Fig. 1 and the flow chart of distribution method.
Embodiment
With reference to the accompanying drawings and examples, the embodiment of the present invention is described in further detail.Implement below Example is used to illustrate the present invention, but is not limited to the scope of the present invention.
Generally speaking, the present processes share frequency domain resource equally per frame by all users, ensure high-priority users speed Under the premise of rate, more users are made to be dispatched in a short time；By estimating user's data volume to be dispatched in advance, for each user Peculiar state and demand assignment resource；By estimating the recommended size of user in advance, follow-up scheduling really distribution money can be simplified Handling process during source.
A kind of Multi net voting Resource co-allocation method that the application provides includes：According to user buffering situation and data to be transferred Amount, confirms the validity user；Can distributing user quantity and OM configurations are maximum adjusts according to validated user quantity, current control channel unit Number of users is spent, determines available subscribers quantity；According to available subscribers quantity, system bandwidth and bearer rate, distributing user benchmark Physical radio carries quantity.
Specifically, Fig. 1 shows a kind of combined distributing method of Multi net voting resource according to the embodiment of the present application, such as Fig. 1 institutes Show, comprise the following steps that detailed description.
S1, start；
S2, the user buffering situation of polling data radio bearer (DRB), confirm based on all cachings are not empty user Effective amount；
Wherein, the polling procedure periodically performs, and each cycle is expected to be 10ms；Caching situation buffers according to reporting of user Zone state report (BSR) content update (up) or according to PDCP be delivered to wireless chain control layer (RLC) data volume renewal (under OK)；
S3, by judging whether user's data to be transferred amount meets validated user buffer requirement, to determine whether being effective Family；Wherein, including in two kinds of situation：
The first, it is preceding once, the user participated in calculating：
User cache buffer>(TbSize/4), then it is assumed that be validated user；
Second, it is preceding once, the user do not participate in calculate：
User cache buffer>(TbSize/2), then it is assumed that be validated user；
Wherein, TbSize is the user base physical radio carrying quantity (PrbNum) once calculated before and is somebody's turn to do The data to be transferred amount that user's order of modulation Mcs is calculated；Caching buffer is the data to be transferred of the last user's renewal Amount.The user participated in last time, requirement can be lowerd, ensure that user's remaining data can subsequently be dispatched as early as possible.
S4, if it is determined that be validated user, update the number nt of validated user；If not validated user, S2 weights are returned New poll；
S5, meanwhile, according to system bandwidth and CCE length situations, it is assignable to calculate current control channel unit (CCE) User's number n2；
S6, meanwhile, obtain the maximum of OM configurations and dispatch number of users n1；
S7, taking the minimum value of three numbers of users, available subscribers number is at least 1 as available subscribers number；
S8, verify whether this nt (number of users) calculated and the calculated value of last time identical, it is identical, turn S11, it is different then Turn S9；
S9, according to new nt (number of users) and current system bandwidth, to calculate the benchmark of each user's distribution PrbNum；Wherein, the number of users of acquisition is nt=n, then the benchmark PrbNum=bandwidth/n calculated.
S10, calculates the Tblength sizes of recommendation according to the MCS of user and PrbNum, that is, obtain user can be with The data volume of scheduling, i.e. Tblength=f (MCS, PrbNum), the numerical value can be obtained by tabling look-up；
S11, all DRB of traverse user are carried, and obtain user's QCI satisfactions of carrying；
S12, all DRB carryings of traverse user, obtains and carries minimum guaranteed rate (GBR), maximum guaranteed rate (MBR), Determine whether DRB carryings meet GBR and the MBR requirements obtained；
S13, if be unsatisfactory for, it is defined as dissatisfied user, double distribution PrbNum, and ensures that the data volume of schedulable expires The GBR rate limits configured enough, distribute PrbNum, and MBR is limited at real resources distribution and ensured；If user's last time is not Satisfied users, turn over 3 times of distribution PrbNum.Wherein, GBR refers to minimum guarantee speed, and distributing to the resource of user will need to meet This speed.
S14, if it is satisfied, being defined as satisfied users, distributed according to benchmark PrbNum, and ensure the data volume of schedulable not Less than the GBR rate limits of configuration, MBR is limited at real resources distribution and ensured.
S15, terminate flow.
Finally, the present processes are only preferable embodiment, are not intended to limit the scope of the present invention.It is all Within the spirit and principles in the present invention, any modification, equivalent substitution and improvements made etc., the protection of the present invention should be included in Within the scope of.

Claims (9)

  1. A kind of 1. Multi net voting Resource co-allocation method, it is characterised in that methods described includes：
    Step 1, according to user buffering situation and data to be transferred amount, user is confirmed the validity；
    Step 2, according to effective amount, current control channel unit can distributing user number and the maximum scheduling number of users of OM configurations, Determine available subscribers number；
    Step 3, according to available subscribers number, system bandwidth and bearer rate, distributing user benchmark physics radio bearer quantity.
  2. 2. according to the method for claim 1, it is characterised in that the step 3 further comprises：
    Dispatched according to priority height, under the premise of ensureing high-priority users speed, all users share frequency domain resource equally per frame；
    By estimating user's data to be transferred amount in advance, based on user's request, frequency domain resource is distributed.
  3. 3. according to the method for claim 1, it is characterised in that the step 1 further comprises：
    Step 11, polling data radio bearer DRB user buffering situation, confirm to have based on all cachings are not empty user Effectiveness amount；
    Step 12, judge whether user's data to be transferred amount meets validated user buffer requirement, to determine whether being validated user.
  4. 4. according to the method for claim 1, it is characterised in that the step 2 further comprises：
    Step 21, based on all validated users, effective amount is updated；
    Step 22, according to system bandwidth and CCE length situations, obtaining current control channel unit CCE can distributing user number；
    Step 23, the maximum scheduling number of users of OM configurations is obtained；
    Step 24, using the effective amount, can be in distributing user number and maximum scheduling number of users minimum value as can use Amount.
  5. 5. according to the method for claim 1, it is characterised in that the step 3 further comprises：
    When the available subscribers number is identical with a preceding available subscribers number, all DRB carryings of traverse user, the minimum guarantor of carrying is obtained Speed GBR and maximum guaranteed rate MBR is demonstrate,proved, determines that DRB carryings meet GBR and the MBR requirements obtained；
    Distributed according to benchmark PrbNum, and ensure that the data volume of schedulable is no more than the GBR rate limits of configuration, MBR is limited in Ensured at real resources distribution.
  6. 6. according to the method for claim 1, it is characterised in that the step 3 further comprises：
    When the available subscribers number is identical with a preceding available subscribers number, all DRB carryings of traverse user, the minimum guarantor of carrying is obtained Speed GBR and maximum guaranteed rate MBR is demonstrate,proved, determines that DRB carryings are unsatisfactory for GBR and the MBR requirements obtained；
    More times of distribution PrbNum, ensure that the data volume of schedulable meets the GBR rate limits of configuration, MBR is limited in real resources Ensured at distribution.
  7. 7. according to the method for claim 1, it is characterised in that the step 3 further comprises：
    When the available subscribers number and a preceding available subscribers number differ, it is according to presently described available subscribers number and current Regiment commander is wide, it is determined that the benchmark PrbNum of each user's distribution；
    Obtained according to the MCS of user and PrbNum and recommend Tblength sizes；
    All DRB carryings of traverse user, obtain and carry minimum guaranteed rate GBR and maximum guaranteed rate MBR, determine that the DRB is held Carry the GBR for whether meeting to obtain and MBR requirements；
    When meeting, distributed according to benchmark PrbNum, and ensure the data volume of schedulable not less than the GBR rate limits of configuration, MBR It is limited at real resources distribution and ensures；
    When being unsatisfactory for, more times of distribution PrbNum, ensure that the data volume of schedulable meets the GBR rate limits of configuration, MBR is limited in Ensured at real resources distribution.
  8. 8. according to the method for claim 3, it is characterised in that in the step 11, the caching situation is according on user Report Buffer Status Report BSR renewals are delivered to the renewal of wireless chain control layer RLC data volumes according to PDCP.
  9. 9. according to the method for claim 3, it is characterised in that the step 12 further comprises：
    User participated in it is preceding when once calculating, as user cache buffer>TbSize/4, confirm as validated user；
    User was not engaged in preceding when once calculating, user cache buffer>TbSize/2, confirm as validated user；
    Wherein, TbSize is the user base physical radio carrying quantity PrbNum and user's modulation order once calculated before Data to be transferred amount obtained by number Mcs.
CN201610629151.2A 2016-08-03 2016-08-03 Multi-network resource joint distribution method Expired - Fee Related CN107690195B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610629151.2A CN107690195B (en) 2016-08-03 2016-08-03 Multi-network resource joint distribution method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610629151.2A CN107690195B (en) 2016-08-03 2016-08-03 Multi-network resource joint distribution method

Publications (2)

Publication Number Publication Date
CN107690195A true CN107690195A (en) 2018-02-13
CN107690195B CN107690195B (en) 2020-05-05

Family

ID=61151546

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610629151.2A Expired - Fee Related CN107690195B (en) 2016-08-03 2016-08-03 Multi-network resource joint distribution method

Country Status (1)

Country Link
CN (1) CN107690195B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111343647A (en) * 2018-12-19 2020-06-26 中国移动通信集团重庆有限公司 Method, apparatus, device and medium for user perception evaluation

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103139925A (en) * 2013-01-31 2013-06-05 武汉邮电科学研究院 Upstream data dispatch method used for local thermodynamic equilibrium (LTE) system and device
CN103378924A (en) * 2012-04-18 2013-10-30 中兴通讯股份有限公司 Method of determining transport block size and device thereof, synchronization method, apparatus and system
CN103547340A (en) * 2013-03-21 2014-01-29 华为终端有限公司 Data transmission method, base station and user equipment
CN103596274A (en) * 2012-08-17 2014-02-19 中兴通讯股份有限公司 Downlink service resource distribution method and radio network controller
CN103906258A (en) * 2014-04-23 2014-07-02 电子科技大学 Double-bounce balance distributed scheduling algorithm based on relay cache in relay enhanced cellular system
CN104469957A (en) * 2014-12-25 2015-03-25 中科晶上（苏州）信息技术有限公司 LTE system base station device downlink resource distribution method and device
CN104955154A (en) * 2015-06-08 2015-09-30 电子科技大学 LTE (long term evolution) uplink proportion fair resource scheduling method based on user business volume satisfaction degree

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103378924A (en) * 2012-04-18 2013-10-30 中兴通讯股份有限公司 Method of determining transport block size and device thereof, synchronization method, apparatus and system
CN103596274A (en) * 2012-08-17 2014-02-19 中兴通讯股份有限公司 Downlink service resource distribution method and radio network controller
CN103139925A (en) * 2013-01-31 2013-06-05 武汉邮电科学研究院 Upstream data dispatch method used for local thermodynamic equilibrium (LTE) system and device
CN103547340A (en) * 2013-03-21 2014-01-29 华为终端有限公司 Data transmission method, base station and user equipment
CN103906258A (en) * 2014-04-23 2014-07-02 电子科技大学 Double-bounce balance distributed scheduling algorithm based on relay cache in relay enhanced cellular system
CN104469957A (en) * 2014-12-25 2015-03-25 中科晶上（苏州）信息技术有限公司 LTE system base station device downlink resource distribution method and device
CN104955154A (en) * 2015-06-08 2015-09-30 电子科技大学 LTE (long term evolution) uplink proportion fair resource scheduling method based on user business volume satisfaction degree

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111343647A (en) * 2018-12-19 2020-06-26 中国移动通信集团重庆有限公司 Method, apparatus, device and medium for user perception evaluation
CN111343647B (en) * 2018-12-19 2022-08-02 中国移动通信集团重庆有限公司 Method, apparatus, device and medium for user perception evaluation

Also Published As

Publication number Publication date
CN107690195B (en) 2020-05-05

Similar Documents

Publication Publication Date Title
EP3342138B1 (en) Systems and methods for distributing network resources to network service providers
CN102577499B (en) For the method and apparatus of resource management
WO2015149657A1 (en) Method and device for triggering buffer state reporting bsr
EP3171629B1 (en) Access network congestion control method and base station device
GB2574247A (en) Communication system
CN101459964B (en) Method of radio resource allocation and related communication apparatus
CN104981017B (en) Uplink resource allocating method and base station
CN109314977B (en) Semi-persistent resource allocation enhancements for V2X communications
EP2802170A1 (en) Method, system and device for service rate control
CN102164412B (en) Resource scheduling method and device for guaranteed bit rate service
CN103428883B (en) A kind of dispatching method of physical downlink control channel resource and equipment
CN103068051A (en) Distribution method and distribution device of downstream resources
CN103945540A (en) Processing method and device for logical channel priority
CN107113821A (en) The method and apparatus of transmitting uplink data
US10448418B2 (en) Decreasing free-riding data traffic in uplink scheduling
CN104981014B (en) Descending resource allocation method and base station
Afrin et al. An adaptive buffer based semi-persistent scheduling scheme for machine-to-machine communications over LTE
CN110475284B (en) Method and device for resource allocation
CN103313411A (en) Multiservice resource distribution method and device
CN104427630B (en) A kind of grouping scheduling method and device
CN112996115B (en) Method and device for allocating uplink resources
CN104796245A (en) Processing method and device for secondary carrier waves
CN107690195A (en) A kind of Multi net voting Resource co-allocation method
CN106604404B (en) Service scheduling method and device
CN102271408A (en) Method for allocating uplink resources in LTE (Long Term Evolution) system

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
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20200505