EP2571310B1 - Communication in a cellular network taking into account backhaul loading - Google Patents

Communication in a cellular network taking into account backhaul loading Download PDF

Info

Publication number
EP2571310B1
EP2571310B1 EP11306173.3A EP11306173A EP2571310B1 EP 2571310 B1 EP2571310 B1 EP 2571310B1 EP 11306173 A EP11306173 A EP 11306173A EP 2571310 B1 EP2571310 B1 EP 2571310B1
Authority
EP
European Patent Office
Prior art keywords
base station
network
backhaul
main
request
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Not-in-force
Application number
EP11306173.3A
Other languages
German (de)
French (fr)
Other versions
EP2571310A1 (en
Inventor
Safouane Sfar
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
OCT Circuit Technologies International Ltd
Original Assignee
OCT Circuit Technologies International 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 OCT Circuit Technologies International Ltd filed Critical OCT Circuit Technologies International Ltd
Priority to EP11306173.3A priority Critical patent/EP2571310B1/en
Priority to EP16189550.3A priority patent/EP3142412A1/en
Priority to US14/345,131 priority patent/US9282486B2/en
Priority to PCT/EP2012/067975 priority patent/WO2013037903A2/en
Publication of EP2571310A1 publication Critical patent/EP2571310A1/en
Application granted granted Critical
Publication of EP2571310B1 publication Critical patent/EP2571310B1/en
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/824Applicable to portable or mobile terminals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/08Load balancing or load distribution
    • H04W28/09Management thereof
    • H04W28/0958Management thereof based on metrics or performance parameters
    • H04W28/0967Quality of Service [QoS] parameters
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/24Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]

