CN107690195B - Multi-network resource joint distribution method - Google Patents
Multi-network resource joint distribution method Download PDFInfo
- Publication number
- CN107690195B CN107690195B CN201610629151.2A CN201610629151A CN107690195B CN 107690195 B CN107690195 B CN 107690195B CN 201610629151 A CN201610629151 A CN 201610629151A CN 107690195 B CN107690195 B CN 107690195B
- Authority
- CN
- China
- Prior art keywords
- user
- users
- mbr
- gbr
- available
- 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.)
- Expired - Fee Related
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
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 invention provides a multi-network resource joint allocation method, which comprises the following steps: step 1, according to the user buffer condition and the data volume to be transmitted, confirming an effective user; step 2, determining the number of available users according to the number of effective users, the number of allocable users of the current control channel unit and the maximum scheduling user number configured by OM; and 3, distributing the user reference physical wireless bearing quantity according to the available user quantity, the system bandwidth and the bearing rate. The method of the application associates the number of available resources with the number of users actually having cache to be scheduled, meanwhile, more reasonably allocates limited resources according to the speed requirements of different users, and distributes the limited number of resources to different users according to the user requirements; and on the premise of meeting the speed requirement of the high-priority user, actively allocating the residual resources to other users for scheduling.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method for joint allocation of multiple network resources.
Background
The LTE system performs scheduling of user data in a resource sharing manner, which can greatly utilize wireless communication resources, but requires a large overhead of control information. In the LTE system, voice services of all circuit domains are cancelled, the voice services are replaced by VoIP services of a data domain, a shared resource allocation scheduling mode is adopted, and related control information is required for each transmission, so that the number of users which can be simultaneously supported by the LTE system is limited.
For the MAC layer of the eNB, when allocating resources to a newly accessed service to be activated, it is necessary to ensure that the allocated resources do not conflict with other allocated services in terms of resource occupation. The traditional algorithm is to traverse all resources in the time period from the current moment to the least common multiple according to the least common multiple of the existing SPS period, and the traditional algorithm needs to spend more time for inquiring the resources, thus increasing the burden of the system. In a large-capacity scene, resource allocation is disordered, the allocation success rate is not high, and resource fragments are easily generated.
In addition, when the existing resource is allocated, the users with high priority possess absolute advantages, and the users with low priority can have overlong scheduling delay or starved scheduling without scheduling for a long time. No corresponding coordination mechanism is performed for the resources of different dimensions, so that all the resources cannot be shared and allocated. For part of available resources, the resource allocation method cannot be uniformly managed with users needing scheduling, cannot realize more effective resource allocation, and is difficult to ensure the resource use of users with low priority.
Meanwhile, in the resource scheduling and using process, the using rate of the resources is generally not considered, and only the priority and the occupation amount are considered, so that intelligent and dynamic resource flow management and allocation are not carried out, and huge waste exists in the whole resource allocation.
Disclosure of Invention
The present invention provides a method of joint allocation of multiple network resources that overcomes, or at least partially solves, the above mentioned problems.
According to an aspect of the present invention, a method for jointly allocating multiple network resources is provided, including:
step 1, according to the user buffer condition and the data volume to be transmitted, confirming an effective user;
step 2, determining the number of available users according to the number of effective users, the number of allocable users of the current control channel unit and the maximum scheduling user number configured by OM;
and 3, distributing the user reference physical wireless bearing quantity according to the available user quantity, the system bandwidth and the bearing rate.
Wherein the step 3 further comprises:
under the premise of scheduling according to the priority level and ensuring the rate of the high-priority user, all users share the frequency domain resources per frame;
and distributing frequency domain resources based on user requirements by pre-estimating the data volume to be transmitted of the user.
Wherein the step 1 further comprises:
step 11, polling the user buffer condition of the data radio bearer DRB, and confirming the number of effective users based on all the users whose buffer is not empty;
and step 12, judging whether the data volume to be transmitted by the user meets the buffering requirement of the effective user, and determining whether the user is the effective user.
Wherein the step 2 further comprises:
step 21, updating the number of the effective users based on all the effective users;
step 22, acquiring the number of distributable users of the CCE of the current control channel unit according to the system bandwidth and the CCE length;
step 23, obtaining the maximum scheduling user number configured by the OM;
and step 24, taking the minimum value of the effective user number, the distributable user number and the maximum scheduling user number as an available user number.
Wherein the step 3 further comprises:
when the number of the available users is the same as the number of the available users at the previous time, traversing all DRB bearers of the users, acquiring a minimum guaranteed rate GBR and a maximum guaranteed rate MBR of the bearers, and determining that the DRB bearers meet the acquired GBR and MBR requirements;
and distributing according to the reference PrbNum, ensuring that the schedulable data volume is not lower than the configured GBR rate limit, and ensuring that the MBR limit is ensured at the real resource distribution position.
Wherein the step 3 further comprises:
when the number of the available users is the same as the number of the available users at the previous time, traversing all DRB bearers of the users, acquiring a minimum guaranteed rate GBR and a maximum guaranteed rate MBR of the bearers, and determining that the DRB bearers do not meet the requirements of the acquired GBR and MBR;
and multiple times of PrbNum allocation ensures that the schedulable data volume meets the configured GBR rate limit, and the MBR limit is guaranteed at the real resource allocation position.
Wherein the step 3 further comprises:
when the number of the available users is different from the number of the available users at the previous time, determining a reference PrbNum allocated to each user according to the current number of the available users and the current system bandwidth;
obtaining recommended Tblength according to the MCS and PrbNum of the user;
traversing all DRB bearers of a user, acquiring a minimum guaranteed rate GBR and a maximum guaranteed rate MBR of the bearers, and determining whether the DRB bearers meet the acquired GBR and MBR requirements;
when the real resource allocation is met, allocating according to the reference PrbNum, ensuring that the schedulable data volume is not lower than the configured GBR rate limit, and ensuring that the MBR limit is ensured at the real resource allocation position;
when the real resource allocation is not met, the PrbNum is multiply allocated, the schedulable data volume is guaranteed to meet the configured GBR rate limit, and the MBR limit is guaranteed at the real resource allocation position.
In step 11, the buffer status is updated according to a buffer status report BSR reported by a user or according to an RLC data volume delivered to a radio link control layer by the PDCP.
Wherein the step 12 further comprises:
when the user participates in the previous calculation, when the user cache buffer is greater than Tblength/4, the user is determined to be an effective user;
when the user does not participate in the previous calculation, the user caches buffer > Tblength/2 and confirms that the user is an effective user;
tblength is a data volume to be transmitted obtained according to the user basic physical radio bearer quantity PrbNum calculated at the previous time and the user modulation order Mcs; the buffer is the amount of data to be transmitted of the latest user update.
The resource allocation method can share and allocate all dimensional resources (such as frequency spectrums and time slots), and realize a more efficient intelligent flow control and distribution mechanism, so that the requirements of a future 5G high-performance network can be better met.
The method associates the number of available resources with the number of users actually cached to be scheduled, and enables the low-priority users to finish scheduling earlier on the premise of ensuring that the high-priority users preferentially use the resources according to the scheduling of the priority. Meanwhile, aiming at the requirements of different users on the speed, limited resources are more reasonably distributed, and the limited resource number is distributed to different users according to the user requirements; and on the premise of meeting the speed requirement of the high-priority user, actively allocating the residual resources to other users for scheduling.
Drawings
Fig. 1 is a flow chart of a multi-network resource chain and an allocation method according to an embodiment of the present invention.
Detailed Description
The following detailed description of embodiments of the present invention is provided in connection with the accompanying drawings and examples. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
In general, the method of the application ensures that more users are scheduled in a short time on the premise of ensuring the rate of high-priority users by sharing frequency domain resources for each frame of all users; allocating resources aiming at the special state and the requirement of each user by pre-estimating the data volume to be scheduled of the user; by estimating the recommended size of the user in advance, the processing flow when the resources are really allocated in the subsequent scheduling can be simplified.
The method for joint allocation of multiple network resources provided by the application comprises the following steps: confirming an effective user according to the user buffer condition and the data volume to be transmitted; determining the number of available users according to the number of effective users, the number of allocable users of the current control channel unit and the number of OM-configured maximum scheduling users; and allocating the user reference physical radio bearer number according to the available user number, the system bandwidth and the bearer rate.
Specifically, fig. 1 illustrates a method for joint allocation of multiple network resources according to an embodiment of the present application, and as shown in fig. 1, specific steps are described in detail as follows.
S1, start;
s2, polling the user buffer condition of the Data Radio Bearer (DRB), and confirming the effective user number based on all the users whose buffer is not empty;
wherein, the polling process is executed periodically, and each period is preset to be 10 ms; updating (ascending) the buffer condition according to the content of a Buffer Status Report (BSR) reported by a user or updating (descending) the data volume delivered to a radio link control layer (RLC) according to the PDCP;
s3, determining whether the data volume to be transmitted by the user meets the buffering requirement of the effective user or not; wherein, two situations are included:
first, the user has previously participated in calculating:
if the user cache buffer (Tblength/4) is the valid user;
second, the previous time, the user was not involved in calculating:
if the user cache buffer (Tblength/2) is the effective user;
tblength is a data volume to be transmitted calculated according to the previously calculated user basic physical radio bearer number (PrbNum) and the user modulation order Mcs; the buffer is the amount of data to be transmitted of the latest user update. The requirement of the user who participates in the last time can be lowered, and the remaining data of the user can be scheduled as soon as possible subsequently.
S4, if the user is determined to be the effective user, updating the number nt of the effective users; if not, returning to S2 to poll again;
s5, calculating the number n2 of users that can be allocated by the current Control Channel Element (CCE) according to the system bandwidth and the CCE length;
s6, simultaneously, acquiring the maximum scheduling user number n1 configured by OM;
s7, taking the minimum value of the three user numbers as the number of available users, wherein the minimum number of available users is 1;
s8, verifying whether the nt (number of users) calculated at the current time is the same as the calculated value at the last time, if the nt (number of users) is the same as the calculated value at the last time, turning to S11, and if the nt (number of users) is not the same as the calculated value at the last time, turning to S9;
s9, calculating the reference PrbNum allocated to each user according to the new nt (user number) and the current system bandwidth; if the obtained number of users is nt ═ n, the calculated reference PrbNum is bandwidth/n.
S10, calculating the recommended Tblength size according to the MCS and PrbNum of the user, that is, obtaining the data amount that the user can schedule, that is, Tblength ═ f (MCS, PrbNum), where the value can be obtained by looking up a table;
s11, traversing all DRB bearers of the user, and acquiring the user QCI satisfaction of the bearers;
s12, traversing all DRB bearers of a user, acquiring a bearer minimum guaranteed rate (GBR) and a maximum guaranteed rate (MBR), and determining whether the DRB bearer meets the acquired GBR and MBR requirements;
s13, if not, determining that the user is not satisfied, doubling and allocating PrbNum, ensuring that the schedulable data quantity meets the configured GBR rate limit, allocating PrbNum, and ensuring that the MBR is limited at the real resource allocation position; and if the user is the unsatisfied user last time, distributing PrbNum by 3 times. GBR refers to the minimum guaranteed rate, and the resource allocated to the user needs to satisfy this rate.
And S14, if the user is satisfied, determining the user to be satisfied, distributing according to the reference PrbNum, ensuring that the schedulable data volume is not lower than the configured GBR rate limit, and ensuring that the MBR limit is ensured at the real resource distribution position.
S15, the flow ends.
Finally, the method of the present application is only a preferred embodiment and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (3)
1. A method for joint allocation of multiple network resources, the method comprising:
step 1, according to the user buffer condition and the data volume to be transmitted, confirming an effective user;
step 2, determining the number of available users according to the number of effective users, the number of allocable users of the current control channel unit and the maximum scheduling user number configured by OM;
step 3, allocating the user reference physical wireless bearing quantity according to the available user quantity, the system bandwidth and the bearing rate;
the step 3 further comprises:
when the number of the available users is the same as the number of the available users at the previous time, traversing all DRB bearers of the users, acquiring a minimum guaranteed rate GBR and a maximum guaranteed rate MBR of the bearers, and determining that the DRB bearers meet the acquired GBR and MBR requirements;
distributing according to a reference PrbNum, ensuring that the schedulable data quantity does not exceed the configured GBR rate limit, and ensuring that the MBR limit is guaranteed at the real resource distribution position;
wherein the OM is operation maintenance.
2. The method of claim 1, wherein the step 3 further comprises:
when the number of the available users is the same as the number of the available users at the previous time, traversing all DRB bearers of the users, acquiring a minimum guaranteed rate GBR and a maximum guaranteed rate MBR of the bearers, and determining that the DRB bearers do not meet the requirements of the acquired GBR and MBR;
and multiple times of PrbNum allocation ensures that the schedulable data volume meets the configured GBR rate limit, and the MBR limit is guaranteed at the real resource allocation position.
3. The method of claim 1, wherein the step 3 further comprises:
when the number of the available users is different from the number of the available users at the previous time, determining a reference PrbNum allocated to each user according to the current number of the available users and the current system bandwidth;
obtaining recommended Tblength according to the MCS and PrbNum of the user;
traversing all DRB bearers of a user, acquiring a minimum guaranteed rate GBR and a maximum guaranteed rate MBR of the bearers, and determining whether the DRB bearers meet the acquired GBR and MBR requirements;
when the real resource allocation is met, allocating according to the reference PrbNum, ensuring that the schedulable data volume is not lower than the configured GBR rate limit, and ensuring that the MBR limit is ensured at the real resource allocation position;
when the real resource allocation is not met, the PrbNum is multiply allocated, the schedulable data volume is guaranteed to meet the configured GBR rate limit, and the MBR limit is guaranteed at the real resource allocation position.
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 CN107690195A (en) | 2018-02-13 |
| CN107690195B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343647B (en) * | 2018-12-19 | 2022-08-02 | ***通信集团重庆有限公司 | Method, apparatus, device and medium for user perception evaluation |
Citations (5)
| 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 |
| CN103906258A (en) * | 2014-04-23 | 2014-07-02 | 电子科技大学 | Double-bounce balance distributed scheduling algorithm based on relay cache in relay enhanced cellular system |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103596274B (en) * | 2012-08-17 | 2018-07-24 | 中兴通讯股份有限公司 | A kind of downlink service resource distribution method and radio network controller |
| CN104469957B (en) * | 2014-12-25 | 2018-06-12 | 中科晶上（苏州）信息技术有限公司 | LTE system base station equipment descending resource allocation method and device |
-
2016
- 2016-08-03 CN CN201610629151.2A patent/CN107690195B/en not_active Expired - Fee Related
Patent Citations (5)
| 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 |
| 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 |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107690195A (en) | 2018-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6103278B2 (en) | Communication system that shares resources among multiple network operators | |
| JP6044813B2 (en) | Communications system | |
| KR100856248B1 (en) | METHOD FOR SCHEDULING UPLINK IN VoIP | |
| US9686204B2 (en) | Capacity management based on backlog information | |
| GB2539731A (en) | Quality of service in wireless backhauls | |
| CN108093485B (en) | Resource allocation method and device | |
| US20070183320A1 (en) | Deficit fair priority queuing | |
| CN111148147B (en) | BSR reporting method and relay node | |
| KR101415201B1 (en) | Apparatus and method for scheduling high speed video stream service | |
| JP2017528978A (en) | Access network congestion control method, base station device, and policy and charging rule function network element | |
| CN113556785A (en) | Method for controlling service quality flow and related equipment | |
| US20120221706A1 (en) | Method and arrangement for network resource management | |
| WO2020185132A1 (en) | Method and current edge cloud manager for controlling resources | |
| CN114040504A (en) | TDMA satellite communication system frame structure and resource allocation method | |
| CN111107629B (en) | 5G communication method and system | |
| CN107690195B (en) | Multi-network resource joint distribution method | |
| JP2023542106A (en) | Enhanced rate signaling in wireless networks with relay functionality | |
| KR100783043B1 (en) | Data transmission method, system, base station, subscriber station, data processing unit, computer program distribution medium and baseband module | |
| JP2013520896A (en) | Satellite communication resource optimization allocation method and related communication system | |
| KR100938089B1 (en) | Method for scheduling data traffic in wireless communication system | |
| CN113645706A (en) | Wireless resource scheduling method, device and base station | |
| Teixeira et al. | A new and efficient adaptive scheduling packets for the uplink traffic in WiMAX networks | |
| CN112996115B (en) | Method and device for allocating uplink resources | |
| CN104427630B (en) | A kind of grouping scheduling method and device | |
| JP2017511991A5 (en) |
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 |