WO2012159349A1 - 实现负载均衡的方法和装置 - Google Patents

实现负载均衡的方法和装置 Download PDF

Info

Publication number
WO2012159349A1
WO2012159349A1 PCT/CN2011/077741 CN2011077741W WO2012159349A1 WO 2012159349 A1 WO2012159349 A1 WO 2012159349A1 CN 2011077741 W CN2011077741 W CN 2011077741W WO 2012159349 A1 WO2012159349 A1 WO 2012159349A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
cell
base station
priority
current
Prior art date
Application number
PCT/CN2011/077741
Other languages
English (en)
French (fr)
Inventor
张洁涛
庄宏成
罗泽宙
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201180001352.3A priority Critical patent/CN103026751B/zh
Priority to PCT/CN2011/077741 priority patent/WO2012159349A1/zh
Publication of WO2012159349A1 publication Critical patent/WO2012159349A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W36/00Hand-off or reselection arrangements
    • H04W36/16Performing reselection for specific purposes
    • H04W36/22Performing reselection for specific purposes for handling the traffic

Definitions

  • the present invention relates to the field of communications, and in particular, to a method and apparatus for implementing load balancing. Background technique
  • the load balancing technology can be used to transfer the services of some user equipments of the heavy load base station to the light load base station to ensure the user equipment under the heavy load base station.
  • QoS Quality of service
  • a commonly used method for implementing the load balancing technology is: in the relay system consisting of the parent base station and the corresponding relay base station, the current parent base station is overloaded, and after the preset load upper threshold is exceeded, the current mother is disconnected.
  • the base station is connected to the corresponding relay base station, and the corresponding relay base station is connected to another parent base station.
  • the user equipment connected to the corresponding relay base station is connected to the other parent base station through the corresponding relay base station, and is no longer connected to the current parent base station, the current mother The load on the base station will decrease.
  • the foregoing means for implementing the load balancing technology requires overall switching between the relay base station and the user equipment connected to the relay base station, and when the relay base station bears There are many data transmission tasks. When the load is large, switching to another parent base station may cause another parent base station to also exceed the load upper threshold. In this case, the connection between the user equipment in the coverage of the relay base station and the other parent base station will be interrupted, resulting in a handover failure.
  • Embodiments of the present invention provide a method and apparatus for implementing load balancing, which improves the success rate of load migration.
  • a method for implementing load balancing comprising: detecting whether a ratio of a service load of a current cell to a load of an average value of service loads of neighboring cells exceeds a preset threshold; the service load is in use of a current cell.
  • the user in the current cell coverage is prioritized by using the spectrum efficiency loss rate expectation and the load balancing gain caused by the cell handover;
  • An apparatus for implementing load balancing comprising: a first load detecting unit, configured to detect whether a ratio of a service load of a current cell to a load of an average value of service loads of neighboring cells exceeds a preset threshold;
  • the traffic load is the ratio of the number of resource blocks in use of the current cell to the total number of resource blocks provided by the current cell;
  • a first priority ordering unit configured to: when the ratio of the load exceeds the threshold, based on a spectrum efficiency loss rate expectation and a load balancing gain caused by a cell handover, to a user in the current cell coverage range Perform switching priority ordering;
  • the connection switching unit is configured to switch the user with the highest handover priority to the neighboring cell of the current cell.
  • the method and the device for implementing the load balancing provided by the embodiment of the present invention after prioritizing the users of the current cell with excessive load, switching the user with the highest priority to the neighboring cell, and transmitting the entire relay base station with the prior art. Compared with the case where the load migration may cause the other parent base station to be overloaded and cause the handover failure, the success rate of the load migration is improved.
  • FIG. 1 is a flowchart of a method for implementing load balancing in Embodiment 1 of the present invention
  • FIG. 2 is a flowchart of a method for implementing load balancing according to Embodiment 2 of the present invention
  • FIG. 3 is a block diagram of an apparatus for implementing load balancing in Embodiment 3 of the present invention.
  • FIG. 4 is a block diagram of another apparatus for implementing load balancing according to Embodiment 3 of the present invention
  • FIG. 5 is a block diagram of a first priority sorting module according to Embodiment 3 of the present invention
  • 6 is a block diagram of a first set partitioning module in Embodiment 3 of the present invention
  • FIG. 7 is a block diagram of a user sorting module in Embodiment 3 of the present invention
  • FIG. 8 is a block diagram of another apparatus for implementing load balancing according to Embodiment 3 of the present invention.
  • the embodiment of the invention provides a method for implementing load balancing. As shown in FIG. 1 , the method includes the following steps:
  • the traffic load is a ratio of the number of resource blocks in use of the current cell to the total number of resource blocks provided by the current cell.
  • the number of resource blocks in use by the user is S eBR i
  • the total number of resource blocks provided by the current cell i is S i
  • the neighboring cells of i are the neighboring cell 1, the neighboring cell 2, the neighboring cell 3, the neighboring cell 4, the neighboring cell 5, and the neighboring cell 6, respectively, and the average value of the traffic load of the neighboring cell is .
  • the threshold value is preset in the current cell i, and is set according to the network operator's business policy and application scenario. If the threshold is P, if the value of the load ratio LJ LL exceeds P, the current cell i is overloaded and the load is unbalanced, and step 102 is performed.
  • the spectrum efficiency loss caused by the system may be different; and because the number of current cell resource blocks is different according to the service of different users, the number of resource blocks that are vacant in the current cell when the cell is switched It is also possible that the more users who have spared the number of resource blocks, the greater the load balancing gain caused by the handover.
  • the user with the highest handover priority is switched, and the user is switched to the neighboring cell.
  • is that the user k is connected to the current base station (or relay station) i in the current cell i.
  • the current base station described in the embodiment of the present invention may be a parent base station or a relay base station.
  • a method for implementing load balancing according to an embodiment of the present invention after prioritizing users of an overloaded current cell, switching the user with the highest priority to the neighboring cell, and transmitting the entire relay with the prior art
  • the load migration of the base station may cause another parent base station to be overloaded and cause a handover failure, the success rate of the load migration is improved.
  • the embodiment of the invention provides a method for implementing load balancing. As shown in FIG. 2, the method includes the following steps:
  • the current cell Before detecting the ratio of the traffic load, the current cell first needs to know the attributes of its neighboring cells, that is, the neighboring base stations in the neighboring cells are known as the parent base station or the relay base station; in addition, each neighboring cell needs to be acquired. The traffic load, and calculate the average of the traffic load of each neighboring cell.
  • the traffic load is a ratio of the number of resource blocks in use of the current cell to the total number of resource blocks provided by the current cell.
  • the number of resource blocks in use by the user is S eBR i
  • the total number of resource blocks provided by the current cell i is S i
  • the traffic load of the current cell is S eB S i ;
  • Each adjacent cell is an adjacent cell 1
  • the average value of the traffic load of the neighboring cell 2 the neighboring cell 3, the neighboring cell 4, the neighboring cell 5, and the neighboring cell 6 is the average of the traffic load of the neighboring cell.
  • the threshold value is preset in the current cell i, and is set according to the network operator's business policy and application scenario. If the threshold value is P, if the value of the load ratio Li/L exceeds P, the current cell i load is too heavy and the load is unbalanced, and step 202 is performed.
  • step 202 further includes the following steps:
  • the spectrum efficiency loss rate caused by the cell switching of each user is first calculated; then, users corresponding to different spectrum efficiency loss rates are divided into the at least one first level set. For each first-level set, the lower the value of the spectral efficiency loss rate value interval, the higher the switching priority of the users of the first-level set.
  • the current cell i is connected to the user k, and among all the neighboring cells of the current cell i, the neighboring cell 1 has the strongest signal strength for the user k.
  • the neighboring cell 1 has the strongest signal strength for the user k.
  • its spectral efficiency loss rate ⁇
  • Ni k is the number of resource blocks occupied by user k for the current cell
  • Nl k is the occupation phase when user k is connected to the neighboring cell The number of resource blocks of the neighboring cell.
  • the user divided into them should satisfy ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ +1 , ⁇ 1, 2, ..., X ⁇ .
  • the spectrum efficiency loss rate value interval [ ⁇ ⁇ , ⁇ ⁇ +1 ) is preset in the current cell i.
  • [ ⁇ ⁇ , ⁇ 2 ), [ ⁇ 2 , ⁇ 3 ), [ ⁇ 3 , ⁇ 4 ) correspond to the first level set 1, the first level set 2, the first level set 3, ⁇ 13 ⁇ 4 ⁇ 2 , ⁇ 3 , ⁇ 4 are preset in the current base station (or relay station) i and [ ⁇ ⁇ 5 ⁇ 4 ) contains the value of the spectral efficiency loss rate of all users connected to the current cell i Range, in this case, all users connected to the current cell i will be recorded in the first level set 1, the first level set 2, the first level set 3, respectively, according to the difference in spectral efficiency loss rate.
  • the switching priority of the user of the first level set 1 is higher than the switching priority of the user in the first level set 2, and the switching of the user in the first level set 2 The priority is higher than the switching priority of the users in the first level set 3.
  • step 202_2 is performed.
  • the user recorded in the first set 1 is divided into at least one second level set.
  • the content of the current cell resource block occupied by the user service is determined according to y Ni k ⁇ y+1 , ⁇ 1, 2, . . . , Y ⁇ .
  • the current cell resource block value interval [ ⁇ ⁇ , ⁇ ⁇ +1 ) is preset in the current base station i.
  • [ ⁇ ⁇ 5 ⁇ 2 ) [ ⁇ 2 , ⁇ 3 ) correspond to the second level set 1 and the second level set 2, respectively.
  • the users in the first level set 1 are recorded as the second level set 1 and the second level set 2 respectively according to the difference of the current cell resource block value interval in which the Ni k of the different users in the first set 1 is located.
  • the higher the value of the current cell resource block value interval the more the number of resource blocks occupied by the users of the second-level set is, and the resources that are left in the current cell after the user switch occurs.
  • the more the number of blocks that is, the greater the load balancing gain
  • the higher the switching priority of the users of the second level set so the switching priority of the users of the second level set 1 at ⁇ s
  • the priority of the user who performs the non-real time service is set above the priority of the user who conducts the real time service.
  • the switching scenario has a priority from high to low, and the delay caused by performing the cell handover is small to large, and the user with the smallest delay caused by performing the cell handover has the highest priority.
  • the switching scenario is determined by a priority from a high to a low: a current parent base station and the Handover between the relay base stations subordinate to the parent base station, handover between the current relay base station and another relay base station subordinate to the same parent base station of the current relay base station, handover between the current parent base station and another parent base station The handover between the current parent base station and the relay base station subordinate to another parent base station, and the handover between the current relay base station and the relay base station subordinate to another parent base station.
  • both the real-time service user A and the real-time service user B of the current cell are connected to the base station X of the current cell, the user A is ready to switch to the base station Y of the neighboring cell Y, and the user B is ready to switch to the base station of the neighboring cell Z.
  • the base station Y is a relay base station subordinate to the base station X
  • the base station z is not a relay base station subordinate to the base station X (may be another parent base station or a relay base station subordinate to another parent base station)
  • the user The switching priority of A is higher than the switching priority of user B.
  • the step 202-4 can also be performed before the step 202-3, which is not limited by the embodiment of the present invention.
  • the above steps 202_1 to 202-4 will be described below by way of example. It is assumed that the current cell i exists, and the current cell i is connected to the user 1, the user 2, the user 3, the user 4, the user 5, the user 6, and the user 7. And the spectrum efficiency loss rate value interval [ ⁇ 1, ⁇ 2 ), [ ⁇ 2 , ⁇ 3 ) is preset in the current cell i, respectively corresponding to the first set 1, the first set 2; in the current cell i, The current cell resource block value interval [ ⁇ ⁇ 5 ⁇ 2 ), [ ⁇ 2 , ⁇ 3 ) is also preset, corresponding to the second level set 1-1 and the second level set 1-2 of the first set 1, respectively; The current cell resource block value interval [ ⁇ , ⁇ ) is preset, corresponding to the second level set 2-1 of the first level set 2.
  • users in the coverage of the current cell i are divided into a first level set 1 and a first level set 2. It may be assumed that the values of the spectrum efficiency loss rate of the user 1, the user 3, and the user 5 belong to the interval [ ⁇ ⁇ 2 ), and the values of the frequency loss rate of the user 2, the user 4, the user 6, and the user 7 belong to the interval [ ⁇ 2 , ⁇ 3 ), the user 1, the user 3, and the user 5 are recorded into the first level set 1, and the user 2, the user 4, the user 6, and the user 7 are recorded into the first level set 2. Then, the users in the first level set 1 and the first level set 2 are again divided again.
  • the number of resource blocks occupied by user 1 and user 5 belongs to the interval [ ⁇ ⁇ 5 ⁇ 2 ), and the number of resource blocks occupied by user 3 belongs to the interval [ ⁇ 2 , ⁇ 3 ), then user 1 and user 5 are recorded into the second level.
  • the set 1-1, the user 3 is recorded in the second level set 1-2, and the user 2, the user 4, the user 6, and the user 7 are all recorded in the second level set 2-1.
  • the switching priority of user 5 is ranked in the switching priority of user 1.
  • the switching priority is sorted according to the switching scenario described above, and the ranking result may be set to user 2, user 6, and user 7 from high to low.
  • the priority order of all seven users is obtained: User 5, User 1, User 3, User 2, User 6, User 7, User 4.
  • step 202 After sorting in step 202, for the user with the highest switching priority after sorting, it is pre-detected whether the neighboring cell has enough resources to satisfy the resource requirement of the switched user after switching to the neighboring cell.
  • the number of newly used resource blocks in the neighboring cell 1 is Nl k , and in the case of adding Nl k , the phase is calculated. Whether the neighboring cell 1 has Nl k vacant resources for the switching user to use.
  • the neighboring cell of the current cell is a relay cell (the relay base station of the relay cell is connected to the user)
  • another pre-detection is needed to determine the parent base station of the relay base station.
  • the user k of the current cell i switches to the relay cell 1 (ie, the user k is connected to the relay base station 1 of the relay cell 1)
  • the user k will occupy the backhaul link of the relay base station 1 to its parent base station j. Resources.
  • Nj k Nj k * lg ( l + Y ) / 1 ⁇ (1 + ⁇ ), where ⁇ is the relay base station 1 to The channel quality factor of the parent base station j.
  • step 204 the process proceeds to step 204, otherwise, the process proceeds to step 205.
  • the user switching is prohibited.
  • step 207 After the user is prohibited from switching, the process proceeds to step 207. Moving to the next handover priority user in step 207, and then pre-detecting whether the neighboring cell has sufficient resource blocks for the next handover priority user; or when the neighboring cell of the current cell is a relay cell Pre-detecting the neighboring cell after receiving the next highest handover priority user, the neighboring cell and Whether the cell where the parent base station is located has enough resource blocks for the next handover priority user.
  • the subsequent cell handover procedure is performed.
  • the current base station (or the relay base station through its parent base station) sends a handover notification to the user with the highest handover priority, and sends a handover request message to the neighboring base station (or the relay base station); the neighboring base station (or the relay base station) Returning a response message through its parent base station to notify the current base station (or relay base station) to start handover; the current base station (or relay base station) disconnects and has the highest handover priority after receiving the response message The user's connection then instructs the user with the highest handover priority to establish a connection with the neighboring base station (or relay base station).
  • step 207 If the ratio of the traffic load of the current cell to the load of the average of the traffic loads of the neighboring cells exceeds the threshold, if the current cell has not reached the load balancing state, the process proceeds to step 207.
  • the current cell has reached the load balancing state and ends the current process.
  • the user of the next handover priority in step 207 is used as the current handover priority user, and the neighboring cell is pre-detected.
  • step 203 of the embodiment of the present invention please refer to step 203 of the embodiment of the present invention.
  • step 204 If the cell where the parent cell of the neighboring cell or the neighboring cell is located does not have enough resource blocks, the process goes to step 204, otherwise step 209 is performed.
  • step 207 If the ratio of the traffic load of the current cell to the load of the average of the traffic loads of the neighboring cells exceeds the threshold, if the current cell has not reached the load balancing state, the process proceeds to step 207.
  • the current cell has reached the load balancing state and ends the current process.
  • the current base station described in the embodiment of the present invention may be a parent base station or a relay base station.
  • a method for implementing load balancing performs a switching priority ordering on a user of a current cell that is overloaded according to a spectrum efficiency loss rate expectation caused by a user switching a base station, and a user resource occupation current cell resource block condition.
  • the user with the highest priority is switched to the neighboring cell, and the user's handover can be continuously performed until the current cell reaches the load balancing state, which may cause the other parent base station to be overloaded after the load migration of the entire relay base station by the prior art.
  • the success rate of load migration is improved compared to the case where the handover fails.
  • the method for implementing load balancing places the handover priority of the user who performs the non-real-time service on the handover priority of the user who performs the real-time service, and switches the user who performs the real-time service.
  • the priority of the scenario is set to reduce the impact of user switching on business continuity.
  • the embodiment of the present invention provides a device for implementing load balancing. As shown in FIG. 3, the device includes: a first load detecting unit 31, a first priority sorting unit 32, and a connection switching unit 33.
  • the first load detecting unit 31 is configured to detect whether a ratio of a traffic load of a current cell to a load of an average value of traffic loads of neighboring cells exceeds a preset threshold; the traffic load is a resource in use of the current cell. The ratio of the number of blocks to the total number of resource blocks provided by the current cell.
  • the first priority ordering unit 32 is configured to: when the ratio of the load exceeds the threshold, use the spectrum efficiency loss rate expectation and the load balancing gain caused by the cell handover, and the user in the current cell coverage Switching prioritization.
  • the connection switching unit 33 is configured to switch the user with the highest handover priority to the neighboring cell of the current cell.
  • the first load detecting unit 31 is further configured to detect, after switching the user with the highest switching priority to the neighboring cell of the current cell, the ratio of the traffic load of the current cell to the load of the average of the traffic loads of the neighboring cells. Whether the threshold is exceeded, so that the pre-detection and the user switching are continued until the threshold is not exceeded, until the load ratio does not exceed the threshold
  • the apparatus further includes: a second load detecting unit 34, a third load detecting unit 35, and a connection switching prohibiting unit 36.
  • the second load detecting unit 34 is configured to pre-detect whether the neighboring cell has enough resource blocks for the user with the highest switching priority before switching the user with the highest switching priority to the neighboring cell of the current cell.
  • the third load detecting unit 35 is configured to: when the neighboring cell of the current cell is a relay cell, pre-detecting whether the cell where the parent cell of the neighboring cell is located after the neighboring cell receives the user with the highest handover priority The resource block is used by the user with the highest switching priority.
  • connection switching prohibiting unit 36 is configured to prohibit switching of the user with the highest switching priority in the case where the cell in which the parent cell of the neighboring cell or the neighboring cell is located does not have sufficient resource blocks.
  • the first priority sorting unit 32 further includes a first set dividing module 321, a second set dividing module 322, and a user sorting module 323.
  • the first set dividing module 321 is configured to divide users in the current cell coverage into at least one first level set according to a spectrum efficiency loss rate expectation caused by the user switching the cell.
  • the second set partitioning module 322 is configured to divide the users in each first level set into at least one second level set according to the situation that the user service occupies the current cell resource block.
  • the user ranking module 323 is configured to sort the users in the second level set of each first level set according to rules in which the non-real time service priority is higher than the real time service priority.
  • the first set dividing module 321 further includes: a frequency loss rate calculating submodule 3211 and a first set dividing submodule 3212 .
  • the frequency loss rate calculation sub-module 3211 is configured to calculate a spectrum efficiency loss rate caused by each user performing cell handover. First Into the at least one first level set.
  • the user ranking module 323 further includes a service attribute query sub-module 3231 and a user ordering sub-module 3232.
  • the service attribute query sub-module 3231 is configured to query the service attributes of the users in the current second-level set.
  • the user ranking sub-module 3232 is used to prioritize users whose business attributes are non-real-time services above the priority of users of real-time services.
  • the apparatus further includes a second prioritization unit 37.
  • the second priority sorting unit 37 is configured to perform priority ordering on the basis of the priority of the preset switching scenario for the user of the real-time service in the second-level set of each first-level set;
  • the level from high to low is: handover between the current parent base station and the relay base station subordinate to the parent base station, handover between the current relay base station and another relay base station subordinate to the same parent base station of the current relay base station, current mother The handover between the base station and another parent base station, the handover between the current parent base station and the relay base station subordinate to another parent base station, and the handover between the current relay base station and the relay base station subordinate to another parent base station.
  • An apparatus for implementing load balancing performs a switching priority ordering on a user of an overloaded current cell according to a spectrum efficiency loss rate expectation caused by a user switching a base station, and a user service occupying a current cell resource block condition.
  • the user with the highest priority is switched to the neighboring cell, and the user's handover can be continuously performed until the current cell reaches the load balancing state, which may cause the other parent base station to be overloaded after the load migration of the entire relay base station by the prior art.
  • the success rate of load migration is improved compared to the case where the handover fails.
  • the present invention can be implemented by means of software plus necessary general hardware, and of course, by hardware, but in many cases, the former is a better implementation. .
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a readable storage medium, such as a floppy disk of a computer.
  • a hard disk or optical disk, etc. includes instructions for causing a computer device (which may be a personal computer, server, or network device, etc.) to perform the methods described in various embodiments of the present invention.

