WO2012143346A1 - Priorité d'ordonnancement dans un réseau de communication - Google Patents

Priorité d'ordonnancement dans un réseau de communication Download PDF

Info

Publication number
WO2012143346A1
WO2012143346A1 PCT/EP2012/056985 EP2012056985W WO2012143346A1 WO 2012143346 A1 WO2012143346 A1 WO 2012143346A1 EP 2012056985 W EP2012056985 W EP 2012056985W WO 2012143346 A1 WO2012143346 A1 WO 2012143346A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
scheduling priority
priority
marker
network
Prior art date
Application number
PCT/EP2012/056985
Other languages
English (en)
Inventor
Mikko Tapani SUNI
Roland Antonius WÖLKER
Miika Sakari VUORISALO
Juha Pekka SIPILÄ
Original Assignee
Nokia Siemens Networks Oy
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 Siemens Networks Oy filed Critical Nokia Siemens Networks Oy
Priority to EP12715385.6A priority Critical patent/EP2700203B1/fr
Publication of WO2012143346A1 publication Critical patent/WO2012143346A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • 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

Definitions

  • the invention generally relates to scheduling priority in a communications network. More particularly, the invention relates to priority differentiation of application data streams.
  • the invention seeks to address at least some of the prob ⁇ lems outlined above.
  • the invention provides a method, which includes evaluating data according to a marker assigned to the data, adjusting a scheduling priority based on a re ⁇ sult of the evaluation, and communicating the adjusted scheduling priority.
  • Data i.e., specific data packet (s) or an application
  • a marker which can indicate a data traffic type, application type, quality of service and/or activ ⁇ ity.
  • the marker can indicate priority and could be, for example, "high” or "low", or "application type A”. Marking can be based on previously defined application and subscriber-specific QoS policies and/or monitored appli ⁇ cation use.
  • the type of data (application) may be evalu ⁇ ated by reading the marker and, according to the given marker, the queuing weight of the data within the radio bearer (including simultaneous applications) and schedul ⁇ ing priority of the radio bearer can be dynamically ad ⁇ justed.
  • the adjusted scheduling priority may then be communicated to the network and can be used to adjust the scheduling weight of the radio bearer in relation to other radio bearers in the air interface.
  • This provides the advantage that several simultaneous ap- plication flows, carried either within the same or dif- fererent radio bearers, may be prioritised relative to each other (for example non-time critical data traffic may be separated from time critical data traffic so that the time critical traffic is prioritised) , thereby im- proving quality of experience for the user, while at the same time avoiding signalling on network interfaces and eliminating signalling over the radio interface altogether. Furthermore, this method is compatible with all mobile terminals.
  • adjusting comprises changing the scheduling priority, for example decreasing a priority level.
  • the scheduling priority for example decreasing a priority level.
  • P2P peer-to-peer
  • P2P traffic can be deprioritised during cell congestion in order to provide for faster download of web pages. This provides the advantage that an improved quality of ex ⁇ perience can be experienced by the network user.
  • the scheduling priority of individual IP data packets within a UTRAN radio bearer (RB) may be adjusted.
  • the scheduling priority is returned to a previous level if a condition changes. For example, if application data had previously been marked as high priority and then been deprioritized, the scheduling priority may be returned to the previous high priority level if conditions change, such as if the level of congestion in the target cell decreases. In this way, application data streams may be dynamically prioritized relative to each other.
  • Data may be received at the control node from a core net- work. Evaluating the data type and adjusting the scheduling priority may then be performed at the control node, for example a radio network controller. Marking the data to assign each application/data a marker may be per ⁇ formed using deep packet inspection, either in the core network or in a control node (such as a radio network controller or eNode B) that has integrated deep packet inspection. Alternatively, marking data or applications may be performed in standalone deep packet inspection on an interface such as the Gi or SGi interface.
  • the marker can be based on the quality of service level and may also indicate a quality of service level of the data or application.
  • the marker may also indicate the ap ⁇ plication type, in which case the control node may have rules to evaluate priority of the given application type.
  • Adjusting the scheduling priority can include mapping the data type to a value of the scheduling priority. This mapping of the data type to a value to a value of the scheduling priority may be achieved by calculating a weighted average of scheduling priority values received over last received data packets, for example by using a mapping algorithm. Alternatively, mapping may use configured rules with relative precedence between applica- tion types, and adjust scheduling priority according to the application rule with highest precedence seen during a given period of time.
  • the adjusted scheduling priority can be communicated to a network node, for example a base station, Node B or eNode B. The network node can then process the data or appli ⁇ cation according to its current scheduling priority.
  • Embodiments of the invention also provide a control node.
  • the control node includes a processor configured to evaluate data according to a marker assigned to the data and to adjust a scheduling priority according to a result of the evaluation.
  • a transmitter is provided, which is configured to communicate the adjusted scheduling prior ⁇ ity.
  • the control node evaluates received data based on a marker given to the data (application) according to its traffic type, quality of service and/or activity. Ac ⁇ cording to the marker, the scheduling priority of the data/application and radio bearer is then adjusted. The adjusted scheduling priority of the radio bearer is then communicated to the network.
  • Embodiments of the invention further provide a network node.
  • the network node includes a receiver, which is configured to receive data and an adjusted scheduling priority of the data.
  • a scheduler is configured to proc- ess the data according to its current scheduling priority. For example, the scheduler may adjust the priority of any given MAC-d queue based on the momentary schedul ⁇ ing priority of the radio bearer assigned by the control node .
  • Embodiments of the invention further provide a computer program product, which includes a program comprising software code portions being arranged, when run on a pro cessor, to perform evaluating data according to a marker assigned to the data, adjusting a scheduling priority of the data based on a result of the evaluation, and commu ⁇ nicating the adjusted scheduling priority.
  • the computer program product may include a computer- readable medium on which the software code portions can be stored, and/or wherein the program can be directly loadable into a memory of the processor.
  • Figure 1 is a simplified schematic diagram of a communi ⁇ cations network
  • Figure 2 is a simplified schematic diagram of a network node
  • Figure 3 is a simplified schematic diagram of a control node ;
  • Figure 4 is a flow chart illustrating a method according to an embodiment of the invention;
  • Figure 5 is an illustration of a layer structure in a communications network;
  • Figure 6 is an illustration of application of an embodiment of the invention in nodes of a communications net ⁇ work.
  • FIG. 1 shows a wireless communications network having a base station or Node B 1 controlled by a radio network controller (RNC) 2 over an Iub interface.
  • the Node B 1 and RNC 2 form the UMTS terrestrial radio access network (UTRAN) part of the communications network, which is con- nected to a core network (CN) 3 over an Iu-PS or Gn in ⁇ terface.
  • UTRAN UMTS terrestrial radio access network
  • CN core network
  • the examples described below may also apply to an LTE radio network, in which case the Node B 1 and RNC 2 may be replaced by an eNode B combining both functionalities of the Node B and the RNC.
  • the CN 3 is a packet switched core net ⁇ work providing access to the internet via a Gi interface.
  • the CN 3 may include a serving GPRS support node (SGSN) and a gateway GPRS support node (GGSN) interfaced over a Gn interface.
  • the CN 3 may also include a public data network gateway (PDN-GW) and a serving gateway (S-GW) .
  • PDN-GW public data network gateway
  • S-GW serving gateway
  • the Node B 1 includes a transmit/receive unit 4 and a scheduler 5, as shown in Figure 2 and the RNC 2 includes a transmit/receive unit 6 and a processor 7, as shown in Figure 3.
  • FIG. 4 shows a flow chart illustrating a method accord- ing to one embodiment.
  • an IP data packet re ⁇ ceived by the network from the internet is marked, which may take place in the CN 3 or in the RNC 2, or in fact in any part of the network before the Packet Data Conver ⁇ gence Protocol (PDCP) layer in the UTRAN, as described in more detail below.
  • the marker indicates priority (for example "high” or "low”) or application type of the data and may be placed in a dedicated header field of the IP data packet, as shown in Figure 5.
  • the marked data packets are received at the
  • the processor 7 in the RNC 3 evaluates each data packet in the PDCP layer by analys ⁇ ing the marker assigned to the data in step SI. However, this evaluation may take place in any part of the UTRAN network at or above the PDCP layer, as illustrated in
  • Step S3 the RNC 3 changes the order of the IP data packets according to priority and/or adjusts the schedul- ing priority of the entire UTRAN radio bearer based on the marker in the header of the data packet. For exam ⁇ ple, if the marker is "low", this means that the data traffic type and/or activity is such that the data asso ⁇ ciated with this particular application is low priority and the RNC 3 "demotes" the IP data packet to have a lower scheduling priority within the UTRAN radio bearer than its previous scheduling priority for that particular application or type of data.
  • IP data packets of different priority can be prioritized e.g. by placing them into queues with different schedul ⁇ ing priority and/or weight before they are scheduled into the MAC protocol layer within the RNC 3. This means that several application data streams in the same radio bearer may be dynamically prioritised relative to each other.
  • a web-based application may be given higher priority than a peer-to-peer application within the UTRAN radio bearer.
  • the RNC 3 may then also change or adjust the scheduling priority of the UTRAN radio bearer according to the priority mix of the IP data packets received recently or buffered currently.
  • the adjusted scheduling priority of the UTRAN radio bearer is indicated by a scheduling priority indicator (SPI) associated with the Frame Protocol PDU carrying the data packet or part of it.
  • SPI scheduling priority indicator
  • a change of SPI may be trig ⁇ gered in the PDCP layer in the RNC 3 by the data traffic type and/or activity as indicated by the marker in the header of the data packet.
  • step S4 the transmit/receive unit 6 of the RNC 3 com ⁇ municates the adjusted SPI to the Node B 1, for example in the "CmCH-PI" field of a HS-DSCH DATA FRAME TYPE 1 or 2 as illustrated in Figure 6.
  • the Node B 1 may then receive the adjusted SPI at the transmit/receive unit 4 and the scheduler 5 can change the scheduling weight associated with the MAC-d flow ac ⁇ cording to the SPI associated with each of the applica ⁇ tion data streams.
  • DPI deep packet inspection
  • DSCP Differentiated Services Code Point
  • GTP-U Ex ⁇ tension Header may be used as well.
  • DPI marks priority using DSCP code points to an inner IP packet (the end-to-end IP packet between a user's termi ⁇ nal and another IP endpoint outside the public land mo ⁇ bile network (PLMN) ) .
  • the DSCP code points are stored in a field of the IP header. This code point information is utilized in or above the PDCP protocol layer in the RNC 3, which then prioritizes application flows and adjusts the SPI of the UTRAN radio bearer and transfers the in ⁇ formation containing the adjusted SPI to the Node B 1 in real time.
  • An advantage of marking the DSCP field of the inner IP packet is that the marking can occur in any part of the network before the PDCP layer in the UTRAN.
  • the IP packet could be marked in a GGSN/PDN- GW that has integrated DPI; in a S-GW that has integrated DPI; in the RNC 3, I-HSPA or eNB (in the case of an LTE network) that has integrated DPI.
  • the IP packet could be marked in standalone DPI on the Gi or SGi interface .
  • outer IP packet DSCP code points (the GTP tunnel IP header DSCP) on Gn or Iu-PS transport or the SGSN do not disturb classification of packets.
  • inner IP packet DSCP is visible to and inter- preted by the UTRAN only, which enables definition of usage and interpretation of 6-bit DSCP code independent of changes in standardization.
  • the SPI information is passed to the Node B 1 HSPA sched ⁇ uling in the CmCH-PI (Common channel priority indication) field of an HS-DSCH data frame (type 1 or 2) .
  • CmCH-PI Common channel priority indication
  • HSDPA scheduling adjusts the priority of any given MAC-d queue based on the CmCH-PI field of an HS- DSCH data frame.
  • the priority of the MAC-d queue may be defined by the packet at the head of the queue.
  • the priority of the MAC-d queue may be defined by the highest priority MAC PDU in the queue. High priority applications are then preferred, which means that a user is able to experience a faster download time for a web page, for example, resulting in an improved QoE .
  • HSUPA scheduling may adjust the priority of up ⁇ link E-DCH channels based on the CmCH-PI field of an HS- DSCH data frame.
  • MAC PDUs of a RB are maintained in a single queue and only the priority of the entire queue is adjusted by the
  • Node B 1 (instead of placing individual MAC PDUs into separate priority queues indicated by the CmCH-PI field of FP HS-DSCH DATA FRAME that carried them) .
  • the interface between the PDCP and the cell MAC scheduler may be internal and therefore there is no need to adapt to any specific stan ⁇ dard to carry the scheduling priority.
  • Uplink (HSUPA) scheduling in the Node B 1 may use the same priority as downlink scheduling.
  • the PDCP layer (or layers above the PDCP layer) in the RNC 3 may include an algorithm, which translates a pattern of DSCP code points in user IP data packets into an SPI level. It is assumed that changing the SPI is not normally performed for every received downlink user packet. This is because there is assumed to be a short MAC-d queue in the Node B 1 and therefore priority changes at individual packet level are not ef- fective.
  • the algorithm follows a DSCP code point from a set of latest downlink data packets and ad ⁇ justs the SPI according to a formula.
  • an algorithm for adjusting the SPI may be implemented as follows:
  • mapping from a DSCP code point to a certain target SPI level This may be absolute or relative to the default SPI level evaluated from 3GPP Rel99 QoS parame ⁇ ters of the radio access bearer.
  • the algorithm follows the target SPI level of recent data packets, limited by a window which may be defined, for example, as a fixed number of transmission time interval (TTI) time slots, or an amount of data received.
  • TTI transmission time interval
  • the algorithm calculates a weighted average of target SPI values over the window, using the length of each user IP data packet (PDCP SDUs) as the weight.
  • the weighted average of target SPI values over the last window is used as the actual SPI value which is sent to the Node B 1 in the CmCH-PI field of FP HS-DSCH DATA FRAME (or over an internal interface in case of I-HSPA or eNB) .
  • n is number of packets that were received in measurement window
  • the algorithm is only an example, and any vari ⁇ ants on the above are possible, as long as there is a mapping from the DSCP value to the SPI value.
  • the details of algorithm may differ, for example with respect to how it reacts to a mixture of data packets having different DSCP codes and packet lengths or how quickly it reacts by changing the actual SPI based on a change of DSCP.
  • the present invention as described hereinabove, it should be noted that
  • any method step is suitable to be implement ⁇ ed as software or by hardware without changing the idea of the embodiments and its modification in terms of the functionality implemented;
  • ASIC Applica ⁇ tion Specific IC (Integrated Circuit)
  • FPGA Field-programmable Gate Arrays
  • CPLD Computer ⁇ plex Programmable Logic Device
  • DSP Digi- tal Signal Processor
  • - devices, units or means e.g. the above-defined appa ⁇ ratuses and network devices, or any one of their respec ⁇ tive units/means
  • an apparatus may be represented by a semiconductor chip, a chipset, or a (hardware) module comprising such chip or chipset; this, however, does not exclude the pos ⁇ sibility that a functionality of an apparatus or module, instead of being hardware implemented, be implemented as software in a (software) module such as a computer pro ⁇ gram or a computer program product comprising executable software code portions for execution/being run on a pro ⁇ cessor;
  • - a device may be regarded as an apparatus or as an as ⁇ sembly of more than one apparatus, whether functionally in cooperation with each other or functionally inde- pendently of each other but in a same device housing, for example .
  • respective functional blocks or elements according to above-described aspects can be implemented by any known means, either in hardware and/or software, respectively, if it is only adapted to perform the described functions of the respective parts.
  • the mentioned method steps can be realized in individual functional blocks or by individual devices, or one or more of the method steps can be realized in a single functional block or by a single device.
  • any method step is suitable to be implemented as software or by hardware without changing the idea of the present invention.
  • Devices and means can be imple ⁇ mented as individual devices, but this does not exclude that they are implemented in a distributed fashion throughout the system, as long as the functionality of the device is preserved. Such and similar principles are to be considered as known to a skilled person.
  • the terms "user equipment (UE) " and "mobile station” de ⁇ scribed herein may refer to any mobile or stationary device including a mobile telephone, a computer, a mobile broadband adapter, a USB stick for enabling a device to access to a mobile network, etc.
  • PDN-GW Public Data Network Gateway

Landscapes

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

Abstract

L'invention concerne un procédé qui comprend la détermination d'un type de données à partir d'un marquage attribué aux données, l'ajustement d'une priorité d'ordonnancement en fonction du type de données et la communication de la priorité d'ordonnancement ajustée.
PCT/EP2012/056985 2011-04-19 2012-04-17 Priorité d'ordonnancement dans un réseau de communication WO2012143346A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP12715385.6A EP2700203B1 (fr) 2011-04-19 2012-04-17 Priorité d'ordonnancement dans un réseau de communication

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP2011056221 2011-04-19
EPPCT/EP2011/056221 2011-04-19

Publications (1)

Publication Number Publication Date
WO2012143346A1 true WO2012143346A1 (fr) 2012-10-26

Family

ID=45976941

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2012/056985 WO2012143346A1 (fr) 2011-04-19 2012-04-17 Priorité d'ordonnancement dans un réseau de communication

Country Status (1)

Country Link
WO (1) WO2012143346A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2513591A (en) * 2013-04-30 2014-11-05 Nokia Solutions & Networks Oy Methods and Apparatus
WO2014198294A1 (fr) 2013-06-11 2014-12-18 Nokia Solutions And Networks Oy Atténuation des interférences dans une zone de déséquilibre important
CN109804658A (zh) * 2016-10-10 2019-05-24 诺基亚通信公司 通信网络中的吞吐量

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100054231A1 (en) * 2008-08-28 2010-03-04 Alcatel Lucent Dpi-triggered application-aware dormancy timer adjustment for mobile data bearers
US20100208609A1 (en) * 2009-02-13 2010-08-19 Qualcomm Incorporated Dynamic mapping of quality of service traffic
EP2239974A2 (fr) * 2009-04-08 2010-10-13 Vodafone Group PLC Procédé et contrôleur de réseau pour la réduction de la charge de trafic de plusieurs porteuses pour déclencher la commutation de porteuse dans des réseaux mobiles étendus

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100054231A1 (en) * 2008-08-28 2010-03-04 Alcatel Lucent Dpi-triggered application-aware dormancy timer adjustment for mobile data bearers
US20100208609A1 (en) * 2009-02-13 2010-08-19 Qualcomm Incorporated Dynamic mapping of quality of service traffic
EP2239974A2 (fr) * 2009-04-08 2010-10-13 Vodafone Group PLC Procédé et contrôleur de réseau pour la réduction de la charge de trafic de plusieurs porteuses pour déclencher la commutation de porteuse dans des réseaux mobiles étendus

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2513591A (en) * 2013-04-30 2014-11-05 Nokia Solutions & Networks Oy Methods and Apparatus
WO2014198294A1 (fr) 2013-06-11 2014-12-18 Nokia Solutions And Networks Oy Atténuation des interférences dans une zone de déséquilibre important
CN109804658A (zh) * 2016-10-10 2019-05-24 诺基亚通信公司 通信网络中的吞吐量
CN109804658B (zh) * 2016-10-10 2022-04-29 诺基亚通信公司 通信网络中的吞吐量

Similar Documents

Publication Publication Date Title
KR101059676B1 (ko) 업링크 송신에 있어서의 보증 비트 레이트 트래픽의 유지
US8565091B2 (en) Dynamic control of air interface throughput
US7782872B2 (en) Method, apparatus, and computer-readable medium for providing an applicable QoS for data that has actually experienced a QoS degraded from that requested
US8223758B2 (en) System and method of load dependent rate policing
JP2022000961A (ja) 受信した体感品質情報に基づくリソース割り当ての最適化
US8488551B2 (en) Method and arrangement in a telecommunication system
US20170150393A1 (en) Dynamic Quality of Service Management
US9948563B2 (en) Transmitting node, receiving node and methods therein
US20130336124A1 (en) Partitioning Entity and Method for Partitioning Capacity
KR20110128210A (ko) 무선 베어러에 서비스를 매핑하여 가중치에 따라 무선 베어러에 대역폭을 할당하는 장치 및 방법
KR101415201B1 (ko) 통신 시스템에서 고속의 비디오 스트림 서비스를 위한스케줄링 방법 및 장치
US9794957B2 (en) Efficient management of scheduling parameter changes in resource limited processing nodes
EP2375658B1 (fr) Congestion de trafic dans des contrôleurs de réseau radio
US20150117205A1 (en) Method and Network Node for Controlling Sending Rates
WO2012143346A1 (fr) Priorité d'ordonnancement dans un réseau de communication
EP2700203A1 (fr) Priorité d'ordonnancement dans un réseau de communication
Wang et al. QoS control for streaming service in UMTS networks
WO2014128243A1 (fr) Procédé et passerelle pour acheminer du trafic dans un réseau de service mobile en mode paquet
Abbas et al. Performance Enhancement of End-to-end Quality of Service in WCDMA Wireless Networks

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2012715385

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2012715385

Country of ref document: EP