[go: up one dir, main page]

WO2014128239A1 - Procédé, entité de gestion et entité d'agent destinés à une attribution de bande passante homogène - Google Patents

Procédé, entité de gestion et entité d'agent destinés à une attribution de bande passante homogène Download PDF

Info

Publication number
WO2014128239A1
WO2014128239A1 PCT/EP2014/053388 EP2014053388W WO2014128239A1 WO 2014128239 A1 WO2014128239 A1 WO 2014128239A1 EP 2014053388 W EP2014053388 W EP 2014053388W WO 2014128239 A1 WO2014128239 A1 WO 2014128239A1
Authority
WO
WIPO (PCT)
Prior art keywords
bearer
bandwidth
bearers
fair share
bit rate
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.)
Ceased
Application number
PCT/EP2014/053388
Other languages
English (en)
Inventor
Stephan Hauth
Eugen Wallmeier
Thomas Theimer
Thushara WEERAWARDANE
Yasir ZAKI
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.)
Nokia Solutions and Networks GmbH and Co KG
Original Assignee
Nokia Solutions and Networks GmbH and Co KG
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 Nokia Solutions and Networks GmbH and Co KG filed Critical Nokia Solutions and Networks GmbH and Co KG
Publication of WO2014128239A1 publication Critical patent/WO2014128239A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/0289—Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5019—Ensuring fulfilment of SLA
    • H04L41/5025—Ensuring fulfilment of SLA by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
    • 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/0268—Traffic management, e.g. flow control or congestion control using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR]

