WO2014101674A1 - 负载均衡的方法和网络控制节点 - Google Patents

负载均衡的方法和网络控制节点 Download PDF

Info

Publication number
WO2014101674A1
WO2014101674A1 PCT/CN2013/089367 CN2013089367W WO2014101674A1 WO 2014101674 A1 WO2014101674 A1 WO 2014101674A1 CN 2013089367 W CN2013089367 W CN 2013089367W WO 2014101674 A1 WO2014101674 A1 WO 2014101674A1
Authority
WO
WIPO (PCT)
Prior art keywords
cell
edge
entity
scheduling
load
Prior art date
Application number
PCT/CN2013/089367
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 CN201380001730.7A priority Critical patent/CN103828422A/zh
Priority to KR1020157020791A priority patent/KR101660351B1/ko
Priority to EP13868286.9A priority patent/EP2941044A4/en
Publication of WO2014101674A1 publication Critical patent/WO2014101674A1/zh
Priority to US14/788,202 priority patent/US20150304889A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/082—Load balancing or load distribution among bearers or channels
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • 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/52—Allocation or scheduling criteria for wireless resources based on load
    • 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
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/16—Performing reselection for specific purposes
    • H04W36/22—Performing reselection for specific purposes for handling the traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/02—Access restriction performed under specific conditions
    • H04W48/06—Access restriction performed under specific conditions based on traffic conditions