Landscapes

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

Abstract

本发明公开了一种实现负载均衡的方法和装置,涉及通信领域,提高了负载迁移的成功率。一种实现负载均衡的方法,包括:检测当前小区的业务负载与各相邻小区的业务负载的平均值的负载之比是否超过预设的门限值;在所述负载之比超过所述门限值时,以小区切换造成的频谱效率损失率预期、负载均衡增益为依据,对所述当前小区覆盖范围内的用户进行切换优先级排序;将切换优先级最高的用户切换到当前小区的相邻小区。本发明实施例主要用于通信系统的基站中。

Description

实现负载均衡的方法和装置 技术领域
本发明涉及通信领域, 尤其涉及一种实现负载均衡的方法和装置。 背景技术
随着当前移动通信网络的扩大, 通信系统中的网元数量急剧增长, 每个基站维持的用户设备也不断增加,基站的负载不断加重。在 LTE( Long Term Evo lut i on,长期演进) 系统中, 通过负载均衡技术, 能够将重负载 基站的部分用户设备的业务转移到轻负载基站, 以保证所述重负载基站 下的用户设备的 QoS (Qua l i ty of Serv i ce , 服务质量)。
一种常用的实现负载均衡技术的手段是, 在由母基站和对应的中继 基站组成的中继系统中, 当前母基站的负载过重, 超过预设的负载上限 阈值后, 断开当前母基站与对应的中继基站的连接, 将所述对应的中继 基站连接至另一母基站。 在此情况下, 所述对应的中继基站连接的用户 设备将通过所述对应的中继基站与所述另一母基站进行连接, 而不再连 接到所述当前母基站, 所述当前母基站的负载将有所下降。
在实现上述技术方案的过程中, 发明人发现现有技术至少存在如下 问题: 上述实现负载均衡技术的手段要求对中继基站以及连接在中继基 站的用户设备进行整体切换, 而当中继基站承担的数据传输任务较多, 负载较大时, 切换至另一母基站可能导致另一母基站也超出负载上限阈 值。 在此情况下, 中继基站覆盖范围内的用户设备与所述另一母基站的 连接将会中断, 导致切换失败。
发明内容
本发明的实施例提供一种实现负载均衡的方法和装置, 提高了负载 迁移的成功率。
为达到上述目的, 本发明的实施例采用如下技术方案: 一种实现负载均衡的方法, 包括: 检测当前小区的业务负载与各相邻小区的业务负载的平均值的负 载之比是否超过预设的门限值;所述业务负载为当前小区的使用中的资 源块数目与当前小区提供的总资源块数目的比值;
在所述负载之比超过所述门限值时, 以小区切换造成的频谱效率 损失率预期、 负载均衡增益为依据,对所述当前小区覆盖范围内的用户 进行切换优先级排序;
将切换优先级最高的用户切换到当前小区的相邻小区。
一种实现负载均衡的装置, 包括: 第一负载检测单元, 用于检测当前小区的业务负载与各相邻小区 的业务负载的平均值的负载之比是否超过预设的门限值;所述业务负载 为当前小区的使用中的资源块数目与当前小区提供的总资源块数目的 比值;
第一优先级排序单元, 用于在所述负载之比超过所述门限值时, 以小区切换造成的频谱效率损失率预期、 负载均衡增益为依据,对所述 当前小区覆盖范围内的用户进行切换优先级排序;
连接切换单元, 用于将切换优先级最高的用户切换到当前小区的相 邻小区。
本发明实施例提供的实现负载均衡的方法和装置, 对于负载过重的当 前小区的用户进行优先级排序后将优先级最高的用户切换至相邻小区, 与现有技术通过对整个中继基站进行负载迁移后可能导致另一母基站负 载过重、 并造成切换失败的情况相比, 提升了负载迁移的成功率。
附图说明
图 1为本发明实施例 1 中实现负载均衡的方法的流程图;
图 2为本发明实施例 2中实现负载均衡的方法的流程图;
图 3为本发明实施例 3中实现负载均衡的装置的框图;
图 4为本发明实施例 3中另一种实现负载均衡的装置的框图; 图 5为本发明实施例 3中的第一优先级排序模块的框图; 图 6为本发明实施例 3中的第一集合划分模块的框图; 图 7为本发明实施例 3中的用户排序模块的框图;
图 8为本发明实施例 3中另一种实现负载均衡的装置的框图。
具体实施方式
下面结合本发明实施例的附图对本发明实施例的技术方案进行清楚、 完整地描述, 显然, 所描述的实施例仅仅是本发明一部分实施例, 而不是全 部的实施例。 基于本发明中的实施例, 本领域普通技术人员在没有作出创造 性劳动前提下所获得的所有其他实施例, 都属于本发明保护的范围。 实施例 1:
本发明实施例提供了一种实现负载均衡的方法, 如图 1 所述, 所 述方法包括以下步骤:
1 01、 检测当前小区的业务负载与各相邻小区的业务负载的平均值 的负载之比是否超过预设的门限值。
所述业务负载为当前小区的使用中的资源块数目与当前小区提供 的总资源块数目的比值。 比如, 在当前小区 i 中, 用户使用中的资源块 数目为 SeBRi,当前小区 i提供的总资源块数目为 S i , 当前小区的业务负 载 L i = SeB S i ; 不妨假设当前小区 i的各相邻小区分别为相邻小区 1、 相邻小区 2、 相邻小区 3、 相邻小区 4、 相邻小区 5、 相邻小区 6 , 相 邻小区的业务负载的平均值为 。 所述门限值预设置在当前小区 i 中, 并根据网络运营商的营业策略、 应用场景进行取值。 若所述门限值为 P,则负载之比 L J LL的数值超过 P时, 当前小区 i 负载过重, 处于负载 不均衡状态, 执行步骤 1 02。
1 02、 以小区切换造成的频谱效率损失率预期、 负载均衡增益为依 据, 对所述当前小区覆盖范围内的用户进行切换优先级排序。
当前小区中不同的用户进行小区切换时, 给系统造成的频谱效率 损失情况可能不同;并且由于不同用户的业务占用当前小区资源块数目 不同, 从而在小区切换时为当前小区空余出来的资源块数目也可能不 同,空余出来资源块数目越多的用户,其切换造成的负载均衡增益越大。 小区切换时的频谱效率损失率预期越小、为当前小区空余出来的资源块 数目越多的用户, 其切换优先级应越高。 以此为依据, 可以对用户的切 换优先级实行排序。
103、 将当前小区中切换优先级最高的用户切换到当前小区的相邻 小区。
在对当前小区覆盖范围内的用户进行切换优先级排序后, 对切换 优先级最高的用户进行切换操作, 将该用户切换到相邻小区。
比如,与当前小区 i连接的用户 k ,若其 GBR( Guaranteed B i t Ra te , 保证比特率 )业务速率为 Dk, γ 为用户 k连接至当前小区 i 中的当前 基站(或中继站) i的信道质量因子, 则用户 k占用当前基站 i的资源 块数目 Nik= Dk/BW* l g (l+ Y ) , 其中 BW为每个资源块的带宽。 在断开 用户 k与当前基站 i的连接后,当前基站 i可用的资源块数目增加 Nik
本发明实施例中描述的当前基站可以是母基站或中继基站。
本发明实施例提供的一种实现负载均衡的方法, 对于负载过重的 当前小区的用户进行优先级排序后,将优先级最高的用户切换至相邻小 区,与现有技术通过对整个中继基站进行负载迁移后可能导致另一母基 站负载过重、 并造成切换失败的情况相比, 提升了负载迁移的成功率。
实施例 2 :
本发明实施例提供了一种实现负载均衡的方法, 如图 2 所示, 所 述方法包括以下步骤:
201、 检测当前小区的业务负载与各相邻小区的业务负载的平均值 的负载之比是否超过预设的门限值。
在检测所述业务负载之比前, 当前小区要首先获知其相邻小区的 属性, 即获知相邻小区中的相邻基站为母基站或中继基站; 另外, 还需 获取每个相邻小区的业务负载, 并计算各相邻小区的业务负载的平均 值。
所述业务负载为当前小区的使用中的资源块数目与当前小区提供 的总资源块数目的比值。 比如, 在当前小区 i 中, 用户使用中的资源块 数目为 SeBRi,当前小区 i提供的总资源块数目为 S i , 当前小区的业务负 载 = SeB S i ; 不妨假设当前小区 i的各相邻小区分别为相邻小区 1、 相邻小区 2、 相邻小区 3、 相邻小区 4、 相邻小区 5、 相邻小区 6, 相 邻小区的业务负载的平均值为 。 所述门限值预设置在当前小区 i 中, 并根据网络运营商的营业策略、 应用场景进行取值。 若所述门限值为 P,则负载之比 Li/L 的数值超过 P时, 当前小区 i 负载过重, 处于负载 不均衡状态 , 执行步骤 202。
202、 以小区切换造成的频谱效率损失率预期、 负载均衡增益为依 据, 对所述当前小区覆盖范围内的用户进行切换优先级排序。
具体的, 如图 3所示, 步骤 202还包括如下步骤:
202_1、 根据用户切换造成的频谱效率损失率预期, 将所述当前小 区覆盖范围内的用户划分入至少一个第一级集合。
具体的, 对于当前小区内的所有用户, 先计算每个用户的小区切 换所造成的频谱效率损失率;然后将不同的频谱效率损失率对应的用户 划分入所述至少一个第一级集合中。对于每个第一级集合, 其频谱效率 损失率取值区间的取值点越低, 则第一级集合的用户的切换优先级越 高。
比如, 当前小区 i连接了用户 k,且在当前小区 i的所有相邻小区 中, 相邻小区 1对于用户 k来说有最强的信号强度。 对于用户 k,其频 谱效率损失率 ΔΝ= |Nik - Nlk|/ Nik, Nik为用户 k占用当前小区的资源块 数, Nlk为用户 k连接至相邻小区的情况下占用相邻小区的资源块数。 根据 本发明实施例 1 中给出的公式, Nik= Dk/BW*lg (l+Y ; 相应的, Nlk=
Figure imgf000007_0001
k),其中 γ 为用户 k连接至小区 1情况下的信道质量因 子。对于多个第一级集合中的每个第一级集合,被划分入其中的用户应 满足 δχ < ΔΝ<δχ+1, {1,2, ..., X}。其中,频谱效率损失率取值区间 [δ χ, δχ+1 )预先设置在当前小区 i中。 根据每个用户的 ΔΝ所在的频谱效率损 失率取值区间的不同, 当前小区 i可将不同的用户划分入不同频谱效率损失 率取值区间对应的第一级集合中。 举例来说, 当前小区 i的频谱效率损失 率取值区间分为 [δΐ5 δ2 )、 [δ2, δ3 )、 [δ3, δ4 ) , Χ=3。 其中, [δ ι, δ2)、 [δ2, δ3)、 [δ3, δ4 )分别对应了第一级集合 1、 第一级集合 2、 第一级集合 3, δ δ2、 δ3、 δ4预先设置在当前基站(或中继站) i中并 且 [δΐ5 δ4)包含了与当前小区 i连接的所有用户的频谱效率损失率的取值 范围, 在此情况下, 与当前小区 i 连接的所有用户将根据频谱效率损失率 的不同, 被分别记录在第一级集合 1、 第一级集合 2、 第一级集合 3中。 由
- δ!<δ234, 则第一级集合 1 的用户的切换优先级高于第一级集合 2 中的用户的切换优先级,第一级集合 2中的用户的切换优先级高于第一级集 合 3中的用户的切换优先级。
在将所述当前小区覆盖范围内的用户划分入至少一个第一级集合 后, 执行步骤 202_2。
202_2、 根据用户业务占用当前小区资源块情况, 将每个第一级集 合中的用户划分入至少一个第二级集合。
以步骤 202_1 中的第一级集合 1 为例来说明, 将被记录在第一集 合 1中的用户, 划分入至少一个第二级集合。 其中, 用户业务占用当前 小区资源块情况根据 y Nik< y+1, {1,2,..., Y}来确定。 当前小区资 源块取值区间 [ξγ, ξγ+1 )预设置在当前基站 i 中。 举例来说, 对于记录在 第一级集合 1中的所有用户, 当前小区资源块取值区间分为 [ξΐ ξ2)、 [ξ 2, ξ3), Υ=2。 其中 [ξΐ5 ξ2 )、 [ξ2, ξ 3)分别对应第二级集合 1, 第二级 集合 2。 根据第一集合 1 中的不同用户的 Nik所在的当前小区资源块取值区 间的不同, 将第一级集合 1 中的用户分别记录如第二级集合 1和第二级集 合 2。 对于每个第二级集合, 其当前小区资源块取值区间的取值点越高, 表明第二级集合的用户所占的资源块数目越多,发生用户切换后为当前 小区空余出的资源块数目也就越多 (即带来的负载均衡增益越大), 则 第二级集合的用户的切换优先级越高, 因此在 ^ ^ s时, 第二级集 合 1的用户的切换优先级低于第二级集合 2的用户的切换优先级。
202_3、 根据非实时业务优先级高于实时业务优先级的规则, 对每 个第一级集合的第二级集合中的用户进行排序。
在每个第一级集合中的第二级集合中, 将开展非实时业务的用户 的优先级设置于开展实时业务的用户的优先级之上。
202_4、 对于每个第一级集合的第二级集合中的实时业务的用户, 以预设的切换场景的优先级为依据进行优先级排序。
所述切换场景按优先级由高到低对应了执行小区切换造成的时延 的由小到大, 执行小区切换造成的时延最小的用户, 其切换场景按优先 级最高。 具体的, 所述切换场景按优先级由高到低为: 当前母基站和该 母基站下属的中继基站之间的切换、当前中继基站切换至与当前中继基 站同一母基站下属的另一中继基站之间的切换、当前母基站和另一母基 站之间的切换、 当前母基站和另一母基站下属的中继基站之间的切换、 当前中继基站和另一母基站下属的中继基站之间的切换。
举例来说, 当前小区的实时业务用户 A和实时业务用户 B都连接 在当前小区的基站 X上, 用户 A准备切换至相邻小区 Y的基站 Y, 用户 B准备切换至相邻小区 Z的基站 Z,若基站 Y为基站 X下属的中继基站、 基站 z不是基站 X下属的中继基站(可以是另一个母基站或另一个母基 站下属的中继基站), 则根据上述切换场景, 用户 A的切换优先级高于 用户 B的切换优先级。
步骤 202-4也可以在步骤 202-3之前执行, 本发明实施例对此不 做限制。
下面举例来对上述步骤 202_1至 202-4进行说明。设存在当前小区 i, 且当前小区 i连接有用户 1、 用户 2、 用户 3、 用户 4、 用户 5、 用 户 6、用户 7。并且在当前小区 i中预设置了频谱效率损失率取值区间 [δ 1, δ2 )、 [δ2, δ3 ), 分别对应第一集合 1、 第一集合 2; 在当前小区 i 中, 还预设置了当前小区资源块取值区间 [ξΐ5 ξ2 )、 [ξ2, ξ3 ), 分别对 应第一集合 1的第二级集合 1-1、 第二级集合 1-2; 还预设置了当前小区资 源块取值区间 [ ξ , ξ ),对应第一级集合 2的第二级集合 2-1。
首先, 将所述当前小区 i覆盖范围内的用户划分入第一级集合 1和 第一级集合 2。 不妨设用户 1、 用户 3、 用户 5的频谱效率损失率的取 值属于区间 [δ δ2 ), 用户 2、 用户 4、 用户 6、 用户 7的频率损失率的 取值属于区间 [δ2, δ3 ), 则用户 1、 用户 3、 用户 5被记录入第一级集 合 1, 用户 2、 用户 4、 用户 6、 用户 7被记录入第一级集合 2。 然后, 分别 对第一级集合 1和第一级集合 2中的用户再次进行划分。不妨设用户 1和用 户 5占用的资源块数量属于区间 [ξΐ5 ξ2 ), 用户 3占用的资源块数量属于 区间 [ξ2, ξ3 ), 则用户 1、 用户 5被记录入第二级集合 1-1、 用户 3被记 录入第二级集合 1-2, 另外, 用户 2、 用户 4、 用户 6、 用户 7都被记录在第 二级集合 2-1。 在此基础上, 第二级集合 1-1中, 当用户 1为开展实时业务 的用户, 用户 5为开展非实时业务的用户时, 用户 5的切换优先级排在用户 1的切换优先级之上, 由此获得第一集合 1中三个用户的切换优先级由高到 低为用户 5、 用户 1、 用户 3; 另一方面, 第二级集合 2-1 中, 若用户 4开 展实时业务, 则用户 4在第二级集合 2-1中的切换优先级最低, 在用户 2、 用户 6、用户 7都开展非实时业务的情况下,按照上文所述的切换场景进行 切换优先级排序, 不妨设定排序结果由高到低为用户 2、 用户 6、 用户 7。 由此获得全部七个用户的优先级排序: 用户 5、 用户 1、 用户 3、 用 户 2、 用户 6、 用户 7、 用户 4。
203、 预检测相邻小区是否有足够的资源块供所述切换优先级最高 的用户使用。
在经过步骤 202 的排序后, 对于排序后切换优先级最高的用户, 预检测在切换至相邻小区后, 相邻小区能否有足够的资源来满足所切换 用户的资源需求。
比如, 与当前小区 i连接的用户 k切换至当前小区 i的相邻小区 1 后, 相邻小区 1新增使用中的资源块的数目为 Nlk, 在新增 Nlk的情况下, 计算相邻小区 1能否有 Nlk的空余资源供切换用户使用。
另外, 若当前小区的相邻小区为中继小区 (中继小区的中继基站 与用户进行连接), 则在经过步骤 203后, 还需要进行另一次预检测, 以判断中继基站的母基站是否能提供足够的资源块来支持用户 k。 具体 的, 当前小区 i的用户 k切换至中继小区 1 (即用户 k与中继小区 1的 中继基站 1连接)后, 用户 k将占用中继基站 1到其母基站 j的回程链 路资源。在此情况下,母基站 j所在的小区将新增使用中的资源块数为 Njk= Njk* l g ( l+ Y ) / 1 § (1 + γ ),其中 γ 为中继基站 1 到其母基站 j 的信道质量因子。在新增 Njk的情况下,计算母基站 j所在的小区是否有 多余的资源块满足新增的 Njk
在相邻小区或相邻小区的母基站所在的小区没有足够的资源块的 情况下, 转向步骤 204 , 否则转向步骤 205。
204、 在相邻小区或相邻小区的母基站所在的小区没有足够的资源 块的情况下, 禁止进行用户切换。
在禁止对用户进行切换后, 转向步骤 207。 在步骤 207中转向下一 切换优先级的用户,然后预检测相邻小区是否有足够的资源块供所述下 一切换优先级的用户使用; 或者在当前小区的相邻小区为中继小区时, 预检测相邻小区在接收所述下一切换优先级次高的用户后,相邻小区和 其母基站所在的小区是否有足够的资源块供下一切换优先级的用户使 用。
当有足够资源块得情况下, 执行后续的小区切换流程。
205、 将切换优先级最高的用户切换到当前小区的相邻小区。
具体的, 当前基站 (或中继基站通过其母基站) 发送切换通知给 切换优先级最高的用户, 并发送切换请求消息给相邻基站 (或中继基 站); 相邻基站(或中继基站通过其母基站)返回一个响应消息, 以通 知当前基站(或中继基站)开始进行切换; 当前基站(或中继基站)在 收到所述响应消息后, 断开与所述切换优先级最高的用户的连接, 然后 指示所述切换优先级最高的用户与相邻基站(或中继基站)进行连接建 立。
206、 在将切换优先级最高的用户切换到当前小区的相邻小区后, 检测当前小区的业务负载与各相邻小区的业务负载的平均值的负载之 比是否超过所述门限值。
若当前小区的业务负载与各相邻小区的业务负载的平均值的负载 之比超过所述门限值, 则当前小区仍未达到负载均衡状态, 则转向步骤 207。
若当前小区的业务负载与各相邻小区的业务负载的平均值的负载 之比未超过所述门限值, 则当前小区已达到负载均衡状态, 结束当前流 程。
207、 转向下一切换优先级的用户。
208、 预检测相邻小区是否有足够的资源块供当前切换优先级的用 户使用。
将步骤 207 中的下一切换优先级的用户作为当前切换优先级的用 户, 对其相邻小区进行预检测。
有关此步骤的详细描述请参考本发明实施例的步骤 203。
在相邻小区或相邻小区的母基站所在的小区没有足够的资源块的 情况下, 转向步骤 204 , 否则执行步骤 209。
209、 将当前切换优先级的用户切换到当前小区的相邻小区。
210、 检测当前小区的业务负载与各相邻小区的业务负载的平均值 的负载之比是否超过所述门限值。
若当前小区的业务负载与各相邻小区的业务负载的平均值的负载 之比超过所述门限值, 则当前小区仍未达到负载均衡状态, 则转向步骤 207。
若当前小区的业务负载与各相邻小区的业务负载的平均值的负载 之比未超过所述门限值, 则当前小区已达到负载均衡状态, 结束当前流 程。
本发明实施例中描述的当前基站可以是母基站或中继基站。
本发明实施例提供的一种实现负载均衡的方法, 根据用户切换基 站造成的频谱效率损失率预期、用户业务占用当前小区资源块情况等对 于负载过重的当前小区的用户进行切换优先级排序,将优先级最高的用 户切换至相邻小区, 并能够连续执行用户的切换, 直至当前小区达到负 载均衡状态,与现有技术通过对整个中继基站进行负载迁移后可能导致 另一母基站负载过重、并造成切换失败的情况相比,提升了负载迁移的 成功率。
另外, 本发明实施例提供的一种实现负载均衡的方法, 将开展非 实时业务的用户的切换优先级置于开展实时业务的用户的切换优先级 之上, 并且对开展实时业务的用户的切换场景的优先级进行了设置,从 而降低用户切换对业务连续性的影响。
实施例 3:
本发明实施例提供了一种实现负载均衡的装置, 如图 3 所示, 所 述装置包括: 第一负载检测单元 31、 第一优先级排序单元 32、 连接切 换单元 33。
第一负载检测单元 31用于检测当前小区的业务负载与各相邻小区 的业务负载的平均值的负载之比是否超过预设的门限值;所述业务负载 为当前小区的使用中的资源块数目与当前小区提供的总资源块数目的 比值。
第一优先级排序单元 32用于在所述负载之比超过所述门限值时, 以小区切换造成的频谱效率损失率预期、 负载均衡增益为依据,对所述 当前小区覆盖范围内的用户进行切换优先级排序。 连接切换单元 33用于将切换优先级最高的用户切换到当前小区的 相邻小区。
所述第一负载检测单元 31还用于在将切换优先级最高的用户切换 到当前小区的相邻小区后,检测当前小区的业务负载与各相邻小区的业 务负载的平均值的负载之比是否超过所述门限值,以使得在未超过所述 门限值的情况下, 继续进行预检测以及用户切换, 直至所述负载之比不 超过所述门限值
进一步的, 如图 4所示, 所述装置还包括: 第二负载检测单元 34、 第三负载检测单元 35、 连接切换禁止单元 36。
第二负载检测单元 34用于在将切换优先级最高的用户切换到当前 小区的相邻小区前,预检测相邻小区是否有足够的资源块供所述切换优 先级最高的用户使用。
第三负载检测单元 35用于在当前小区的相邻小区为中继小区时, 预检测相邻小区在接收所述切换优先级最高的用户后,相邻小区的母基 站所在的小区是否有足够的资源块供所述切换优先级最高的用户使用。
连接切换禁止单元 36用于在相邻小区或相邻小区的母基站所在的 小区没有足够的资源块的情况下,禁止对所述切换优先级最高的用户进 行切换。
进一步的, 如图 5所示, 所述第一优先级排序单元 32还包括第一 集合划分模块 321、 第二集合划分模块 322、 用户排序模块 323。
其中, 第一集合划分模块 321 用于根据用户切换小区造成的频谱 效率损失率预期,将所述当前小区覆盖范围内的用户划分入至少一个第 一级集合。
第二集合划分模块 322 用于根据用户业务占用当前小区资源块情 况, 将每个第一级集合中的用户划分入至少一个第二级集合。
用户排序模块 323 用于根据非实时业务优先级高于实时业务优先 级的规则, 对每个第一级集合的第二级集合中的用户进行排序。
其中, 如图 6 所示, 所述第一集合划分模块 321还包括: 频率损 失率计算子模块 3211、 第一集合划分子模块 3212。 频率损失率计算子 模块 3211 用于计算每个用户进行小区切换造成的频谱效率损失率。 第 入所述至少一个第一级集合中。
如图 7 所示, 所述用户排序模块 323还包括业务属性查询子模块 3231、 用户排序子模块 3232。 业务属性查询子模块 3231用于查询当前 第二级集合中的用户的业务属性。 用户排序子模块 3232用于将业务属 性为非实时业务的用户的优先级置于实时业务的用户的优先级之上。
进一步的, 如图 8所示, 所述装置还包括第二优先级排序单元 37。 第二优先级排序单元 37用于对于每个第一级集合的第二级集合中 的实时业务的用户, 以预设的切换场景的优先级为依据进行优先级排 序; 所述切换场景按优先级由高到低为: 当前母基站和该母基站下属的 中继基站之间的切换、当前中继基站与当前中继基站同一母基站下属的 另一中继基站之间的切换、 当前母基站和另一母基站之间的切换、 当前 母基站和另一母基站下属的中继基站之间的切换、当前中继基站和另一 母基站下属的中继基站之间的切换。
关于将用户划分入第一级集合、 第二级集合以及切换优先级的排 序的具体说明, 可以参考本发明实施例 2中的描述, 此处不再贅述。
本发明实施例提供的一种实现负载均衡的装置, 根据用户切换基 站造成的频谱效率损失率预期、用户业务占用当前小区资源块情况等对 于负载过重的当前小区的用户进行切换优先级排序,将优先级最高的用 户切换至相邻小区, 并能够连续执行用户的切换, 直至当前小区达到负 载均衡状态,与现有技术通过对整个中继基站进行负载迁移后可能导致 另一母基站负载过重、并造成切换失败的情况相比,提升了负载迁移的 成功率。
通过以上的实施方式的描述, 所属领域的技术人员可以清楚地了 解到本发明可借助软件加必需的通用硬件的方式来实现,当然也可以通 过硬件, 但很多情况下前者是更佳的实施方式。 基于这样的理解, 本发 明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产 品的形式体现出来, 该计算机软件产品存储在可读取的存储介质中,如 计算机的软盘,硬盘或光盘等, 包括若干指令用以使得一台计算机设备 (可以是个人计算机, 服务器, 或者网络设备等)执行本发明各个实施 例所述的方法。 以上所述, 仅为本发明的具体实施方式, 但本发明的保护范围并 不局限于此,任何熟悉本技术领域的技术人员在本发明揭露的技术范围 内,可轻易想到变化或替换,都应涵盖在本发明的保护范围之内。 因此, 本发明的保护范围应所述以权利要求的保护范围为准。