Definitions

  • the invention relates to communication in a cellular network in which backhaul loading is taken into account to limit the risk of traffic congestion.
  • a base station has at least two interfaces, an air interface to mobile user equipment (UE) and a backhaul interface to the core network.
  • UE mobile user equipment
  • the backhaul portion of the network comprises the intermediate links between the core network, or backbone, of the cellular network and the small subnetworks at the "edge" of the entire cellular network.
  • the core network or backbone
  • the small subnetworks at the "edge" of the entire cellular network.
  • An object of some embodiments of the present invention is to alleviate at least partly the above mentioned drawbacks.
  • embodiments of the invention aim to make processing simpler and more mobile user equipment transparent, when own backhaul traffic load of a base station in a network is too high to satisfy a new request from or to a mobile user equipment.
  • a preferred embodiment of the invention aims at making such processing completely transparent for mobile user equipment, that is to say with no interaction from mobile user equipment, with no cell change for the mobile user equipment, with no request relayed to another base station to trigger the backhaul change.
  • To trigger the backhaul change there is signaling only between base station and core network according to some embodiments of the invention.
  • FIG. 1 shows an example of a couple of cellular networks implementing an embodiment of the invention. There are two networks represented on figure 1 , but there could be three of them or even more of them.
  • First network encompasses a core network 9, base stations 5 and 6, only two of them being represented on figure 1 but there may be more of them and mobile user equipments 1 and 4, only two of them being represented on figure 1 but there may be more of them.
  • Base stations 5 and 6 communicate with core network 9, respectively through links 11 and 12.
  • Link 11 is the backhaul between base station 5 and core network 9.
  • Link 12 is the backhaul between base station 6 and core network 9.
  • Core network 9 communicates through link 19 with an operation, administration and maintenance center 21.
  • the operation, administration and maintenance center 21 will provide base station 6 with a list of available neighbor base stations of a second network with associated offered qualities of service for their associated backhauls. In the list, each available neighbor base station is associated with its offered quality of service of its dedicated backhaul.
  • Mobile user equipments 1 and 4 can communicate with base stations 5 and 6 through air interface. On figure 1 , mobile user equipment 4 has established a communication 16 through air interface with base station 6. Mobile user equipment 4 has sent a request to base station 6 or base station 6 has got a request that is to be sent to mobile user equipment 4.
  • First network can, for example, be an E-UTRAN network.
  • Base stations 5 and 6 can be eNodeB.
  • An E-UTRAN Enhanced Universal Terrestrial Radio Access Network
  • LTE long term evolution
  • First network could also be a GSM, a UTRAN, or a WIFI network.
  • Second network encompasses a core network 10, base stations 7 and 8, only two of them being represented on figure 1 but there may be more of them, and mobile user equipments 2 and 3, only two of them being represented on figure 1 but there may be more of them.
  • Base stations 7 and 8 communicate with core network 10, respectively through links 13 and 14.
  • Link 13 is the backhaul between base station 7 and core network 10.
  • Link 14 is the backhaul between base station 8 and core network 10.
  • Core network 10 communicates through link 20 with an operation, administration and maintenance center 21.
  • Mobile user equipments 2 and 3 can communicate with base stations 7 and 8 through air interface.
  • Second network can be a GSM (Global System for Mobile communications), UTRAN, E-UTRAN, or WIFI (Wireless Fidelity) network.
  • Base stations 7 and 8 can be corresponding base stations, that is to say a 2G base station, a nodeB, eNodeB, Home eNodeB, or a WIFI base station.
  • base station 6 of first network has asked core network 9 of first network for backhaul resource support.
  • Core network 9 of first network or base station 6 of first network managed to find base station 8 of second network as available and as providing sufficient quality of service for its backhaul to satisfy request of mobile user equipment 4 of first network.
  • base station 6 of first network has established a communication 17 through air interface with base station 8 of second network, base station 6 of first network acting as a mobile user equipment of second network, that is to say acting as would act mobile user equipments 2 or 3, or at least in a similar way.
  • base station 6 of first network asks base station 8 of second network for backhaul resource support.
  • the backhaul between base station 8 of second network and core network 9 of first network includes links 14 and 15 and goes through core network 10 of second network.
  • So base station 6 of first network instead of satisfying request coming from or to mobile user equipment 4 of first network by communicating with core network 9 of first network through link 12 which is the own backhaul of base station 6, will satisfy request coming from or to mobile user equipment 4 of first network by communicating with core network 9 of first network first through air interface (communication 17) with base station 8 of second network, then through links 14 and 15, that is to say through backhaul between base station 8 of second network and core network 9 of first network.
  • So base station 6 of first network having too much traffic load on own backhaul, will use a new backhaul which is backhaul of base station 8 of second network.
  • mobile user equipment 3 now tries to establish a communication 18 through air interface with base station 8, after communications 16 and 17 have been established. If base station 8 of second network is far from being overloaded, it can deal with mobile user equipment 3 of second network. Whereas, if, on the contrary, base station 8 of second network is close to being overloaded, it cannot deal directly with mobile user equipment 3 of second network. In some embodiments, base station 8 of second network must first terminate backhaul sharing with base station 6 of first network, before being able to deal with request of mobile user equipment 3 of second network, which later request may have priority over former requests coming from first network according to some embodiments of the invention .
  • Fig. 2 shows the steps of an example of method implementing an embodiment of the invention.
  • This method comprises a "request reception” step 31, a "traffic load check” step 32, a “new backhaul selection” step 33, a "request satisfaction through new backhaul” step 34, a “request satisfaction through old backhaul” step 35, a "traffic load recheck” step 36, and a "no request satisfaction” step 37.
  • Base station 6 will from now on often be called main base station 6, simply because it is the base station that is considered to receive the request to be satisfied. Later on, another base station, like for example base station 5, could be called main base station if it receives a request to be satisfied.
  • step 31 the main base station 6 of first network receives a request from or to the mobile user equipment 4 of the first network.
  • a request from the mobile user equipment 4 can be a file download request
  • a request to the mobile user equipment 4 can be a request to establish a path for a terminating call to said mobile user equipment 4, this request coming from another mobile user equipment, either from first or second network, through network core 9 of first network.
  • step 32 the main base station 6 checks if request can be satisfied through own backhaul according to traffic load. There are two alternatives. Either it can be satisfied though own backhaul, or it cannot. If it can, "OK” option, then the request is satisfied through own backhaul of main base station 6 in step 35, and here ends the performing of the method. If it cannot, "NOK” option, then we go to step 33.
  • the main base station 6 checks if request can be satisfied through own backhaul by comparing effective traffic load to a predetermined maximum traffic load threshold.
  • a maximum traffic load threshold helps anticipating overload and avoiding breakdown of main base station traffic load.
  • this predetermined maximum traffic load threshold is below 100% of own backhaul total capacities in order to limit risk of congestion of own backhaul.
  • this predetermined maximum traffic load threshold ranges from 60% to 90% of own backhaul total capacities. More preferably, this predetermined maximum traffic load threshold ranges from 70% to 80% of own backhaul total capacities.
  • step 33 main base station 6 or core network 9 of first network try to select another neighbour base station of second network, according at least to availability and/or to offered quality of service of said another neighbour base station.
  • said another neighbour base station of second network is preferably selected by main base station 6 of first network. More generally speaking, this applies when the request comes from mobile user equipment 4 to main base station 6 according to some embodiments.
  • said another neighbour base station of second network is preferably selected by core network 9 of first network. More generally speaking, this applies when the request comes to mobile user equipment 4 from main base station 6 or simply forwarded by main base station 6 according to some embodiments.
  • the selection in step 33 may be done according to a strategy.
  • An example of such a strategy will be detailed in figure 4 .
  • Either selection of another base station of second network is successful, or it is not successful. If it is successful, we go to step 34. If it is not successful, we go to step 36.
  • main base station 6 of first network may still try and use own backhaul, provided that is possible, even if effective traffic load is above maximum traffic load threshold. That can be done, because often, the maximum traffic load threshold is not an "absolute" maximum traffic load threshold ; indeed, the maximum traffic load threshold includes a margin.
  • the main base station 6 may still try and use own backhaul, even if effective traffic load is above maximum traffic load threshold, provided effective traffic load is still below a very maximum traffic load threshold, the very maximum traffic load threshold being higher than the maximum traffic load.
  • the very maximum traffic load threshold can range from 90% to 99% of own backhaul total capacities. So this very maximum traffic load threshold still includes a margin, but a much smaller one than the maximum traffic load threshold.
  • step 35 already known. If it definitely cannot be used, then we go to step 37.
  • step 37 nothing is done for satisfying the request which simply cannot be satisfied at that time, except from waiting for own backhaul traffic load reduction.
  • handover can be used, with its drawbacks already discussed.
  • main base station 6 can ask core network 9 of first network for an updated list of available neighbour base stations of at least a second network, hoping that the traffic load situation has changed.
  • step 34 main base station 6 communicates through backhaul between said another neighbour base station 8 of second network and core network 9 of first network to satisfy request. This communication to satisfy request will be detailed in figure 3 .
  • Step 34 of figure 2 may comprise two substeps, an "air interface communication" substep 341 and a "through backhaul communication" substep 342. Both substeps 341 and 342 are successively performed, the one or the other substep first.
  • information comes from mobile user equipment 4 of first network, for example request of file download
  • information first goes from main base station 6 to said another neighbour base station 8 of second network through air interface and then information goes from said another neighbour base station 8 of second network to core network 9 of first network through backhaul between said another neighbour base station 8 of second network and core network 9 of first network.
  • information When information comes to mobile user equipment 4 of first network, for example effective down of requested file, information first goes from core network 9 of first network to said another neighbour base station 8 through backhaul between said another neighbour base station 8 of second network and core network 9 of first network, and then goes from said another neighbour base station 8 of second network to main base station 6 through air interface.
  • communicating through backhaul between said another neighbour base station 8 of second network and core network 9 of first network includes communicating through core network 10 of second network.
  • main base station 6 of first network when communicating with neighbour base station 8 of second network, avoids loading own backhaul which is already very loaded, even sometimes more or less close to be overloaded.
  • Main base station 6 communicates with said another neighbour base station 8 of second network through air interface, acting as a user equipment of second network.
  • Fig. 4 shows an example of detailed substeps of another step of method shown on figure 2 .
  • Step 33 of figure 2 may comprise several substeps. Among them, a "list fetching" substep 331, a "QoS backhaul estimation” substep 332, a "UE acceptance” sub step 333. Step 33 may start with substep 331.
  • substep 331 the main base station 6 or the core network 9 of first network goes and fetches a list of available neighbour base stations 7 or 8 of at least a second network with associated offered qualities of service for their backhauls.
  • this list is stored, updated, and provided by an operation, administration and maintenance center 21 sending it through core network 9 of first network.
  • Main base station 6 of first network asks this list to core network 9 of first network.
  • This list can of course contain more available base stations of second network or even available base stations of a third network or of other networks.
  • substep 332 we go to substep 332.
  • the main base station 6 or core network 9 of first network tries to select another neighbour base station 8 of second network by choosing, in the list of available neighbour base stations 7 and 8 of second network with associated offered qualities of service, preferably the available neighbour base station with the best quality of service for its backhaul, which is in our present case neighbour base station 8 of second network. In that way, the maximum effort is done to satisfy required quality of service of request transmitted by main base station 6 of first network despite the inter network backhaul drift.
  • a neighbour base station 7 or 8 is considered available when it is available to satisfy a new request, for example when effective traffic load of its backhaul is neither congested nor close to become congested.
  • main base station 6 or core network 9 of first network tries to select another neighbour base station of second network by choosing, in the list of available neighbour base stations 7 or 8 of second network with associated offered qualities of service for their backhauls, the available neighbour base station with the lowest quality of service, as long as this lowest quality of service is above the minimum quality of service required by the request to be satisfied.
  • this main base station or another base station of first network needs also to benefit from a backhaul resource sharing but this time with another request requiring a highest quality of service, this can be done in an easier way.
  • main base station 6 or core network 9 of first network tries to select another neighbour base station of second network by choosing, in the list of available neighbour base stations 7 or 8 of second network with associated offered qualities of service for their backhauls, the available neighbour base station which has both a sufficient quality of service, that is to say a level of quality of service which is above the minimum quality of service required by the request to be satisfied, and the lowest effective traffic load on its backhaul.
  • the risk that a base station of second network, sharing its backhaul with a base station of first network, becomes overloaded and for example needs itself to drift its backhaul traffic load is more efficiently reduced.
  • either main base station 6 of first network can find another available neighbour base station 8 of second network with quality of service sufficient to meet requirements of request, or it cannot. If offered quality of service of intended to be chosen neighbour base station is above a threshold S corresponding to requirements of request, then we go to step 34 already known. If offered quality of service of intended to be chosen neighbour base station is below a threshold S corresponding to requirements of request, then we go to substep 333.
  • substep 333 quality of service of neighbour base station intended to be chosen being below the minimum quality of service required by the request to be satisfied, main base station 6 of first network or core network 9 of first network requires acceptance of mobile user equipment 4 having issued the request. In that way, mobile user equipment has the lead on negotiated quality of service of its request.
  • a similar procedure for acceptance of a lower quality of service for mobile user equipment 4 may, in some embodiments, be applied also in step 36 and/or in step 32 in relation to the quality of service offered by the backhaul of the base station of the first network.
  • Mobile user equipment 4 can accept or refuse this quality of service degradation to satisfy its request. If mobile user equipment 4 accepts quality of service degradation, then we go to step 34 already known, "request satisfaction through new backhaul”. If mobile user equipment 4 refuses quality of service degradation, then we go to step 36 already known, "traffic load recheck”.
  • neighbour base station 8 of second network When a neighbour base station 8 of second network accepts to share its backhaul with main base station 6 of first network, said neighbour base station 8 of second network typically (but not necessarily) gives priority to requests from or to mobile user equipments 2 or 3 of second network over the request to be satisfied by main base station 6 of first network. In this way, sharing backhaul capacities with base stations 5 or 6 of other networks does not impede own backhaul traffic load of selected neighbour base station 8 of second network, or in the least reduces the intrusive effect of this sharing.
  • this priority management may be implemented in a processing that runs as follows: when too many requests from or to mobile user equipments 2 or 3 of second network need backhaul use of the neighbour base station 8 of second network, this neighbour base station 8 stops sharing its backhaul with main base station 6 of first network. This stop can be forecast in order to give enough time to main base station 6 of first network to find another solution to continue satisfying the request it has started to satisfy while sharing backhaul of this neighbour base station 8 of second network.
  • this priority management may be implemented in a processing that runs as follows : any neighbour base station 8 of second network only accepts to share a minor part of its backhaul total capacities with main base station 6 of first network (or indeed with any other base station 5 or 6 of any other network).
  • the total amount of backhaul capacities that a neighbour base station 8 can share with base stations 5 or 6 of other networks is a minor part of its backhaul total capacities.
  • This sharable, with base stations 5 or 6 of other networks, amount of capacities could by way of example range from 10% to 30% of backhaul total capacities of this neighbour base station 8 of second network.
  • neighbour base station 8 of second network For priority management to be implemented, it is useful for neighbour base station 8 of second network to be able to make the difference between a call of a "normal" mobile user equipment 2 or 3 of second network on the one side and a call of a "main base station" 6 of first network, acting as a mobile user equipment of second network.
  • Fig. 5 shows an example of main base station according to one embodiment of the invention.
  • Main base station 6 of first network comprising mobile user equipments 1 and 4, base stations 5 and 6 and a core network 9, comprises a receiver 61, a traffic load detector 64, a selector 65, a transmitter 62, and a central unit 63 making all preceding elements working together.
  • the main base station 6 of figure 5 may, for example, be configured to perform appropriate method steps according to one or more figures 2 through 4 .
  • the receiver 61 receives a request from or to mobile user equipment 4.
  • the traffic load detector 64 checks if received request can be satisfied through own backhaul according to traffic load.
  • the traffic load detector 64 includes a threshold comparator configured to be able to compare effective traffic load to a predetermined maximum traffic load threshold.
  • the selector 65 tries and selects another neighbour base station 8 of second network according at least to availability and to offered quality of service of said another neighbour base station 8, if detection performed by detector 64 result is that received request cannot be satisfied trough own backhaul.
  • the selector 65 includes a controller able to select a neighbour base station among other available neighbour base stations, according to their respective qualities of service and or their respective effective traffic loads.
  • the selector 65 may be associated to a memory 66 in which are stored the formulas that are used to implement the strategy with respect to the way of choosing a neighbour base station among other available neighbour base stations.
  • the transmitter 62 and the receiver 61 communicate through backhaul between selected neighbour base station 8 of second network and core network 9 of first network to satisfy received request, if selection performed by selector 65 has been successful.
  • main base station 6 is an eNodeB of a E-UTRAN.
  • Fig. 6 shows an example of a subsystem SCN of core network according to an embodiment of the invention.
  • the subsystem of core network 9 comprises a receiving element 91, a transmitting element 92, , a fetching element 95, a selector 96, and a central unit 94 making all preceding elements working together.
  • the subsystem of core network 9 of figure 6 may, for example, be configured to perform appropriate method steps according to one or more figures 2 through 4 .
  • the receiving element 91 receives a demand from a base station 6 of first network.
  • the fetching element 95 gets a list of available neighbour base stations 7 and 8 of second network and associated offered qualities of service.
  • the fetching element 95 is configured to be able to get said list from an operation, administration and maintenance center 21.
  • the transmitting element 92 sends said list to said base station 6 of first network as an answer to said demand.
  • the selector 96 tries and selects another neighbour base station 8 in said list.
  • Receiving element 91 and transmitting element 92 communicate afterwards with said base station 8 of first network through backhaul between core network 9 of first network and base station 8 selected from said list.
  • the transmitting element 92 and the selector 96 are configured such that either operation of transmitting element 92 sending said list or operation of selector 96 trying to select said another neighbour base station 8 can be performed, but both operations cannot be performed for the same demand.
  • the subsystem or core network 9 of first network is a serving gateway (SGW) of a E-UTRAN.
  • SGW serving gateway
  • Fig. 7 shows an example of a mobile user equipment according to an embodiment of the invention.
  • Mobile user equipment 4 comprises : a receiver 41, a transmitter 42, a controller 44, and a central unit 43 making all preceding elements working together.
  • the mobile user equipment 4 of figure 7 may, for example, be configured to perform appropriate method steps according to one or more figures 2 through 4 .
  • the transmitter 42 sends a request to a base station 6 of first network.
  • the receiver 41 receives a quality of service degradation proposal from the base station 6 of first network according to excessive traffic load on backhaul of said base station 6 of first network.
  • the controller 44 checks if said degradation proposal is acceptable for said request.
  • the transmitter 42 sends an acceptance message or a refusal message depending on checking result of controller 44.