Definitions

  • Embodiments of the present invention relate to the field of wireless communications, and more particularly, to a method of load balancing and a network control node. Background technique
  • the load level of a cell is determined by factors such as user distribution, mobility, and user service type. That is, the distribution of user equipment (UE) in the cell has Randomness, usually non-uniform and time-varying, so the load in the entire network is likely to be unbalanced, resulting in a significant drop in user experience in an overloaded cell.
  • UE user equipment
  • Load Balancing is to determine the load level of the cell and perform inter-cell load information interaction to transfer the load from a busy cell to a cell with more remaining resources. This coordinates the load distribution between cells. Maximize the utilization of network resources and reduce the system congestion rate, thus improving the user's business experience.
  • the base station periodically measures the utilization of the air interface resources of the cell service, that is, the physical resource block (PRB) utilization rate, and estimates the cell load according to the measurement situation. After the utilization of the air interface resource of the cell is higher than the threshold, the cell initiates a load interaction request to the neighboring area that meets the condition, and performs load information interaction with the neighboring area. Then, the base station will comprehensively judge according to the load difference and handover performance between the serving cell and the target neighboring cell, and select the optimal target cell. After the target cell is determined, the serving cell will select a part of the UE for load transfer, and the load transfer means includes handover and cell reselection.
  • the load transfer means includes handover and cell reselection.
  • the embodiment of the invention provides a load balancing method and a network control node, which can improve the efficiency of load balancing.
  • a method for load balancing including: The first entity in which the cell is located selects a scheduling cell for the edge UE from the neighboring cell of the serving cell, where the entity in which the scheduling cell is located is a second entity; The scheduling cell allocates a data channel resource to the edge UE; the first entity receives an allocation result of the data channel resource sent by the second entity, and according to an allocation result of the data channel resource, in the service The cell allocates control channel resources to the edge UE; the first entity sends data of the edge UE to the second entity, to send data of the edge UE to the node by using the allocated data channel resource Said edge UE.
  • the selecting, by the first entity, the scheduling cell for the edge UE includes: acquiring a utility value that is configured by the edge UE in all neighboring cells; The utility value of the scheduling in all neighboring cells selects the cell with the best utility value from all the neighboring cells as the scheduling cell.
  • the acquiring the utility value of the edge UE in all neighboring areas includes: acquiring the edge UE to be scheduled in the first neighboring area
  • the utility value of the first neighboring cell is any one of the neighboring cells
  • the acquiring the utility value of the edge UE in the first neighboring cell includes: The entity in which the first neighboring cell is located sends the state information of the edge UE in the serving cell; the entity that receives the first neighboring cell determines the edge UE according to the state information of the edge UE in the first The utility value of scheduling in a neighboring cell.
  • the method before the first entity selects a scheduling cell for the edge UE, the method further The method includes: determining the edge UE to be scheduled, including: sorting all cells that meet the condition according to a load indicator; and determining that the edge UE in the cell with the heaviest load is the edge UE to be scheduled.
  • the condition that is satisfied is that the capacity and the delay of the communication link between the cells enable the UE data between the cells to be shared and maintained. Synchronize.
  • the load indicator includes a cell highest scheduling priority; or a number of UEs to be scheduled with a data volume.
  • the method before the first entity selects a scheduling cell for the edge UE, the method further The method includes: detecting a control channel load of a serving cell of the edge UE; when the control channel is negative When the load is below the threshold, the scheduling cell is selected for the edge UE.
  • control channel is a physical downlink control channel PDCCH
  • data channel is a physical downlink shared channel. PDSCH.
  • a method for load balancing including: a second entity where a scheduling cell of an edge user equipment UE is located receives a notification message sent by a first entity, where the first entity is a serving cell of the edge UE Entity, and the notification message is that the first entity selects the scheduling cell from the neighboring cell of the serving cell for the edge UE, and sends the message to the second entity, and is used to notify the second entity.
  • the entity allocates a data channel resource to the edge UE; the second entity allocates a data channel resource to the edge UE in the scheduling cell according to the notification message; and the second entity allocates the data channel resource
  • the result is sent to the first entity, so that the first entity allocates control channel resources to the edge UE in the serving cell according to the result of the data channel resource allocation, and sends the edge UE data to the a second entity; the second entity receives data of the edge UE, and sends the data of the edge UE by using the allocated data channel resource Edge to the UE.
  • the method before the second entity receives the notification message that is sent by the first entity, the method further includes: receiving the edge UE sent by the first entity State information of the serving cell; determining, according to status information of the edge UE in the serving cell, a utility value that is scheduled by the edge UE in the scheduling cell; sending the utility value to the first An entity, such that the first entity selects the scheduling cell according to the utility value.
  • control channel is a physical downlink control channel PDCCH
  • data channel is a physical downlink shared channel PDSCH.
  • a third aspect provides a device for load balancing, where the serving cell of the edge user equipment UE is located, the device includes: a selecting unit, selecting, for the edge UE, from a neighboring cell of the serving cell Scheduling a cell, where the entity in which the scheduling cell is located is a second entity, and an interface unit, configured to notify the second entity to allocate a data channel resource to the edge UE in the scheduling cell, and send the second entity to send And an allocation unit, configured to allocate a control channel resource to the edge UE in the serving cell according to the allocation result of the data channel resource; the interface unit is further used to Data transmission of edge UE And sending, by the second entity, data of the edge UE to the edge UE by using the allocated data channel resource.
  • the interface unit is further configured to acquire a utility value that is configured by the edge UE in all neighboring cells; the selecting unit is specifically configured to use, according to the edge UE, For the utility value of the neighboring cell scheduling, the cell with the best utility value is selected from all neighboring cells as the scheduling cell.
  • the status information of the edge of the service cell is determined by the edge.
  • the apparatus further includes: a sorting unit, configured to sort all cells that meet the condition according to a load indicator And a determining unit, configured to determine that the edge UE in the cell with the heaviest load is the edge UE to be scheduled.
  • the met condition is that the capacity and the delay of the communication link between the cells enable the UE data between the cells to be shared and maintained. Synchronize.
  • the load indicator includes a cell maximum scheduling priority; or the number of UEs to be scheduled with a data volume.
  • the apparatus further includes: a detecting unit, configured to detect a control channel of the serving cell of the edge UE
  • the selecting unit is configured to select the scheduling cell for the edge UE when the control channel load is lower than a threshold.
  • control channel is a physical downlink control channel PDCCH
  • data channel is a physical downlink shared channel PDSCH.
  • a device for load balancing where a second entity that is located in a cell of an edge user equipment UE, the device includes: an interface unit, configured to receive a notification message sent by the first entity, where the first An entity is an entity where the serving cell of the edge UE is located, and the notification message is that the first entity sends the scheduling cell to the edge UE from the neighboring cell of the serving cell, and then sends the message to the second An entity, configured to notify the second entity to allocate a data channel resource to the edge UE, and an allocating unit, configured to: in the scheduling cell, according to the notification message
  • the edge UE allocates a data channel resource; the interface unit is further configured to send the result of the data channel resource allocation to the first entity, so that the first entity obtains a result according to the data channel resource allocation
  • the serving cell allocates a control channel resource to the edge UE, and sends the data of the edge UE to the second entity, and is further configured to receive data of the edge UE, and a sending
  • the interface unit is further configured to receive status information of the edge UE that is sent by the first entity in the serving cell, and the device further includes: a determining unit, configured to determine, according to status information of the edge UE in the serving cell, the edge UE is scheduled to be used in the scheduling cell; The scheduling cell is selected according to the utility value.
  • control channel is a physical downlink control channel PDCCH
  • data channel is a physical downlink shared channel PDSCH.
  • a load balancing system including the first load balancing device of any one of the third aspect or the third aspect, and the second load of the fourth aspect or any implementation of the fourth aspect Balanced device.
  • the entity where the serving cell is located selects a scheduling cell for the edge UE, and notifies the scheduling cell to allocate a data channel for the edge UE, and the control channel remains in the serving cell without performing handover, and thus, may be in the UE.
  • the above load balancing method uses the data channel as the transfer granularity, and does not need to introduce a switching delay, thereby realizing the function of quickly balancing the instantaneous load, thereby improving the load balancing efficiency.
  • FIG. 1 is a flow chart of a method of load balancing according to an embodiment of the present invention.
  • FIG. 2 is a flow chart of a method of load balancing in accordance with an embodiment of the present invention.
  • 3 is a flow chart of a method of rapid collaboration in accordance with one embodiment of the present invention.
  • FIG. 4 is a flow chart of a method of slow collaboration in accordance with one embodiment of the present invention.
  • Figure 5 is a schematic block diagram of a network control node in accordance with one embodiment of the present invention.
  • FIG. 6 is a schematic block diagram of a network control node according to another embodiment of the present invention.
  • FIG. 7 is a signaling flow diagram of a method for load balancing according to another embodiment of the present invention.
  • FIG. 8 is a schematic flowchart diagram of a method for load balancing according to another embodiment of the present invention.
  • FIG. 9 is a schematic structural diagram of a load balancing apparatus according to another embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a load balancing apparatus according to still another embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of a load balancing apparatus according to still another embodiment of the present invention.
  • FIG. 12 is a schematic structural diagram of a load balancing apparatus according to still another embodiment of the present invention.
  • FIG. 13 is a schematic structural diagram of a load balancing apparatus according to still another embodiment of the present invention.
  • FIG. 14 is a schematic structural diagram of a load balancing apparatus according to still another embodiment of the present invention.
  • FIG. 15 is a schematic structural diagram of a load balancing apparatus according to still another embodiment of the present invention.
  • FIG. 16 is a schematic flowchart diagram of a load balancing method according to still another embodiment of the present invention.
  • FIG. 17 is a schematic flowchart diagram of a method for load balancing according to still another embodiment of the present invention.
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • UMTS Universal Mobile Telecommunication System
  • a user equipment may be called a terminal, a mobile station (MS), a mobile terminal (Mobile). Terminal, etc., the user equipment can communicate with one or more core networks via a Radio Access Network (RAN), for example, the user equipment can be a mobile phone (or "cellular" phone), with mobile
  • RAN Radio Access Network
  • the user equipment can be a mobile phone (or "cellular" phone), with mobile
  • the computer of the terminal, etc., for example, the user device can also be a portable, pocket, handheld, computer built-in or in-vehicle mobile device that exchanges voice and/or data with the wireless access network.
  • the base station may be a Base Transceiver Station (BTS) in GSM or CDMA, or may be a base station (NodeB, NB) in WCDMA, or may be an evolved base station in LTE (Evolutional Node B) , eNB or e-NodeB), the invention is not limited.
  • BTS Base Transceiver Station
  • NodeB NodeB
  • NB base station
  • LTE Long Term Evolutional Node B
  • eNB evolved Node B
  • e-NodeB evolved base station in LTE
  • the network control node may be a base station, or may be a centralized controller on the upper layer of the base station.
  • the nodes represented by the network control node are different, specifically in the following embodiments. Description.
  • FIG. 1 is a flow chart of a method of load balancing according to an embodiment of the present invention.
  • the method of Figure 1 is performed by a network control node, which may be a base station or a centralized controller.
  • the load balancing related parameters include one or a combination of the following information: a cell handover related parameter, and a cell reselection related parameter.
  • the embodiment of the present invention collects and comprehensively considers load-related information of all cells controlled by the network control node, and performs load balancing on the network with load balancing related parameters that enable the total utility function to obtain an optimal value, thereby achieving global optimality. Load balancing.
  • the load balancing method in the embodiment of the present invention is directed to a co-frequency cell, and the inter-frequency cell needs to load balance the network by determining an aggregated user set that enables the total utility function to obtain an optimal value, where the overlay user set is used for Identify the users who need to perform cell handover.
  • each cell controlled by the network control node periodically reports the following information to the network control node: a fast coordinated neighboring cell of the cell, and a PRB utilization of the cell Rate, historical scheduling priority of the cell, scheduling rate of each user in the cell, resource block allocation, buffer data amount, waiting delay, QoS Class Identifier (QCI) type, modulation and coding strategy (Modulation and Coding Scheme, MCS), Reference Signal Received Power (RSRP).
  • QCI QoS Class Identifier
  • MCS Modulation and Coding Scheme
  • RSRP Reference Signal Received Power
  • the scheduling data volume of the local cell and the channel quality indicator (CQI), the channel state information (CSI), and the reference signal receiving quality (Reference Signal Received Quality, RSRQ) reported by the user may also be reported.
  • the centralized controller determines, according to the collected load related information, a cell whose load exceeds a threshold, and then determines a first according to the fast coordinated neighboring cell of the local cell in the load related information to exclude the fast coordinated cell.
  • Class-like cells that is, slow cooperative cells.
  • the power configuration and overlay configuration for each cell that enables the total utility function to obtain an optimal value can then be determined by traversing.
  • the power configuration may be a transmit power spectrum of each cell on different time-frequency resources, and the coverage configuration may be an adjustment parameter of a trigger condition for performing cell handover and cell reselection.
  • the network control node adjusts the load balancing related parameter in step 102, including: determining a total utility function controlled by the network control node according to the load related information; determining that the total utility function can obtain the maximum value or the minimum value.
  • the total utility function may include: a weighted sum of scheduling rates of all users in the first type of cell; or a sum of scheduling priorities of all cells in the first type of cell.
  • the scheduling rate of the user is the historical scheduling rate of the user for a period of time, and the weighted sum of the scheduling rates of all users can reflect the overall load level of the network composed of the slow coordinated cells.
  • the user priority scheduled on a time-frequency resource of the cell may be used as the priority on the time-frequency resource, and the scheduling priority of the cell is the average of the priorities on all time-frequency resources in a period of time, which may be used for Indicates the degree of load of the cell. After summation, the overall load level of the network can be similarly indicated.
  • determining a load balancing related parameter that enables the total utility function to obtain a maximum value or a minimum value may include: determining a load balancing related parameter that can obtain a maximum value of a weighted sum of scheduling rates of all users in the first type of cell; Or determining a load balancing related parameter that enables a sum of scheduling priorities of all cells in the first type of cell to obtain a minimum value.
  • the load balancing related parameter may include: a cell handover parameter, a trigger condition for determining a cell handover; a cell reselection parameter; a trigger condition for determining a cell reselection; a transmit power spectrum, configured to configure a cell in each The transmit power value on the time-frequency resource.
  • all cells controlled by the network control node may include: a first type of cell and a second type of cell, where the first type of cell is used to indicate a cell scheduled by the baseband processing unit BBU, and the second type of cell is used.
  • the fast cooperating cell in the process is a common BBU, and the slow cooperating cells performing the slow cooperating process are not BBUs together, or it can be understood that the cells that cannot cooperate quickly perform slow cooperation.
  • the network control node determines a load indicator of a second type of cell in all cells controlled by the network control node; and, according to the load indicator, sequentially determines a target scheduling cell of the edge user of the second type of cell according to the load indicator. ; scheduling the edge users in the target scheduling cell.
  • the steps in this embodiment are the steps of a fast collaborative process where the network control node can stand.
  • the foregoing load indicator may include: a highest scheduling priority of the second type of cell; or a number of users to be scheduled with a data amount in the second type of cell.
  • determining, according to the load indicator, the target scheduling cell of the edge user of the second type of cell in descending order including: determining an edge user of the second type of cell; and adjoining the second type of cell
  • the second type of cell sends the scheduling related information of the edge user; according to the scheduling related information, the cell that can obtain the maximum value of the utility function is the target scheduling cell of the edge user, and the target scheduling cell may be the second type of cell or the adjacent second type of cell.
  • the utility function may include: a sum of cell scheduling priorities of the second type of cell and the adjacent second type of cell.
  • the cell scheduling priority is the average of the priorities on all time-frequency resources at the current time.
  • the foregoing scheduling related information may include: a channel state of the user, a scheduling rate of the user, a waiting delay of the user, and a QoS (Quality of Service) weight of the user.
  • the channel state of the user can be represented by CQI, CSI, and the like.
  • the scheduling rate is the user's historical average scheduling rate.
  • the QoS weighting is determined jointly by the user level and the user connection type level.
  • scheduling the edge user in the target scheduling cell may include: sending, to the second type of cell, resource allocation of the edge user in the target scheduling cell; and sending, according to the resource allocation, the edge user to the target scheduling cell. Data to be scheduled.
  • FIG. 2 is a flow chart of a method of load balancing according to an embodiment of the present invention.
  • the method of Figure 2 is performed by a network control node, which may be a base station or a centralized controller.
  • the load indicator of the fast coordinated cell may include the highest scheduling priority of the fast coordinated cell or the number of users to be scheduled with a data volume.
  • the scheduling priority of the user with the highest scheduling priority in the fast coordinated cell can be used as the highest scheduling priority of the fast coordinated cell, and is used to reflect the load level of the cell.
  • the utility function may include a sum of cell scheduling priorities of the second type of cell and the neighboring second type of cell.
  • the scheduling related information may include the channel state of the user, the scheduling rate of the user, the waiting delay of the user, and the QoS weighting of the user.
  • the channel state of the user can be represented by CQI and CSI.
  • the network control node collects and comprehensively considers load-related information of all cells controlled by the network, and performs load balancing on the network with load balancing related parameters that enable the total utility function or the utility function to obtain an optimal value, thereby achieving global Optimal load balancing.
  • all cells controlled by the network control node may include: a first type of cell and a second type of cell, where the first type of cell is used to indicate a cell scheduled by the baseband processing unit BBU, and the second type of cell is used.
  • receiving load related information reported by each of the cells controlled by the network control node determining load balancing related parameters of the first type of cells and the first type of cells according to the load related information; The first type of cell sends load balancing related parameters.
  • determining the load balancing related parameters of the first type of cells and the first type of cells according to the load related information may include: determining a total utility function of the first type of cells according to the load related information; determining that the total utility function may obtain a maximum value or Minimum load balancing related parameters.
  • the total utility function may include: a weighted sum of scheduling rates of all users in the first type of cell; or a sum of scheduling priorities of all cells in the first type of cell.
  • determining load balancing related parameters that enable the total utility function to obtain a maximum value or a minimum value including: determining a load balancing related parameter that can maximize a weighted sum of scheduling rates of all users in the first type of cell; or Determining the scheduling of all cells in the first type of cell The sum of the priorities takes the minimum load balancing related parameters.
  • the load balancing related parameter may include: a cell handover parameter, a trigger condition for determining a cell handover; a cell reselection parameter; a trigger condition for determining a cell reselection; a transmit power spectrum, configured to configure a cell at each time frequency The transmit power value on the resource.
  • the load related information may include: a second type of cell in a neighboring cell of the cell; a PRB utilization rate of the cell; a historical scheduling priority of the cell; a scheduling rate of each user in the cell, an allocated RB, and a buffer data. Quantities, latency, QCI type, modulation, and coding are configured for MCS, RSRP.
  • the load related information may further include: a scheduling data amount of the cell; CSI, RSRQ, and RSSI of each user in the cell.
  • FIG. 3 is a flow chart of a method of rapid collaboration in accordance with one embodiment of the present invention.
  • the method of Figure 3 can be performed by a base station.
  • the specific application scenario may be all cells in a baseband unit (BBU), or all cells in the same base station.
  • BBU baseband unit
  • the BBU centralized scenario is generally applied to the indoor coverage of a large-scale venue, or a dense urban scene.
  • the feature is that the base station is divided into a near-end BBU and a remote radio remote radio unit (RRU).
  • the BBU can Installed in a suitable equipment room, the RRU can be installed at the antenna end.
  • a BBU can be connected to multiple RRUs, and the two are connected by fiber, which meets the requirements of high-capacity and low-latency communication links.
  • the communication between multiple cells controlled by the base station is performed inside the base station, and also meets the fast cooperation condition. It should be understood that the application scenarios of the embodiments of the present invention are not limited thereto, and all the scenarios that meet the above-mentioned fast cooperation conditions fall within the protection scope of the present invention.
  • the base station periodically detects whether there is an edge user between the cells according to the measurement report reported by the user in the cell.
  • the measurement 4 can be one or more of RSRP, RSRQ, and RSSI. For example, if the difference between the RSRP of the serving cell reported by a user and the RSRP of the neighboring cell is lower than a threshold, the user is determined to be an edge user.
  • the threshold used to determine the edge user can be predefined by the system.
  • the downlink control channel PDCCH load of the serving cell of the edge user is lower than a threshold.
  • the base station will detect the serving cells of the edge users.
  • PDCCH load ie CCE utilization. If the CCE utilization of the serving cell is lower than the threshold, a fast cooperation process between the serving cell and the neighboring cell is triggered.
  • the threshold for determining the CCE utilization may be predefined by the system.
  • the PDCCH is used for the bearer of the downlink control signaling.
  • the cell can ensure that the PDSCH scheduling result of the neighboring cell is correctly indicated, that is, the fast cooperative process can be performed.
  • the load indicator is used to indicate the load level of the cell, and specifically, may be the highest scheduling priority of the cell or the number of users to be scheduled with a data volume in the buffer area of the cell.
  • the highest scheduling priority among all the user scheduling priorities in the cell can be used as the highest scheduling priority of the cell.
  • the higher the load degree of the cell the higher the highest scheduling priority of the user in the cell.
  • the user's scheduling priority can be determined by dividing the instantaneous rate by the historical scheduling rate to represent the instantaneous load demand of the user. It should be understood that the scheduling priority of the user may also use the waiting delay, QCI, etc. as the weighting value, which is not limited by the present invention.
  • the serving cell and the neighboring cell determine a target scheduling cell of the edge user.
  • the target scheduling cell of the edge user in the cell at the current time is determined in turn.
  • the serving base station transmits information such as channel status and scheduling rate to all neighboring areas that meet the fast cooperation conditions.
  • the channel state information may include CQI, CSI, etc.
  • the scheduling rate may be a historical scheduling rate of the user in the serving cell.
  • the neighboring cell receiving the scheduling related information needs to estimate the instantaneous rate at which the edge user performs scheduling in the own cell. Specifically, the estimation may be performed according to the RSRP and the RSRQ reported by the edge user, or may be combined with the CQI and RSRP of the serving cell, or the CSI of the neighboring cell may be directly reported by the user to determine the instantaneous rate of the edge user in the neighboring cell.
  • the serving cell and the neighboring cell determine which neighboring cell service the user's data channel is served based on the utility function.
  • the utility function may be the sum of the current scheduling priorities of each cell, and the neighboring cell that obtains the maximum value by the utility function may be selected as the target scheduling cell.
  • the expression of the utility function can be:
  • the scheduling priority of the cell i is the highest priority user at the current time of the cell.
  • the priority is used as the priority of the cell to indicate the instantaneous load level of the cell.
  • the input variables X, y, z, etc. of the user priority calculation are defined as: user data packet waiting delay; instantaneous spectral efficiency calculated by the user under current channel conditions; average spectral efficiency of the user over a period of time; user historical scheduling rate; QoS weighting, etc.
  • the cell scheduling priority instantaneous value indicates the cell load instantaneous degree
  • the average value of the cell scheduling priority over a period of time indicates the average load degree of the cell for a period of time.
  • Fast collaboration reduces the long-term average network load by maximizing the instantaneous total utility value by coordinating network resources in real time. Therefore, in the fast collaboration process, the goal is to maximize the instantaneous total utility function value; in the slow collaboration process, the goal is to minimize the average total utility function value.
  • the most suitable transmit power of the serving cell and the neighboring cell can also be coordinated according to the selected utility function. For example, when the user is scheduled in the neighboring cell, the transmit power of the serving cell is reduced to reduce interference to the user.
  • the PMI of the serving cell and the neighboring cell can also be coordinated according to the selected utility function, and the interference between the two cells can be reduced by spatial beam direction coordination.
  • a transmission time interval may be used.
  • the target scheduling cell After determining the target scheduling cell of the edge user, the target scheduling cell allocates time-frequency resources to the edge users, and notifies the edge user of the serving cell time-frequency resource allocation result.
  • the serving cell will allocate the PDCCH resource to the edge user, and send the data to be scheduled of the edge user to the target scheduling cell.
  • the target scheduling cell PDSCH sends data to the edge user
  • the serving cell PDCCH sends a scheduling indication to the edge user. It should be understood that multiple edge users in a serving cell may be served by the associated target scheduling cell at the same time.
  • the transmission mode is a single-antenna port or a UE-based reference signal.
  • Layer transfer mode the user's initial transmission and retransmission select the same cell (target scheduling cell) to send, or retransmission is sent in the serving cell.
  • the embodiment of the present invention uses a utility function of resource utilization.
  • factors such as the use of air interface resources, the QoS requirements of user services, and the channel conditions of users are comprehensively considered, and the target scheduling cell is dynamically determined for the fast coordinated cell. There is no need to complete the load transfer by means of cell switching, thereby reducing the granularity and delay of load balancing, achieving a fast balance of instantaneous load and improving the user experience.
  • FIG. 4 is a flow chart of a method of slow collaboration in accordance with one embodiment of the present invention.
  • the method of Figure 4 can be performed by a network control node.
  • the network control node may perform a slow cooperation process on such cells, where the network control node may include a centralized controller or a base station.
  • the network control node periodically collects load related information of the cell.
  • the load-related information includes: the fast coordinated neighboring cell of the cell, and the PRB utilization rate of the cell.
  • the load related information may further include: a quantity of scheduling data of the current cell, and information such as CQI, CSI, RSRQ, and RSSI reported by the user.
  • this step is performed by the base station, and the control base station of the cell periodically collects load related information of all neighboring areas.
  • the network control node calculates a total utility function of the current network when the network has a load exceeding a threshold according to the load related information, where the total utility function may be a weighted sum of scheduling rates of all users in the network, or an average scheduling of all cells. The sum of the priorities.
  • the total utility function can be defined as:
  • the historical scheduling rate of user i is ⁇ (representing the weighting mode of the pair, optionally log( ⁇ ), and so on. This formula represents the weighted summation of the scheduling rate of all users in the network, and is used to measure the overall load of the network. Degree.
  • the total utility function can also be defined as: ⁇ ⁇ , ⁇ , ⁇ , etc.
  • the scheduling priority of the cell i is on the cell time-frequency resource (for example, the resource block group).
  • the scheduled user priority is used as the priority on the time-frequency resource, and the average value of the priority on all time-frequency resources in a period of time. It is the average scheduling priority of the cell, which is used to indicate the average load level of the cell.
  • the average mode can be arithmetic averaging, or alpha filtering.
  • the input variables X, y, z, etc. of the user priority calculation are defined as: User data packet waiting delay; User when Instantaneous spectral efficiency calculated under pre-channel conditions; average spectral efficiency of the user over a period of time; user historical scheduling rate; user's QoS weighting, etc.
  • the cell whose load exceeds the threshold is selected according to the load related information reported by each cell in step 401. And determining, according to the "fast cooperative neighboring cell of the own cell" in the load related information, the cell whose load exceeds the threshold and has not performed rapid cooperation.
  • the change of the cell coverage and the post-speech network total utility function is modified, and the configuration that makes the total utility function obtain the optimal value is selected, wherein the optimal value is obtained. It means that the weighted sum of the scheduling rates of all users in the network is maximized, or the sum of the average scheduling priorities of all the cells is the lowest.
  • the coverage of the intra-frequency cell can be adjusted by the conditions of cell handover and cell reselection.
  • the conditions for cell handover are:
  • the adjustment parameter is Ocn
  • Ocn is a specific cell offset of the neighboring cell, and acts on the connected state.
  • Mn is the measurement result of the neighboring cell
  • Of is the specific frequency offset of the neighboring cell frequency
  • Hys is the hysteresis parameter
  • Ms is the measurement result of the monthly good service cell
  • ss is the specific frequency offset of the frequency of the good service cell
  • Ocs Is the specific cell offset of the serving cell
  • Off is the offset parameter.
  • Mn and Ms are in dBm in PSPR and dB in PSPQ. Ofh, Ocn, Ofs, Ocs, Hys, Off are all in dB.
  • the adjustment parameter is Qoffset, Qoffset is the temporary offset value, and the UE acting in the idle state, Qmeans, n is the RSRP measurement value for the cell reselection in the temporary area, and Qmeans, s is the serving cell for the cell weight.
  • the selected RSRP measurement, Qhyst is used to indicate the hysteresis value, where Qmeans, n and Qmeans, s are in dBm, Qoffset and Qhyst are in dB.
  • the centralized controller determines the adjustment parameters of the handover and the cell reselection, it can also determine the periodic transmission power spectrum of each cell at the same time, specifically, determine the transmit power value of each cell and each PRB in a specific period.
  • the inter-frequency cell is determined by the centralized controller to determine the set of users to be handed over and the target inter-frequency cell.
  • the centralized controller adjusts the switching and small
  • the adjustment parameters of the region reselection and the transmission power spectrum of the cell are used to estimate the change of the adjusted total utility function, and the total utility function is maximized by the traversal method or a certain search algorithm (weighted sum of the scheduling rates of all users in the network) Or load balancing related parameters of the minimum value (the sum of the average scheduling priorities of all cells).
  • the control base station of the reloaded cell configures Ocn and Offset of all light-weight co-frequency neighboring cells according to the principle that the total utility function of the cell and all neighboring cells obtains the maximum value, and may also determine the present
  • the periodic transmit power spectrum of the cell and all the light-weight co-frequency neighboring cells can also determine the user set and the target inter-frequency cell in which the cell initiates the inter-frequency handover.
  • the network control node sends the load balancing related parameters to the respective slow coordinated cells, and the slow coordinated cell adjusts the adjustment parameters of the cell handover and the cell reselection according to the load configuration, so that the trigger conditions of the cell handover and the cell reselection can be adjusted. That is to say, the coverage configuration of the cell is adjusted.
  • the embodiment uses a total utility function of resource utilization as an indicator of load evaluation, and comprehensively considers factors such as air port resource usage, user service QoS requirements, and user channel conditions, and the like.
  • the load balancing related parameters that enable the total utility function to obtain an optimal value are determined for the slow coordinated cell, thereby enabling global optimal load balancing.
  • FIG. 7 is a schematic block diagram of a network control node in accordance with one embodiment of the present invention.
  • the network control node 500 may include a determining unit 501, an adjusting unit 502, and a configuration unit 503.
  • the determining unit 501 determines a first cell that needs to perform load balancing and a second cell that participates in load balancing, and the first cell is adjacent to the second cell.
  • the adjusting unit 502 adjusts load balancing related parameters, where the load balancing related parameters include one or a combination of the following information: a cell handover related parameter, and a cell reselection related parameter.
  • the configuration unit 503 configures the first cell or the second cell according to the adjusted load balancing related parameters.
  • the network control node collects and comprehensively considers load-related information of all cells controlled by the network, and performs load balancing on the network with load balancing related parameters that enable the total utility function or the utility function to obtain an optimal value, thereby achieving global Optimal load balancing.
  • the network control node 500 can perform the various steps of the method embodiment of FIG. 1 to FIG. 4, and details are not described herein to avoid repetition.
  • the determining unit 501 is specifically configured to: determine a total utility function controlled by the network control node according to the load related information; and determine a load balancing related parameter that can obtain a maximum or minimum value of the total utility function.
  • the total utility function includes: There is a weighted sum of the scheduling rates of the users; or the sum of the scheduling priorities of all cells controlled by the network control node.
  • the determining unit 501 is specifically configured to: determine a load balancing related parameter that can obtain a weighted sum of scheduling rates of all users in the first type of cell, or determine that the first type of cell can be caused
  • the sum of the scheduling priorities of all the cells in the middle takes the load balancing related parameter of the minimum value.
  • the load balancing related parameters include: a cell handover parameter, a trigger condition for determining a cell handover, a cell reselection parameter, a trigger condition for determining a cell reselection, and a transmit power spectrum, configured to configure a cell on each time-frequency resource. Transmit power value.
  • the load related information includes: a second type of cell in a neighboring cell of the cell; a PRB utilization rate of the cell; a historical scheduling priority of the cell; a scheduling rate of each user in the cell, an allocated RB, a buffer data volume, and a waiting time Extension, QCI type, modulation and coding configuration MCS; RSRP.
  • the load related information also includes at least one of the following: a scheduled data volume of the cell; CSI, RSRQ, and RSSI reported by each user in the cell.
  • the embodiment of the present invention considers the use of the air interface resource, the QoS requirement of the user service, and the channel condition of the user by using the total utility function of the resource utilization as an indicator of the load evaluation. Dynamically determining load balancing related parameters that enable the total utility function to obtain an optimal value for the slow coordinated cell, thereby enabling global optimal load balancing.
  • the embodiment of the present invention considers the use of the air interface resource, the QoS requirement of the user service, and the channel condition of the user by using a utility function of the resource utilization as an indicator of the load evaluation.
  • the target scheduling cell is dynamically determined for the fast coordinated cell.
  • the load transfer is not required by the method of cell handover, thereby reducing the granularity and delay of load balancing, realizing a rapid balance of instantaneous load and improving the user experience.
  • the network control node 600 of FIG. 6 includes a processor 601, a memory 602, a transmitter 603, and a receiver 604.
  • Processor 601, memory 602, transmitter 603 and receiver 604 are coupled by bus system 605.
  • the memory 602 is configured to store instructions for causing the processor 601 to: receive the load related information reported by each of the cells controlled by the network control node 600; and determine the first type of cells and the first type of cells according to the load related information. Load balancing related parameters; send load balancing related parameters to the first type of cell.
  • the network control node collects and comprehensively considers the load-related information of all cells controlled by the network, and the negative value that can make the total utility function or the utility function obtain the optimal value.
  • the load balancing related parameters load balance the network to achieve global optimal load balancing.
  • the processor 601 controls the operation of the network control node 600, which may also be referred to as a Central Processing Unit (CPU).
  • Memory 602 can include read only memory and random access memory and provides instructions and data to processor 601.
  • a portion of memory 602 may also include non-volatile random access memory (NVRAM).
  • NVRAM non-volatile random access memory
  • the various components of the network control node 600 are coupled together by a bus system 605, which may include, in addition to the data bus, a power bus, a control bus, and a status signal bus.
  • bus system 605 may include, in addition to the data bus, a power bus, a control bus, and a status signal bus.
  • various buses are labeled as bus system 605 in the figure.
  • Processor 601 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method may be completed by an integrated logic circuit of the hardware in the processor 601 or an instruction in the form of software.
  • the processor 601 described above may be a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware. Component.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA off-the-shelf programmable gate array
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present invention may be implemented or carried out.
  • the general purpose processor may be a microprocessor or the processor or any conventional processor or the like.
  • the steps of the method disclosed in connection with the embodiments of the present invention may be directly implemented by the hardware decoding processor, or by a combination of hardware and software modules in the decoding processor.
  • the software modules can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like.
  • the storage medium is located in the memory 602, and the processor 601 reads the information in the memory 602 and combines the hardware to perform the steps of the above method.
  • the fast cooperation process described in the foregoing embodiments may be applicable to load balancing between multiple cells, where there are high-capacity and low-latency communication links between the cells, so that UE data between the cells may be Share, stay in sync.
  • all cells under the same base station e.g., eNB
  • all cells under the eNB that are interconnected at high speed between the X2 interfaces, or all cells controlled centrally by the BBU.
  • the so-called BBU centralized control means that the BBUs of these cells are deployed centrally, and the BBUs can be connected through a high-speed interconnect bus.
  • the structure in which these BBUs are centrally deployed is regarded as a base station, and the radio frequency structure (for example, RRU) of the base station can be pulled through the optical fiber.
  • the fast cooperative load balancing method will be described in detail below with reference to the accompanying drawings.
  • the method is used for load balancing between multiple cells, and there is a high-capacity and low-latency communication link between the cells,
  • the UE data between these cells can be shared and kept synchronized.
  • all cells under the same base station for example, eNB
  • all cells under the eNB with high speed interconnection between the X2 interfaces or all cells under centralized control by the BBU.
  • the cell can transmit the load condition of the cell, the scheduling information of the UE, and the scheduling data by using the message interaction, so that, in the case of being transparent to the UE, the switch does not need to be automatically coordinated to achieve load balancing. .
  • FIG. 7 is a signaling flow diagram of a load balancing method according to another embodiment of the present invention.
  • the load of the edge UEs is pushed to the cells with lighter loads, thereby achieving load balancing.
  • the serving cell has an edge UE, and the neighboring cell of the serving cell may be more than one.
  • the serving cell and the neighboring cell interact with the state information of the edge UE, so that the neighboring cell can be based on the edge.
  • the state information of the UE is calculated, and the utility value of the edge UE in the current cell is calculated, so that the best neighboring cell is selected as the scheduling cell of the edge UE according to the utility value of each neighboring cell.
  • the scheduling cell is allocated to the edge UE to allocate a data channel, and the control channel is reserved in the serving cell. Therefore, in the case of being transparent to the UE, it is not necessary to automatically perform fast load coordination to achieve load balancing.
  • the method may include the following steps:
  • S701 The entity where the serving cell is located sends the state information of the edge UE in the serving cell to the entity where the neighboring cell of the serving cell is located.
  • S702 The entity where the neighboring cell is located calculates the utility value of the scheduling edge UE in the cell according to the state information of the edge UE in the serving cell.
  • S703 The entity where the neighboring cell is located sends the calculated utility value to the entity where the serving cell is located.
  • the scheduling cell of the edge UE may be determined by considering the load condition of the serving cell.
  • the determined scheduling cell may be the serving cell itself.
  • the determined scheduling cell is a neighboring cell of the serving cell, not the serving cell itself. If the determined scheduling cell is the serving cell itself, the subsequent scheduling of the UE is the same as that of the prior art, and details are not described herein.
  • S705 The entity where the serving cell is located notifies the entity where the scheduling cell is located to allocate data channel resources to the edge UE.
  • S706 The entity where the scheduling cell is located allocates data channel resources to the edge UE.
  • S707 The entity where the scheduling cell is located notifies the entity where the serving cell is located, the data channel resource allocation result.
  • S708 The entity where the serving cell is located allocates control channel resources to the edge UE according to the data channel resource allocation result.
  • S709 The entity where the serving cell is located sends the data to be sent by the edge UE to the entity where the scheduling cell is located.
  • S710 The entity where the scheduling cell is located to the edge by using the data channel resource allocated in the scheduling cell
  • the UE sends data.
  • the entity in which the neighboring cell is located knows the location of the data channel resource allocated by the entity in which the serving cell is located and the transport format used by the serving cell, so that the serving cell schedules the control channel resource accordingly, and sends the edge to-be-scheduled data to the neighboring cell.
  • the status information of the foregoing edge UE in the serving cell may include information such as a channel state, a scheduling rate, and the like, and the channel state may be, for example, a reference signal received power (RSRP) reported by the edge UE, and a reference signal received quality (Reference Signal Received Quality) , RSRQ), Received Signal Strength Indicator (RSI), Channel State Information (CSI), such as one or more of Channel Quality Indicator (CQI).
  • RSRP reference signal received power
  • RSRQ reference signal received quality
  • RSI Received Signal Strength Indicator
  • CSI Channel State Information
  • CQI Channel Quality Indicator
  • MCS Modulation and Coding Scheme
  • QoS weight QoS Class Identifier
  • QCI QoS Class Identifier
  • the instantaneous rate may be estimated according to the RSRP or RSRQ reported by the edge UE in the neighboring cell, or combined with the full bandwidth CQI and RSRP of the serving cell, or directly reported by the edge UE to the CSI of the neighboring cell;
  • the serving cell and the neighboring cell determine which cell is served by the edge UE's data channel according to the selected utility function.
  • the utility function may be the sum of the scheduling priorities of each cell on the time-frequency resource, wherein the scheduling priority of each cell may be the cell priority of the highest priority UE in the cell.
  • the priority may be the highest in the serving cell scheduling, and the neighboring cell may be used to schedule other UEs.
  • the edge UEs are sorted in the neighboring cell, the priority may be the highest in the neighboring cell, and the serving cell may schedule other UEs.
  • the scheduling cell of the edge UE is selected to maximize the sum of the scheduling priorities of the serving cell and the neighboring cell.
  • the Precoding Matrix Indicator (PMI) of the serving cell and the neighboring cell may also be coordinated according to the selected utility function. This is because the spectrum efficiency of the edge UE scheduling varies according to the PMI of the serving cell and the PMI of the neighboring cell, thereby affecting the scheduling priority.
  • the spectrum efficiency of the neighboring scheduling edge UE also changes according to the serving PMI and the interference PMI. Affects the scheduling priority size.
  • the appropriate PMI combination of each cell is selected to maximize the sum of the scheduling priorities of the serving cell and the neighboring cell. Specifically, interference between two cells can be reduced by spatial beam direction coordination.
  • the UE may negotiate a transmission time interval (Transmission Time Interval, ⁇ ).
  • ⁇ Transmission Time Interval
  • the allocated frequency resources of the UE are only from one cell; or may be negotiated once on each RBG of a TTI.
  • the frequency resources allocated by the user at the same time may come from two cells.
  • a UE-specific reference signal (UE-specific reference signal) can be used, and the transmission mode is a single-antenna port or a UE-based reference signal.
  • Layer transfer mode for transmission The retransmission and initial transmission of the UE may select the same cell transmission, for example, all are scheduled to be transmitted by the cell; or may be initially transmitted in the scheduling cell, and the retransmission is transmitted in the serving cell.
  • the UE adjusts the MCS according to the ACK/NACK feedback, it can maintain two sets of CQI adjustment amounts according to different initial scheduling cells.
  • FIG. 8 is a schematic flowchart of a method for load balancing according to another embodiment of the present invention. As shown in the figure, the following steps are included:
  • S801 Determine whether an edge UE exists between cells with fast cooperation conditions
  • step S802 When there is an edge UE between cells with fast cooperation conditions, check the serving cell control channel load of the edge UE. If the control channel load is lower than the threshold, it indicates the control of the serving cell. If there are available vacant resources in the channel, the serving cell is a cell that needs to cooperate quickly. In this way, at least one cell that needs to cooperate quickly is determined. Then, step S803 is performed.
  • the load indicator may be: the highest scheduling priority of the cell, or the number of UEs to be scheduled with data volume. Starting from the most heavily loaded cell,
  • step S804 The fast collaboration process of the serving cell and the neighboring cell is triggered in sequence according to the sequence determined in step S803.
  • the fast collaboration process is specifically described in FIG. 7, and details are not described herein again.
  • the edge UE may be determined by the RSRP of the serving cell and the RSRP of the neighboring cell. For example, if the difference between the RSRP of the serving cell of the UE and the RSRP of the neighboring cell is lower than a preset value, The UE is an edge UE.
  • the edge UE may be determined by the RSRP of the serving cell and the RSRP of the neighboring cell.
  • step S802 can be performed before step S804. That is to say, after the sequence is triggered, when the fast cooperation is triggered, it is determined whether the control channel load of the serving cell of the edge UE is lower than a threshold, that is, whether the control channel resource is sufficient, if sufficient, , triggering a rapid collaborative process between the serving cell and the neighboring cell.
  • a threshold can be determined by the Control Channel Element (CCE) utilization.
  • the threshold for controlling the channel load can be set according to specifications that allow for fast cooperation, such as how many UEs are allowed to be scheduled to the neighbors per cell.
  • the threshold of the control channel load can be set by a person skilled in the art according to specific needs, and the embodiment of the present invention does not impose any limitation.
  • FIG. 9 is a schematic structural diagram of a load balancing apparatus according to another embodiment of the present invention.
  • the load balancing device is located at a first entity where the serving cell of the edge UE is located.
  • the apparatus 900 includes a selection unit 910, an interface unit 920, and an allocation unit 930.
  • the selecting unit 910 is configured to select a scheduling cell for the edge UE from the neighboring cell of the serving cell, where the entity in which the scheduling cell is located is the second entity.
  • the interface unit 920 is configured to interact with the second entity, and includes: informing the second entity that the scheduling cell allocates a data channel resource for the edge UE, and is configured to receive an allocation result of the data channel resource sent by the second entity.
  • the allocating unit 930 is configured to allocate control channel resources to the edge UE in the serving cell according to the allocation result of the data channel resources.
  • the interface unit 920 is further configured to send the data of the edge UE to the second entity, to send the data of the edge UE to the edge UE by using the allocated data channel resource.
  • the serving cell notifies the scheduling cell to allocate a data channel to the edge UE, and the control channel remains in the serving cell without switching, so that the UE can be transparent to the UE. In this case, it is not necessary to automatically and cooperatively schedule the load balancing by switching.
  • the manner in which the selection unit 910 selects the scheduling cell can be implemented by comparing the utility values of the edge UEs in each neighboring region.
  • the interface unit 920 may obtain a utility value that is configured by the edge UE in each neighboring cell of the serving cell, and the selecting unit selects the cell with the best utility value from the neighboring cells according to the utility value of the edge UE scheduling in each neighboring cell.
  • the utility value of the edge UE scheduling in each neighboring cell is determined by the entity in which the neighboring cell is located according to the state information of the edge UE in the serving cell. For details, refer to the foregoing embodiment, and details are not described herein again.
  • load balancing may be started from an edge UE of the most heavily loaded cell, and finally load balancing effect is achieved. optimal.
  • the load balancing device 900 may further include a sorting unit 940 and a determining unit 950.
  • the sorting unit 940 is configured to sort all the cells that meet the condition according to the load indicator
  • the determining unit 950 is configured to determine that the edge UE in the cell with the heaviest load is the edge UE to be scheduled.
  • the condition for this is that the capacity and delay of the communication link between the cells allows the UE data between these cells to be shared and kept synchronized.
  • the description of the load indicator is the same as the above embodiment, and details are not described herein again.
  • the fast cooperation when triggering the fast cooperation, that is, before selecting the scheduling cell for the edge UE, it may first determine whether the control channel load of the serving cell of the edge UE is lower than a threshold, that is, determining whether the control channel resource is sufficient, When sufficient, trigger the rapid collaboration process between the serving cell and the neighboring cell.
  • a threshold that is, determining whether the control channel resource is sufficient
  • the load balancing apparatus 900 may further include a detecting unit 960 configured to detect a control channel load of the serving cell of the edge UE.
  • the selecting unit 910 is further configured to: when the control channel load is lower than a threshold. , select a scheduling cell for the edge UE.
  • control channel in this embodiment may be a PDCCH
  • data channel may be a PDSCH
  • the interface unit 920 in this embodiment may be an internal interface circuit of the base station or an X2 interface.
  • the interface unit 920 may be an interface circuit of the base station or an interface of a high-speed bus interconnected between the BBUs; when the serving cell and the scheduling cell When the cells are in different base stations, the interface unit 920 can be an X2 interface.
  • the selecting unit 910 may be a separately set processor, or may be integrated in one processor of the base station, or may be stored in the form of program code. Stored in the memory of the base station, the function of the above selection unit 910 is called and executed by a certain processor of the base station.
  • each of the allocation unit 930, the sorting unit 940, the determining unit 950, and the detecting unit 960 may be the same as the selecting unit 910, and may be integrated with the selecting unit 910, or may be implemented independently.
  • the processor described herein may be a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more integrated systems configured to implement embodiments of the present invention. Circuit.
  • FIG. 12 is a schematic structural diagram of a load balancing apparatus according to another embodiment of the present invention.
  • the load balancing device is located at a second entity where the scheduling cell of the edge UE is located, and the device 120 includes an interface unit 121, an allocating unit 122, and a transmitting unit 123.
  • the interface unit 121 is configured to receive the notification message sent by the first entity, where the first entity is an entity where the serving cell of the edge UE is located, and the notification message is that the first entity selects a scheduling for the edge UE from the neighboring cell of the serving cell.
  • the cell is sent to the second entity, and is used to notify the second entity to allocate the data channel resource to the edge UE.
  • the allocating unit 122 is configured to allocate the data channel resource to the edge UE in the scheduling cell according to the notification message; the interface unit 121 is further used to Transmitting the result of the data channel resource allocation to the first entity, so that the first entity allocates the control channel resource to the edge UE in the serving cell according to the result of the data channel resource allocation, and sends the data of the edge UE to the second entity, and also uses Receiving data of the edge UE; the sending unit 123 is configured to send data to the edge UE by using the allocated data channel resource.
  • the load balancing device 120 may further include a determining unit 124.
  • the interface unit 121 receives the state information of the edge UE in the serving cell sent by the first entity, and the determining unit 124 is configured to determine, according to the state information of the serving UE in the serving cell, the utility value of the edge UE scheduling in the scheduling cell; The utility value determined by the determining unit 124 is sent to the first entity, so that the first entity selects the scheduling cell according to the utility value.
  • the control channel in this embodiment may be a PDCCH, and the data channel may be a PDSCH.
  • the interface unit 121 in this embodiment may be an internal interface circuit of the base station or an X2 interface.
  • the interface unit 121 may be an interface circuit of the internal base station or an interface of a high-speed bus interconnected between the BBUs; when the serving cell and the scheduling cell When the cells are in different base stations, the interface unit 121 can be an X2 interface.
  • the transmitting unit 123 can be a transmitter of the base station or a transceiver integrated with the receiver.
  • the allocation unit 122 can be a separate place
  • the processor can also be implemented in a processor of the base station. In addition, it can also be stored in the memory of the base station in the form of program code, and is called by one of the processors of the base station and performs the functions of the above allocation unit 122.
  • the implementation of the determining unit 124 may be the same as the allocating unit 122, and may be integrated with the allocating unit 122, or may be implemented independently.
  • the processor described herein may be a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more integrated configurations configured to implement embodiments of the present invention. Circuit.
  • FIG. 14 is a schematic structural diagram of a load balancing apparatus according to another embodiment of the present invention.
  • the device 140 is located at a first entity where the serving cell of the edge user equipment UE is located, and includes a processor 141 and an interface circuit 142.
  • the memory 143 and the bus 144 are also shown.
  • the processor 141, the interface circuit 142 and the memory 143 pass.
  • the bus 144 is connected and completes communication with each other.
  • the bus 144 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (ESA) bus.
  • ISA Industry Standard Architecture
  • PCI Peripheral Component
  • ESA Extended Industry Standard Architecture
  • the bus 144 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 14, but it does not mean that there is only one bus or one type of bus.
  • Memory 143 is for storing executable program code, the program code including computer operating instructions.
  • the memory 143 may include a high speed RAM memory, and may also include a non-volatile memory, for example, at least one disk memory.
  • the processor 141 can be a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • the processor 141 is configured to implement the function of the first entity where the foregoing serving cell is located. For example, to do the following:
  • the interface circuit 142 Notifying, by the interface circuit 142, the second entity to allocate data channel resources to the edge UE in the scheduling cell;
  • the processor 141 may further obtain, by using the interface circuit 142, a utility value that is configured by the edge UE in all neighboring cells. According to the utility value of the edge UE scheduling in all neighboring cells, the cell with the best utility value is selected from all the neighboring cells. Schedule the cell.
  • the processor 141 may send, by using the interface circuit 142, the status information of the edge UE in the serving cell to the entity where the neighboring cell is located, so that the entity where the neighboring cell is located calculates the edge UE in the local cell according to the state information of the edge UE in the serving cell.
  • the utility value is obtained by the interface circuit 142, and the utility value calculated by the entity in which each neighboring zone is located is received; thereby, the scheduling cell is selected according to the received utility value.
  • the processor 141 can also start load balancing operations from the most heavily loaded cell. Specifically, the processor 141 may sort all the cells satisfying the condition according to the load indicator; and determine that the edge UEs in the cell with the heaviest load are the edge UE to be scheduled. Then, repeat the above operation until the load balance is reached. The condition is satisfied that the capacity and delay of the communication link between the cells enables the UE data between the cells to be shared and kept synchronized.
  • the load indicators are the same as those described above, and are not described here.
  • the processor 141 can also detect the control channel load of the serving cell of the edge UE; when the control channel resources are sufficient, load balancing processing is performed. Specifically, when it is detected that the control channel load is lower than the threshold, the scheduling cell is selected for the edge UE.
  • the description of the threshold is the same as that of the above implementation, and details are not described herein again.
  • FIG. 15 is a schematic structural diagram of a load balancing apparatus according to another embodiment of the present invention.
  • the device 150 is located in a second entity where the scheduling cell of the edge user equipment UE is located, and includes a processor 151 and an interface circuit 152.
  • the memory 153, the bus 154, and the transceiver 155 are also shown.
  • the processor 151 and the interface circuit 152 are shown.
  • the memory 153 and the transceiver 155 are connected by the bus 154 and complete communication with each other.
  • the bus 154 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (ESA) bus.
  • ISA Industry Standard Architecture
  • PCI Peripheral Component
  • ESA Extended Industry Standard Architecture
  • the bus 154 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 15, but it does not mean that there is only one bus or one type of bus.
  • the memory 153 is for storing executable program code, the program code including computer operating instructions.
  • the memory 153 may include a high speed RAM memory, and may also include a non-volatile memory, for example, at least one disk memory.
  • the processor 151 may be a central processing unit (CPU), or an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present invention.
  • the processor 151 is configured to implement the function of the second entity where the foregoing scheduling cell is located. For example, to do the following:
  • the interface circuit 152 Receiving, by the interface circuit 152, the notification message sent by the first entity, where the notification message is sent by the first entity to the edge entity from the neighboring cell of the serving cell, and then sent to the second entity, and is used to notify the second entity that the edge is the edge.
  • the UE allocates data channel resources;
  • the scheduling cell is allocated the data channel resource for the edge UE; the result of the data channel resource allocation is sent to the first entity by the interface circuit 152, so that the first entity is at the edge of the serving cell according to the result of the data channel resource allocation.
  • the UE allocates control channel resources, and sends data of the edge UE to the second entity;
  • the data of the edge UE is received by the interface circuit 152, and the data is transmitted to the edge UE by the transceiver 155 through the allocated data channel resources.
  • the processor 151 may further receive, by using the interface circuit 152, state information of the edge UE in the serving cell sent by the first entity, and determine, according to the state information of the serving cell in the edge UE, the utility value of the edge UE scheduling in the scheduling cell; The utility value is sent by the interface circuit 152 to the first entity such that the first entity selects a scheduling cell based on the utility value.
  • the entity in which the serving cell or the neighboring cell is located may be a processing core, a processor, a baseband board, or a base station.
  • the serving cell and the entity in the neighboring cell may be the same base station, or may be different baseband boards under the same base station.
  • different processors under the same baseband board, or different processing cores of the same processor for example, when the serving cell and a neighboring cell are the cells under the centralized control of the BBU, the serving cell and the entity in the neighboring cell may Different BBUs, which may be different processors or processing cores under the same BBU; for example, when the serving cell and a neighboring cell are cells under different base stations that are interconnected at high speed between X2 interfaces, the serving cell and the serving cell The entity in which the neighboring cell is located may be a different base station.
  • the above control channel may be a physical downlink control channel (PDCCH), and the data channel may be a physical downlink shared channel (PDSCH).
  • FIG. 16 is a flowchart of a load balancing method according to another embodiment of the present invention. As shown in the figure, the load balancing method is applied to a cell under the same base station or all cells controlled centrally by the BBU. As shown in FIG. 16, the method includes the following steps: S161: The base station where the serving cell of the edge UE is located selects a scheduling cell for the edge UE from the neighboring cell of the serving cell. At this time, the scheduling cell and the serving cell are located under the same base station.
  • S162 The base station allocates a data channel resource to the edge UE in the scheduling cell.
  • S164 Send data to the edge UE by using the data channel resource allocated by the scheduling cell, and send control signaling to the edge UE by using the control channel resource allocated by the serving cell.
  • the base station may obtain the utility value of the edge UE in all the neighboring cells, and select the neighboring cell with the best utility value as the scheduling cell.
  • the acquisition of the utility value may be calculated according to the state information of the UE in the serving cell.
  • the base station may sort the cells according to the load indicator for the conditions that satisfy the condition, and then perform load balancing from the cell with the heaviest load, that is, perform the operation shown in Fig. 16.
  • the condition is satisfied that the capacity and delay of the communication link between the cells allows UE data between the cells to be shared and kept synchronized.
  • the base station may also detect the control channel load of the serving cell of the edge UE before performing load balancing, that is, before performing the operation shown in FIG. 16. When the control channel resources are sufficient, the operation shown in FIG. 16 is performed. Specifically, the scheduling cell may be selected for the edge UE when the control channel load is lower than the threshold.
  • FIG. 17 is a flowchart of a load balancing method according to another embodiment of the present invention. As shown in the figure, the load balancing method is applied to cells under different base stations. As shown in FIG. 17, the method includes the following steps:
  • S171 The base station where the serving cell of the edge UE is located selects a scheduling cell for the edge UE from the neighboring cell of the serving cell.
  • the method further includes:
  • S172 the first base station notifies the second base station to allocate data channel resources to the edge UE in the scheduling cell;
  • S173 the first base station receives the allocation result of the data channel resource sent by the second base station;
  • the first base station allocates control channel resources to the edge UE in the serving cell according to the allocation result of the data channel resource.
  • the first base station sends control signaling to the edge UE by using the control channel resource allocated by the serving cell, and sends the data of the edge UE to the second base station to pass the number allocated in the scheduling cell.
  • the data of the edge UE is transmitted to the edge UE according to the channel resource.
  • the first base station may obtain a utility value that is configured by the edge UE in all neighboring cells; and select a neighboring cell with the best utility value as the scheduling cell.
  • the acquisition of the utility value may be obtained according to the state information of the UE in the serving cell.
  • the first base station may send the status information of the edge UE in the serving cell to the second base station, so that the second base station calculates the utility value of the edge UE in the local cell according to the state information of the edge UE in the serving cell, thereby using the utility value.
  • the first base station is sent to the first base station to select a scheduling cell.
  • the disclosed systems, devices, and methods may be implemented in other ways.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not executed.
  • the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be electrical, mechanical or otherwise.
  • the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the functions may be stored in a computer readable storage medium if implemented in the form of a software functional unit and sold or used as a standalone product. Based on such understanding, the present invention The technical solution may be embodied in the form of a software product in essence or in part of the prior art, the computer software product being stored in a storage medium, including a plurality of instructions for causing one
  • the computer device (which may be a personal computer, server, or network device, etc.) performs all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and the like, which can store program codes. .

