WO2016114768A1 - Équilibrage de la charge de réseau ran compatible avec l'application - Google Patents

Équilibrage de la charge de réseau ran compatible avec l'application Download PDF

Info

Publication number
WO2016114768A1
WO2016114768A1 PCT/US2015/011257 US2015011257W WO2016114768A1 WO 2016114768 A1 WO2016114768 A1 WO 2016114768A1 US 2015011257 W US2015011257 W US 2015011257W WO 2016114768 A1 WO2016114768 A1 WO 2016114768A1
Authority
WO
WIPO (PCT)
Prior art keywords
base station
ran
resource requirement
load balancing
requirement
Prior art date
Application number
PCT/US2015/011257
Other languages
English (en)
Inventor
Joydeep Acharya
Salam Akoum
Original Assignee
Hitachi, Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi, Ltd. filed Critical Hitachi, Ltd.
Priority to PCT/US2015/011257 priority Critical patent/WO2016114768A1/fr
Publication of WO2016114768A1 publication Critical patent/WO2016114768A1/fr

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
    • 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

Definitions

  • the present disclosure is generally related to wireless systems, and more specifically, to load balancing for radio access network (RAN).
  • RAN radio access network
  • load balancing is utilized at the radio access network (RAN) level to spread the User Equipment (UE) load uniformly across base stations.
  • RAN radio access network
  • UE User Equipment
  • FIGS. 1A and IB An example of related art load balancing in the related art is illustrated in FIGS. 1A and IB.
  • a macro identified as "Macro”
  • macro small cell situation
  • FIG. 1A more UEs are associated with the macro base station than with the small cell.
  • UE21 and UE22 are handed over from the macro to the small cell as illustrated in FIG. IB.
  • Related art implementations conduct the load balancing based on the RAN link gain conditions (e.g.
  • both UE21 and UE22 have comparable channel strengths to the macro and small cell).
  • each base station After load balancing, each base station has a roughly similar number of UEs. Thus each UE may have statistically equal chances of receiving service.
  • the related art macro base station and small cell have different resources and capabilities (e.g., macro typically having more resources and capabilities) and more UEs can be served by the macro than the small cell with each UE receiving equal measure of sendee.
  • Example implementations are directed to systems and methods to mark a UE based on the UE service class, the throughput and latency requirements of the application of the UE such that these marks can act as relative priorities in resource and sendee time allocation from the associated base station of that UE.
  • example implementations can derive an aggregate UE mark value.
  • Example implementations also utilize a new signaling methodology by which the core network (CN) can provide a base station (BS) with the UE marking information. This is based on modifying the tunnel endpoint identifiers (IDs) of the Evolved Packet System (EPS) bearer between a UE to the Packet Data Network Gateway (P-GW) to carry the UE marking information.
  • IDs tunnel endpoint identifiers
  • EPS Evolved Packet System
  • example implementations can provide a load balancing mechanism which takes into account the RAN channel strengths, RAN base station loads and application information of the UEs obtained from the UE marks.
  • a base station which can involve a memory configured to store information indicative of a resource requirement for each User Equipment (UE) associated with a Radio Access Network (RAN), the resource requirement based on one or more applications executed on the each UE associated with the RAN and a radio link gain between the each UE and one or more base stations in the RAN; and a processor, configured to conduct load balancing of the each UE associated with the RAN across one base station from the one or more base stations in the RAN and a target base station from the one or more base stations in the RAN by associating the each UE with the one base station based on the resource requirement of the each UE.
  • UE User Equipment
  • RAN Radio Access Network
  • aspects of the present disclosure further include a method, which can involve managing information indicative of a resource requirement for each User Equipment (UE) associated with a Radio Access Network (RAN), the resource requirement based on one or more applications executed on the each UE associated with the RAN and a radio link gain, between, the each UE and one or more base stations in the RAN; and conducting load balancing of the each UE associated with the RAN across the base station from the one or more base stations in the RAN and a target base station from the one or more base stations in the RAN by associating the each UE with the one base station based on the resource requirement of the each UE.
  • UE User Equipment
  • RAN Radio Access Network
  • aspects of the present disclosure further include a computer program storing instructions for executing a process.
  • the instructions may further include managing information indicative of a resource requirement for each User Equipment (UE) associated with a Radio Access Network (RAN), the resource requirement based on one or more applications executed on the each UE associated with the RAN and a radio link gain between, the each UE and one or more base stations in the RAN; and conducting load balancing of the each UE associated with the RAN across the base station from the one or more base stations in the RAN and a target base station from the one or more base stations in the RAN by associating the each UE with the one base station based on the resource requirement of the each UE .
  • the instructions may be stored on a non-transitory computer readable medium and executed by one or more processors.
  • FIGS. 1A and IB illustrate an example of load balancing.
  • FIG. 2 illustrates a Long Term Evolution (LTE) system with an EPS bearer, in accordance with an example implementation.
  • LTE Long Term Evolution
  • FIG. 3 illustrates a flow diagram, in accordance with an example implementation.
  • FIG. 4 illustrates a UE Application Type Determination Module in accordance with an example implementation.
  • FIG. 5 illustrates a UE Application Type Information Transmission Module in accordance with an example implementation.
  • FIG. 6 illustrates a flow diagram for the application aware load balancing module, in accordance with an example implementation.
  • FIG. 7 illustrates an example network with additional information of UE markings and received power regions, in accordance with an example implementation.
  • FIG. 8 illustrates the application of load balancing from the implementations as applied to the network of FIG. 7.
  • FIG. 9 illustrates an example apparatus implementation for a core network, in accordance with an example implementation.
  • FIG. 10 illustrates an example base station upon which example implementations can be implemented.
  • FIG. 11 illustrates an example user equipment upon which example implementations can be implemented. DETAILED DESCRIPTION
  • Example implementations provide for RAN load balancing that takes into account the end-to-end application requirements. Thus, RAN congestion may be substantially prevented through the example implementations.
  • the concept of different QoS classes is introduced into the LTE system.
  • UEs having different priorities or applications can be mapped to different EPS bearers with different QoS classes.
  • the base station can also take into account the application characteristics while allocating resources to the UEs.
  • TFT traffic flow template
  • TFT traffic flow template
  • all traffic may thereby be mapped into a single bearer, thus negating application awareness at the RAN level.
  • Flow priority based packet marking is utilized to indicate which packets should receive higher priority in case of congestion. Packet marking approaches are mostly for cases when congestion has already occurred and congestion control is desired. However, example implementations mark the UE and not the packets, which can avoid congestion, from occurring by intelligent application aware RAN load balancing.
  • FIG. 2 illustrates a Long Term Evolution (LTE) system with an EPS bearer, in accordance with an example implementation
  • the system may include a CN 100, having a mobility management entity (MME) 101, a Home Subscriber Server (HSS) 102, a serving gateway (S-GW) 103, and a P-GW 104.
  • MME 101 is configured to facilitate bearer/UE attachment procedures.
  • the HSS 102 may contain a database of subscriber UEs including tier information.
  • the S-GW 103 routes and forwards user data packets, and may also function as a mobility anchor for the user plane during handovers.
  • the P-GW is configured to conduct policy enforcement, packet filtering for each user, and packet screening functions.
  • the RAN may include one or more associated base stations 110, each having a cell to serve one or more UEs 120.
  • the external bearer 203 facilitates the connections between the CN 100 and the external IP network 130.
  • the EPS bearer is an end to end logical connection between a P- GW and the UE as illustrated in FIG. 2.
  • the component bearers include the S5/S8 bearer 200 between the P-GW and the S-GW, the SI bearer 201 between the S-GW and the eNodeB, and the data radio bearer 202 between the eNodeB and the UE.
  • the external bearer 203 receives data from the internet and adds information such as the destination UE and the source application used.
  • the P-GW takes the internet protocol (IP) packets destined for the UE, encapsulates the packets within another IP packet, puts the P-GW as the source (SIP) and the S-GW as the destination (DIP) and includes a tunnel endpoint ID (TID) X.
  • IP internet protocol
  • the TID informs the S- GW which eNodeB to which the IP packet is forwarded.
  • the S-GW receives the encapsulated IP packet, strips the encapsulated header and puts the IP packet in a new encapsulated IP packet with itself as the SIP and the eNodeB as the DIP.
  • the S-GW also includes a new TID Y that informs the eNodeB which UE is the destination for the packet.
  • the new encapsulated packet from the S-GW is transmitted over the S 1 bearer 201.
  • FIG. 3 illustrates a flow diagram, in accordance with an example implementation.
  • the UE 120 initially performs ATTACH, and subsequently sends packet data network (PDN) connectivity requests to the core network for starting various kinds of data services at 300.
  • the Core Network 100 utilizes a module called the UE Application Type Determination Module, for marking UEs based on the applications that they are currently ranning and their sendee class (e.g. ordinary, gold, platinum). Further details of the module are provided in FIG. 4. From the processing of the UE Application Type Determination Module, the CN 100 proceeds to the UE Application Type Information Transmission Module 500, which is described in further detail in FIG. 5.
  • the UE Application Type Information Transmission Module 500, which is described in further detail in FIG. 5.
  • the processing from the UE Application Type Information Transmission Module 500 results in the CN sending UE Application Type information 301 to the BS 110, which processes the information in the UE Application Type Information Reception Module and forwards the information to the Application Aware RAN Load Balancing Module 600.
  • Handover module 303 processes the information to generate handover information 304 for sending to the UE 120, which receives the processed handover information at the corresponding handover module 305.
  • FIG. 4 illustrates a UE Application Type Determination Module in accordance with an example implementation.
  • the UE Application Type Determination Module 400 has two aspects. In the first aspect 401, for each combination of the UE's service class, the application throughput requirement, and the application latency requirement, the UE is marked with a value
  • a second aspect 402 of the UE Application Type Determination Module 400 there is the case when a UE has multiple applications running. Let UE k have N applications running. Let application of UE k be determined by the throughput and latency requirements and the UE marking based on these individual applications be given by f(ck, dkn). Thus the overall UE marking would be of the form
  • weights can be chosen in multiple ways depending on the
  • weights may be chosen to favor one application over another. For example a UE that predominantly performs video download over voice calls, can have a weight to reflect this.
  • Other implementations are also possible and the example implementations are not limited based on the type of content, depending on the desired method of handling applications.
  • FIG. 5 illustrates a UE Application Type Information Transmission Module in accordance with an example implementation.
  • the UE Application Type Information Transmission Module 500 by which the UE marking information obtained in the UE Application Type Determination Module 400 is conveyed to the base stations by the CN at a per UE basis as illustrated at 501.
  • example implementations may reuse some of the existing signal structure available in the LTE system.
  • the related art includes EPS bearers and tunnel endpoint IDs.
  • the UE marking information and the traditional information being carried by the tunnel endpoint IDs can now be jointly encoded as illustrated at 502.
  • Example implementations can thereby use the joint encoding approach, which can be modified according to the desired implementation.
  • FIG. 6 illustrates a flow diagram for the application aware load balancing module 600, in accordance with an example implementation. Assume that there is a load balancing being performed between a macro base station and a small cell. Let the transmit powers be Pm and Ps for the macro and the small cell respectively. Let the link gains from the macro and small cell to UE k be k and respectively. Let ⁇ be a power offset used to denote
  • Tm and Ts be the set of UEs associated with the macro and small cell after load balancing.
  • the load balancing module 600 obtains the above quantities. The flow diagram proceeds based on the following handover rules.
  • the load balancing module 600 performs application aware load balancing jointly for all UEs k. For example, of then associate the UE based on the UE markings.
  • g(.) is a function chosen to influence the nature of the solution.
  • the load balancing mechanism takes into account both RAN conditions (hence association in 603 and 605 are based on channel conditions) and also the UE application information (hence UEs in the association at 606 are associated based on the UE marking criteria as captured in the function g(.) of the UE marking information U k .
  • FIG. 7 illustrates an example network with additional information of UE markings and received power regions, in accordance with an example implementation. Specifically, FIG. 7 illustrates initial associations without any load balancing and regions based on the example network provided in FIG. 1A. FIG. 8 illustrates the application of load balancing from the implementations as applied to the network of FIG. 7.
  • example implementations involve attempts to find two sets of UEs such that the sum of their marks is the closest. Since the mark values, if properly designed, are roughly proportional to the amount of resource/sendee time a UE needs on average, the optimization returns two sets of UEs whose aggregate resource needs are similar. This leads to load balancing from the application requirements perspective and minimizes the chance of RAN congestion.
  • FIG. 7 the initial associations of the UEs to the base stations are shown along with the additional information about the UE applications and markings. FIG.
  • FIG. 7 illustrates that UEs with high bandwidth and low latency requirement video applications have a higher marking value, denoting that they need a larger share of the resources as compared to the normal voice UEs.
  • the received power regions a), b) and c) are depicted.
  • Region a) would tend to have the UEs that would undergo processing at 602 and 603 of FIG. 6.
  • Region b) would tend to have the UEs that would undergo processing at 604 and 605 of FIG. 6.
  • Region c) would tend of have the UEs that undergo the processing at 606. Note that if only RAN based load balancing is performed, then, in the final association as shown in FIG. IB, UEs UE21 and UE22 are associated with the small cell. While this example implementation refers to video applications, the present inventive concept is not limited thereto, and other types of content may be substituted therefor.
  • FIG. I B both of the bandwidth intensive video UEs are offloaded to the same small cell and would thereby compete for the limited resources of the small cell and thus potentially lead to RAN congestion. Further, the UEs in the macro cell have minimal resources and thus the macro cell resources may go underutilized. In contrast, example implementations as described herein would conduct offloading as illustrated in FIG. 8, which can ensure that the total demand of resources is roughly same in each base station. Note that this example in FIG. 8 is for the case when . Note that although the depicted example illustrates a use case of macro and
  • FIG. 10 illustrates an example base station upon which example implementations can be implemented.
  • the block diagram of a base station 1000 in the RAN of the example implementations is shown in FIG. 10, which could be a macro base station, a pico base station, an eNodeB and so forth.
  • the base station 1000 may include the following modules: the Central Processing Unit (CPU) 1001, the baseband processor 1002, the transmission/receiving (Tx/Rx) array 1003, the X2/Xn interface 1004, and the memory 1005.
  • CPU Central Processing Unit
  • Tx/Rx transmission/receiving
  • X2/Xn interface 1004 the X2/Xn interface
  • the CPU 1001 is configured to execute one or more modules or flows as described, for example, in FIG 3 to conduct load balancing for each UE associated with the base station for a target base station based on the resource requirement of the each UE associated with the base station, and resource requirements of one or more UE associated with the target base station.
  • CPU 1001 can further facilitate the flow as illustrated in FIG. 6 to facilitate the implementations of application aware load balancing.
  • CPU 1001 may be further configured to calculate the linked gains or transmit powers for the base station, and transmit the information to other base stations. Further, CPU 1001 may receive such information regarding other base stations from other base stations through the X2/Xn interface 1004, or may receive it from apparatus 900.
  • CPU 1001 may conduct load balancing based on the received resource requirements, including latency and throughput requirements, or an aggregate thereof.
  • Memory 1005 may take the form of a computer readable storage medium or can be replaced with a computer readable signal medium as described below. Memory 1005 may also store information indicative of a resource requirement for each UE associated with the base station, including information regarding one or more applications executed on the UE.
  • Example implementations may also relate to an apparatus for performing the operations herein.
  • This apparatus may be specially constructed for the required purposes, or it may include one or more general-purpose computers selectively activated or reconfigured by one or more computer programs.
  • Such computer programs may be stored in a computer readable medium, such as a computer-readable storage medium or a computer-readable signal medium.
  • a computer-readable storage medium may involve tangible mediums such as, but not limited to optical disks, magnetic disks, read-only memories, random access memories, solid state devices and drives, or any other types of tangible or non-transitory media suitable for storing electronic information.
  • a computer readable signal medium may include mediums such as carrier waves.
  • the operations described above can be performed by hardware, software, or some combination of software and hardware.
  • Various aspects of the example implementations may be implemented using circuits and logic devices (hardware), while other aspects may be implemented using instructions stored on a machine-readable medium (software), which if executed by a processor, would cause the processor to perform a method to carry out implementations of the present application.
  • some example implementations of the present application may be performed solely in liardware, whereas other example implementations may be performed solely in software.
  • the various functions described can be performed in a single unit, or can be spread across a number of components in any number of ways.
  • the methods may be executed by a processor, such as a general purpose computer, based on instructions stored on a computer-readable medium. If desired, the instructions can be stored on the medium in a compressed and/or encrypted format.