Landscapes

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

Description

    FIELD OF THE INVENTION
  • The invention relates to communication in a cellular network in which backhaul loading is taken into account to limit the risk of traffic congestion.
  • BACKGROUND OF THE INVENTION
  • In a conventional cellular system, whatever generation is considered, a base station has at least two interfaces, an air interface to mobile user equipment (UE) and a backhaul interface to the core network.
  • In a cellular network, the backhaul portion of the network comprises the intermediate links between the core network, or backbone, of the cellular network and the small subnetworks at the "edge" of the entire cellular network. For example, while mobile user equipments communicating with a single base station constitute a local subnetwork, the connection between the base station and the rest of the world begins with a backhaul link to the core network of cellular network.
  • With more and more expectations coming from mobile user equipments, with respect to geographical coverage, available bandwidth, and quality of service level, that is to say with a continuous increase in user demand, traditional backhaul can be easily overloaded, thereby creating a backhaul bottleneck because of insufficient backhaul capacities.
  • A solution that could strike one's mind is to increase backhaul capacities in a limitless way in order to meet user's demand increase. But upgrading network infrastructure rapidly raises capital and operational expenditures to a non acceptable level for telecommunication operators.
  • In a first prior art, for example described in English application GB 2454872 , a solution to this problem is proposed. When backhaul traffic load becomes too high, corresponding base station of the network merely refuses new entering calls and a handover to a neighbor base station of the same network is managed. A new link is set up between new neighbor base station and mobile user equipment. This can only be done when there is at least one neighbor base station available in the network.
  • It is also known from US 2008/261602 , in a local network comprising several femto base stations and several terminals, said femto base stations having their own respective backhauls connecting them to main network, to have each terminal associated to a dedicated femto base station which is its only access to main network. In this context, a given terminal forms a cellular link either with its dedicated femto base station or with another femto base station of the local network. In both cases, whatever the traffic load on the backhaul of the femto base station dedicated to the given terminal, this given terminal always accesses the main network through the backhaul of this dedicated femto base station.
  • SUMMARY OF THE INVENTION
  • An object of some embodiments of the present invention is to alleviate at least partly the above mentioned drawbacks.
  • More particularly, embodiments of the invention aim to make processing simpler and more mobile user equipment transparent, when own backhaul traffic load of a base station in a network is too high to satisfy a new request from or to a mobile user equipment.
  • A preferred embodiment of the invention aims at making such processing completely transparent for mobile user equipment, that is to say with no interaction from mobile user equipment, with no cell change for the mobile user equipment, with no request relayed to another base station to trigger the backhaul change. To trigger the backhaul change, there is signaling only between base station and core network according to some embodiments of the invention.
  • When there are several different networks in a same geographical area, when base stations belonging to different networks are neighbor to one another in this same geographical area, it may happen that all different networks are not equally loaded. For example, a first network backhaul is close to traffic overload whereas a second network has major part of its backhaul capacities still traffic free and therefore available. It is within the scope of invention to take advantage of these yet unused backhaul capacities of second network to limit or to reduce the risk of backhaul traffic overload in the first network. This object is achieved with a method in a cellular communication network, base station apparatus of a cellular communication network and subsystem aparatus of a core network of a cellular network according to the appended claims. Further features and advantages of the invention will appear from the following description of embodiments of the invention, given as non-limiting examples, with reference to the accompanying drawings listed hereunder.
  • BRIEF DESCRIPTION OF THE DRAWINGS
    • Fig. 1 shows an example of a couple of cellular networks implementing an embodiment of the invention.
    • Fig. 2 shows the steps of an example of method implementing an embodiment of the invention.
    • Fig. 3 shows an example of detailed substeps of a step of method shown on figure 2.
    • Fig. 4 shows an example of detailed substeps of another step of method shown on figure 2.
    • Fig. 5 shows an example of main base station according to one embodiment of the invention.
    • Fig. 6 shows an example of a subsystem of core network according to one embodiment of to the invention.
    • Fig. 7 shows an example of a mobile user equipment according to one embodiment of to the invention.
    DETAILED DESCRIPTION OF THE INVENTION
  • Fig. 1 shows an example of a couple of cellular networks implementing an embodiment of the invention. There are two networks represented on figure 1, but there could be three of them or even more of them.
  • First network encompasses a core network 9, base stations 5 and 6, only two of them being represented on figure 1 but there may be more of them and mobile user equipments 1 and 4, only two of them being represented on figure 1 but there may be more of them. Base stations 5 and 6 communicate with core network 9, respectively through links 11 and 12. Link 11 is the backhaul between base station 5 and core network 9. Link 12 is the backhaul between base station 6 and core network 9. Core network 9 communicates through link 19 with an operation, administration and maintenance center 21. The operation, administration and maintenance center 21 will provide base station 6 with a list of available neighbor base stations of a second network with associated offered qualities of service for their associated backhauls. In the list, each available neighbor base station is associated with its offered quality of service of its dedicated backhaul. Mobile user equipments 1 and 4 can communicate with base stations 5 and 6 through air interface. On figure 1, mobile user equipment 4 has established a communication 16 through air interface with base station 6. Mobile user equipment 4 has sent a request to base station 6 or base station 6 has got a request that is to be sent to mobile user equipment 4. First network can, for example, be an E-UTRAN network. Base stations 5 and 6 can be eNodeB. An E-UTRAN (Enhanced Universal Terrestrial Radio Access Network) is a network also called long term evolution (LTE) UTRAN. First network could also be a GSM, a UTRAN, or a WIFI network.
  • Second network encompasses a core network 10, base stations 7 and 8, only two of them being represented on figure 1 but there may be more of them, and mobile user equipments 2 and 3, only two of them being represented on figure 1 but there may be more of them. Base stations 7 and 8 communicate with core network 10, respectively through links 13 and 14. Link 13 is the backhaul between base station 7 and core network 10. Link 14 is the backhaul between base station 8 and core network 10. Core network 10 communicates through link 20 with an operation, administration and maintenance center 21. Mobile user equipments 2 and 3 can communicate with base stations 7 and 8 through air interface. Second network can be a GSM (Global System for Mobile communications), UTRAN, E-UTRAN, or WIFI (Wireless Fidelity) network. Base stations 7 and 8 can be corresponding base stations, that is to say a 2G base station, a nodeB, eNodeB, Home eNodeB, or a WIFI base station.
  • On figure 1, through link 12, base station 6 of first network has asked core network 9 of first network for backhaul resource support. Core network 9 of first network or base station 6 of first network managed to find base station 8 of second network as available and as providing sufficient quality of service for its backhaul to satisfy request of mobile user equipment 4 of first network.
  • On figure 1, base station 6 of first network has established a communication 17 through air interface with base station 8 of second network, base station 6 of first network acting as a mobile user equipment of second network, that is to say acting as would act mobile user equipments 2 or 3, or at least in a similar way. By this communication 17, base station 6 of first network asks base station 8 of second network for backhaul resource support. The backhaul between base station 8 of second network and core network 9 of first network includes links 14 and 15 and goes through core network 10 of second network.
  • So base station 6 of first network, instead of satisfying request coming from or to mobile user equipment 4 of first network by communicating with core network 9 of first network through link 12 which is the own backhaul of base station 6, will satisfy request coming from or to mobile user equipment 4 of first network by communicating with core network 9 of first network first through air interface (communication 17) with base station 8 of second network, then through links 14 and 15, that is to say through backhaul between base station 8 of second network and core network 9 of first network. So base station 6 of first network, having too much traffic load on own backhaul, will use a new backhaul which is backhaul of base station 8 of second network.
  • On figure 1, mobile user equipment 3 now tries to establish a communication 18 through air interface with base station 8, after communications 16 and 17 have been established. If base station 8 of second network is far from being overloaded, it can deal with mobile user equipment 3 of second network. Whereas, if, on the contrary, base station 8 of second network is close to being overloaded, it cannot deal directly with mobile user equipment 3 of second network. In some embodiments, base station 8 of second network must first terminate backhaul sharing with base station 6 of first network, before being able to deal with request of mobile user equipment 3 of second network, which later request may have priority over former requests coming from first network according to some embodiments of the invention .
  • Fig. 2 shows the steps of an example of method implementing an embodiment of the invention. This method comprises a "request reception" step 31, a "traffic load check" step 32, a "new backhaul selection" step 33, a "request satisfaction through new backhaul" step 34, a "request satisfaction through old backhaul" step 35, a "traffic load recheck" step 36, and a "no request satisfaction" step 37. Depending on circumstances, only part of method steps can be performed for a same request. Base station 6 will from now on often be called main base station 6, simply because it is the base station that is considered to receive the request to be satisfied. Later on, another base station, like for example base station 5, could be called main base station if it receives a request to be satisfied.
  • In step 31, the main base station 6 of first network receives a request from or to the mobile user equipment 4 of the first network. For example, a request from the mobile user equipment 4 can be a file download request, whereas a request to the mobile user equipment 4 can be a request to establish a path for a terminating call to said mobile user equipment 4, this request coming from another mobile user equipment, either from first or second network, through network core 9 of first network. Once step 31 is performed, we go to step 32.
  • In step 32, the main base station 6 checks if request can be satisfied through own backhaul according to traffic load. There are two alternatives. Either it can be satisfied though own backhaul, or it cannot. If it can, "OK" option, then the request is satisfied through own backhaul of main base station 6 in step 35, and here ends the performing of the method. If it cannot, "NOK" option, then we go to step 33.
  • In step 32, in a preferred embodiment, the main base station 6 checks if request can be satisfied through own backhaul by comparing effective traffic load to a predetermined maximum traffic load threshold. Use of a maximum traffic load threshold helps anticipating overload and avoiding breakdown of main base station traffic load.
  • Preferably, this predetermined maximum traffic load threshold is below 100% of own backhaul total capacities in order to limit risk of congestion of own backhaul. Preferably, this predetermined maximum traffic load threshold ranges from 60% to 90% of own backhaul total capacities. More preferably, this predetermined maximum traffic load threshold ranges from 70% to 80% of own backhaul total capacities.
  • In step 33, main base station 6 or core network 9 of first network try to select another neighbour base station of second network, according at least to availability and/or to offered quality of service of said another neighbour base station.
  • When the request is a file down load request from mobile user equipment 4, then said another neighbour base station of second network, according at least to availability and to offered quality of service of said another neighbour base station, is preferably selected by main base station 6 of first network. More generally speaking, this applies when the request comes from mobile user equipment 4 to main base station 6 according to some embodiments.
  • When said request is a request to establish a path for a terminating call to mobile user equipment 4, then said another neighbour base station of second network, according at least to availability and to offered quality of service of said another neighbour base station, is preferably selected by core network 9 of first network. More generally speaking, this applies when the request comes to mobile user equipment 4 from main base station 6 or simply forwarded by main base station 6 according to some embodiments.
  • The selection in step 33 may be done according to a strategy. An example of such a strategy will be detailed in figure 4. Anyway, here again, there are two alternatives. Either selection of another base station of second network is successful, or it is not successful. If it is successful, we go to step 34. If it is not successful, we go to step 36.
  • If selection is not successful, in step 36, main base station 6 of first network may still try and use own backhaul, provided that is possible, even if effective traffic load is above maximum traffic load threshold. That can be done, because often, the maximum traffic load threshold is not an "absolute" maximum traffic load threshold ; indeed, the maximum traffic load threshold includes a margin.
  • In an alternative embodiment, if selection is unsuccessful, the main base station 6 may still try and use own backhaul, even if effective traffic load is above maximum traffic load threshold, provided effective traffic load is still below a very maximum traffic load threshold, the very maximum traffic load threshold being higher than the maximum traffic load. By way of example, the very maximum traffic load threshold can range from 90% to 99% of own backhaul total capacities. So this very maximum traffic load threshold still includes a margin, but a much smaller one than the maximum traffic load threshold.
  • Anyway, if in the end, either own backhaul of main base station 6 of first network can still be used (with a smaller margin than in step 32 of course) or it definitely cannot be used. If it still can be used, then we go to step 35, already known. If it definitely cannot be used, then we go to step 37.
  • In step 37, nothing is done for satisfying the request which simply cannot be satisfied at that time, except from waiting for own backhaul traffic load reduction. In another embodiment, in a more classical way, then handover can be used, with its drawbacks already discussed. In yet another embodiment, from time to time, main base station 6 can ask core network 9 of first network for an updated list of available neighbour base stations of at least a second network, hoping that the traffic load situation has changed. Some of preceding embodiments can be used in combination.
  • If selection in step 33 is successful, in step 34, main base station 6 communicates through backhaul between said another neighbour base station 8 of second network and core network 9 of first network to satisfy request. This communication to satisfy request will be detailed in figure 3.
  • Fig. 3 shows an example of detailed substeps of a step of method shown on figure 2. Step 34 of figure 2 may comprise two substeps, an "air interface communication" substep 341 and a "through backhaul communication" substep 342. Both substeps 341 and 342 are successively performed, the one or the other substep first.
  • When information comes from mobile user equipment 4 of first network, for example request of file download, information first goes from main base station 6 to said another neighbour base station 8 of second network through air interface and then information goes from said another neighbour base station 8 of second network to core network 9 of first network through backhaul between said another neighbour base station 8 of second network and core network 9 of first network.
  • When information comes to mobile user equipment 4 of first network, for example effective down of requested file, information first goes from core network 9 of first network to said another neighbour base station 8 through backhaul between said another neighbour base station 8 of second network and core network 9 of first network, and then goes from said another neighbour base station 8 of second network to main base station 6 through air interface.
  • Preferably, communicating through backhaul between said another neighbour base station 8 of second network and core network 9 of first network includes communicating through core network 10 of second network.
  • While using air interface, main base station 6 of first network, when communicating with neighbour base station 8 of second network, avoids loading own backhaul which is already very loaded, even sometimes more or less close to be overloaded. Main base station 6 communicates with said another neighbour base station 8 of second network through air interface, acting as a user equipment of second network.
  • Fig. 4 shows an example of detailed substeps of another step of method shown on figure 2. Step 33 of figure 2 may comprise several substeps. Among them, a "list fetching" substep 331, a "QoS backhaul estimation" substep 332, a "UE acceptance" sub step 333. Step 33 may start with substep 331.
  • In substep 331, the main base station 6 or the core network 9 of first network goes and fetches a list of available neighbour base stations 7 or 8 of at least a second network with associated offered qualities of service for their backhauls. We have already seen in figure 1 that this list is stored, updated, and provided by an operation, administration and maintenance center 21 sending it through core network 9 of first network. Main base station 6 of first network asks this list to core network 9 of first network. This list can of course contain more available base stations of second network or even available base stations of a third network or of other networks. At end of step 331, we go to substep 332.
  • Providing more than one possibility for backhaul sharing to main base station 6 of first network and implementing clever strategies to choose among possibilities helps maintaining a steady flow in the whole networks.
  • In substep 332, the main base station 6 or core network 9 of first network tries to select another neighbour base station 8 of second network by choosing, in the list of available neighbour base stations 7 and 8 of second network with associated offered qualities of service, preferably the available neighbour base station with the best quality of service for its backhaul, which is in our present case neighbour base station 8 of second network. In that way, the maximum effort is done to satisfy required quality of service of request transmitted by main base station 6 of first network despite the inter network backhaul drift.
  • A neighbour base station 7 or 8 is considered available when it is available to satisfy a new request, for example when effective traffic load of its backhaul is neither congested nor close to become congested.
  • In an alternative embodiment, main base station 6 or core network 9 of first network tries to select another neighbour base station of second network by choosing, in the list of available neighbour base stations 7 or 8 of second network with associated offered qualities of service for their backhauls, the available neighbour base station with the lowest quality of service, as long as this lowest quality of service is above the minimum quality of service required by the request to be satisfied. In this way, if later on, this main base station or another base station of first network needs also to benefit from a backhaul resource sharing but this time with another request requiring a highest quality of service, this can be done in an easier way.
  • In another alternative embodiment, main base station 6 or core network 9 of first network tries to select another neighbour base station of second network by choosing, in the list of available neighbour base stations 7 or 8 of second network with associated offered qualities of service for their backhauls, the available neighbour base station which has both a sufficient quality of service, that is to say a level of quality of service which is above the minimum quality of service required by the request to be satisfied, and the lowest effective traffic load on its backhaul. In this way, the risk that a base station of second network, sharing its backhaul with a base station of first network, becomes overloaded and for example needs itself to drift its backhaul traffic load, is more efficiently reduced.
  • Many other strategies may be applied in the selection of alternative base station. For example, one might apply a random selection among the available base stations having a sufficient QoS.
  • Anyway, either main base station 6 of first network can find another available neighbour base station 8 of second network with quality of service sufficient to meet requirements of request, or it cannot. If offered quality of service of intended to be chosen neighbour base station is above a threshold S corresponding to requirements of request, then we go to step 34 already known. If offered quality of service of intended to be chosen neighbour base station is below a threshold S corresponding to requirements of request, then we go to substep 333.
  • In substep 333, quality of service of neighbour base station intended to be chosen being below the minimum quality of service required by the request to be satisfied, main base station 6 of first network or core network 9 of first network requires acceptance of mobile user equipment 4 having issued the request. In that way, mobile user equipment has the lead on negotiated quality of service of its request.
  • A similar procedure for acceptance of a lower quality of service for mobile user equipment 4 may, in some embodiments, be applied also in step 36 and/or in step 32 in relation to the quality of service offered by the backhaul of the base station of the first network.
  • Mobile user equipment 4 can accept or refuse this quality of service degradation to satisfy its request. If mobile user equipment 4 accepts quality of service degradation, then we go to step 34 already known, "request satisfaction through new backhaul". If mobile user equipment 4 refuses quality of service degradation, then we go to step 36 already known, "traffic load recheck".
  • When a neighbour base station 8 of second network accepts to share its backhaul with main base station 6 of first network, said neighbour base station 8 of second network typically (but not necessarily) gives priority to requests from or to mobile user equipments 2 or 3 of second network over the request to be satisfied by main base station 6 of first network. In this way, sharing backhaul capacities with base stations 5 or 6 of other networks does not impede own backhaul traffic load of selected neighbour base station 8 of second network, or in the least reduces the intrusive effect of this sharing.
  • In an embodiment, this priority management may be implemented in a processing that runs as follows: when too many requests from or to mobile user equipments 2 or 3 of second network need backhaul use of the neighbour base station 8 of second network, this neighbour base station 8 stops sharing its backhaul with main base station 6 of first network. This stop can be forecast in order to give enough time to main base station 6 of first network to find another solution to continue satisfying the request it has started to satisfy while sharing backhaul of this neighbour base station 8 of second network.
  • In an alternative embodiment, this priority management may be implemented in a processing that runs as follows : any neighbour base station 8 of second network only accepts to share a minor part of its backhaul total capacities with main base station 6 of first network (or indeed with any other base station 5 or 6 of any other network). The total amount of backhaul capacities that a neighbour base station 8 can share with base stations 5 or 6 of other networks is a minor part of its backhaul total capacities. This sharable, with base stations 5 or 6 of other networks, amount of capacities could by way of example range from 10% to 30% of backhaul total capacities of this neighbour base station 8 of second network.
  • For priority management to be implemented, it is useful for neighbour base station 8 of second network to be able to make the difference between a call of a "normal" mobile user equipment 2 or 3 of second network on the one side and a call of a "main base station" 6 of first network, acting as a mobile user equipment of second network.
  • One way to make this difference could run as follows: when main base station 6 of first network calls neighbour base station 8 of second network, while acting as a mobile user equipment of second network, in order to ask for backhaul sharing, it could take advantage of the "spare bit" of an "EPS attach type information" (as described in section 9.9.3.11 of document TS 24.301 of the 3GPP specification), EPS standing for Evolved Packet System. One value of this spare bit would mean that another base station 6 is calling while the other value of this spare bit would mean that an ordinary mobile user equipment 2 or 3 is calling.
  • Fig. 5 shows an example of main base station according to one embodiment of the invention. Main base station 6 of first network comprising mobile user equipments 1 and 4, base stations 5 and 6 and a core network 9, comprises a receiver 61, a traffic load detector 64, a selector 65, a transmitter 62, and a central unit 63 making all preceding elements working together. The main base station 6 of figure 5 may, for example, be configured to perform appropriate method steps according to one or more figures 2 through 4.
  • The receiver 61 receives a request from or to mobile user equipment 4.
  • The traffic load detector 64 checks if received request can be satisfied through own backhaul according to traffic load. The traffic load detector 64 includes a threshold comparator configured to be able to compare effective traffic load to a predetermined maximum traffic load threshold.
  • The selector 65 tries and selects another neighbour base station 8 of second network according at least to availability and to offered quality of service of said another neighbour base station 8, if detection performed by detector 64 result is that received request cannot be satisfied trough own backhaul. The selector 65 includes a controller able to select a neighbour base station among other available neighbour base stations, according to their respective qualities of service and or their respective effective traffic loads. The selector 65 may be associated to a memory 66 in which are stored the formulas that are used to implement the strategy with respect to the way of choosing a neighbour base station among other available neighbour base stations.
  • The transmitter 62 and the receiver 61 communicate through backhaul between selected neighbour base station 8 of second network and core network 9 of first network to satisfy received request, if selection performed by selector 65 has been successful.
  • In a preferred embodiment, main base station 6 is an eNodeB of a E-UTRAN.
  • Fig. 6 shows an example of a subsystem SCN of core network according to an embodiment of the invention. The subsystem of core network 9 comprises a receiving element 91, a transmitting element 92, , a fetching element 95, a selector 96, and a central unit 94 making all preceding elements working together. The subsystem of core network 9 of figure 6 may, for example, be configured to perform appropriate method steps according to one or more figures 2 through 4.
  • The receiving element 91 receives a demand from a base station 6 of first network. The fetching element 95 gets a list of available neighbour base stations 7 and 8 of second network and associated offered qualities of service. The fetching element 95 is configured to be able to get said list from an operation, administration and maintenance center 21. The transmitting element 92 sends said list to said base station 6 of first network as an answer to said demand. The selector 96 tries and selects another neighbour base station 8 in said list.
  • Receiving element 91 and transmitting element 92 communicate afterwards with said base station 8 of first network through backhaul between core network 9 of first network and base station 8 selected from said list.
  • The transmitting element 92 and the selector 96 are configured such that either operation of transmitting element 92 sending said list or operation of selector 96 trying to select said another neighbour base station 8 can be performed, but both operations cannot be performed for the same demand.
  • In a preferred embodiment, the subsystem or core network 9 of first network is a serving gateway (SGW) of a E-UTRAN.
  • Fig. 7 shows an example of a mobile user equipment according to an embodiment of the invention. Mobile user equipment 4 comprises : a receiver 41, a transmitter 42, a controller 44, and a central unit 43 making all preceding elements working together. The mobile user equipment 4 of figure 7 may, for example, be configured to perform appropriate method steps according to one or more figures 2 through 4.
  • The transmitter 42 sends a request to a base station 6 of first network. The receiver 41 receives a quality of service degradation proposal from the base station 6 of first network according to excessive traffic load on backhaul of said base station 6 of first network. The controller 44 checks if said degradation proposal is acceptable for said request. The transmitter 42 sends an acceptance message or a refusal message depending on checking result of controller 44.
  • The invention has been described with reference to preferred embodiments. However, many variations are possible within the scope of the invention.