Claims

权利 要求 书
1、 一种实现负载均衡的方法, 其特征在于, 包括:
检测当前小区的业务负载与各相邻小区的业务负载的平均值的负载 之比是否超过预设的门限值; 所述业务负载为当前小区的使用中的资源 块数目与当前小区提供的总资源块数目的比值;
在所述负载之比超过所述门限值时, 以小区切换造成的频谱效率损 失率预期、 负载均衡增益为依据, 对所述当前小区覆盖范围内的用户进 行切换优先级排序;
将切换优先级最高的用户切换到当前小区的相邻小区。
2、 根据权利要求 1所述的方法, 其特征在于, 在将切换优先级最高 的用户切换到当前小区的相邻小区前, 还包括:
预检测相邻小区是否有足够的资源块供所述切换优先级最高的用户 使用门限值;
若当前小区的相邻小区为中继小区, 预检测相邻小区在接收所述切 换优先级最高的用户后, 相邻小区的母基站所在的小区是否有足够的资 源块供所述切换优先级最高的用户使用;
在相邻小区或相邻小区的母基站所在的小区没有足够的资源块的情 况下, 禁止对所述切换优先级最高的用户进行切换。
3、 根据权利要求 1所述的方法, 其特征在于, 在将切换优先级最高 的用户切换到当前小区的相邻小区后, 还包括:
检测当前小区的业务负载与各相邻小区的业务负载的平均值的负载 之比是否超过所述门限值, 以使得在未超过所述门限值的情况下, 继续 进行预检测以及用户切换, 直至所述负载之比不超过所述门限值。
4、 根据权利要求 1至 3中任一项所述的方法, 其特征在于, 所述以 小区切换造成的频谱效率损失率预期、 负载均衡增益为依据, 对所述当 前小区覆盖范围内的用户进行切换优先级排序包括:
根据用户切换小区造成的频谱效率损失率预期, 将所述当前小区覆 盖范围内的用户划分入至少一个第一级集合;
根据用户业务占用当前小区资源块情况, 将每个第一级集合中的用 户划分入至少一个第二级集合; 根据非实时业务优先级高于实时业务优先级的规则, 对每个第一级 集合的第二级集合中的用户进行排序。
5、 根据权利要求 4所述的方法, 其特征在于, 所述根据用户切换小 区造成的频谱效率损失率预期, 将所述当前小区覆盖范围内的用户划分 入至少一个第一级集合包括:
计算每个用户进行小区切换造成的频谱效率损失率; 所述每个用户的频谱 效率损失率 ΔΝ= |Nik - Nlk|/ Nik, 其中 Nik为用户 k占用当前小区的资源块数, Nlk为用户 k连接至相邻小区的情况下占用相邻小区的资源块数;
合中; 其中, 第一级集合 X中的用户的频谱效率损失率 ΔΝ满足 δ χ < ΔΝ < δ χ+1, χ ζ {1, 2, ..., X} , [ δ χ, δ χ+1 )为预设置的频谱效率损失率取值区间, 并 且第一级集合的频谱效率损失率取值区间的取值点越低, 第一级集合的 用户的切换优先级越高。
6、 根据权利要求 5所述的方法, 其特征在于, 在第二级集合 y中的 用户 k的 Nlk满足 y Nlk< y+1, {1, 2, ..., Y} , [ ξ y, ξ γ+1 )为预设置的当 前小区资源块取值区间,并且第二级集合的当前小区资源块取值区间的取值点 越高, 第二级集合中用户的切换优先级越高。
7、 根据权利要求 6所述的方法, 其特征在于, 所述根据非实时业务 优先级高于实时业务优先级的规则, 对每个第一级集合的第二级集合中 的用户进行排序, 还包括:
查询当前第二级集合中的用户的业务属性;
将业务属性为非实时业务的用户的切换优先级置于实时业务的用户 的切换优先级之上。
8、 根据权利要求 7所述的方法, 其特征在于, 还包括:
对于每个第一级集合的第二级集合中的实时业务的用户, 以预设的 切换场景的优先级为依据进行切换优先级排序; 所述切换场景按优先级 由高到低为: 当前母基站和该母基站下属的中继基站之间的切换、 当前 中继基站与当前中继基站同一母基站下属的另一中继基站之间的切换、 当前母基站和另一母基站之间的切换、 当前母基站和另一母基站下属的 中继基站之间的切换、 当前中继基站和另一母基站下属的中继基站之间 的切换。
9、 一种实现负载均衡的装置, 其特征在于, 包括:
第一负载检测单元, 用于检测当前小区的业务负载与各相邻小区的 业务负载的平均值的负载之比是否超过预设的门限值; 所述业务负载为 当前小区的使用中的资源块数目与当前小区提供的总资源块数目的比 值;
第一优先级排序单元, 用于在所述负载之比超过所述门限值时, 以 小区切换造成的频谱效率损失率预期、 负载均衡增益为依据, 对所述当 前小区覆盖范围内的用户进行切换优先级排序;
连接切换单元, 用于将切换优先级最高的用户切换到当前小区的相 邻小区。
1 0、 根据权利要求 9所述的装置, 其特征在于, 还包括:
第二负载检测单元, 用于在将切换优先级最高的用户切换到当前小 区的相邻小区前, 预检测相邻小区是否有足够的资源块供所述切换优先 级最高的用户使用;
第三负载检测单元, 用于在当前小区的相邻小区为中继小区时, 预 检测相邻小区在接收所述切换优先级最高的用户后, 相邻小区的母基站 所在的小区是否有足够的资源块供所述切换优先级最高的用户使用; 连接切换禁止单元, 用于在相邻小区或相邻小区的母基站所在的小 区没有足够的资源块的情况下, 禁止对所述切换优先级最高的用户进行 切换。
1 1、 根据权利要求 9 所述的装置, 其特征在于, 所述第一负载检测 单元还用于在将切换优先级最高的用户切换到当前小区的相邻小区后, 检测当前小区的业务负载与各相邻小区的业务负载的平均值的负载之比 是否超过所述门限值, 以使得在未超过所述门限值的情况下, 继续进行 预检测以及用户切换, 直至所述负载之比不超过所述门限值。
1 2、 根据权利要求 9至 1 1 中任一项所述的装置, 其特征在于, 所述 第一优先级排序单元还包括:
第一集合划分模块, 用于根据用户切换小区造成的频谱效率损失率 预期, 将所述当前小区覆盖范围内的用户划分入至少一个第一级集合; 第二集合划分模块, 用于根据用户业务占用当前小区资源块情况, 将每个第一级集合中的用户划分入至少一个第二级集合;
用户排序模块, 用于根据非实时业务优先级高于实时业务优先级的 规则, 对每个第一级集合的第二级集合中的用户进行排序。
1 3、 根据权利要求 1 2所述的装置, 其特征在于, 所述第一集合划分 模块还包括:
频率损失率计算子模块, 用于计算每个用户进行小区切换造成的频谱效率 损失率;
入所述至少一个第一级集合中。
14、 根据权利要求 1 2或 1 3中所述的装置, 其特征在于, 所述用户排 序模块还包括:
业务属性查询子模块, 用于查询当前第二级集合中的用户的业务属 性;
用户排序子模块, 用于将业务属性为非实时业务的用户的优先级置 于实时业务的用户的优先级之上。
1 5、 根据权利要求 1 4所述的装置, 其特征在于, 还包括:
第二优先级排序单元, 用于对于每个第一级集合的第二级集合中的 实时业务的用户, 以预设的切换场景的优先级为依据进行切换优先级排 序; 所述切换场景按优先级由高到低为: 当前母基站和该母基站下属的 中继基站之间的切换、 当前中继基站与当前中继基站同一母基站下属的 另一中继基站之间的切换、 当前母基站和另一母基站之间的切换、 当前 母基站和另一母基站下属的中继基站之间的切换、 当前中继基站和另一 母基站下属的中继基站之间的切换。
PCT/CN2011/077741 2011-07-28 2011-07-28 实现负载均衡的方法和装置 WO2012159349A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201180001352.3A CN103026751B (zh) 2011-07-28 2011-07-28 实现负载均衡的方法和装置
PCT/CN2011/077741 WO2012159349A1 (zh) 2011-07-28 2011-07-28 实现负载均衡的方法和装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/077741 WO2012159349A1 (zh) 2011-07-28 2011-07-28 实现负载均衡的方法和装置