Landscapes

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

Abstract

Des exemples de mise en oeuvre de l'invention concernent des systèmes et des procédés au moyen desquels des informations de niveau du réseau d'accès radio (RAN) telles que des conditions de charge et de canaux de station de base du moment peuvent être combinées avec des informations d'application pour effectuer l'équilibrage de la charge du réseau RAN compatible avec l'application. Ces systèmes peuvent faciliter la qualité de service (QoS) de bout en bout des utilisateurs.
PCT/US2015/011257 2015-01-13 2015-01-13 Équilibrage de la charge de réseau ran compatible avec l'application WO2016114768A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/US2015/011257 WO2016114768A1 (fr) 2015-01-13 2015-01-13 Équilibrage de la charge de réseau ran compatible avec l'application

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2015/011257 WO2016114768A1 (fr) 2015-01-13 2015-01-13 Équilibrage de la charge de réseau ran compatible avec l'application

Publications (1)

Publication Number Publication Date
WO2016114768A1 true WO2016114768A1 (fr) 2016-07-21

Family

ID=56406167

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2015/011257 WO2016114768A1 (fr) 2015-01-13 2015-01-13 Équilibrage de la charge de réseau ran compatible avec l'application

Country Status (1)

Country Link
WO (1) WO2016114768A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018053038A1 (fr) 2016-09-13 2018-03-22 Opanga Networks, Inc. Transfert intercellulaire dirigé de flux éléphants

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080279139A1 (en) * 2004-01-28 2008-11-13 Nathalie Beziot Method for Managing Radio Resources in an Utran Radio Access Network
US20110252477A1 (en) * 2010-04-08 2011-10-13 Kamakshi Sridhar Dynamic Load Balancing In An Extended Self Optimizing Network
WO2012139781A1 (fr) * 2011-04-12 2012-10-18 Alcatel Lucent Concept d'équilibrage de charge dans un réseau d'accès radio
US20130100839A1 (en) * 2009-11-18 2013-04-25 Research In Motion Limited Optimized resource allocation for wireless device in packet transfer mode

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080279139A1 (en) * 2004-01-28 2008-11-13 Nathalie Beziot Method for Managing Radio Resources in an Utran Radio Access Network
US20130100839A1 (en) * 2009-11-18 2013-04-25 Research In Motion Limited Optimized resource allocation for wireless device in packet transfer mode
US20110252477A1 (en) * 2010-04-08 2011-10-13 Kamakshi Sridhar Dynamic Load Balancing In An Extended Self Optimizing Network
WO2012139781A1 (fr) * 2011-04-12 2012-10-18 Alcatel Lucent Concept d'équilibrage de charge dans un réseau d'accès radio

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018053038A1 (fr) 2016-09-13 2018-03-22 Opanga Networks, Inc. Transfert intercellulaire dirigé de flux éléphants
KR20190042743A (ko) * 2016-09-13 2019-04-24 오팡가 네트웍스, 인크. 엘리펀트 플로우들의 지향된 핸드오버
CN110121898A (zh) * 2016-09-13 2019-08-13 欧庞戈网络有限公司 大象流的定向切换
EP3513594A4 (fr) * 2016-09-13 2020-05-13 Opanga Networks, Inc. Transfert intercellulaire dirigé de flux éléphants
US10834650B2 (en) 2016-09-13 2020-11-10 Opanga Networks, Inc. Directed handover of elephant flows
CN110121898B (zh) * 2016-09-13 2021-08-27 欧庞戈网络有限公司 切换产生大象流的设备终端的方法和系统和传输管理器
KR102398946B1 (ko) * 2016-09-13 2022-05-16 오팡가 네트웍스, 인크. 엘리펀트 플로우들의 지향된 핸드오버