Claims (13)

  1. Method of communication in a cellular communication network comprising mobile user equipments (1, 4), base stations (5, 6) and a core network (9), including the successive steps of:
    a) main base station (6) of a first cellular network receiving a request from or to a mobile user equipment (4) of the first network;
    b) main base station (6) checking if request can be satisfied through own backhaul according to traffic load;
    wherein, if request cannot be satisfied trough own backhaul, method further includes the successive steps of:
    c) main base station (6) or core network (9) of first network trying to select another neighbour base station (8) of at least a second cellular network different from first network, according at least to availability of a backhaul of said another neighbour base station (8) and to offered quality of service of the backhaul of said another neighbour base station (8), wherein the neighbour base station (8) is selected from a list of available neighbour base stations of the second cellular network provided by the operation, administration and maintenance center to the main base station;
    d) if successful, main base station (6) communicating through backhaul between said another neighbour base station (8) of second network and core network (9) of first network to satisfy request.
  2. Method of communication according to claim 1, wherein, in step d), main base station (6) communicates with said another neighbour base station (8) of second network through air interface and communicates with core network (9) of first network through backhaul between said another neighbour base station (8) of second network and core network (9) of first network via a core network (10) of second network, to satisfy request.
  3. Method of communication according to claim 2, wherein, in step d), main base station (6) communicates with said another neighbour base station (8) of second network through air interface, acting as a user equipment of second network.
  4. Method of communication according to claim 1, wherein, in step b), main base station (6) checks if request can be satisfied through own backhaul by comparing effective traffic load to a predetermined maximum traffic load threshold.
  5. Method of communication according to claim 1, wherein, in step c), main base station (6) or core network (9) of first network tries to select another neighbour base station (8) of at least a second network by choosing in a list of available neighbour base stations (7, 8) of at least a second network with associated offered qualities of service.
  6. Method of communication according to claim 5, wherein, in step c), main base station (6) or core network (9) of first network tries to select another neighbour base station (8) of at least a second network by choosing, in the list of available neighbour base stations (7, 8) of at least a second network with associated offered qualities of service, the available neighbour base station (8) with the best quality of service.
  7. Method of communication according to claim 5, wherein, in step c), main base station (6) or core network (9) of first network tries to select another neighbour base station (8) of at least a second network by requiring acceptance of said mobile user equipment (4), if quality of service of neighbour base station (8) intended to be chosen is below the minimum quality of service required by the request to be satisfied.
  8. Main base station (6) of a main cellular network comprising mobile user equipments (1, 4), base stations (5, 6) and a core network (9), comprising:
    a) a receiver (61) adapted to receive a request from or to a mobile user equipment (4);
    b) a traffic load detector (64) adapted to check if request can be satisfied through own backhaul according to traffic load;
    wherein, main base station (6) further comprises:
    c) a selector (65), adapted to try and select another neighbour base station (8) of at least another cellular network according at least to availability and to offered quality of service of said another neighbour base station (8), if request cannot be satisfied trough own backhaul, wherein the neighbour base station (8) is selected from a list of available neighbour base stations of the second cellular network provided by the operation, administration and maintenance center to the main base station;
    d) a transmitter (62) and the receiver (61), both adapted to communicate through backhaul between said another neighbour base station (8) of said another cellular network and core network (9) of main cellular network to satisfy request, if selection successful.
  9. Main base station according to claim 8, wherein main base station (6) is an eNodeB of a E-UTRAN.
  10. Subsystem of a main core network (9) of a main cellular network comprising mobile user equipments (1, 4), base stations (5, 6) and the main core network (9), comprising:
    a) a receiving element (91) adapted to receive a demand from a base station (6);
    b) a fetching element (95) adapted to get a list of available neighbour base stations (7, 8) and associated offered qualities of service of at least another cellular network;
    c) a transmitting element (92) adapted to send said list to said base station (6) of main cellular network as an answer to said demand;
    d) a selector (96), adapted to try and select another neighbour base station (8) in said list;
    receiving element (91) and transmitting element (92) being adapted to communicate afterwards with said base station (6) of main cellular network through backhaul between main core network (9) and one base station (8) selected from said list.
  11. Subsystem according to claim 10, wherein subsystem is a serving gateway of a E-UTRAN.
  12. Subsystem according to claim 11, wherein the fetching element (95) is configured to be able to get said list from a OAM center.
  13. A computer program product comprising a computer readable medium, having thereon a computer program comprising program instructions, the computer program being loadable into a data-processing unit and adapted to cause execution of the method according to any of claims 1 through 7 when the computer program is run by the data-processing unit.