Landscapes

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

Abstract

本发明实施例提供了一种负载均衡的方法和网络控制节点，其中，服务小区所在的实体为边缘UE选择调度小区，并通知调度小区为该边缘UE分配数据信道，而控制信道保留在服务小区不进行切换，如此，可以在对UE透明的情况下，不需要通过切换，自动地快速协作调度达到负载平衡的目的。可见，以上负载平衡的方式以数据信道为转移粒度，无需引入切换时延，实现了快速平衡瞬时负载的功能，从而提高了负载平衡效率。

Description

负载均衡的方法和网络控制节点 技术领域
本发明实施例涉及无线通信领域， 并且更具体地， 涉及负载均衡的方法 和网络控制节点。 背景技术
在长期演进（ Long Term Evolution, LTE ) 系统中， 小区的负载程度由 用户分布、移动性、用户业务类型等因素共同决定，也就是说，用户设备（ User Equipment, UE )在小区中的分布具有随机性，通常是非均匀并且随时间变化 的， 所以整个网络中的负载很可能出现不平衡的分布状态， 导致某个重载小 区中的用户体验大幅下降。
负载均衡（Load Balancing )是通过判断本小区的负载高低， 进行小区 间负载信息交互， 将负载从较为繁忙的小区转移到剩余资源较多的小区， 这 样协调了小区之间的负载分布， 实现了网络资源利用最大化， 降低系统拥塞 率， 从而提升了用户的业务感受。
在现有的负载均衡技术中，通常由基站周期性测量小区业务所占空口资 源利用率， 即物理资源块（Physical Resource Block, PRB )利用率， 根据测 量情况来评估小区负载。 当小区空口资源利用率高于门限后， 小区向满足条 件的邻区发起负载交互请求， 与邻区进行负载信息交互。 之后基站将根据服 务小区和目标邻区之间的负载差和切换性能进行综合判断，选择出最优目标 小区。 在确定了目标小区后， 服务小区将选出部分 UE进行负载转移， 其负 载转移手段包含切换和小区重选。
然而， 通过切换和小区重选作为负载平衡的手段， 负载转移粒度较粗， 只能以 UE为单位； 同时， 切换所需的时延较长，难以快速平衡瞬时的负载； 可见， 现有负载平衡效率较低。 发明内容
本发明实施例提供一种负载均衡的方法和网络控制节点， 能够提高负载 均衡的效率。
第一方面， 提供了一种负载均衡的方法， 包括： 边缘用户设备 UE的服 务小区所在的第一实体从所述服务小区的邻区中为所述边缘 UE选择调度小 区， 所述调度小区所在的实体为第二实体； 所述第一实体通知所述第二实体 在所述调度小区为所述边缘 UE分配数据信道资源； 所述第一实体接收所述 第二实体发送的所述数据信道资源的分配结果， 并根据所述数据信道资源的 分配结果， 在所述服务小区为所述边缘 UE分配控制信道资源； 所述第一实 体将所述边缘 UE的数据发送给所述第二实体， 以通过分配的所述数据信道 资源将所述边缘 UE的数据发送给所述边缘 UE。
结合第一方面， 在其第一种实现方式中， 所述第一实体为所述边缘 UE 选择调度小区， 包括： 获取所述边缘 UE在所有邻区中调度的效用值； 根据 所述边缘 UE在所有邻区调度的效用值， 从所有邻区中选择效用值最佳的小 区作为调度小区。
结合第一方面的第一种实现方式， 在其第二种实现方式中， 所述获取所 述边缘 UE在所有邻区中调度的效用值包括： 获取所述边缘 UE在第一邻区 中调度的效用值， 所述第一邻区为所述所有邻区中的任一邻区， 所述获取所 述边缘 UE在第一邻区中调度的效用值， 包括： 所述第一实体向所述第一邻 区所在的实体发送所述边缘 UE在所述服务小区的状态信息； 接收所述第一 邻区所在的实体根据所述边缘 UE的状态信息确定的所述边缘 UE在所述第 一邻区中调度的效用值。
结合第一方面或第一方面的第一种至第二种实现方式之一，在其第三种 实现方式中， 在所述第一实体为所述边缘 UE选择调度小区之前， 所述方法 还包括： 确定待调度的所述边缘 UE, 包括： 将满足条件的所有小区按照负 载指标进行排序； 确定负载最重的小区内的边缘 UE 为待调度的所述边缘 UE。
结合第一方面的第三种实现方式， 在其第四种实现方式中， 所述满足的 条件为小区之间的通信链路的容量和时延使得这些小区之间的 UE数据可以 共享且保持同步。
结合第一方面的第三种或第四种实现方式， 在其第五种实现方式中， 所 述负载指标包括小区最高调度优先级； 或有数据量的待调度 UE数。
结合第一方面或第一方面的第一种至第五种实现方式之一，在其第六种 实现方式中， 在所述第一实体为所述边缘 UE选择调度小区之前， 所述方法 还包括： 检测所述边缘 UE的服务小区的控制信道负载； 当所述控制信道负 载低于阈值时， 为所述边缘 UE选择调度小区。
结合第一方面或第一方面的第一种至第六种实现方式之一，在其第七种 实现方式中， 所述控制信道为物理下行控制信道 PDCCH, 所述数据信道为 物理下行共享信道 PDSCH。
第二方面， 提供了一种负载均衡的方法， 包括： 边缘用户设备 UE的调 度小区所在的第二实体接收第一实体发送的通知消息， 所述第一实体为所述 边缘 UE的服务小区所在的实体， 且所述通知消息为所述第一实体从所述服 务小区的邻区中为所述边缘 UE选择所述调度小区后发送给所述第二实体， 且用于通知所述第二实体为所述边缘 UE分配数据信道资源； 所述第二实体 根据所述通知消息， 在所述调度小区为所述边缘 UE分配数据信道资源； 所 述第二实体将所述数据信道资源分配的结果发送给所述第一实体，使得所述 第一实体根据所述数据信道资源分配的结果在所述服务小区为所述边缘 UE 分配控制信道资源， 并将所述边缘 UE的数据发送给所述第二实体； 所述第 二实体接收所述边缘 UE的数据， 并通过分配的所述数据信道资源将所述边 缘 UE的数据发送给所述边缘 UE。
结合第二方面， 在其第一种实现方式中， 在所述第二实体接收所示第一 实体发送的通知消息之前， 所述方法还包括： 接收所述第一实体发送的所述 边缘 UE在所述服务小区的状态信息； 根据所述边缘 UE在所述服务小区的 状态信息， 确定所述边缘 UE在所述调度小区中调度的效用值； 将所述效用 值发送给所述第一实体， 以便所述第一实体根据所述效用值选择所述调度小 区。
结合第二方面或第二方面的第一种实现方式， 在其第二种实现方式中， 所述控制信道为物理下行控制信道 PDCCH, 所述数据信道为物理下行共享 信道 PDSCH。
第三方面， 提供了一种负载均衡的装置， 位于边缘用户设备 UE的服务 小区所在的第一实体， 所述装置包括： 选择单元， 从所述服务小区的邻区中 为所述边缘 UE选择调度小区， 所述调度小区所在的实体为第二实体； 接口 单元， 用于通知所述第二实体在所述调度小区为所述边缘 UE分配数据信道 资源， 并用于接收所述第二实体发送的所述数据信道资源的分配结果； 分配 单元， 用于根据所述数据信道资源的分配结果， 在所述服务小区为所述边缘 UE分配控制信道资源； 所述接口单元， 还用于将所述边缘 UE的数据发送 给所述第二实体， 以通过分配的所述数据信道资源将所述边缘 UE的数据发 送给所述边缘 UE。
结合第三方面， 在其第一种实现方式中， 所述接口单元还用于获取所述 边缘 UE在所有邻区中调度的效用值； 所述选择单元具体用于根据所述边缘 UE在所有邻区调度的效用值， 从所有邻区中选择效用值最佳的小区作为调 度小区。
结合第三方面的第一种实现方式， 在其第二种实现方式中， 所述边缘 所述 Λ良务小区的状态信息确定的。
结合第三方面或第三方面的第一种或第二种实现方式，在其第三种实现 方式中， 所述装置还包括： 排序单元， 用于将满足条件的所有小区按照负载 指标进行排序； 确定单元， 用于确定负载最重的小区内的边缘 UE为待调度 的所述边缘 UE。
结合第三方面的第三种实现方式， 在其第四种实现方式中， 所述满足的 条件为小区之间的通信链路的容量和时延使得这些小区之间的 UE数据可以 共享且保持同步。
结合第三方面的第三种或第四种实现方式， 在其第五种实现方式中， 所 述负载指标包括小区最高调度优先级； 或有数据量的待调度 UE数。
结合第三方面或第三方面的第一种或第五种实现方式，在其第六种实现 方式中， 所述装置还包括： 检测单元， 用于检测所述边缘 UE的服务小区的 控制信道负载； 所述选择单元， 用于在所述控制信道负载低于阈值时， 为所 述边缘 UE选择所述调度小区。
结合第三方面或第三方面的第一种或第六种实现方式，在其第七种实现 方式中， 所述控制信道为物理下行控制信道 PDCCH, 所述数据信道为物理 下行共享信道 PDSCH。
第四方面， 提供了一种负载均衡的装置， 位于边缘用户设备 UE的调度 小区所在的第二实体， 所述装置包括： 接口单元， 用于接收第一实体发送的 通知消息， 所述第一实体为所述边缘 UE的服务小区所在的实体， 且所述通 知消息为所述第一实体从所述服务小区的邻区中为所述边缘 UE选择所述调 度小区后发送给所述第二实体， 且用于通知所述第二实体为所述边缘 UE分 配数据信道资源； 分配单元， 用于根据所述通知消息， 在所述调度小区为所 述边缘 UE分配数据信道资源； 所述接口单元， 还用于将所述数据信道资源 分配的结果发送给所述第一实体，使得所述第一实体根据所述数据信道资源 分配的结果在所述服务小区为所述边缘 UE分配控制信道资源， 并将所述边 缘 UE的数据发送给所述第二实体， 且还用于接收所述边缘 UE的数据； 发 送单元， 用于通过分配的所述数据信道资源将向所述边缘 UE发送数据。
结合第四方面， 在其第一种实现方式中， 所述接口单元， 还用于接收所 述第一实体发送的所述边缘 UE在所述服务小区的状态信息； 且所述装置还 包括： 确定单元， 用于根据所述接口单元接收的所述边缘 UE在所述服务小 区的状态信息， 确定所述边缘 UE在所述调度小区中调度的效用值； 所述接 便所述第一实体根据所述效用值选择所述调度小区。
结合第四方面或第四方面的第一种实现方式， 在其第二种实现方式中， 所述控制信道为物理下行控制信道 PDCCH, 所述数据信道为物理下行共享 信道 PDSCH。
第五方面， 提供了一种负载均衡的系统， 包括第三方面或第三方面任一 种实现方式的第一负载均衡的装置和第四方面或第四方面任一种实现方式 的第二负载均衡的装置。
可见， 在本发明实施例中， 服务小区所在的实体为边缘 UE选择调度小 区， 并通知调度小区为该边缘 UE分配数据信道， 而控制信道保留在服务小 区不进行切换， 如此， 可以在对 UE透明的情况下， 不需要通过切换， 自动 地快速协作调度达到负载平衡的目的。 可见， 以上负载平衡的方式以数据信 道为转移粒度， 无需引入切换时延， 实现了快速平衡瞬时负载的功能， 从而 提高了负载平衡效率。 附图说明
为了更清楚地说明本发明实施例的技术方案， 下面将对实施例或现有技 术描述中所需要使用的附图作简单地介绍， 显而易见地， 下面描述中的附图 仅仅是本发明的一些实施例， 对于本领域普通技术人员来讲， 在不付出创造 性劳动的前提下， 还可以根据这些附图获得其他的附图。
图 1是本发明一个实施例的负载均衡的方法的流程图。
图 2是本发明一个实施例的负载均衡的方法的流程图。 图 3是本发明一个实施例的快速协作的方法的流程图。
图 4是本发明一个实施例的慢速协作的方法的流程图。
图 5是本发明一个实施例的网络控制节点的示意框图。
图 6是本发明另一实施例的网络控制节点的示意框图。
图 7是本发明另一个实施例提供的一种负载均衡的方法的信令流图。 图 8是本发明另一个实施例提供的一种负载均衡的方法的流程示意图。 图 9是本发明另一个实施例提供的一种负载均衡装置的结构示意图。 图 10是本发明又一个实施例提供的一种负载均衡装置的结构示意图。 图 11是本发明又一个实施例提供的一种负载均衡装置的结构示意图。 图 12是本发明又一个实施例提供的一种负载均衡装置的结构示意图。 图 13是本发明又一个实施例提供的一种负载均衡装置的结构示意图。 图 14是本发明又一个实施例提供的一种负载均衡装置的结构示意图。 图 15是本发明又一个实施例提供的一种负载均衡装置的结构示意图。 图 16是本发明又一个实施例提供的一种负载均衡的方法的流程示意图。 图 17是本发明又一个实施例提供的一种负载均衡的方法的流程示意图。 具体实施方式
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行 清楚、 完整地描述， 显然， 所描述的实施例是本发明一部分实施例， 而不是 全部的实施例。 基于本发明中的实施例， 本领域普通技术人员在没有作出创 造性劳动前提下所获得的所有其他实施例， 都属于本发明保护的范围。
应理解， 本发明的技术方案可以应用于各种通信系统， 例如： 全球移动 通讯 ( Global System of Mobile communication, GSM )系统、码分多址（ Code Division Multiple Access, CDMA ) 系统、 宽带码分多址 （Wideband Code Division Multiple Access , WCDMA )系统、通用分组无线业务（ General Packet Radio Service, GPRS )、 长期演进（ Long Term Evolution, LTE ) 系统、 LTE 频分双工 （Frequency Division Duplex, FDD ) 系统、 LTE时分双工 （Time Division Duplex , TDD )、 通用移动通信系统 （ Universal Mobile Telecommunication System, UMTS )等。
还应理解， 在本发明实施例中， 用户设备（ User Equipment, UE )可称 之为终端 （Terminal ), 移动台 （Mobile Station, MS )、 移动终端 （Mobile Terminal )等， 该用户设备可以经无线接入网 ( Radio Access Network, RAN ) 与一个或多个核心网进行通信，例如，用户设备可以是移动电话（或称为 "蜂 窝" 电话）、 具有移动终端的计算机等， 例如， 用户设备还可以是便携式、 袖珍式、 手持式、 计算机内置的或者车载的移动装置， 它们与无线接入网交 换语音和 /或数据。
在本发明实施例中， 基站可以是 GSM 或 CDMA 中的基站 （Base Transceiver Station, BTS ), 也可以是 WCDMA中的基站（ NodeB, NB ), 还 可以是 LTE中的演进型基站 （ Evolutional Node B, eNB或 e-NodeB ), 本发 明并不限定。 为描述方便， 下述实施例将以基站 eNB和用户设备 UE为例进 行说明。
在本发明实施例中， 网络控制节点可以是基站， 也可以是基站上层的集 中控制器（Centralized Controller ), 在不同的实施例中网络控制节点代表的 节点不同， 具体地将在下述实施例中说明。
图 1是本发明一个实施例的负载均衡的方法的流程图。 图 1的方法由网 络控制节点执行， 其中网络控制节点可以是基站或集中控制器。
101 , 确定需要进行负载均衡的第一小区和参与负载均衡的第二小区， 第一小区与第二小区相邻。
102, 调整负载均衡相关参数， 其中负载均衡相关参数包括如下信息之 一或其组合： 小区切换相关参数， 小区重选相关参数。
103 ,根据调整后的负载均衡相关参数对第一小区或第二小区进行配置。 本发明实施例通过网络控制节点收集并综合考虑其控制的所有小区的 负载相关信息 , 并以能够使得总效用函数取得最优值的负载均衡相关参数对 网络进行负载均衡， 从而实现全局最优的负载均衡。
此外， 本发明实施例的负载均衡方法是针对同频小区的， 对于异频小区 需要通过确定能够使得总效用函数取得最优值的覆盖用户集合来对网络进 行负载均衡， 其中覆盖用户集合用于确定需要进行小区切换的用户。
可选地， 作为一个实施例， 在慢速协作过程中， 网络控制节点所控制的 每个小区周期性地向该网络控制节点上报以下信息： 本小区的快速协作邻 区， 本小区的 PRB利用率， 本小区的历史调度优先级， 本小区中各个用户 的调度速率、 资源块的分配、緩冲区数据量、等待时延、 QoS类别标识（QoS Class Identifier, QCI )类型、调制与编码策略（ Modulation and Coding Scheme, MCS )、 参考信号接收功率 ( Reference Signal Received Power, RSRP )。 可选 地， 还可以上报本小区的调度数据量和用户上报的信道质量指示 （Channel Quality Indicator, CQI )、 信道状态信息 ( Channel State Information, CSI )、 参考信号接收质量（Reference Signal Received Quality, RSRQ )、接收信号强 度指示 （ Received Signal Strength Indicator, RSSI )等信息。
可选地， 作为另一个实施例， 集中控制器根据收集到的负载相关信息确 定负载超过阈值的小区，再根据负载相关信息中的本小区的快速协作邻区排 除出快速协作小区来确定第一类小区， 即慢速协作小区。 然后可以通过遍历 的方法确定出能够使得总效用函数取得最优值的每个小区的功率配置和覆 盖配置。 其中功率配置可以是每个小区在不同的时频资源上的发射功率谱， 覆盖配置可以是进行小区切换和小区重选的触发条件的调节参数。
可选地， 作为另一个实施例， 步骤 102中网络控制节点调整负载均衡相 关参数， 包括： 根据负载相关信息确定网络控制节点控制的总效用函数； 确 定能够使总效用函数取得最大值或最小值的负载均衡相关参数。 其中， 总效 用函数可以包括： 第一类小区中所有用户的调度速率的加权和； 或者第一类 小区中所有小区的调度优先级之和。 这里， 用户的调度速率是该用户在一段 时间内的历史调度速率， 而所有用户的调度速率的加权和能够反映慢速协作 小区组成的网络的总体负载程度。 另外， 可以以小区一个时频资源上调度的 用户优先级作为该时频资源上的优先级， 而小区的调度优先级为一段时间内 所有时频资源上的优先级的平均值， 可以用于表示该小区的负载程度， 求和 后， 同样地可以表示网络的总体负载程度。
可选地，确定能够使总效用函数取得最大值或最小值的负载均衡相关参 数， 可以包括： 确定能够使得第一类小区中所有用户的调度速率的加权和取 得最大值的负载均衡相关参数； 或者确定能够使得第一类小区中所有小区的 调度优先级之和取得最小值的负载均衡相关参数。
可选地， 负载均衡相关参数可以包括： 小区切换参数， 用于确定小区切 换的触发条件； 小区重选参数； 用于确定小区重选的触发条件；发射功率谱， 用于配置小区在每个时频资源上的发射功率值。
可选地， 作为另一个实施例， 网络控制节点控制的所有小区可以包括： 第一类小区和第二类小区， 第一类小区用于指示跨基带处理单元 BBU调度 的小区， 第二类小区用于指示共 BBU调度的小区。 可以理解， 进行快速协 作过程的快速协作小区是共 BBU的， 而进行慢速协作过程的慢速协作小区 之间是不共 BBU的， 或者可以理解为， 不能进行快速协作的小区则进行慢 速协作。
可选地， 作为另一个实施例， 网络控制节点确定网络控制节点控制的所 有小区中的第二类小区的负载指标； 根据负载指标， 按照降序依次确定第二 类小区的边缘用户的目标调度小区； 在目标调度小区对边缘用户进行调度。 该实施例中的步骤为快速协作过程的步骤， 此时网络控制节点可以 站。
可选地， 上述负载指标可以包括： 第二类小区的最高调度优先级； 或者 第二类小区中有数据量的待调度用户数。
可选地， 作为另一个实施例， 根据负载指标， 按照降序依次确定第二类 小区的边缘用户的目标调度小区， 包括： 确定第二类小区的边缘用户； 向第 二类小区的相邻第二类小区发送边缘用户的调度相关信息； 根据调度相关信 息， 确定能够使效用函数取得最大值的小区为边缘用户的目标调度小区， 目 标调度小区可以是第二类小区或相邻第二类小区。 其中效用函数可以包括： 第二类小区和相邻第二类小区的小区调度优先级之和。 这里， 小区调度优先 级为当前时刻所有时频资源上的优先级的平均值。
可选地， 上述调度相关信息可以包括： 用户的信道状态、 用户的调度速 率、 用户的等待时延、 用户的 QoS ( Quality of Service )加权。 具体地， 用 户的信道状态可以通过 CQI、 CSI等表示。 调度速率为用户的历史平均调度 速率。 QoS加权根据用户等级和用户连接类型等级共同决定。
可选地， 作为另一实施例， 在目标调度小区对边缘用户进行调度可以包 括：向第二类小区发送边缘用户在目标调度小区的资源分配；根据资源分配， 向目标调度小区发送边缘用户的待调度数据。
图 2是本发明一个实施例的负载均衡的方法的流程图。 图 2的方法由网 络控制节点执行， 其中网络控制节点可以是基站或集中控制器。
201 , 确定网络控制节点控制的所有小区中的第二类小区的负载指标。 在快速协作过程中， 网络控制节点可以 站。 快速协作小区的负载指 标可以包括快速协作小区的最高调度优先级或有数据量的待调度用户数。其 中， 快速协作小区中的具有最高调度优先级的用户的调度优先级可以作为快 速协作小区的最高调度优先级， 用于反映小区的负载程度。
202, 根据负载指标， 按照降序依次确定第二类小区的边缘用户的目标 调度小区。
根据负载指标，按照降序依次确定第二类小区的边缘用户的目标调度小 区， 包括： 确定第二类小区的边缘用户； 向第二类小区的相邻第二类小区发 送边缘用户的调度相关信息； 根据调度相关信息， 确定能够使效用函数取得 最大值的相邻第二类小区为边缘用户的目标调度小区。 其中， 效用函数可以 包括第二类小区和相邻第二类小区的小区调度优先级之和。调度相关信息可 以包括用户的信道状态、 用户的调度速率、 用户的等待时延、 用户的 QoS 加权。 其中， 用户的信道状态可以通过 CQI、 CSI来表示。
203 , 在目标调度小区对边缘用户进行调度。
向第二类小区发送边缘用户在目标调度小区的资源分配； 根据资源分 配， 向目标调度小区发送边缘用户的待调度数据。
本发明实施例通过网络控制节点收集并综合考虑其控制的所有小区的 负载相关信息， 并以能够使得总效用函数或者效用函数取得最优值的负载均 衡相关参数对网络进行负载均衡， 从而实现全局最优的负载均衡。
可选地， 作为一个实施例， 网络控制节点控制的所有小区可以包括： 第 一类小区和第二类小区， 第一类小区用于指示跨基带处理单元 BBU调度的 小区， 第二类小区用于指示共 BBU调度的小区。 可以理解， 进行快速协作 过程的快速协作小区是共 BBU的， 而进行慢速协作过程的慢速协作小区之 间是不共 BBU的， 或者可以理解为， 不能进行快速协作的小区则进行慢速 协作。
可选地， 作为另一个实施例， 接收网络控制节点控制的所有小区中的每 一个小区上报的负载相关信息； 根据负载相关信息确定第一类小区和第一类 小区的负载均衡相关参数； 向第一类小区发送负载均衡相关参数。
可选地，根据负载相关信息确定第一类小区和第一类小区的负载均衡相 关参数可以包括： 根据负载相关信息确定第一类小区的总效用函数； 确定能 够使总效用函数取得最大值或最小值的负载均衡相关参数。 其中， 总效用函 数可以包括： 第一类小区中所有用户的调度速率的加权和； 或者第一类小区 中所有小区的调度优先级之和。
可选地，确定能够使总效用函数取得最大值或最小值的负载均衡相关参 数， 包括： 确定能够使得第一类小区中所有用户的调度速率的加权和取得最 大值的负载均衡相关参数； 或者确定能够使得第一类小区中所有小区的调度 优先级之和取得最小值的负载均衡相关参数。 其中， 负载均衡相关参数可以 包括： 小区切换参数， 用于确定小区切换的触发条件； 小区重选参数； 用于 确定小区重选的触发条件； 发射功率谱， 用于配置小区在每个时频资源上的 发射功率值。
可选地， 负载相关信息可以包括： 小区的相邻小区中的第二类小区； 小 区的 PRB 利用率； 小区的历史调度优先级； 小区中各个用户的调度速率、 分配 RB、 緩冲区数据量、 等待时延、 QCI类型、 调制和编码配置 MCS 、 RSRP。 另外， 负载相关信息还可以包括： 小区的调度数据量； 小区中各个 用户上 ^艮的 CSI、 RSRQ和 RSSI。
图 3是本发明一个实施例的快速协作的方法的流程图。 图 3的方法可以 由基站执行。
当多个小区之间存在高容量低延时的通信链路、用户数据可以共享并且 保持同步时， 则认为这些小区具备快速协作条件。 具体的应用场景可以是基 带处理单元（Baseband Unit, BBU )集中的所有小区， 或同基站下的所有小 区。 其中， BBU 集中的场景一般应用于大型场馆的室内覆盖， 或密集城区 场景， 其特点是将基站分成近端即 BBU 和远端即射频拉远模块 （Radio Remote Unit, RRU ) 两部分， BBU可以安装在合适的机房位置， RRU可 以安装在天线端，一个 BBU可以连接多个 RRU,且二者之间通过光纤连接， 符合高容量低延时的通信链路的要求。 对于同基站的场景， 该基站控制的多 个小区之间的通信是在基站内部进行的， 也符合快速协作条件。 应理解， 本 发明实施例的应用场景不限于此， 所有符合上述快速协作条件的场景都落入 本发明的保护范围。
301 , 小区间存在边缘用户。
基站根据小区中用户上报的测量报告周期性的检测小区间是否存在边 缘用户。 其中测量 4艮告可以为 RSRP、 RSRQ, RSSI中的一项或者多项。 例 如， 一个用户上报的服务小区的 RSRP与邻区的 RSRP之差低于一个阈值， 则判定该用户为边缘用户。 用于判定边缘用户的阈值可以是由系统预定义 的。 当快速协作小区之间存在边缘用户时， 执行下述步骤 302。 当快速协作 小区之间不存在边缘用户时， 则重复当前步骤。
302, 边缘用户的服务小区的下行控制信道 PDCCH负载低于阈值。 当快速协作小区之间存在边缘用户时，基站将检测边缘用户的服务小区 的 PDCCH负载， 即 CCE利用率。如果该服务小区的 CCE利用率低于阈值， 则触发服务小区和邻区之间的快速协作流程。 其中， 用于判定 CCE利用率 的阈值可以是由系统预定义的。
可以理解， PDCCH用于下行控制信令的承载， 当 PDCCH负载较低时， 该小区才能保证正确指示邻区的 PDSCH调度结果， 即可以进行快速协作流 程。
303 , 在每个调度时刻对需要快速协作的小区排序。
基站确定了需要并且可以进行快速协作的小区后， 可以按照某个负载指 标对所有需要并且可以进行快速协作的小区进行排序。 其中， 负载指标用于 表示小区的负载程度， 具体地， 可以为小区最高调度优先级或者小区中緩冲 区有数据量的待调度用户数。 小区中所有用户调度优先级中最高的调度优先 级可以作为小区最高调度优先级， 小区的负载程度越高， 小区中用户的最高 调度优先级就越高。 作为一个例子， 用户的调度优先级可以通过瞬时速率除 以历史调度速率来确定， 用于表示用户的瞬时负载需求。 应理解， 用户的调 度优先级还可以用等待时延、 QCI等作为加权值， 本发明对此不作限定。
304, 服务小区与邻区决定边缘用户的目标调度小区。
按照快速协作小区的排序， 从负载最重的小区开始， 依次决定当前时刻 小区中边缘用户的目标调度小区。
对于需要在邻区进行调度的边缘用户， 其服务基站将信道状态、 调度速 率等信息传递给所有符合快速协作条件的邻区。其中信道状态信息可以包括 CQI、 CSI等， 调度速率可以是用户在服务小区的历史调度速率。
接收到调度相关信息的邻区需要估计边缘用户在本小区进行调度的瞬 时速率。 具体地， 可以根据边缘用户上报的 RSRP、 RSRQ进行估计， 也可 以结合服务小区的全货款 CQI和 RSRP估计， 或者由用户直接上报邻区的 CSI来确定边缘用户在邻区调度的瞬时速率。
之后，服务小区和邻区根据效用函数决定用户的数据信道由哪个邻区服 务。 其中效用函数可以是当前的每个小区调度优先级之和， 可以通过选定使 得效用函数取得最大值的邻区作为目标调度小区。 具体地， 效用函数的表达 式可以为：
Figure imgf000014_0001
其中小区 i的调度优先级为 ，小区当前时刻最高优先级的用户 的优先级作为该小区的优先级， 用于表示该小区的瞬时负载程度。 用户优先 级计算的输入变量 X , y , z等等定义为： 用户数据包等待时延； 用户当前信 道状况下计算的瞬时频谱效率； 用户一段时间内的平均频谱效率； 用户历史 调度速率； 用户的 QoS加权等。
应理解， 当以调度优先级表示效用函数时， 小区调度优先级瞬时值表示 小区负载瞬时程度， 小区调度优先级一段时间内的平均值表示了小区一段时 间内的平均负载程度。快速协作通过实时协调网络资源最大化瞬时总效用值 来降低网络长期平均负载程度。 因此， 快速协作过程中， 目标为最大化瞬时 总效用函数值； 慢速协作过程中， 目标为最小化平均总效用函数值。
另外， 在决定边缘用户数据信道的目标调度小区同时， 也可依据选定的 效用函数， 协调服务小区和邻区最合适的发射功率。 例如当用户在邻区被调 度时， 降低服务小区的发射功率， 以降低对该类用户的干扰。 还可以依据选 定的效用函数， 协调服务小区和邻区的 PMI, 通过空间波束方向协调降低两 个小区之间的干扰。
应理解， 在决定用户在哪个小区被调度时， 可以一个传输时间间隔
( Transmission Time Interval , ΤΤΙ )协商一次， 在同一时刻用户被分配的频 率资源只来自一个小区； 也可以一个 ΤΤΙ的每个 RBG上协商一次， 在同一 时刻用户被分配的频率资源可能来自两个小区。
305, 在目标调度小区对边缘用户进行调度。
确定了边缘用户的目标调度小区后， 目标调度小区将为边缘用户分配时 频资源， 并且通知边缘用户的服务小区时频资源分配结果。 服务小区将为边 缘用户分配 PDCCH资源，并将边缘用户的待调度数据发送给目标调度小区， 之后由目标调度小区 PDSCH向边缘用户下发数据， 由服务小区 PDCCH向 边缘用户下发调度指示。 应理解， 一个服务小区中可以同时有多个边缘用户 被相关的目标调度小区服务。 还应理解， 用户的数据信道在目标调度小区发 送时， 使用的是 UE级参考信号（ UE-specific Reference signal ), 发射模式为 单天线端口 （ single-antenna port ) 或基于 UE级参考信号的多层传输模式。 此外， 用户的初传与重传选择同样的小区（目标调度小区)发送， 或重传都在 服务小区发送。 用户根据 ACK/NACK反馈调整 MCS时， 按照初传调度小 区的不同各自维护两套 CQI调整量。
本发明实施例在共 BBU的场景下， 通过使用一种资源利用的效用函数 作为负载评估的指标，综合考虑了空口资源使用情况、用户业务的 QoS需求、 用户的信道情况等因素， 动态的为快速协作小区确定目标调度小区。 不需要 通过小区切换的方法完成负载转移， 从而降低了负载均衡的粒度和时延， 实 现了对瞬时负载的快速平衡， 提高了用户体验。
图 4是本发明一个实施例的慢速协作的方法的流程图。 图 4的方法可以 由网络控制节点执行。
当多个小区之间不满足快速协作条件时， 可以由网络控制节点对此类小 区进行慢速协作过程， 其中网络控制节点可以包括集中控制器或基站。
401 , 网络控制节点周期性的收集小区的负载相关信息。
当网络中存在集中控制器时， 集中控制器控制下的所有小区周期性的向 集中控制器上报负载相关信息， 其中负载相关信息包括： 本小区的快速协作 邻区， 本小区的 PRB利用率， 本小区的历史调度优先级， 本小区中各个用 户的调度速率、 资源块的分配、 緩冲区数据量、 等待时延、 QCI类型、 MCS RSRP。 可选地， 负载相关信息还可以包括： 本小区的调度数据量和用户上 报的 CQI、 CSI、 RSRQ、 RSSI等信息。
当网络中不存在集中控制器时， 此步骤由基站执行， 小区的控制基站周 期性收集所有邻区的负载相关信息。
402, 计算当前网络的总效用函数。
网络控制节点根据负载相关信息发现网络中存在负载超过阈值的小区 时， 计算当前网络的总效用函数， 其中总效用函数可以是网络中所有用户的 调度速率的加权和， 或者是所有小区的平均调度优先级之和。
具体地， 总效用函数可以定义为：
其中用户 i 的历史调度速率为^ ( 表示对 的加权方式， 可选为 log(^) , 等等， 该公式表示对网络中所有用户的调度速率加权后求和， 用于 度量网络整体的负载程度。
总效用函数还可以定义为： ^ χ, γ, ζ,...)
其中小区 i的调度优先级为 小区时频资源上（例如资源块组
RBG 上）调度的用户优先级作为该时频资源上的优先级， 一段时间内所有 时频资源上的优先级的平均值 . 为小区的平均调度优先级, 用于表 示该小区的平均负载程度， 平均方式可以为算数平均， 或 alpha滤波。 用户 优先级计算的输入变量 X , y, z等等定义为： 用户数据包等待时延； 用户当 前信道状况下计算的瞬时频谱效率； 用户一段时间内的平均频谱效率； 用户 历史调度速率； 用户的 QoS加权等。
403 , 选出慢速协作小区。
根据步骤 401 中各个小区上报的负载相关信息选出负载超过阈值的小 区。 并根据负载相关信息中的 "本小区的快速协作邻区" 确定负载超过阈值 并且未进行过快速协作的小区。
404, 确定每个小区的负载均衡相关参数。
之后利用步骤 401中各个小区上报的负载相关信息和总效用函数预估修 改小区覆盖范围和发射功率语后网络总效用函数的变化，选择使得总效用函 数取得最优值的配置，其中最优值是指使得网络中所有用户调度速率的加权 和最大， 或者使得所有小区的平均调度优先级之和最低。
同频小区的覆盖范围可以通过小区切换和小区重选的条件来进行调节。 具体地， 小区切换的条件为：
Mn + Ofn + Ocn - Hys > Ms + Ofs + Ocs + Off
其中， 调节参数为 Ocn, Ocn是邻区的特定小区偏置， 作用于连接态的
UE, Mn是邻区的测量结果， Of 是邻区频率的特定频率偏置， Hys是滞后 参数， Ms是月良务小区的测量结果， Ofs是 Λ良务小区频率的特定频率偏置， Ocs是服务小区的特定小区偏置， Off是偏置参数。 Mn和 Ms在 PSPR中以 dBm为单位， 在 PSPQ 中以 dB为单位。 Ofh, Ocn, Ofs, Ocs, Hys, Off 都以 dB为单位。
同频小区重选的调节为：
Qmeans, n - Qoffset > Qmeans, s + Qhyst
其中，调节参数为 Qoffset, Qoffset为临区偏置值，作用于空闲态的 UE, Qmeans,n是临区的用于小区重选的 RSRP测量值， Qmeans,s是服务小区的 用于小区重选的 RSRP测量值， Qhyst用于指示滞后值， 其中 Qmeans,n和 Qmeans,s以 dBm为单位， Qoffset和 Qhyst以 dB为单位。
集中控制器在决定切换和小区重选的调节参数时，还可以同时决定每个 小区周期性发射功率谱，具体地，决定小区在特定周期内每个 ΤΉ、每个 PRB 上的发射功率值。
异频小区由集中控制器决定需要切换的用户集合和目标异频小区。
也就是说， 当网络中存在集中控制器时， 集中控制器通过调节切换和小 区重选的调节参数和小区的发射功率谱来估计调节后总效用函数的变化，通 过遍历的方法或者某种搜索算法确定使得总效用函数取得最大值 (网络中所 有用户调度速率的加权和）或者最小值（所有小区的平均调度优先级之和） 的负载均衡相关参数。
当网络中不存在集中控制器时， 由重载小区的控制基站根据本小区与所 有邻区总效用函数取得最大值的原则配置所有轻载同频邻区的 Ocn 和 Offset, 还可以同时决定本小区与所有轻载同频邻区的周期性发射功率谱， 还可以同时决定本小区发起异频切换的用户集合和目标异频小区。
405 , 下发负载均衡相关参数。
网络控制节点将负载均衡相关参数分别下发给各个慢速协作小区，慢速 协作小区则根据负载配置调整小区切换和小区重选的调节参数，从而能够调 整小区切换和小区重选的触发条件， 也就是说， 调整了小区的覆盖配置。
本发明实施例在不共 BBU的场景下， 通过使用一种资源利用的总效用 函数作为负载评估的指标， 综合考虑了空口资源使用情况、 用户业务的 QoS 需求、 用户的信道情况等因素， 动态的为慢速协作小区确定能够使得总效用 函数取得最优值的负载均衡相关参数， 从而能够实现全局最优的负载均衡。
图 5是本发明一个实施例的网络控制节点的示意框图。 如图 7所示， 网 络控制节点 500可包括确定单元 501、 调整单元 502和配置单元 503。
确定单元 501确定需要进行负载均衡的第一小区和参与负载均衡的第二 小区， 第一小区与第二小区相邻。 调整单元 502调整负载均衡相关参数， 其 中负载均衡相关参数包括如下信息之一或其组合： 小区切换相关参数， 小区 重选相关参数。 配置单元 503根据调整后的负载均衡相关参数对第一小区或 第二小区进行配置。
本发明实施例通过网络控制节点收集并综合考虑其控制的所有小区的 负载相关信息， 并以能够使得总效用函数或者效用函数取得最优值的负载均 衡相关参数对网络进行负载均衡， 从而实现全局最优的负载均衡。
网络控制节点 500可以执行图 1-图 4的方法实施例的各个步骤，为避免 重复， 不再贅述。
可选地， 作为一个实施例， 确定单元 501具体用于： 根据负载相关信息 确定网络控制节点控制的总效用函数； 确定能够使总效用函数取得最大值或 最小值的负载均衡相关参数。 其中总效用函数包括： 网络控制节点控制的所 有用户的调度速率的加权和； 或者网络控制节点控制的所有小区的调度优先 级之和。
可选地， 作为另一个实施例， 确定单元 501具体用于： 确定能够使得第 一类小区中所有用户的调度速率的加权和取得最大值的负载均衡相关参数； 或者确定能够使得第一类小区中所有小区的调度优先级之和取得最小值的 负载均衡相关参数。 其中负载均衡相关参数包括： 小区切换参数， 用于确定 小区切换的触发条件； 小区重选参数； 用于确定小区重选的触发条件； 发射 功率谱， 用于配置小区在每个时频资源上的发射功率值。 负载相关信息， 包 括： 小区的相邻小区中的第二类小区； 小区的 PRB利用率； 小区的历史调 度优先级； 小区中各个用户的调度速率、 分配 RB、 緩冲区数据量、 等待时 延、 QCI类型、 调制和编码配置 MCS ； RSRP。 负载相关信息还包括以下至 少一种： 小区的调度数据量； 小区中各个用户上报的 CSI、 RSRQ和 RSSI。
因此本发明实施例在不共 BBU的场景下， 通过使用一种资源利用的总 效用函数作为负载评估的指标， 综合考虑了空口资源使用情况、 用户业务的 QoS需求、 用户的信道情况等因素， 动态的为慢速协作小区确定能够使得总 效用函数取得最优值的负载均衡相关参数，从而能够实现全局最优的负载均 衡。
进一步地， 本发明实施例在共 BBU的场景下， 通过使用一种资源利用 的效用函数作为负载评估的指标， 综合考虑了空口资源使用情况、 用户业务 的 QoS需求、用户的信道情况等因素，动态的为快速协作小区确定目标调度 小区。 不需要通过小区切换的方法完成负载转移， 从而降低了负载均衡的粒 度和时延， 实现了对瞬时负载的快速平衡， 提高了用户体验。
图 6是本发明另一实施例的网络控制节点的示意框图。 图 6的网络控制 节点 600包括处理器 601、 存储器 602、 发射器 603和接收器 604。 处理器 601、 存储器 602、 发射器 603和接收器 604通过总线系统 605相连。
存储器 602用于存储使得处理器 601执行以下操作的指令： 接收网络控 制节点 600控制的所有小区中的每一个小区上报的负载相关信息； 根据负载 相关信息确定第一类小区和第一类小区的负载均衡相关参数； 向第一类小区 发送负载均衡相关参数。
基于上述技术方案，通过网络控制节点收集并综合考虑其控制的所有小 区的负载相关信息， 并以能够使得总效用函数或者效用函数取得最优值的负 载均衡相关参数对网络进行负载均衡， 从而实现全局最优的负载均衡。
处理器 601控制网络控制节点 600的操作，处理器 601还可以称为中央 处理单元（ Central Processing Unit, CPU )。 存储器 602可以包括只读存储器 和随机存取存储器， 并向处理器 601提供指令和数据。 存储器 602的一部分 还可以包括非易失性随机存取存储器 ( NVRAM )。 具体的应用中， 网络控制 节点 600的各个组件通过总线系统 605耦合在一起，其中总线系统 605除包 括数据总线之外， 还可以包括电源总线、 控制总线和状态信号总线等。 但是 为了清楚说明起见， 在图中将各种总线都标为总线系统 605。
上述本发明实施例揭示的方法可以应用于处理器 601中，或者由处理器 601实现。 处理器 601可能是一种集成电路芯片， 具有信号的处理能力。 在 实现过程中， 上述方法的各步骤可以通过处理器 601中的硬件的集成逻辑电 路或者软件形式的指令完成。 上述的处理器 601可以是通用处理器、 数字信 号处理器（DSP )、 专用集成电路（ASIC )、 现成可编程门阵列 （FPGA )或 者其他可编程逻辑器件、 分立门或者晶体管逻辑器件、 分立硬件组件。 可以 实现或者执行本发明实施例中的公开的各方法、 步骤及逻辑框图。 通用处理 器可以是微处理器或者该处理器也可以是任何常规的处理器等。 结合本发明 实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成， 或者 用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存 储器， 闪存、 只读存储器， 可编程只读存储器或者电可擦写可编程存储器、 寄存器等本领域成熟的存储介质中。该存储介质位于存储器 602,处理器 601 读取存储器 602中的信息， 结合其硬件完成上述方法的步骤。
关于以上实施例中所描述的快速协作过程，可以适用于多个小区之间的 负载均衡， 其中， 这些小区之间存在高容量低时延的通信链路、 使得这些小 区之间的 UE数据可以共享， 保持同步。 例如， 同一基站 （例如， eNB ) 下 的所有小区、 X2接口之间高速互连的 eNB下的所有小区， 或者 BBU集中 控制的所有小区。 所谓 BBU集中控制就是指， 这些小区的 BBU集中部署， 且 BBU之间可以通过高速互连总线相连。 需要说明的是， 这些 BBU集中部 署的结构视为一个基站， 该基站的射频结构（例如， RRU )可以通过光纤拉 远。
以下结合附图， 对快速协作的负载均衡方法进行详细的描述。 该方法用 于多个小区之间的负载均衡， 这些小区之间存在高容量低时延的通信链路、 使得这些小区之间的 UE数据可以共享， 保持同步。 例如， 同一基站（例如， eNB )下的所有小区、 X2接口之间高速互连的 eNB下的所有小区，或者 BBU 集中控制的所有小区。 如此， 这些小区之间可以通过消息交互来传递小区的 负载情况、 UE的调度信息和调度数据等， 使得在对 UE透明的情况下， 不 需要通过切换， 自动地快速协作调度达到负载平衡的目的。
具体， 请参考图 7, 其为本发明又一实施例提供的一种负载均衡方法的 信令流图。 在该实施例中， 通过协调相邻小区间的边缘 UE的调度小区， 将 边缘 UE的负载推向负载较轻的小区， 从而实现负载均衡。
如图 7所示， 服务小区存在边缘 UE, 且服务小区的邻区可能不止一个， 为了为边缘 UE选择合适的邻区，服务小区与邻区交互边缘 UE的状态信息， 以便邻区可以根据边缘 UE的状态信息， 计算该边缘 UE在本小区调度的效 用值，从而根据每个邻区的效用值，选择最佳邻区作为边缘 UE的调度小区。 而后通知调度小区为该边缘 UE分配数据信道， 而控制信道保留在服务小区 不进行切换， 如此， 可以在对 UE透明的情况下， 不需要通过切换， 自动地 快速协作调度达到负载平衡的目的。 具体， 该方法可以包括如下步骤：
S701 : 服务小区所在的实体将边缘 UE在服务小区的状态信息发送给服 务小区的邻区所在的实体。
S702: 邻区所在的实体根据边缘 UE在服务小区的状态信息计算在本小 区调度边缘 UE的效用值。 S703: 邻区所在的实体将计算得到的效用值发送 给服务小区所在的实体。
S704: 根据边缘 UE在邻区调度的效用值， 服务小区所在的实体确定边 缘 UE 的调度小区。 此时， 可以结合考虑服务小区的负载情况， 确定边缘 UE 的调度小区， 当然， 确定的调度小区可以是服务小区本身。 在本实施例 中， 确定的调度小区为服务小区的某个邻区， 而并非服务小区本身。 如果确 定的调度小区为服务小区本身， 后续对 UE的调度与现有技术相同， 在此不 再赘述。
S705: 服务小区所在的实体通知调度小区所在的实体为边缘 UE分配数 据信道资源。
S706: 调度小区所在的实体为边缘 UE分配数据信道资源。
S707:调度小区所在的实体将数据信道资源分配结果通知服务小区所在 的实体。 S708: 服务小区所在的实体根据数据信道资源分配结果， 为边缘 UE分 配控制信道资源。
S709: 服务小区所在的实体将边缘 UE待发送的数据发送给调度小区所 在的实体。
S710:调度小区所在的实体通过在调度小区分配的数据信道资源向边缘
UE发送数据。
以上邻区所在的实体通过信息知会服务小区所在的实体分配的数据信 道资源位置和使用的传输格式， 使得服务小区据此调度控制信道资源， 同时 将边缘待调度数据发送给邻区。
以上边缘 UE在服务小区的状态信息可以包括信道状态、 调度速率等信 息，信道状态例如可以为边缘 UE上报的参考信号接收功率（ Reference Signal Received Power, RSRP )、 参考信号接收质量 ( Reference Signal Received Quality, RSRQ )、 接收信号强度指示（Received Signal Strength Indicator, RSSI )、 信道状态信息（ Channel State Information, CSI ), 例如信道质量指示 ( Channel Quality Indicator, CQI )等信息中的一个或多个。 此外， 还可以包 括以下信息中的一个或多个： 调度调制与编码策略（ Modulation and Coding Scheme, MCS ), QoS权重， QoS类别标识（ QoS Class Identifier, QCI )等 信息。
边缘 UE在邻区被调度时， 瞬时速率可以根据边缘 UE在邻区上报的 RSRP或 RSRQ进行估计， 或结合服务小区全带宽 CQI和 RSRP估计， 或由 边缘 UE直接上报邻区的 CSI进行估计；
每个调度的时频资源上，服务小区和邻区根据选定的效用函数决定边缘 UE 的数据信道被哪个小区服务。 效用函数可以是该时频资源上每个小区调 度优先级之和， 其中每个小区的调度优先级可以以小区内最高优先级 UE的 优先级作为小区优先级。 边缘 UE在服务小区排序时， 可能优先级最高在服 务小区调度， 邻区调度其他 UE; 边缘 UE在邻区排序时， 也可能优先级最 高在邻区调度， 服务小区调度其他 UE。 选择边缘 UE的调度小区， 使得服 务小区和邻区调度优先级之和最大。
决定边缘 UE数据信道的调度小区的同时， 也可依据选定的效用函数， 协调服务小区和邻区最合适的发射功率， 例如， 降低服务小区的发射功率， 会降低服务小区的调度优先级， 但如果邻区调度的 UE受到服务小区干扰， 则同时会提升邻区的调度优先级， 选择合适的功率配置， 使得服务小区和邻 区调度优先级之和最大。 如此， 当 UE在邻区被调度时， 降低服务小区的发 射功率， 以降低对该类用户的干扰。
决定边缘 UE的数据信道的调度小区的同时，也可依据选定的效用函数， 协调服务小区和邻区的预编码矩阵指示（ Precoding Matrix Indicator, PMI )。 这是因为， 边缘 UE调度的频谱效率会根据服务小区的 PMI和邻区的 PMI 变化， 从而影响调度优先级的大小； 邻区调度边缘 UE的频谱效率也会根据 服务 PMI和干扰 PMI变化， 从而影响调度优先级大小。 选择合适的各小区 PMI组合， 使得服务小区和邻区调度优先级之和最大。 具体， 可以通过空间 波束方向协调降低两个小区之间的干扰。
决定 UE在哪个小区被调度时， 可以一个传输时间间隔 （Transmission Time Interval , ΤΤΙ )协商一次， 在同一时刻 UE被分配的频率资源只来自 一个小区； 也可以一个 TTI的每个 RBG上协商一次， 在同一时刻用户被分 配的频率资源可能来自两个小区。
另外， 当边缘 UE的数据信道被切换到邻区之后， 可以使用的 UE级参 考信号 ( UE-specific Reference signal ),发射模式为单天线端口 ( single-antenna port ) 或基于 UE级参考信号的多层传输模式进行传输。 UE的重传与初传 可以选择同样的小区发送， 例如都在调度小区发送； 或也可以初传在调度小 区， 而重传都在服务小区发送。 UE根据 ACK/NACK反馈调整 MCS时， 可 以按照初传调度小区的不同各自维护两套 CQI调整量。
通过以上描述可以知道， 当多个小区之间存在高容量低时延的通信链 路、 用户数据可以共享、 保持同步时， 认为这些小区具备快速协作的条件。 例如， 同一基站（例如， eNB )下的所有小区、 X2接口之间高速互连的 eNB 下的所有小区， 或者 BBU集中控制的所有小区。 这些小区中， 可能存在多 个小区具有边缘 UE , 以下实施例整体考虑从哪个小区的边缘 UE开始进行 负载均衡， 最终使得负载均衡的效果最佳。
请参考图 8, 其为本发明又一实施例提供的一种负载均衡的方法的流程 示意图。 如图所示， 包括如下步骤：
S801 : 确定具备快速协作条件的小区之间是否存在边缘 UE;
S802: 当具备快速协作条件的小区之间存在边缘 UE时， 检查边缘 UE 的服务小区控制信道负载。 若控制信道负载低于阈值， 说明服务小区的控制 信道存在可用的空余资源，则该服务小区是需要进行快速协作的小区。如此， 确定出至少一个需要进行快速协作的小区。 而后， 进行步骤 S803。
S803: 在每个调度时刻， 按照负载指标对所有需要快速协作的小区进行 排序； 负载指标可以为： 小区最高调度优先级， 或有数据量的待调度 UE数。 从负载最重的小区开始，
S804: 按照步骤 S803确定的顺序依次触发服务小区和邻区的快速协作 流程。 该快速协作流程具体如图 7的描述， 在此不再贅述。
需要说明的是，在以上步骤 S801中，边缘 UE可以通过服务小区的 RSRP 与邻区的 RSRP进行确定，例如某个 UE的服务小区的 RSRP与邻区的 RSRP 之差低于预设值， 则该 UE为边缘 UE, 当然， 确定边缘 UE的方式有多种， 此为本领域技术人员所熟知， 在此不再贅述。
另外， 以上步骤 S802可以放在步骤 S804之前进行。 也就是说， 可以在 排好序以后， 在触发快速协作的时候， 判断边缘 UE的服务小区的控制信道 负载是否低于阈值，也就是说判断控制信道资源是否够用，在够用的情况下， 触发服务小区和邻区的快速协作流程。 需要说明的是， 控制信道负载可以通 过控制信道元素（Control Channel Element, CCE )利用率来确定。 另夕卜， 控 制信道负载的阈值可以根据允许快速协作的规格设置，例如每 ΤΉ允许多少 比例的 UE到邻区调度。 当然， 对于控制信道负载的阈值， 本领域技术人员 可以根据具体需要进行设置， 本发明实施例不做任何限制。
请参考图 9, 其为本发明又一实施例提供的一种负载均衡装置的结构示 意图。 该负载均衡装置位于边缘 UE的服务小区所在的第一实体。 如图 9所 示， 该装置 900包括选择单元 910、 接口单元 920和分配单元 930。 其中， 选择单元 910用于从服务小区的邻区中为边缘 UE选择调度小区， 其中调度 小区所在的实体为第二实体。 接口单元 920用于与第二实体进行交互， 包括 通知第二实体在调度小区为边缘 UE分配数据信道资源， 并用于接收第二实 体发送的数据信道资源的分配结果。分配单元 930用于根据数据信道资源的 分配结果， 在服务小区为边缘 UE分配控制信道资源。 且接口单元 920还用 于将边缘 UE 的数据发送给第二实体， 以通过分配的数据信道资源将边缘 UE的数据发送给该边缘 UE。
可见， 在以上实施例中， 服务小区通知调度小区为该边缘 UE分配数据 信道， 而控制信道保留在服务小区不进行切换， 如此， 可以在对 UE透明的 情况下， 不需要通过切换， 自动地快速协作调度达到负载平衡的目的。
选择单元 910选择调度小区的方式可以通过比较边缘 UE在每个邻区调 度的效用值来实现。 具体， 接口单元 920可以获取边缘 UE在服务小区的每 个邻区中调度的效用值， 选择单元根据边缘 UE在每个邻区调度的效用值， 从这些邻区中选择效用值最佳的小区作为调度小区。 边缘 UE在每个邻区中 调度的效用值是该邻区所在的实体根据边缘 UE在服务小区的状态信息确定 的。 具体， 可以参考以上实施例， 在此不再贅述。
另外， 通过以上描述可以知道， 服务小区和其邻区中， 可能存在多个小 区具有边缘 UE, 可选的， 可以从负载最重的小区的边缘 UE开始进行负载 均衡， 最终使得负载均衡的效果最佳。
此时，请参考图 10, 负载均衡装置 900还可以包括排序单元 940和确定 单元 950。 其中， 排序单元 940用于将满足条件的所有小区按照负载指标进 行排序， 确定单元 950用于确定负载最重的小区内的边缘 UE为当前待调度 的边缘 UE。 该满足的条件为小区之间的通信链路的容量和时延使得这些小 区之间的 UE数据可以共享且保持同步。关于负载指标的描述同以上实施例， 在此不再赘述。
可选的， 在触发快速协作的时候， 即在为边缘 UE选择调度小区之前， 可以先判断边缘 UE的服务小区的控制信道负载是否低于阈值， 也就是说判 断控制信道资源是否够用， 在够用的情况下， 触发服务小区和邻区的快速协 作流程。
请参考图 11 , 此时， 负载均衡装置 900还可以包括检测单元 960, 用于 检测所述边缘 UE的服务小区的控制信道负载； 选择单元 910进一步用于在 所述控制信道负载低于阈值时， 为边缘 UE选择调度小区。
同以上实施例， 本实施例中的控制信道可以为 PDCCH, 数据信道可以 为 PDSCH。
需要说明的是， 本实施例中的接口单元 920可以为基站内部接口电路， 也可以 X2接口。 例如， 当服务小区和调度小区为同一基站下的小区或 BBU 集中控制的小区时， 接口单元 920可以为基站内部的接口电路或 BBU之间 互连的高速总线的接口； 当服务小区和调度小区为不同基站下的小区时， 该 接口单元 920可以为 X2接口。 选择单元 910可以为单独设立的处理器， 也 可以集成在基站的某一个处理器中实现， 此外， 也可以以程序代码的形式存 储于基站的存储器中， 由基站的某一个处理器调用并执行以上选择单元 910 的功能。 分配单元 930、 排序单元 940、 确定单元 950和检测单元 960中每 个单元的实现可以同选择单元 910, 且可以与选择单元 910集成在一起， 也 可以独立实现。这里所述的处理器可以是一个中央处理器（ Central Processing Unit, CPU ), 或者是特定集成电路（Application Specific Integrated Circuit, ASIC ), 或者是被配置成实施本发明实施例的一个或多个集成电路。
请参考图 12,其为本发明又一实施例提供的一种负载均衡装置的结构示 意图。该负载均衡装置位于边缘 UE的调度小区所在的第二实体，该装置 120 包括接口单元 121、 分配单元 122和发送单元 123。 其中， 接口单元 121用 于接收第一实体发送的通知消息， 该第一实体为边缘 UE的服务小区所在的 实体， 且该通知消息为第一实体从服务小区的邻区中为边缘 UE选择调度小 区后发送给第二实体的，且用于通知第二实体为边缘 UE分配数据信道资源； 分配单元 122用于根据通知消息，在调度小区为边缘 UE分配数据信道资源； 接口单元 121还用于将数据信道资源分配的结果发送给第一实体，使得第一 实体根据数据信道资源分配的结果在服务小区为边缘 UE 分配控制信道资 源， 并将边缘 UE的数据发送给第二实体， 且还用于接收边缘 UE的数据； 发送单元 123用于通过分配的数据信道资源将向边缘 UE发送数据。
第一实体从服务小区的邻区中为边缘 UE选择调度小区的方式可以通过 比较边缘 UE在各个邻区调度的效用值来实现。 此时， 请参考图 13 , 负载均 衡装置 120还可以包括确定单元 124。 接口单元 121接收第一实体发送的边 缘 UE在服务小区的状态信息； 确定单元 124用于根据边缘 UE在服务小区 的状态信息，确定边缘 UE在调度小区中调度的效用值； 而后通过接口单元， 121将确定单元 124确定的所述效用值发送给第一实体， 以便第一实体根据 该效用值选择调度小区。
同以上实施例， 本实施例中的控制信道可以为 PDCCH, 数据信道可以 为 PDSCH。 需要说明的是， 本实施例中的接口单元 121 可以为基站内部接 口电路， 也可以 X2接口。 例如， 当服务小区和调度小区为同一基站下的小 区或 BBU集中控制的小区时， 接口单元 121可以为基站内部的接口电路或 BBU之间互连的高速总线的接口； 当服务小区和调度小区为不同基站下的 小区时， 该接口单元 121可以为 X2接口。 发送单元 123可以为基站的发射 机， 或者与接收机集成在一起的收发机。 分配单元 122可以为单独设立的处 理器， 也可以集成在基站的某一个处理器中实现， 此外， 也可以以程序代码 的形式存储于基站的存储器中， 由基站的某一个处理器调用并执行以上分配 单元 122的功能。 确定单元 124的实现可以同分配单元 122, 且可以与分配 单元 122集成在一起， 也可以独立实现。 这里所述的处理器可以是一个中央 处理器（ Central Processing Unit, CPU ), 或者是特定集成电路（ Application Specific Integrated Circuit, ASIC ), 或者是被配置成实施本发明实施例的一 个或多个集成电路。
请参考图 14,其为本发明又一实施例提供的一种负载均衡装置的结构示 意图。 该装置 140位于边缘用户设备 UE的服务小区所在的第一实体， 包括 处理器 141和接口电路 142, 图中还示出了存储器 143和总线 144, 该处理 器 141、接口电路 142和存储器 143通过总线 144连接并完成相互间的通信。
该总线 144可以是工业标准体系结构 ( Industry Standard Architecture, ISA )总线、 外部设备互连（ Peripheral Component, PCI )总线或扩展工业标 准体系结构 ( Extended Industry Standard Architecture, EISA ) 总线等。 该总 线 144可以分为地址总线、 数据总线、 控制总线等。 为便于表示， 图 14中 仅用一条粗线表示， 但并不表示仅有一根总线或一种类型的总线。
存储器 143用于存储可执行程序代码，该程序代码包括计算机操作指令。 存储器 143 可能包含高速 RAM存储器， 也可能还包括非易失性存储器 ( non-volatile memory ), 例 口至少一个磁盘存 4诸器。
处理器 141可以是一个中央处理器（ Central Processing Unit, CPU ), 或 者是特定集成电路 ( Application Specific Integrated Circuit, ASIC ), 或者是 被配置成实施本发明实施例的一个或多个集成电路。
其中，处理器 141用于实现以上服务小区所在的第一实体的功能。例如， 用于执行以下操作：
从服务小区的邻区中为边缘 UE选择调度小区；
通过接口电路 142通知第二实体在调度小区为边缘 UE分配数据信道资 源；
通过接口电路 142接收第二实体发送的数据信道资源的分配结果，并根 据所述数据信道资源的分配结果，在服务小区为边缘 UE分配控制信道资源； 通过接口电路 142将边缘 UE的数据发送给第二实体， 以通过第二实体 分配的数据信道资源将边缘 UE的数据发送给该边缘 UE。 进一步的 , 处理器 141还可以通过接口电路 142获取边缘 UE在所有邻 区中调度的效用值； 根据边缘 UE在所有邻区调度的效用值， 从所有邻区中 选择效用值最佳的小区作为调度小区。
进一步的， 处理器 141可以通过接口电路 142将边缘 UE在服务小区的 状态信息发送给邻区所在的实体， 使得邻区所在的实体根据边缘 UE在服务 小区的状态信息计算边缘 UE在本小区调度的效用值； 并通过接口电路 142 接收每个邻区所在的实体计算得到的效用值； 从而根据接收到的效用值， 选 择调度小区。
进一步的， 处理器 141还可以从负载最重的小区开始负载平衡操作。 具 体， 处理器 141可以将满足条件的所有小区按照负载指标进行排序； 确定负 载最重的小区内的边缘 UE为待调度的所述边缘 UE。 而后， 重复以上操作， 直至达到负载平衡。 所述满足的条件为小区之间的通信链路的容量和时延使 得这些小区之间的 UE数据可以共享且保持同步。 其中， 负载指标同以上实 施的描述， 在此不再贅述。
进一步的，处理器 141还可以检测边缘 UE的服务小区的控制信道负载； 在控制信道资源充足时， 在进行负载平衡处理。 具体， 当检测到控制信道负 载低于阈值时， 为边缘 UE选择调度小区。 其中， 阈值同以上实施的描述， 在此不再赘述。
请参考图 15 ,其为本发明又一实施例提供的一种负载均衡装置的结构示 意图。 该装置 150位于边缘用户设备 UE的调度小区所在的第二实体， 包括 处理器 151和接口电路 152, 图中还示出了存储器 153、 总线 154和收发器 155 , 该处理器 151、 接口电路 152、 存储器 153和收发器 155通过总线 154 连接并完成相互间的通信。
该总线 154可以是工业标准体系结构 ( Industry Standard Architecture, ISA )总线、 外部设备互连（ Peripheral Component, PCI )总线或扩展工业标 准体系结构 ( Extended Industry Standard Architecture, EISA ) 总线等。 该总 线 154可以分为地址总线、 数据总线、 控制总线等。 为便于表示， 图 15中 仅用一条粗线表示， 但并不表示仅有一根总线或一种类型的总线。
存储器 153用于存储可执行程序代码，该程序代码包括计算机操作指令。 存储器 153 可能包含高速 RAM存储器， 也可能还包括非易失性存储器 ( non-volatile memory ), 例 口至少一个磁盘存 4诸器。 处理器 151可以是一个中央处理器（Central Processing Unit, CPU ), 或 者是特定集成电路 ( Application Specific Integrated Circuit, ASIC ), 或者是 被配置成实施本发明实施例的一个或多个集成电路。
其中，处理器 151用于实现以上调度小区所在的第二实体的功能。例如， 用于执行以下操作：
通过接口电路 152接收第一实体发送的通知消息， 该通知消息为第一实 体从服务小区的邻区中为边缘 UE选择调度小区后发送给第二实体的， 且用 于通知第二实体为边缘 UE分配数据信道资源；
根据以上通知消息， 在调度小区为边缘 UE分配数据信道资源； 通过接口电路 152将数据信道资源分配的结果发送给第一实体，使得第 一实体根据该数据信道资源分配的结果在服务小区为边缘 UE分配控制信道 资源， 并将边缘 UE的数据发送给第二实体；
通过接口电路 152接收所述边缘 UE的数据， 并利用收发器 155通过分 配的数据信道资源将向边缘 UE发送数据。
进一步的， 处理器 151还可以通过接口电路 152接收第一实体发送的边 缘 UE在服务小区的状态信息； 根据边缘 UE在服务小区的状态信息， 确定 边缘 UE在调度小区中调度的效用值； 将该效用值通过接口电路 152发送给 所述第一实体， 以便第一实体根据效用值选择调度小区。 需要说明的是， 以 上服务小区或邻区所在的实体可以为处理核、处理器、基带板或基站。例如， 当服务小区和某个邻区 （例如， 选定的调度小区）在同一基站下时， 服务小 区和该邻区所在的实体可以是同一基站， 也可以是同一基站下的不同基带 板， 或者是同一基带板下的不同处理器， 或者是同一处理器的不同处理核； 再如， 当服务小区和某个邻区为 BBU集中控制下的小区， 服务小区和该邻 区所在的实体可以是不同的 BBU, 也可以是同一 BBU下的不同处理器或处 理核； 再如， 当服务小区和某个邻区为 X2接口之间高速互连的不同基站下 的小区， 则服务小区和该邻区所在的实体可以是不同的基站。
此外， 以上控制信道可以为物理下行控制信道（PDCCH ), 数据信道可 以为物理下行共享信道（PDSCH )。 请参考图 16, 其为本发明另一实施例提 供的一种负载均衡方法的流程图。 如图所示， 该负载均衡方法应用于同一基 站下的小区， 或者 BBU集中控制的所有小区。 如图 16所示， 该方法包括如 下步骤： S161 : 边缘 UE 的服务小区所在的基站从该服务小区的邻区中为边缘 UE选择调度小区。 此时， 调度小区和服务小区位于同一基站下。
S162: 该基站在调度小区为边缘 UE分配数据信道资源；
S163: 根据数据信道资源的分配结果， 在服务小区为边缘 UE分配控制 信道资源；
S164: 通过在调度小区分配的数据信道资源向边缘 UE发送数据， 且通 过在服务小区分配的控制信道资源向边缘 UE发送控制信令。
进一步的， 基站可以通过获取边缘 UE在所有邻区中调度的效用值； 从 中选择效用值最佳的邻区作为调度小区。 关于效用值的获取， 可以根据 UE 在服务小区的状态信息计算获得。
另外， 基站也可以对满足条件的所以小区按照负载指标进行排序， 而后 从负载最重的小区开始进行负载平衡， 即执行图 16所示的操作。 所述满足 的条件为小区之间的通信链路的容量和时延使得这些小区之间的 UE数据可 以共享且保持同步。
此外， 基站还可以在进行负载平衡之前， 即执行图 16所示的操作之前， 检测边缘 UE的服务小区的控制信道负载， 当控制信道资源充足时， 执行图 16所示的操作。 具体可以在控制信道负载低于阈值时， 为边缘 UE选择调度 小区。
请参考图 17, 其为本发明另一实施例提供的一种负载均衡方法的流程 图。 如图所示， 该负载均衡方法应用于不同基站下的小区。 如图 17所示， 该方法包括如下步骤：
S171 : 边缘 UE 的服务小区所在的基站从该服务小区的邻区中为边缘 UE选择调度小区。
此时， 调度小区和服务小区位于不同基站下， 且服务小区所在的基站为 第一基站， 调度小区所在的基站为第二基站时， 以上方法还包括：
S 172:第一基站通知第二基站在调度小区为边缘 UE分配数据信道资源； S173: 第一基站接收第二基站发送的数据信道资源的分配结果；
S174: 第一基站根据该数据信道资源的分配结果， 在服务小区为边缘 UE分配控制信道资源；
S175: 第一基站通过在服务小区分配的控制信道资源向边缘 UE发送控 制信令， 且将边缘 UE的数据发送给第二基站， 以通过在调度小区分配的数 据信道资源将边缘 UE的数据发送给边缘 UE。
进一步的，第一基站可以通过获取边缘 UE在所有邻区中调度的效用值； 从中选择效用值最佳的邻区作为调度小区。 关于效用值的获取， 可以根据 UE在服务小区的状态信息计算获得。 例如， 第一基站可以将边缘 UE在服 务小区的状态信息发送给第二基站， 使得第二基站根据边缘 UE在服务小区 的状态信息计算在本小区调度该边缘 UE 的效用值，从而将效用值发给第一 基站， 供第一基站选择调度小区。
本领域普通技术人员可以意识到， 结合本文中所公开的实施例描述的各 示例的单元及算法步骤， 能够以电子硬件、 或者计算机软件和电子硬件的结 合来实现。 这些功能究竟以硬件还是软件方式来执行， 取决于技术方案的特 法来实现所描述的功能， 但是这种实现不应认为超出本发明的范围。
所属领域的技术人员可以清楚地了解到， 为描述的方便和简洁， 上述描 述的系统、 装置和单元的具体工作过程， 可以参考前述方法实施例中的对应 过程， 在此不再贅述。
在本申请所提供的几个实施例中， 应该理解到， 所揭露的系统、 装置和 方法， 可以通过其它的方式实现。 例如， 以上所描述的装置实施例仅仅是示 意性的， 例如， 所述单元的划分， 仅仅为一种逻辑功能划分， 实际实现时可 以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个 系统， 或一些特征可以忽略， 或不执行。 另一点， 所显示或讨论的相互之间 的耦合或直接耦合或通信连接可以是通过一些接口， 装置或单元的间接耦合 或通信连接， 可以是电性， 机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作 为单元显示的部件可以是或者也可以不是物理单元， 即可以位于一个地方， 或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或 者全部单元来实现本实施例方案的目的。
另外， 在本发明各个实施例中的各功能单元可以集成在一个处理单元 中， 也可以是各个单元单独物理存在， 也可以两个或两个以上单元集成在一 个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使 用时， 可以存储在一个计算机可读取存储介质中。 基于这样的理解， 本发明 的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部 分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质 中， 包括若干指令用以使得一台计算机设备（可以是个人计算机， 服务器， 或者网络设备等）执行本发明各个实施例所述方法的全部或部分步骤。 而前 述的存储介质包括: U盘、移动硬盘、只读存储器（ ROM, Read-Only Memory )、 随机存取存储器（RAM, Random Access Memory ), 磁碟或者光盘等各种可 以存储程序代码的介质。
以上所述， 仅为本发明的具体实施方式， 但本发明的保护范围并不局限 于此， 任何熟悉本技术领域的技术人员在本发明揭露的技术范围内， 可轻易 想到变化或替换， 都应涵盖在本发明的保护范围之内。 因此， 本发明的保护 范围应所述以权利要求的保护范围为准。