Publications (1)

Publication Number Publication Date
WO2012159349A1 true WO2012159349A1 (zh) 2012-11-29

Family

ID=47216576

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/077741 WO2012159349A1 (zh) 2011-07-28 2011-07-28 实现负载均衡的方法和装置

Country Status (2)

Country Link
CN (1) CN103026751B (zh)
WO (1) WO2012159349A1 (zh)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103037440A (zh) * 2012-12-13 2013-04-10 北京北方烽火科技有限公司 一种移动负载均衡方法及装置
CN105657749A (zh) * 2014-11-20 2016-06-08 中国移动通信集团浙江有限公司 一种lte小区间负载均衡的方法、装置及基站
GB2533002A (en) * 2014-12-01 2016-06-08 Inst Information Ind Central control device and load balancing method thereof
WO2018196834A1 (zh) * 2017-04-28 2018-11-01 中兴通讯股份有限公司 一种天线下倾角调整方法和装置
CN112866394A (zh) * 2021-01-26 2021-05-28 广州虎牙科技有限公司 一种负载均衡方法、装置、系统、计算机设备和存储介质

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107770816A (zh) * 2017-11-15 2018-03-06 烽火通信科技股份有限公司 一种lte负载均衡方法、接纳控制模块及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101594641A (zh) * 2009-07-01 2009-12-02 东南大学 基于服务质量优先级的小区间切换负载均衡方法
CN101711044A (zh) * 2009-11-17 2010-05-19 中兴通讯股份有限公司 一种在相邻小区间实现负载均衡的方法及装置
CN101784078A (zh) * 2010-01-08 2010-07-21 东南大学 移动通信系统中的负载均衡和吞吐量优化方法
CN101951664A (zh) * 2010-09-14 2011-01-19 天津理工大学 一种负载不平衡的无线网络中用户接入与切换的方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101594641A (zh) * 2009-07-01 2009-12-02 东南大学 基于服务质量优先级的小区间切换负载均衡方法
CN101711044A (zh) * 2009-11-17 2010-05-19 中兴通讯股份有限公司 一种在相邻小区间实现负载均衡的方法及装置
CN101784078A (zh) * 2010-01-08 2010-07-21 东南大学 移动通信系统中的负载均衡和吞吐量优化方法
CN101951664A (zh) * 2010-09-14 2011-01-19 天津理工大学 一种负载不平衡的无线网络中用户接入与切换的方法

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103037440A (zh) * 2012-12-13 2013-04-10 北京北方烽火科技有限公司 一种移动负载均衡方法及装置
CN105657749A (zh) * 2014-11-20 2016-06-08 中国移动通信集团浙江有限公司 一种lte小区间负载均衡的方法、装置及基站
CN105657749B (zh) * 2014-11-20 2019-07-05 中国移动通信集团浙江有限公司 一种lte小区间负载均衡的方法、装置及基站
GB2533002A (en) * 2014-12-01 2016-06-08 Inst Information Ind Central control device and load balancing method thereof
GB2533002B (en) * 2014-12-01 2017-10-11 Inst Information Ind Central control device and load balancing method thereof
WO2018196834A1 (zh) * 2017-04-28 2018-11-01 中兴通讯股份有限公司 一种天线下倾角调整方法和装置
CN108810921A (zh) * 2017-04-28 2018-11-13 中兴通讯股份有限公司 一种天线下倾角调整方法和装置
CN112866394A (zh) * 2021-01-26 2021-05-28 广州虎牙科技有限公司 一种负载均衡方法、装置、系统、计算机设备和存储介质
CN112866394B (zh) * 2021-01-26 2022-09-13 广州虎牙科技有限公司 一种负载均衡方法、装置、系统、计算机设备和存储介质