Similar Documents

Publication Publication Date Title
US10779195B2 (en) Information transmission method and apparatus
US20200374743A1 (en) Method for determining qos description information and apparatus
CN105324966B (zh) 负载传输的控制方法及装置
US11522803B2 (en) Method and apparatus for handling packet delay budget division and quality of service monitoring in a communication system
EP3425939B1 (fr) Appareil de communication, procédé de communication, système de communication et appareil de noeud
EP3582543A1 (fr) Procédé de détermination d'ambr, et entité de communication
US20220256390A1 (en) Quality of service information notification method, device, and system
US11089512B2 (en) Dual connectivity flow control
JP2023025025A (ja) データ伝送方法及び装置
CN110493849A (zh) 一种双连接方法及接入网设备
CN108024284B (zh) 无线通信方法、用户设备接入网设备、和核心网设备
US20210112437A1 (en) User Plane QOS Bearer Control Method for 5G Fixed Access
WO2020073899A1 (fr) Procédé et appareil de transmission de données
US20220217569A1 (en) Method and apparatus for controlling service flow transmission, and system
US12022319B2 (en) Policy node, user plane node, control plane node and methods therein for handling quality of service in a wireless communications network
CN108282320A (zh) 一种系统间信息交互方法，无线通信系统和用户设备
CN106454959A (zh) 一种分布式网络的服务质量控制方法、及服务器
WO2018141278A1 (fr) Procédé de communication sans fil, équipement utilisateur, équipement de réseau d'accès et système de réseau
CN110138685A (zh) 一种通信方法及装置
US9179357B2 (en) Systems and methods for buffer status reporting in wireless communication systems
US11102691B2 (en) Triggering terminal handover after session-request message
US10051508B2 (en) System and method for mobility support selection
US20220053502A1 (en) Methods and devices for operating with dual connectivity
WO2016114768A1 (fr) Équilibrage de la charge de réseau ran compatible avec l'application
US20220217593A1 (en) Communication method and apparatus

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: 15878210

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15878210

Country of ref document: EP

Kind code of ref document: A1