Claims

权利要求
1. 一种负载均衡的方法， 其特征在于， 包括：
边缘用户设备 UE的服务小区所在的第一实体从所述服务小区的邻区中 为所述边缘 UE选择调度小区， 所述调度小区所在的实体为第二实体；
所述第一实体通知所述第二实体在所述调度小区为所述边缘 UE分配数 据信道资源；
所述第一实体接收所述第二实体发送的所述数据信道资源的分配结果， 并根据所述数据信道资源的分配结果， 在所述服务小区为所述边缘 UE分配 控制信道资源；
所述第一实体将所述边缘 UE的数据发送给所述第二实体， 以通过分配 的所述数据信道资源将所述边缘 UE的数据发送给所述边缘 UE。
2. 根据权利要求 1所述的方法，其特征在于，所述第一实体为所述边缘 UE选择调度小区， 包括：
获取所述边缘 UE在所有邻区中调度的效用值；
根据所述边缘 UE在所有邻区调度的效用值， 从所有邻区中选择效用值 最佳的小区作为调度小区。
3. 根据权利要求 2所述的方法， 其特征在于， 所述获取所述边缘 UE在 所有邻区中调度的效用值包括： 获取所述边缘 UE在第一邻区中调度的效用 值， 所述第一邻区为所述所有邻区中的任一邻区， 所述获取所述边缘 UE在 第一邻区中调度的效用值， 包括：
所述第一实体向所述第一邻区所在的实体发送所述边缘 UE在所述服务 小区的状态信息；
接收所述第一邻区所在的实体根据所述边缘 UE的状态信息确定的所述 边缘 UE在所述第一邻区中调度的效用值。
4. 根据权利要求 1至 3任一项所述的方法，其特征在于，在所述第一实 体为所述边缘 UE选择调度小区之前， 还包括：
确定待调度的所述边缘 UE, 包括：
将满足条件的所有小区按照负载指标进行排序；
确定负载最重的小区内的边缘 UE为待调度的所述边缘 UE。
5. 根据权利要求 4所述的方法，其特征在于，所述满足的条件为小区之 间的通信链路的容量和时延使得这些小区之间的 UE数据可以共享且保持同 步。
6. 根据权利要求 4或 5所述的方法，其特征在于，所述负载指标包括小 区最高调度优先级； 或有数据量的待调度 UE数。
7. 根据权利要求 1至 6任一项所述的方法， 其特征在于， 在所述第一 实体为所述边缘 UE选择调度小区之前， 还包括：
检测所述边缘 UE的服务小区的控制信道负载；
当所述控制信道负载低于阈值时， 为所述边缘 UE选择调度小区。
8. 根据权利要求 1至 7任一项所述的方法， 其特征在于， 所述控制信 道为物理下行控制信道 PDCCH , 所述数据信道为物理下行共享信道 PDSCH。
9、 一种负载均衡的方法， 其特征在于， 包括：
边缘用户设备 UE的调度小区所在的第二实体接收第一实体发送的通知 消息， 所述第一实体为所述边缘 UE的服务小区所在的实体， 且所述通知消 息为所述第一实体从所述服务小区的邻区中为所述边缘 UE选择所述调度小 区后发送给所述第二实体， 且用于通知所述第二实体为所述边缘 UE分配数 据信道资源；
所述第二实体根据所述通知消息， 在所述调度小区为所述边缘 UE分配 数据信道资源；
所述第二实体将所述数据信道资源分配的结果发送给所述第一实体，使 得所述第一实体根据所述数据信道资源分配的结果在所述服务小区为所述 边缘 UE分配控制信道资源 ,并将所述边缘 UE的数据发送给所述第二实体； 所述第二实体接收所述边缘 UE的数据， 并通过分配的所述数据信道资 源将所述边缘 UE的数据发送给所述边缘 UE。
10、 根据权利要求 9所述的方法， 其特征在于， 在所述第二实体接收所 示第一实体发送的通知消息之前， 还包括：
接收所述第一实体发送的所述边缘 UE在所述服务小区的状态信息； 根据所述边缘 UE在所述服务小区的状态信息， 确定所述边缘 UE在所 述调度小区中调度的效用值；
将所述效用值发送给所述第一实体， 以便所述第一实体根据所述效用值 选择所述调度小区。
11、 根据权利要求 9或 10所述的方法， 其特征在于， 所述控制信道为 物理下行控制信道 PDCCH, 所述数据信道为物理下行共享信道 PDSCH。
12、 一种负载均衡的装置， 其特征在于， 位于边缘用户设备 UE的服务 小区所在的第一实体， 所述装置包括：
选择单元， 从所述服务小区的邻区中为所述边缘 UE选择调度小区， 所 述调度小区所在的实体为第二实体；
接口单元， 用于通知所述第二实体在所述调度小区为所述边缘 UE分配 数据信道资源， 并用于接收所述第二实体发送的所述数据信道资源的分配结 果；
分配单元， 用于根据所述数据信道资源的分配结果， 在所述服务小区为 所述边缘 UE分配控制信道资源；
所述接口单元， 还用于将所述边缘 UE的数据发送给所述第二实体， 以 通过分配的所述数据信道资源将所述边缘 UE的数据发送给所述边缘 UE。
13、 根据权利要求 12所述的装置， 其特征在于， 所述接口单元还用于 获取所述边缘 UE在所有邻区中调度的效用值；
所述选择单元具体用于根据所述边缘 UE在所有邻区调度的效用值， 从 所有邻区中选择效用值最佳的小区作为调度小区。
14、 根据权利要求 13所述的装置， 其特征在于， 所述边缘 UE在所有 邻区中调度的效用值是每个邻区所在的实体根据所述边缘 UE在所述服务小 区的状态信息确定的。
15、 根据权利要求 12至 14任一项所述的装置， 其特征在于， 还包括： 排序单元， 用于将满足条件的所有小区按照负载指标进行排序； 确定单元， 用于确定负载最重的小区内的边缘 UE为待调度的所述边缘
UE。
16、 根据权利要求 15所述的装置， 其特征在于， 所述满足的条件为小 区之间的通信链路的容量和时延使得这些小区之间的 UE数据可以共享且保 持同步。
17、 根据权利要求 15或 16所述的装置， 其特征在于， 所述负载指标包 括小区最高调度优先级； 或有数据量的待调度 UE数。
18、 根据权利要求 12至 17任一项所述的装置， 其特征在于， 还包括： 检测单元， 用于检测所述边缘 UE的服务小区的控制信道负载； 所述选择单元， 用于在所述控制信道负载低于阈值时， 为所述边缘 UE 选择所述调度小区。
19、 根据权利要求 12至 18任一项所述的装置， 其特征在于， 所述控制 信道为物理下行控制信道 PDCCH , 所述数据信道为物理下行共享信道 PDSCH0
20、 一种负载均衡的装置， 其特征在于， 位于边缘用户设备 UE的调度 小区所在的第二实体， 所述装置包括：
接口单元， 用于接收第一实体发送的通知消息， 所述第一实体为所述边 缘 UE的服务小区所在的实体， 且所述通知消息为所述第一实体从所述服务 小区的邻区中为所述边缘 UE选择所述调度小区后发送给所述第二实体， 且 用于通知所述第二实体为所述边缘 UE分配数据信道资源；
分配单元， 用于根据所述通知消息， 在所述调度小区为所述边缘 UE分 配数据信道资源；
所述接口单元，还用于将所述数据信道资源分配的结果发送给所述第一 实体，使得所述第一实体根据所述数据信道资源分配的结果在所述服务小区 为所述边缘 UE分配控制信道资源， 并将所述边缘 UE的数据发送给所述第 二实体， 且还用于接收所述边缘 UE的数据；
发送单元， 用于通过分配的所述数据信道资源将向所述边缘 UE发送数 据。
21、 根据权利要求 20所述的装置， 其特征在于， 所述接口单元， 还用 于接收所述第一实体发送的所述边缘 UE在所述服务小区的状态信息； 且所 述装置还包括：
确定单元， 用于根据所述接口单元接收的所述边缘 UE在所述服务小区 的状态信息， 确定所述边缘 UE在所述调度小区中调度的效用值； 一实体， 以便所述第一实体根据所述效用值选择所述调度小区。
22、 根据权利要求 20或 21所述的装置， 其特征在于， 所述控制信道为 物理下行控制信道 PDCCH, 所述数据信道为物理下行共享信道 PDSCH。
23、 一种负载均衡的系统， 其特征在于， 包括如权利要求 12至 19任一 项所述的第一负载均衡的装置和如权利要求 20至 22任一项所述的第二负载 均衡的装置。
PCT/CN2013/089367 2012-12-31 2013-12-13 负载均衡的方法和网络控制节点 WO2014101674A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CN201380001730.7A CN103828422A (zh) 2012-12-31 2013-12-13 负载均衡的方法和网络控制节点
KR1020157020791A KR101660351B1 (ko) 2012-12-31 2013-12-13 부하 밸런싱 방법 및 네트워크 제어 노드
EP13868286.9A EP2941044A4 (en) 2012-12-31 2013-12-13 LOAD BALANCING METHOD AND NETWORK CONTROL NODE
US14/788,202 US20150304889A1 (en) 2012-12-31 2015-06-30 Load balancing method and network control node

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNPCT/CN2012/088148 2012-12-31
PCT/CN2012/088148 WO2014101243A1 (zh) 2012-12-31 2012-12-31 负载均衡的方法和网络控制节点

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14/788,202 Continuation US20150304889A1 (en) 2012-12-31 2015-06-30 Load balancing method and network control node