Also Published As

Publication number Publication date
CN103026751B (zh) 2017-04-26
CN103026751A (zh) 2013-04-03

Similar Documents

Publication Publication Date Title
US11917481B2 (en) Load balancing method and apparatus
US8498653B2 (en) Load sharing method, device, and system
EP2800414B1 (en) Load balancing method and related device
CN105979542B (zh) 一种5G异构网络中基于SDN的WiFi分流系统及方法
US8676186B2 (en) Cell load balancing method, cell load measuring method, and devices thereof
US9930545B2 (en) Real-time load balancing for a network
KR101542042B1 (ko) 셀룰러 원격통신 시스템 네트워크 요소, 대응하는 방법 및 컴퓨터-판독 가능한 저장 매체
WO2013155941A1 (zh) 动态频谱共享方法和装置
CN103987085B (zh) 小区间移动负荷均衡的方法和移动负荷均衡装置
WO2012159349A1 (zh) 实现负载均衡的方法和装置
US10674402B2 (en) Load balancing system with an access controller in the field of communication technology
WO2016090770A1 (zh) 一种频点测量消息的发送方法及装置
CN102625389A (zh) 一种移动通信网络的接入方法、装置和系统
WO2016197557A1 (zh) 一种多无线接入技术中用户设备的接入方法和用户设备
CN103313324A (zh) LTE系统的目标小区选择方法和eNB
CN108055677B (zh) 基于软件定义无线网络的负载均衡方法
JP2017525282A (ja) バックホールリンク上の輻輳制御のための通信システム、制御ノード、基地局及び方法
CN104703241A (zh) 一种小区切换方法及装置
US9693295B2 (en) Terminal selection method and system based on self-organizing network, and network entity
KR20140045887A (ko) 무선 통신시스템의 셀 부하 분산 방법 및 장치
WO2012075803A1 (zh) 一种切换目标小区的选择方法及系统
CN103874131A (zh) 一种基于服务质量的小区内负载均衡方法、装置及系统
CN113271629A (zh) 一种网络负载均衡方法、接入网设备及网络系统
CN109257773B (zh) 一种负载均衡的方法和装置
CN112770339B (zh) 一种协作小区确定方法及装置

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201180001352.3

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11866169

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11866169

Country of ref document: EP

Kind code of ref document: A1