Definitions

  • the invention relates to a method, a managing entity, an agent entity, a mobile service network, and computer program product for consistent
  • bandwidth allocation in particular downlink bandwidth allocation, and in particular in case of air interface and mobile backhaul congestion in a packet oriented mobile service network.
  • a mobile service network 100 at least one radio
  • Radio Transceiver 101
  • MBH Mobile Backhaul Network
  • gateway Gateway
  • PSTN Switched Telephone Network
  • Internet 105 or using other, potentially dedicated, wired or wireless (fixed or mobile) service networks.
  • Mobile Core Network functions may be incorporated 1n or associated with the mobile service network to support mobility
  • UE User eguipment
  • UE comprises any fixed or mobile devices, systems, or arrangements in the hands, or at a site, or under control of a subscriber (or user) of the mobile service network and capable of connecting to the network via the radio interface provided by a radio transceiver.
  • the radio transceiver may be a base station (BTS), a NodeB, an enhanced NodeB (eNodeB) or any eguivalent device providing regional (and preferably cellular) radio access using technologies as specified e.g. in the 2G, 3G, 4G/LTE, or other relevant radio standards .
  • BTS base station
  • eNodeB enhanced NodeB
  • any eguivalent device providing regional (and preferably cellular) radio access using technologies as specified e.g. in the 2G, 3G, 4G/LTE, or other relevant radio standards .
  • the gateway may be any device, system, or arrangement capable of providing access to other service networks such as, or through, the PSTN, the Internet, or any other kind of application and/or transport service network.
  • the gateway may be a PDN gateway, SAE gateway or any other suitable gateway providing an interface, e.g. a packet data network interface, to a network, e.g. the Internet.
  • Typical applications, among others, could be location based or streaming services .
  • the gateway may to a large extent be implemented in, or comprise, computer program software, which, when loaded into the memory and executed on a
  • a gateway device, system, or arrangement may comprise computer hardware and software and it may be capable to, or actually do, provide and/or share hardware and software resources with other system functions not necessarily specific for the gateway function.
  • Radio transceivers and gateways may be arranged in redundancy schemes for a better availability and reliability of their respective services.
  • the mobile backhaul network may comprise any components and technologies suitable to interconnect radio transceivers and gateways as described above. More recent systems
  • Packet Data Network (PDN) Gateways interface to the Internet or dedicated packet oriented service networks using a packet data network interface (PDNI) (Fig. 2) .
  • PDNI packet data network interface
  • 3GPP TS 23.002 V12.1.0 (2012-12) (as well as other versions of the TS 23.002 document) presents possible architectures of a packet oriented mobile service network based on various radio access technologies and an Evolved Packet System (EPS) as specified by 3GPP.
  • EPS Evolved Packet System
  • a bearer uniquely identifies traffic flows that receive a common treatment between a user equipment and a gateway. Packet filters are associated with the bearers to identify the traffic flows belonging to each bearer. All traffic mapped to the same bearer receives the same bearer level packet forwarding treatment, i.e. routing, queuing, scheduling, rate shaping, etc., in the network and thus exhibits the same QoS behaviour. Actions performed on bearer traffic by individual components of the network may differ according to the different roles of the components in the network (user equipment, radio transceiver, MBH,
  • 3GPP distinguishes between guaranteed bit rate (GBR) bearers and non-guaranteed bit rate (non-GBR) bearers.
  • GRR guaranteed bit rate
  • non-GBR non-guaranteed bit rate
  • QCI QoS Class Identifier
  • AMBR Aggregate Maximum Bit Rate
  • Bearer based traffic shaping and related fair traffic shares can also be applied by the radio transceiver to upstream traffic propagated towards the PDN gateway via the MBH. Note, that the number of subscription levels is not necessarily limited to two. Whereas traffic can be treated individually on a per bearer basis in the radio transceiver and the gateway, this is completely different within the packet based MBH. Class based traffic management is applied instead of bearer based traffic control. Traffic classes are distinguished e.g. by DiffServ Code Points (DSCP) in IP based networks (IETF RFC 2474, RFC 2475, RFC 3260 and others), P-bit values with Carrier
  • DSCP DiffServ Code Points
  • Ethernet IEEE 802.1Q
  • EXP bit values with MPLS RRC 3270
  • 3GPP TS 23.401 suggests a potential mapping between QCI values of EPS bearers and DSCP values.
  • Ekstrom QoS Control in the 3GPP Evolved Packet System
  • the gateway and the LTE RAN implements a QCI to DSCP mapping function to make a translation from bearer level QoS (QCI) to transport-level QoS (DSCP), and he concludes that in the transport network the bearer is not visible and hence the traffic forwarding treatment of each individual packet is based on the DSCP value.
  • QCI bearer level QoS
  • DSCP transport-level QoS
  • the QoS which the end user of an LTE network perceives in case of network congestion is determined by various QoS mechanisms applied in different parts of the network. Congestion can occur at the air interface and also in the Mobile Backhaul Network (MBH) . Due to the high peak rates possible in LTE networks, it is not economical for an operator to take maximum cell capacities into account when dimensioning the MBH.
  • the Downlink Packet Scheduler of an eNodeB handles congestion at the air interface by supporting multiple QoS classes identified by the Quality Class Identifier (QCI) .
  • QCI Quality Class Identifier
  • Scheduler takes into account the QCI each time, when it allocates resources to an individual Radio Bearer.
  • Mobile Backhaul Networks use simpler QoS mechanisms than the air interface schedulers of an eNodeB.
  • IP based Mobile Backhaul Networks typically class based traffic management (based on the DiffServ concept) is used to handle congestion. Individual Radio Bearers are not visible in the MBH.
  • Guaranteed Bit Rate (GBR) bearers e.g. using strict priority gueues and Admission Control (AC) procedures. This raises the issue of how to distribute the remaining bandwidth among non- GBR bearers .
  • the object is achieved by a method, managing entity, agent entity and computer program product as specified in the independent claims. Further embodiments are described in the dependent claims .
  • a method for a consistent allocation of bandwidth shares for non-guaranteed bit rate bearers on air interfaces and in a mobile backhaul network section of a packet based mobile service network comprises : estimating an overall transport bandwidth available for non-guaranteed bit rate bearers in the mobile backhaul network; estimating a fair share of the overall transport bandwidth for each non-guaranteed bit rate bearer and its respective traffic rate; and in case of a potential congestion throttling the respective traffic rate of a non-GBR bearer to its respective fair share transport bandwidth .
  • a method for a consistent allocation of downlink bandwidth shares for non-guaranteed bit rate bearers on an air interfaces and in a mobile backhaul network section of a packet based mobile service network comprises estimating an overall transport bandwidth available for non-guaranteed bit rate bearers in the mobile backhaul network; estimating a fair share of each non-guaranteed bit rate bearer and its respective bandwidth; and in case of a potential congestion throttling a respective traffic rate of a non-GBR bearer to its respective fair share bandwidth; wherein the throttling is done by discarding incoming packets to a radio
  • transceiver thereby invoking respective TCP traffic control mechanisms .
  • the method may relate to a consistent
  • the estimated fair share of each non-guaranteed bit rate bearer relates to a fair share of bandwidth and/or fair share of traffic rate.
  • the term "estimating” should be read in a broad sense. In particular, it may encompass a true estimation, i.e. calculation or even estimating, of an unknown value, for example the overall transport bandwidth available. In this case the estimated or calculated value may include an error. However, the term may as well encompass a determination of an in principle known value, e.g. in cases where the overall transport bandwidth is already known or can be easily calculated, in which case the resulting "estimated value" may include only a very small or even no error at all.
  • a managing entity for a mobile service network comprises: a calculation unit configured to estimate an overall transport bandwidth available for non-guaranteed bit rate bearers and configured to estimate a fair share of the overall transport bandwidth for each non-guaranteed bit rate bearer and its respective traffic rate; and a
  • communication interface configured to communicate information indicative of the estimated fair share.
  • the managing entity may be a traffic
  • enforcement manager or an enhanced traffic enforcement manager and/or may be part or may form a gateway.
  • the managing entity may be part of a radio transceiver or may form a radio transceiver, for example.
  • the term "managing entity" may particularly encompass a hardware component like a suitably programmed processing unit or computer as well as the pure software component which may be run on a processing unit. In particular, the overall
  • transport bandwidth available for non-guaranteed bit rate bearers may be calculated for all bearers of the mobile service network or for a subset of all bearers of the mobile service network, e.g. by a subset corresponding to a cell and/or which are associated with a specific eNodeB, NodeB or base station.
  • an agent entity for a mobile service network comprising a counting unit configured to count incoming data packets per non-guaranteed bearer; and a communication interface configured to communicate with a managing entity according to an exemplary aspect.
  • the agent entity may be a traffic enforcement agent or an enhanced traffic enforcement agent.
  • the agent entity may be part of or may form an eNodeB, a NodeB, a base station or a radio transceiver.
  • the agent entity may be a radio transceiver which may be adapted to perform a method according to an exemplary aspect.
  • the agent entity may be further configured to increment a virtual gueue length for at least one or each non-guaranteed bit rate bearer, in particular the virtual gueue length may be incremented according to bytes received by the agent entity in a time interval (t-x,t) .
  • the agent entity may be configured to send the counted number of incoming data packets or bytes arrived in the time interval (t-x,t) and/or a fair share of an air interface bandwidth for the point in time (t) to the managing entity.
  • the agent entity may be configured to perform a throttling by discarding packets or data packets and/or by using Explicit Congestion Notification.
  • a packet based mobile service network comprising a managing entity according to an exemplary aspect and an agent entity according to an
  • the managing entity and the agent entity may be two different entities, physical and/or logically/virtually .
  • the two entities may be implemented by one and the same physical entity implementing both functions.
  • a computer program product comprising software is provided, which when loaded into the memory of a computer enables the computer to execute any of the steps of the method of an exemplary aspect.
  • the described components and features may also be used in connection with the managing entity, the agent entity, the packet based mobile service network, and the computer program product.
  • the throttling is done by discarding incoming packets and/or by using Explicit Congestion Notification.
  • the throttling may be done by discarding incoming packets to a radio transceiver, agent entity, NodeB, base station or eNodeB .
  • the discarding of a number of incoming packets may be a suitable way to achieve that a calculated or estimated fair share of transport bandwidth or corresponding traffic load is observed.
  • the chances of a potential congestion may be reduced or even avoided by using Explicit Congestion
  • the estimating of the fair share of the overall transport bandwidth a weighting factor is considered for each non- guaranteed bit rate bearer.
  • the weighting factor or weight may be any weighting factor or weight.
  • the weighting factor or weight may be any weighting factor or weight.
  • QCI Quality of Service Class Identifier
  • the method further comprises determining whether an actual traffic rate of respective non-guaranteed bit rate bearer is below its respective fair share of transport bandwidth; and in case it is determined that the actual traffic rate of the respective non-guaranteed bit rate bearer is below its respective fair share of transport bandwidth redistributing the difference between the estimated fair share traffic rate and the actual traffic rate to other bearers.
  • the other bearer(s) may be non-guaranteed bit rate bearers.
  • the provision of a redistribution possibility may enable an efficient use of the overall transport
  • the redistribution may be performed once or several times, e.g. in form of an iterative process, till all potential free or unused transport bandwidth is allocated to the bearers, in particular to the other active bearers.
  • the estimation of the fair share of the overall transport is performed for a given time interval.
  • the estimation of the fair share of the overall transport bandwidth may be based on a time interval preceding the given time interval. For example, the
  • estimation may be based on a single preceding time interval or a plurality of preceding time intervals.
  • the estimation may be based on an average of the plurality o preceding time intervals or may be based on the directly or immediately preceding time interval.
  • the method further comprises deciding whether a non-guaranteed bit rate bearer is an active or inactive bearer.
  • an inactive non-GBR bearer may be a bearer which is not active, i.e. has a traffic load or carried load of less than a predetermined threshold.
  • the predetermined threshold may be 10 kbit/s or 2 kbit/s or the like .
  • the estimation of the fair share of transport bandwidth is only performed for bearer determined to be an active bearer.
  • the described components and features may also be used in connection with the methods, the agent entity, the packet based mobile service network, and the computer program product .
  • the calculation unit is further configured to decide for each non-guaranteed bit rate bearer whether it is an active bearer or not .
  • the decision may be based on information received by the managing entity from an agent unit, for example.
  • the information may be based on or may be indicative for a carried load of the respective bearer during a given time interval .
  • the estimation of a fair share is only performed for active bearers .
  • the managing unit is configured to perform a bandwidth redistribution .
  • the bandwidth redistribution may be performed for the active bearer, i.e. only the active bearers may be considered by the redistribution, while the bandwidth share of the inactive non-GBR bearers are redistributed or
  • the calculation unit is further configured to calculate an enforcement rate for at least one active bearer .
  • the invention may be guided by the idea that the bandwidth available for (active) non-GBR bearers at any bottleneck in the system should always be shared based on the same rules as used by the air interface schedulers, independent of the location of the respective bandwidth bottleneck.
  • a key principle may be a preventive one . Proactive throttling of bearer traffic based on prediction of potential transport bottlenecks avoids the potentially devastating effects of the purely class based traffic control mechanisms in the
  • eTE enhanced Traffic Enforcement
  • Exemplary embodiments builds and relies on the specific properties and the behavior of traffic that on one hand is greedy on bandwidth (and capable of getting hold of available bandwidth) , but on the other hand obeys to rules of
  • congestion control that aim at a fairly shared usage of the available bandwidth between multiple traffic sources. This typically applies to TCP based traffic, which forms the vast majority of non-GBR traffic in the system.
  • the system comprises or consists of an eNodeB (eNB) connected to a transport network for mobile backhaul (MBH) .
  • eNB eNodeB
  • MCH mobile backhaul
  • the transport network may use any kinds of switching and
  • the DOWNLINK schedulerin the eNodeB (indirectly) controls the downlink BW of the transport section bottleneck located UPSTREAM to it, i.e. the bandwidth of the data streams coming down to it. In fact, it does not really manage the bandwidth of the
  • the invention specifies the mechanisms to control the system and a specific algorithm for
  • radio transceiver or eNodeB
  • eNodeB any other control instance of the system, which is eguipped with a computer.
  • Such instance could e.g. be a network management system or a policy controller .
  • the software may be incorporated with any means capable of storing permanently or temporarily computer program code or related data .
  • any system and device capable of or intended to be used for executing the method, or the underlying algorithm, or any part of any of these is preferably eguipped, has to be eguipped or is at least with respective means, i.e. a computer (processing device with respective memory and input/output capabilities, etc.) and/or other respective hardware means.
  • Fig. 1 schematically shows a mobile service network.
  • Fig. 2 schematically shows another kind of mobile service network .
  • Fig. 3 schematically shows a mobile service network
  • FIG. 4 showing schematically effective buffer filing vs.
  • Fig. 5 schematically depicts the monitoring of downlink load.
  • Fig. 6 schematically depicts basic principle of eTE for an example of two greedy sources.
  • Figs. 7A and 7B schematically illustrate the redistribution during which the eTE takes into account sources with low activity .
  • Fig. 8 schematically illustrates a functional view of eTE .
  • Fig. 9 schematically depicts a whole eTE algorithm in a seguence view.
  • Fig. 10 schematically depicts the eTE algorithm of Fig. 9 in a time view.
  • Guaranteed Bit Rate (GBR) bearers e.g. using strict priority gueues and Admission Control (AC) procedures. This raises the issue of how to distribute the remaining bandwidth among non- GBR bearers.
  • GBR Guaranteed Bit Rate
  • AC Admission Control
  • MBH overload air interface overload
  • the air interface scheduler acts on individual Radio Bearers while the MBH uses class based traffic management and is not aware of Radio Bearers. For example, considering an eNodeB serving a number of p cells typical values of p could e.g. be 3 or 6. Each of the cells has its own Downlink Packet Scheduler, which allocates bandwidth to non-GBR bearers using weights (one weight per QCI) and further parameters which reflect radio conditions.
  • traffic management and control mechanism applied to other potential bottlenecks in the system should not interfere with the bandwidth distribution and the respective shares allocated by the air interface schedulers.
  • the distribution of transport bandwidth in case of a congestion in the MBH should not contradict to or jeopardize the distribution of bandwidth to individual bearers as specified for the air interface.
  • the bandwidth allocated to each service class is fixed, which can lead to further problems, when e.g. the traffic mix of different types of users (e.g. Business and Economy) cannot be predicted exactly. Even worse, since the service usage on the air interface freguently changes in time, the weights defining the bandwidth shares of Weighted Fair Queuing (WFQ) schedulers in the MBH will usually not fit with the actual traffic mix. It thus may happen that a Business User, though he should clearly be preferred against an Economy User (and actually receives this preferred service at the air
  • the Mobile Backhaul Network has the tendency to egualize the throughput of TCP sessions using the same QoS class. This is implied by the way, the fairness mechanisms of TCP are defined and implemented.
  • the throughput of non-GBR bearers, assigned to the same QoS class in the MBH is proportional to the (arbitrary) number of TCP sessions contained therein. In other words, in times of MBH congestion two non-GBR bearers, even if associated with the same bandwidth at the air-interface, may come out of the MBH with completely different bandwidths, if they contain a different number of TCP sessions.
  • the radio transceiver e.g. an eNodeB of an LTE system
  • the radio transceiver can easily do an individual shaping of all bearers sharing its resources. By doing so it can control and limit the amount and the mix of traffic according to the resources available for it in the MBH before the traffic enters the MBH.
  • the bearers sharing the air interface resources of a radio transceiver may pass through different gateways. Even AMBR shaping in the different gateways (as it has no "common view”) cannot avoid potential traffic
  • Fig. 3 schematically depicts a basic concept of eTE.
  • Fig. 3 shows a mobile service network 300 similar to the one depicted in Figs. 1 and 2 comprising at least one eNodeB 301, connected via a Mobile Backhaul Network (MBH) 302 to at least one gateway (Gateway, e.g. an SAE-gateway) 303, provides through a radio interface connectivity between a plurality of (in most cases mobile) subscriber devices (user equipment, UE ) 304 among each other and with other devices, e.g. servers 306, or other components or devices (not shown), reachable from the least one gateway via the Internet 305, for example.
  • MMH Mobile Backhaul Network
  • DL downlink
  • dotted lines 307 some potential transport bottlenecks for LTE downlink (DL) traffic are indicated in Fig. 3 by the dotted lines 307.
  • any part of the MBH i.e. any link and/or node
  • could be congested at a given point in time i.e. forms a bottleneck.
  • different DL traffic streams destined for the same UE may pass different bottlenecks.
  • DL per bearer shaping in the SAE-gateway may limit the traffic which can be sent over a bearer .
  • the TCP congestion control is schematically indicated by the arrows 311.
  • eTE eTE
  • backhaul congestion e.g., LTE and LTE-A
  • eTE eTE reguires a few basic building blocks which are described in more detail below:
  • Throttling a bearer may be done by discarding incoming IP packets at the PDCP layer and thus triggering TCP congestion control.
  • the eTE algorithm is relying on TCP congestion control.
  • TCP Transmission Control Protocol
  • the eTE algorithms uses the steps described in the following subsections. These steps are performed once per "cycle", this means once per interval of x ms (where x could e.g. have a typical value of 20 or 50, but may be selected from a larger range, e.g. between 1 and 1, 000) .
  • Ask Traffic Sources using the bearer to throttle their rates e.g. triggering TCP congestion control by discarding a packet or usage of Explicit Congestion Notification )
  • Fig. 5 schematically depicts the monitoring of downlink load arriving at eNodeB by the eTE for different cycles and different bearers.
  • the DL load arriving at eNodeB (number of bytes) is continuously measured for each individual non-GBR bearer which is indicated for three bearers in Fig. 5 by the lines 501.
  • the total DL load arriving at eNB i.e. the sum of all non-GBR bearers, is continuously measured and indicated by line 503.
  • the DL load expected during time interval (t,t+x) estimated on the basis of measurements up to t is indicated for the three bearers by lines 502, while the estimation of the total DL load arriving at eNB for interval (t,t+x) including a safety margin is indicated by line 504.
  • the eTE algorithm measures the instantaneous traffic load comprising all non-GBR bearers (in Mbit/s, counting the bits which arrive in the interval (t,t+x) Pktsizes
  • the measurements of the instantaneous traffic load in recent cycles are used at time t in order to estimate the transport bandwidth BW TRi ( t ) available for non-GBR traffic in the next cycle (t, t+x) .
  • Non-GBR bearer j is considered as active during cycle
  • BW ⁇ , ( t ) which is calculated at time t provides a good estimate for the unknown bottleneck bandwidth in cycle (t,t+x) .
  • the eTE algorithm distributes the bandwidth BW tr , ( ) among all active non-GBR bearers . I f the totally available bandwidth in cycle (t,t+x) is underestimated, then eTE will throttle the traffic more than necessary. On the other hand, if the totally available bandwidth is
  • the eTE algorithm monitors non-GBR bearers and ensures that a non-GBR bearer j of a UE i in cell k does not exceed an EnfoTcedR te kiiij (t) during cycle (t,t+x).
  • the eTE algorithm allows that each non-GBR bearer exploits its fair share of the transport bandwidth FS£J* (t) .
  • a bearer is not using its fair BW share completely for t re dist milliseconds (default 120 milliseconds, but other values may be envisaged, depending e.g.
  • eTE assumes that the bearer is unable to ramp up to its fair share and redistributes unused bandwidth to other bearers allowing them Enforced Rates which are higher than their fair BW shares.
  • a bearer may simply not have enough data to send, its traffic may be shaped at the egress of the Serving Gateway, its traffic may pass a bottleneck somewhere between source and eNodeB (which is not seen by other bearers), or a bearer may suffer from air interface congestion. Bottlenecks at the air interface are known in the eNB . In contrast to other bottlenecks they can be taken into account explicitly.
  • FS" y -(t) denote the fair share of the air interface bandwidth for a bearer j of UE i in cell k in the cycle (t,t+x) .
  • the air interface scheduler of cell k provides this value to eTE once per cycle.
  • the air interface scheduler defines as a very large number. It is described in Section 4 how the air interface schedulers calculate F5g (t).
  • eTE uses as an upper limit for the bandwidth allocated to bearer j .
  • F5£ -(t) > FS j (t) the difference FS£* (i) is available for redistribution to other bearers.
  • I I Enforced Rate can be set for j
  • EnfBrcedRate kiLj (t) Proposed_Bandwidth ki' ' ] (t)
  • the eTE algorithm maintains for each non-GBR bearer a virtual queue, which is used to calculate the packet discard probability to be applied in the interval (t,t+x), if a bearer violates its enforced rate.
  • the virtual queue is incremented by the length of the packet (counted in bits) .
  • the virtual queue of an active non-GBR bearer is served at its Enf orcedRate k ⁇ (t)
  • the virtual queue of an inactive user is served at the Active_minimum_rate, which may be defined e.g. as 2 kbit/s.
  • a packet discard function is activated for an active non-GBR bearer j during the interval (t,t+x) if its virtual queue exceeds a configurable threshold after serving it at time t.
  • the discard probability for an incoming packet is defined with the aid of the Effective Buffer Filling (EBF), which is measured in seconds and calculated by dividing the current virtual queue length by the Enf orccdR tc K t) (i)
  • EPF Effective Buffer Filling
  • the discard probability for an incoming packet of bearer j is 0 if the Effective Buffer Filling (EBF) is below a
  • the discard probability grows with increasing EBF as indicated in Fig. 4 showing schematically the EBF vs. the discard probability.
  • Either random discard using this discard probability or periodic discard are applied to incoming IP packets.
  • the TCP layer at the source will react when noting the packet loss. It will reduce its sending rate (typically by 50%) and then start to increase the rate again (typically by one TCP segment size per round trip time) . In this way bearers exceeding their Enforced Rates are throttled and the bandwidth becomes available for other bearers .
  • BW limits resulting from air interface congestion are known in the eNodeB and can be taken into account explicitly.
  • Fi?Bs 3t3 ⁇ 4 (t) r ⁇ PRBs ⁇ iil + (l - 1 / T ) ⁇ PR3s m (t - ⁇ ) (9) is the average number of PRBs used during recent TTIs.
  • PRBsTM ati denotes the number of PRBs availa le per TTI (e.g. 50 for 10 MHz)
  • cell k is considered as congest at time t and the calculation of the fair share of the air interface bandwidth is relevant.
  • PRBsTM ati denotes the number of PRBs availa le per TTI (e.g. 50 for 10 MHz)
  • cell k is considered as congest at time t and the calculation of the fair share of the air interface bandwidth is relevant.
  • a person skilled in the art can easily find various ways to determine a respective value for the fair share FS j (t) of the air interface bandwidth for a bearer j of UE i in cell k in the cycle (t,t+x) .
  • a simple way could be to use the ideal fair shares as specified by formula (1) above. Respective options are not described in detail.
  • Fig. 6 schematically depicts basic principle of eTE for an example of two greedy sources .
  • BW DL transport bandwidth
  • the eTE calculates or estimates for each UE the fair BW share of measured transport BW (602) .
  • air interface weights QI weights of the DL packet schedulers
  • the eTE monitors whether radio bearers exceed their fair shares, which is
  • Fig. 7 schematically illustrates the redistribution during which he eTE takes into account sources with low activity.
  • Fig. 7A starts from the same point as Fig. 6.
  • BW transport bandwidth
  • the eTE calculates or estimates for each UE the fair BW share of measured transport BW (702) .
  • air interface weights QI weights of the DL packet schedulers
  • UEl has a carried load estimation which is lower than the fair share of UEl while UE2 has a higher carried load estimation than its fair share as can be seen in Fig.
  • Fig. 1A shows a portion of the redistribution in case UEl is not using its fair share.
  • UE2 may use BW left over by UEl, resulting in an enforced rate for UE2 which is the sum of the fair share for UE2 and the BW left over by UEl.
  • eTE does not prevent UEl from ramping up to its fair share .
  • Fig. 7B A new cycle starts from the DL transport bandwidth (BW) for non-GBR bearers which is measured at eNB (711) the eTE calculates or estimates for each UE the fair BW share of measured transport BW (712).
  • air interface weights QI weights of the DL packet schedulers
  • UEl has a carried load estimation which is lower than the fair share of UEl while UE2 has a higher carried load estimation than its fair share as can be seen in Fig. 7B in column 715 wherein the estimations of the carried load are based on per bearer measurements as indicated by arrow 715.
  • the carried load estimation for UEl is higher than the one for a former cycle which is indicated by the delta 719 of carried load estimation in the column 715.
  • the next column 716 indicates the enforced rate of UEl in case no redistribution is performed, i.e. equals the fair share of UEl, while column 717 represents the difference between the fair share or enforced rate of UEl, i.e.
  • UE2 and the left BW of UEl is depicted as the last column 718 in Fig. 7B .
  • the left over of UEl and thus, the enforced rate for UE2 is lower in the case of Fig. 7B than in the one of Fig. 7A, i.e. UEl is ramping up and the BW left over by UEl decreases.
  • the enforced rate of UE2 is reduced and packets for UE2 are discarded since carried load of UE2 exceeds its enforced rate.
  • TCP congestion control will reduce carried load for UE2.
  • Fig. 8 schematically illustrates a functional view of eTE.
  • the eTE algorithm can be implemented using two functional components as show in Fig.
  • an eTE manager or managing entity 801 in the Transport SW which runs the eTE algorithm
  • eTE agents 802 or agent entities in the user plane at PDCP layer which count the incoming packets per bearer, maintain the virtual queues, and accept/discard incoming packets.
  • the eTE manager exchanges information with eTE agents and eTE agents get the required radio information from DL schedulers 803.
  • Fig. 9 schematically depicts the whole eTE algorithm (taking into account BW limits at the air interface and
  • Step 901 DL schedulers provide FS , r , ,,(:) for each non-GBR bearer .
  • Step 902 eTE Agents perform for each non-GBR bearers the following tasks:
  • Step 903 eTE Manager calculates the bandwidth BW Crs (t ) available in total for all non-GBR bearers
  • Step 904 eTE Manager calculates for each non-GBR beare and decides whether the bearer is active not .
  • Step 905 eTE Manager calculates for each active non-GBR bearer the fair share FS£TM (t) of BW suspend, ⁇ t )
  • Step 906 eTE Manager performs BW redistribution
  • Step 907 eTE Manager calculates for each active non-GBR bearer EnforcedRate kii (t ⁇
  • Step 908 eTE Manager gives for each non-GBR bearer the following information to the eTE agents:
  • Step 909 eTE Agent receives status information
  • Fig. 10 shows the same steps as Fig. 9 but in an eTE timing view.

Landscapes

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

Abstract

L'invention se rapporte à un procédé destiné à l'attribution homogène de parts de bande passante à des porteuses à débit binaire non garanti sur des interfaces hertziennes et dans une section d'un réseau d'amenée mobile d'un réseau de service mobile à base de paquets. Ledit procédé consiste : à estimer une bande passante de transport globale disponible pour les porteuses à débit binaire non garanti dans le réseau d'amenée mobile; à estimer une part équitable de la bande passante de transport globale pour chaque porteuse à débit binaire non garanti et son débit de trafic respectif; et, dans le cas d'une congestion potentielle, à limiter le débit de trafic respectif d'une porteuse à débit binaire non garanti à sa part équitable respective de la bande passante de transport.
PCT/EP2014/053388 2013-02-25 2014-02-21 Procédé, entité de gestion et entité d'agent destinés à une attribution de bande passante homogène Ceased WO2014128239A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP13000940.0 2013-02-25
EP13000940 2013-02-25

Publications (1)

Publication Number Publication Date
WO2014128239A1 true WO2014128239A1 (fr) 2014-08-28

Family

ID=47842995

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2014/053388 Ceased WO2014128239A1 (fr) 2013-02-25 2014-02-21 Procédé, entité de gestion et entité d'agent destinés à une attribution de bande passante homogène

Country Status (1)

Country Link
WO (1) WO2014128239A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2023036926A (ja) * 2017-08-22 2023-03-14 デジェロ ラブス インコーポレイテッド 通信資源を評価するためのシステムおよび方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6069872A (en) * 1997-11-20 2000-05-30 Cabletron Systems, Inc. Explicit rate congestion control system and method
US20070127419A1 (en) * 2005-12-01 2007-06-07 Microsoft Corporation Enforcing fairness in ad hoc mesh networks
WO2008055936A1 (fr) * 2006-11-07 2008-05-15 Telefonaktiebolaget Lm Ericsson (Publ) Système et procédé de contrôle de débit en fonction de la charge
WO2009008817A1 (fr) * 2007-07-06 2009-01-15 Telefonaktiebolaget L M Ericsson (Publ) Contrôle d'encombrement dans un nœud de transmission
US20120218892A1 (en) * 2011-02-25 2012-08-30 Verizon Patent And Licensing, Inc. Subscriber/service differentiation in advanced wireless networks

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6069872A (en) * 1997-11-20 2000-05-30 Cabletron Systems, Inc. Explicit rate congestion control system and method
US20070127419A1 (en) * 2005-12-01 2007-06-07 Microsoft Corporation Enforcing fairness in ad hoc mesh networks
WO2008055936A1 (fr) * 2006-11-07 2008-05-15 Telefonaktiebolaget Lm Ericsson (Publ) Système et procédé de contrôle de débit en fonction de la charge
WO2009008817A1 (fr) * 2007-07-06 2009-01-15 Telefonaktiebolaget L M Ericsson (Publ) Contrôle d'encombrement dans un nœud de transmission
US20120218892A1 (en) * 2011-02-25 2012-08-30 Verizon Patent And Licensing, Inc. Subscriber/service differentiation in advanced wireless networks

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
"QoS Control in the 3GPP Evolved Packet System", February 2009, IEEE COMMUNICATIONS MAGAZINE
3GPP TS 23.401 V11.4.0 (2012-12, 18 December 2012 (2012-12-18)
EKSTROM H: "QoS control in the 3GPP evolved packet system", IEEE COMMUNICATIONS MAGAZINE, IEEE SERVICE CENTER, PISCATAWAY, US, vol. 47, no. 2, 1 February 2009 (2009-02-01), pages 76 - 83, XP011280742, ISSN: 0163-6804, DOI: 10.1109/MCOM.2009.4785383 *
F. FIRMIN, THE EVOLVED PACKET CORE, 31 January 2013 (2013-01-31), Retrieved from the Internet <URL:http://www.3gpp.org/The-Evolved-Packet-Core>
J. ERMAN; A. GERBER; K.K. RAMAKRISHNAN; S. SEN; O. SPATSCHECK: "Over The Top Video: the Gorilla in Cellular Networks", IMC'11, 2 November 2011 (2011-11-02)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2023036926A (ja) * 2017-08-22 2023-03-14 デジェロ ラブス インコーポレイテッド 通信資源を評価するためのシステムおよび方法
US11909593B2 (en) 2017-08-22 2024-02-20 Dejero Labs Inc. System and method for assessing communication resources
JP7489733B2 (ja) 2017-08-22 2024-05-24 デジェロ ラブス インコーポレイテッド 通信資源を評価するためのシステムおよび方法

Similar Documents

Publication Publication Date Title
US8553545B2 (en) Congestion buffer control in wireless networks
US8767553B2 (en) Dynamic resource partitioning for long-term fairness to non-elastic traffic on a cellular basestation
EP3446464B1 (fr) Systèmes et procédé destinés à la surveillance de qualité de service, l&#39;application de politique et la facturation dans un réseau de communication
US8611217B2 (en) Subscriber/service differentiation in advanced wireless networks
EP2201730B1 (fr) Procédé et agencement pour planifier des paquets de données dans un système de réseau de communication
Jung et al. Intelligent active queue management for stabilized QoS guarantees in 5G mobile networks
US9432874B2 (en) Service-aware profiling for transport networks
JP5882422B2 (ja) ワイヤレスネットワークにおけるリソース管理方法およびワイヤレスネットワーク
US20150264707A1 (en) Uplink Backpressure Coordination
Irazabal et al. Dynamic buffer sizing and pacing as enablers of 5G low-latency services
US10715453B2 (en) Method and network node for congestion management in a wireless communications network
CN101346971A (zh) 用于解决数据分组业务拥塞的方法和设备
JP5521038B2 (ja) トラフィック負荷を管理する方法
KR100699531B1 (ko) 휴대 인터넷 서비스의 큐오에스 제공 장치 및 방법
CN103858474A (zh) 针对传输网络的增强性能的基于服务的配置
Zaki et al. Intelligent traffic enforcement for LTE backhaul
Tahir et al. Efficient Policy-Rich Rate Enforcement with Phantom Queues
WO2014128239A1 (fr) Procédé, entité de gestion et entité d&#39;agent destinés à une attribution de bande passante homogène
WO2014128243A1 (fr) Procédé et passerelle pour acheminer du trafic dans un réseau de service mobile en mode paquet
JP2019033392A (ja) 通信装置及び通信方法
Priya et al. Adaptive Uplink Scheduler for WiMAX
Lakkakorpi Quality of service and resource management in IP and wireless networks
Metin et al. A novel model for inter-domain QoS management for real-time applications
Smit A simulation study to evaluate the performance of schedulers in a differentiated services network
Nyarota Designing a Quality of Service for mobile Ad Hoc Networks carrying multimedia traffic.

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

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

Country of ref document: EP

Kind code of ref document: A1