EP11306173.3A 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading Not-in-force EP2571310B1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP11306173.3A EP2571310B1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading
EP16189550.3A EP3142412A1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading
US14/345,131 US9282486B2 (en) 2011-09-16 2012-09-13 Communication in a cellular network taking into account backhaul loading
PCT/EP2012/067975 WO2013037903A2 (en) 2011-09-16 2012-09-13 Communication in a cellular network taking into account backhaul loading

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP11306173.3A EP2571310B1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading

Related Child Applications (2)

Application Number Title Priority Date Filing Date
EP16189550.3A Division EP3142412A1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading
EP16189550.3A Division-Into EP3142412A1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading

Publications (2)

Publication Number Publication Date
EP2571310A1 EP2571310A1 (en) 2013-03-20
EP2571310B1 true EP2571310B1 (en) 2017-05-31

Family

ID=44764046

Family Applications (2)

Application Number Title Priority Date Filing Date
EP11306173.3A Not-in-force EP2571310B1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading
EP16189550.3A Withdrawn EP3142412A1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading

Family Applications After (1)

Application Number Title Priority Date Filing Date
EP16189550.3A Withdrawn EP3142412A1 (en) 2011-09-16 2011-09-16 Communication in a cellular network taking into account backhaul loading