Publications (1)

Publication Number Publication Date
WO2014101674A1 true WO2014101674A1 (zh) 2014-07-03

Family

ID=51019825

Family Applications (2)

Application Number Title Priority Date Filing Date
PCT/CN2012/088148 WO2014101243A1 (zh) 2012-12-31 2012-12-31 负载均衡的方法和网络控制节点
PCT/CN2013/089367 WO2014101674A1 (zh) 2012-12-31 2013-12-13 负载均衡的方法和网络控制节点

Family Applications Before (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/088148 WO2014101243A1 (zh) 2012-12-31 2012-12-31 负载均衡的方法和网络控制节点

Country Status (4)

Country Link
US (1) US20150304889A1 (zh)
EP (1) EP2941044A4 (zh)
KR (1) KR101660351B1 (zh)
WO (2) WO2014101243A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3223555A4 (en) * 2014-12-12 2017-10-25 Huawei Technologies Co., Ltd. Method for improving processing capacity of base station, base band device, base station and system
CN111580968A (zh) * 2020-05-07 2020-08-25 广西大学 基于雾计算的医疗云平台负载自动均衡方法、系统及介质

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9872210B2 (en) * 2013-10-16 2018-01-16 At&T Mobility Ii Llc Adaptive rate of congestion indicator to enhance intelligent traffic steering
GB2526617A (en) * 2014-05-30 2015-12-02 Nec Corp Communication system
WO2016032378A1 (en) * 2014-08-28 2016-03-03 Telefonaktiebolaget L M Ericsson (Publ) Methods receiving radiation pattern information and related network nodes and base stations
EP3187014B1 (en) 2014-08-28 2019-11-27 Telefonaktiebolaget LM Ericsson (publ) Methods for communicating radiation pattern information and related network nodes and base stations
US9681451B1 (en) * 2014-10-08 2017-06-13 Sprint Spectrum L.P. Reducing PDCCH interference
CN111885738B (zh) * 2014-12-18 2022-09-02 华为技术有限公司 一种获取站点设备请求的方法、接入点设备及站点设备
US9813939B1 (en) * 2015-11-05 2017-11-07 Sprint Spectrum L.P. Management of channel state information reporting rate in a communication system
CN105516369A (zh) * 2016-02-04 2016-04-20 城云科技（杭州）有限公司 视频云平台负载均衡方法及视频云平台负载均衡调度器
US11224039B2 (en) * 2016-10-31 2022-01-11 Telefonaktiebolaget Lm Ericsson (Publ) Systems and methods of sharing channel information between co-located radio nodes
CN106714239B (zh) * 2016-12-14 2022-02-22 北京拓明科技有限公司 一种lte网络负载自动均衡的方法和系统
US10979530B2 (en) 2017-03-03 2021-04-13 LGS Innovations LLC Methods and apparatuses for batch radio resource command and control
KR102483329B1 (ko) * 2018-06-27 2023-01-02 삼성전자주식회사 무선 통신 시스템에서 액세스 포인트에 접속하는 방법 및 단말
CN110753372B (zh) * 2018-07-24 2023-05-30 中兴通讯股份有限公司 基带处理分离架构中的信息处理方法、装置及存储介质
CN110831052B (zh) * 2018-08-07 2021-11-12 大唐移动通信设备有限公司 一种基于周期测量报告的负载均衡方法及装置
US11848717B2 (en) * 2018-10-17 2023-12-19 Verizon Patent And Licensing, Inc. Profiling of wireless local area network performance
CN111356179B (zh) * 2018-12-21 2023-10-17 中兴通讯股份有限公司 一种均衡负荷的方法、装置、设备及存储介质
WO2020222107A1 (en) * 2019-05-02 2020-11-05 Telefonaktiebolaget Lm Ericsson (Publ) Determining available capacity per cell partition
US11006432B2 (en) * 2019-08-06 2021-05-11 At&T Intellectual Property I, L.P. Managing signal traffic in a 5G or other next generation wireless network
CN110381539B (zh) * 2019-08-28 2023-04-18 中国联合网络通信集团有限公司 网络负荷均衡的方法、装置及系统
US11523377B2 (en) * 2020-02-14 2022-12-06 T-Mobile Usa, Inc. LTE resource allocation controller
US20210360474A1 (en) * 2020-05-15 2021-11-18 Samsung Electronics Co., Ltd. Methods and apparatus for network load balancing optimization
CN113709815A (zh) * 2020-05-22 2021-11-26 中兴通讯股份有限公司 负荷调整方法、服务器及存储介质
JP2022158830A (ja) * 2021-03-31 2022-10-17 スターライト テクノロジーズ リミテッド オープン無線アクセスネットワーク環境におけるハンドオーバーのためのターゲットセル推薦方法
US20230030173A1 (en) * 2021-07-29 2023-02-02 Celona, Inc. Load balancing for enterprise deployments
US11792712B2 (en) 2021-12-23 2023-10-17 T-Mobile Usa, Inc. Cell reselection priority assignment based on performance triggers

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101895940A (zh) * 2010-07-26 2010-11-24 北京邮电大学 主服务小区和协作小区之间资源分配的方法
CN102325375A (zh) * 2011-06-29 2012-01-18 中兴通讯股份有限公司 资源分配方法及装置
CN102752824A (zh) * 2012-06-29 2012-10-24 中国联合网络通信集团有限公司 异系统切换方法及装置

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
HUE049792T2 (hu) * 2003-08-25 2020-10-28 Signal Trust For Wireless Innovation Javított uplink mûködés puha hívásátadásnál
JP5380291B2 (ja) * 2007-07-31 2014-01-08 株式会社エヌ・ティ・ティ・ドコモ 移動通信システムにおける基地局装置及び情報通知方法
MX2011003100A (es) * 2008-09-26 2011-04-19 Ericsson Telefon Ab L M Tecnicas para cooperacion de enlace ascendente de nodos de acceso.
US20100215011A1 (en) * 2009-02-26 2010-08-26 Interdigital Patent Holdings, Inc. Method and apparatus for switching a resource assignment mode for a plurality of component carriers
US8903413B2 (en) * 2009-03-20 2014-12-02 Qualcomm Incorporated Hybrid cell management in wireless networks
WO2011028158A1 (en) * 2009-09-02 2011-03-10 Telefonaktiebolaget L M Ericsson (Publ) Method and arrangement for improving radio network characteristics
US9232462B2 (en) * 2009-10-15 2016-01-05 Qualcomm Incorporated Methods and apparatus for cross-cell coordination and signaling
US8989087B2 (en) * 2010-06-15 2015-03-24 Telefonaktiebolaget L M Ericsson (Publ) Methods and devices for managing radio access in a communication system
US8588797B2 (en) * 2010-06-17 2013-11-19 Nokia Siemens Networks Oy Optimizing control channel performance with virtual inter-cell coordination
ES2528475T3 (es) * 2011-02-18 2015-02-10 Telefonaktiebolaget L M Ericsson (Publ) Método y disposición para posicionar un dispositivo inalámbrico
CN102685814B (zh) * 2011-03-16 2016-12-21 上海无线通信研究中心 Lte网络中小区间移动重选参数的协商方法
KR101840699B1 (ko) * 2011-12-15 2018-03-23 한국전자통신연구원 조정 다중 점 통신을 이용한 이동성 관리 방법
WO2013114419A1 (en) * 2012-01-30 2013-08-08 Nec Corporation Radio communication system and communication control method
CN102625369B (zh) * 2012-03-16 2014-07-09 东南大学 分类保证不同等级用户服务质量要求的负载均衡优化方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101895940A (zh) * 2010-07-26 2010-11-24 北京邮电大学 主服务小区和协作小区之间资源分配的方法
CN102325375A (zh) * 2011-06-29 2012-01-18 中兴通讯股份有限公司 资源分配方法及装置
CN102752824A (zh) * 2012-06-29 2012-10-24 中国联合网络通信集团有限公司 异系统切换方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2941044A4 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3223555A4 (en) * 2014-12-12 2017-10-25 Huawei Technologies Co., Ltd. Method for improving processing capacity of base station, base band device, base station and system
US10492101B2 (en) 2014-12-12 2019-11-26 Huawei Technologies Co., Ltd. Method for enhancing processing capability of base station, baseband device, base station, and system
CN111580968A (zh) * 2020-05-07 2020-08-25 广西大学 基于雾计算的医疗云平台负载自动均衡方法、系统及介质
CN111580968B (zh) * 2020-05-07 2023-04-18 广西大学 基于雾计算的医疗云平台负载自动均衡方法、系统及介质

Also Published As

Publication number Publication date
EP2941044A4 (en) 2015-12-23
KR101660351B1 (ko) 2016-09-27
KR20150103377A (ko) 2015-09-10
EP2941044A1 (en) 2015-11-04
US20150304889A1 (en) 2015-10-22
WO2014101243A1 (zh) 2014-07-03

Similar Documents

Publication Publication Date Title
WO2014101674A1 (zh) 负载均衡的方法和网络控制节点
US11350405B2 (en) Enabling exchange of information on radio frame configuration in neighbor cells
US10165583B2 (en) Scheduling method, apparatus, and system
US9578605B2 (en) Adjusting transmit power across a network
EP2800414B1 (en) Load balancing method and related device
CN103686858B (zh) 上行控制信息的反馈方法、基站及用户设备
RU2683483C2 (ru) Система управления беспроводными ресурсами, беспроводная базовая станция, устройство ретрансляции, способ управления беспроводными ресурсами и программа
EP3582568A1 (en) Assignment of component carriers in dual connectivity operation
JP5083411B2 (ja) 無線基地局、スケジューリングシステム、割り当て制御方法および記録媒体
US20170041940A1 (en) Uplink Based Selection of Downlink Connectivity Configuration
CN106793047B (zh) 一种上行功率控制方法及基站
EP3141012A1 (en) Dynamic cell clustering for coordinated multipoint operation
WO2016045748A1 (en) Methods and network nodes in a wireless communication network
CN103828422A (zh) 负载均衡的方法和网络控制节点
RU2759803C1 (ru) Аппарат связи
CN106412993B (zh) 用于均衡负荷的方法、基站和系统
WO2014108028A1 (zh) 无线通信方法和无线通信设备
CN114145062A (zh) 促进侧链路上的逻辑信道传输的终端设备、网络节点和方法
EP2922229A1 (en) A method, apparatus and system
WO2016150109A1 (zh) 一种用户设备调度方法、装置和系统
WO2017024570A1 (zh) 一种确定小区簇子帧配置的方法及装置
WO2016172826A1 (zh) 小基站发射功率管理方法、设备和系统
EP3000271B1 (en) Signalling scheme
WO2014110766A1 (zh) 信道质量测量方法、用户设备以及基站

Legal Events

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

Ref document number: 13868286

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2013868286

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20157020791

Country of ref document: KR

Kind code of ref document: A