Country Status (3)

Country Link
US (1) US9282486B2 (en)
EP (2) EP2571310B1 (en)
WO (1) WO2013037903A2 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130272219A1 (en) * 2012-03-13 2013-10-17 Qualcomm Incorporated Methods and apparatus for backhaul sharing by femtocells
ES2636889T3 (en) * 2013-10-31 2017-10-10 Telefonica Digital España, S.L.U. Method and device for coordinating access points for backlink aggregation in a telecommunications network
WO2016037324A1 (en) * 2014-09-10 2016-03-17 华为技术有限公司 Apparatus and method for establishing data transmission link, and communications system
WO2016154892A1 (en) * 2015-03-31 2016-10-06 华为技术有限公司 Spectrum sharing method and apparatus
US9986458B2 (en) * 2015-08-27 2018-05-29 Qualcomm Incorporated Mitigating constrained backhaul availability between a radio access network (RAN) and core network
WO2018035724A1 (en) * 2016-08-23 2018-03-01 华为技术有限公司 Service establishment method and device
WO2018119923A1 (en) * 2016-12-29 2018-07-05 华为技术有限公司 Communication method and mobile terminal
JP2020167550A (en) * 2019-03-29 2020-10-08 本田技研工業株式会社 Communication device, communication method, and program

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7640020B2 (en) * 2005-12-19 2009-12-29 Motorola, Inc. Method and apparatus for assigning backhaul methods
US7848241B2 (en) * 2006-01-31 2010-12-07 Motorola Mobility, Inc. Method and apparatus for handoff control in mobile communications systems
US8594678B2 (en) 2007-04-18 2013-11-26 Qualcomm Incorporated Backhaul network for femto base stations
GB2454872B (en) 2007-11-16 2010-01-13 Motorola Inc A base station for a cellular communication system and a method of operation therefor
US8243679B1 (en) * 2007-12-05 2012-08-14 Sprint Communications Company L.P. Initiating a handover in a communication network
US8126403B2 (en) * 2008-04-23 2012-02-28 Telefonaktiebolaget Lm Ericsson (Publ) Estimating and limiting inter-cell interference
US8861449B2 (en) * 2008-11-21 2014-10-14 Telefonaktiebolaget L M Ericsson (Publ) Transmission method and devices in a communication system with contention-based data transmission
GB0901314D0 (en) * 2009-01-27 2009-03-11 Vodafone Plc IMS home cell
US8422424B1 (en) * 2009-12-08 2013-04-16 Sprint Communications Company L.P. Identification of backhaul links for termination
US8254949B2 (en) * 2009-12-23 2012-08-28 At&T Intellectual Property I, L.P. Active set modification to release backhaul capacity
US8559957B2 (en) * 2010-01-28 2013-10-15 Qualcomm Incorporated Method and apparatus for biasing a handoff decision based on a blackhaul link

Also Published As

Publication number Publication date
US20140248897A1 (en) 2014-09-04
WO2013037903A3 (en) 2013-08-29
EP2571310A1 (en) 2013-03-20
WO2013037903A2 (en) 2013-03-21
EP3142412A1 (en) 2017-03-15
US9282486B2 (en) 2016-03-08

Similar Documents

Publication Publication Date Title
US11917484B2 (en) Content-aware inter-RAT RAB steering
EP2571310B1 (en) Communication in a cellular network taking into account backhaul loading
EP2529580B1 (en) Hybrid home node b
EP3108691B1 (en) Traffic steering in a wlan based on transmit power control
JP6358450B2 (en) Communication system and load balancing method
EP3618499B1 (en) Method and cell for determining handover of pdu session
CN109804672B (en) Cellular telecommunications network
EP2906015B1 (en) Flexible connection control femtocell access point (fap) device of small cell and method of driving the same
EP3018934B1 (en) Network offloading method and apparatus
CN109792683B (en) Cellular telecommunications network, base station and method of operating a base station in a cellular telecommunications network
EP2241129B1 (en) Offered bit rate at handover
US9356832B2 (en) Method and arrangement for optimization of network element settings
KR101657861B1 (en) Load balancing
EP3179814B1 (en) Apparatus and method for establishing data transmission link, and communications system
WO2016006397A1 (en) Communication system, control node, base station and method for congestion control on a backhaul link
CN114208267A (en) Method and device for adjusting QoS of QoS flow based on auxiliary information
KR102482607B1 (en) Method for operating user equipment with a base station of a cellular network
KR101651962B1 (en) Method for enhanced access selection by a user equipment in a cellular telecommunications network, telecommunications network, and system for enhanced access selection of a user equipment
US20220201553A1 (en) Radio network node, network node and methods performed therein for controlling transmission
WO2016072465A1 (en) Base station and processor
KR101612214B1 (en) Method of and apparatus for accessing in wireless communication network
US10542451B1 (en) Systems and methods for managing conflicts between access node protocols
JP6374922B2 (en) Relay device and relay method
JP2014096747A (en) Base station and handover control method

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

17P Request for examination filed

Effective date: 20130903

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

17Q First examination report despatched

Effective date: 20131113

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20161208

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: OCT CIRCUIT TECHNOLOGIES INTERNATIONAL LIMITED

RIN1 Information on inventor provided before grant (corrected)

Inventor name: SFAR, SAFOUANE

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 898433

Country of ref document: AT

Kind code of ref document: T

Effective date: 20170615

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602011038305

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20170531

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 898433

Country of ref document: AT

Kind code of ref document: T

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170901

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170831

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170930

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170831

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602011038305

Country of ref document: DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602011038305

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

26N No opposition filed

Effective date: 20180301

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20170916

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20170930

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170916

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20180531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180404

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170916

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170930

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170930

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170916

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20171002

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170930

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170916

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20110916

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170531