WO2014180949A1 - Procede d'exploitation d'un reseau et reseau associe - Google Patents

Procede d'exploitation d'un reseau et reseau associe Download PDF

Info

Publication number
WO2014180949A1
WO2014180949A1 PCT/EP2014/059434 EP2014059434W WO2014180949A1 WO 2014180949 A1 WO2014180949 A1 WO 2014180949A1 EP 2014059434 W EP2014059434 W EP 2014059434W WO 2014180949 A1 WO2014180949 A1 WO 2014180949A1
Authority
WO
WIPO (PCT)
Prior art keywords
generalized
data sessions
data
traffic
sessions
Prior art date
Application number
PCT/EP2014/059434
Other languages
English (en)
Inventor
Gottfried Punz
Andreas Maeder
Original Assignee
Nec Europe 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 Nec Europe Ltd. filed Critical Nec Europe Ltd.
Publication of WO2014180949A1 publication Critical patent/WO2014180949A1/fr

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H04W4/08User group management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0894Policy-based network configuration management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/11Identifying congestion
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/122Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/125Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/41Flow control; Congestion control by acting on aggregated flows or links
    • 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/0247Traffic management, e.g. flow control or congestion control based on conditions of the access network or the infrastructure network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W8/00Network data management
    • H04W8/02Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04Registration at HLR or HSS [Home Subscriber Server]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/14Session management

Definitions

  • the present invention relates to a method for operating a network, particularly a radio network, wherein a management of traffic from a plurality of User Equipments, UEs, is performed by applying one or more definable policy rules on UE data sessions. Further, the present invention relates to a network, particularly a radio network, comprising means for performing a management of traffic from a plurality of User Equipments, UEs, by applying one or more definable policy rules on UE data sessions.
  • the Packet Data Network Gateway, P-GW, and the co-located Policy Control Enforcement Function, PCEF as the traffic aggregation point in the network have to carry and manage high traffic volumes from potentially many - tens of - thousands of subscribers at line speed.
  • Certain classes of applications generate mainly short-lived data flows, e.g. web surfing, Apps, instant messaging, etc., which cannot effectively be managed by means of traffic shaping, rate limitation, etc. on a per-flow basis. For this type of traffic it is more appropriate to implement congestion mitigation schemes, which operate on traffic aggregates.
  • 3GPP has developed an elaborate framework for policy handling in a mobile network with Policy and Charging Control, PCC, see 3GPP TS 23.203, "Policy and charging control architecture". It relies on the concept of IP-CAN sessions and Service Data Flows, SDFs, i.e. the level of granularity is per established access NW connectivity per UE - in selected cases a UE may have established connectivity via several access NWs in parallel - and the SDFs within an IP-CAN session. Such granularity was adequate so far, because in normal operation mobile terminals - and thus their data flows - need to be treated individually, according to their subscribed and requested services. Two models are supported:
  • IP-CANs supporting bearer characteristics e.g. 3GPP and 3GPP2 RANs;
  • bearer-less IP-CANs e.g. WLAN access NWs.
  • Fig. 1 For every IP-CAN session in PCEF, that is, in the gateway in the user data plane, a corresponding session exists in the Policy Control and Rule Function, PCRF, and allows to control the former via the Gx interface.
  • Gx is DIAMETER based, i.e. we see also a corresponding number of DIAMETER sessions.
  • PCRF may interface to SPR/UDR and thus has available detailed information on individual subscribers.
  • IP-CAN session 2 does not have bearers, but transports another SDF, as does IP-CAN session 3 on yet another - it's only - bearer.
  • IP-CAN sessions 2 and 3 both transport only one SDF each. The aspect of bearer handling is not important for the rest of this invention.
  • Fig. 2 depicts the high-level flow of information for control of an IP-CAN session by PCRF, according to 3GPP TS 29.213, "Policy and Charging Control signaling flows and Quality of Service (QoS) parameter mapping"; in this case even the more general situation with standalone Traffic Detection Function, TDF, a capability to detect Service Data Flows in the user plane, is shown.
  • TDF Traffic Detection Function
  • ADC Application Detection Control
  • each PCC rule is associated to exactly one IP-CAN session, see 3GPP TS 23.203, "Policy and charging control architecture”.
  • SDFs are detected and bound to IP-CAN sessions by means of SDF templates, e.g. by using IP-5-tuples ⁇ src-ip; dst-ip; src-port; dst-port; protocols
  • Policy control e.g. traffic limitation, is applied according to the PCC rule for each SDF individually.
  • both policy enforcement - in PCEF/TDF - and policy control - in PCRF - are in current systems performed on the granularity of SDFs, creating unnecessary overhead on the control plane and reducing efficiency of traffic handling for certain types of traffic, e.g. short-lived flows.
  • the description above describes the established state of the art according to 3GPP TS 23.203 and TS 29.212. Further established art is found in WO 2010/086013 A1 , "Group Session management for policy control", which describes a group session concept between PCRF and PCEF, characterized in the following:
  • PCEF keeps an association of IP-CAN sessions belonging to a group in the bearer plane
  • this method is based on group Gx sessions, which are created and maintained by explicitly adding, confirming, and removing individual user sessions, see Fig. 3. This includes also reporting for group events.
  • 3GPP has found that, due to the general strong increase of data transmission by e.g. smart phones, and for the benefit of optimal control in special situations like disasters or mass events, means are required to prioritize, reduce and limit data traffic.
  • Requirements related to user plane congestion management, UPCON have been included in 3GPP TS 22.101 , "Service aspects; Service principles" and 3GPP SA2 has started a feasibility study with the aim to enhance the system architecture correspondingly, see 3GPP TS 23.705, "System Enhancements for User Plane Congestion Management".
  • the aforementioned object is accomplished by a method comprising the features of claim 1 and by a network comprising the features of claim 23.
  • the method is characterized in that at least one generalized policy rule for application on UE data sessions is defined based on at least one condition and that the at least one generalized policy rule is applied on UE data sessions matching said condition.
  • the network is characterized by means for defining at least one generalized policy rule for application on UE data sessions based on at least one condition and by means for applying the at least one generalized policy rule on UE data sessions matching said condition.
  • Such a generalized policy rule is defined based on at least one condition which can be selected for a suitable influence on traffic management.
  • the at least one generalized policy rule is applied on UE data sessions matching said condition.
  • the at least one generalized policy rule can be applied on a set of individual UE data sessions or on an aggregate of UE data sessions matching said condition. This means that UE data sessions can be seen and handled as an aggregate of UE data sessions matching said condition or as a set of individual UE data sessions each matching said condition.
  • the at least on condition responsible for definition of the at least one generalized policy rule can be selected depending on individual aims of management of traffic from the UEs.
  • the condition can comprise at least one action and/or event to be executed on a set of individual UE data sessions or on an aggregate of UE data sessions matching said condition.
  • a set of individual UE data sessions and/or an aggregate of UE data sessions can be created based on the existence of a corresponding action and/or event in the generalized policy rule. Further steps of the inventive method can be performed regarding such a created set or aggregate of UE data sessions. This simplifies the inventive method.
  • An action operating on individual UE data sessions can comprise triggering user locating reporting, user plane congestion reporting, WLAN offloading of data traffic, packet marking, configuring of bearer properties or Quality of Service, QoS, enforcement. Depending on individual situations further kinds of action can be defined.
  • An action operating on an aggregate of UE data sessions can comprise limiting a data traffic to a definable bandwidth or prioritizing a definable type of traffic before an other definable type of traffic. Depending on individual requirements an appropriate action can be part of the method.
  • the action and/or the event can be executed in different functional entities. Within a preferred embodiment the action and/or event can be executed in a Policy and Charging Enforcement Function, PCEF.
  • An event operating on individual UE data sessions can be triggered if the accumulated number of individual UE data sessions of monitored UE data sessions exceeds a definable threshold. However, also other kinds of events can be defined for operating on individual UE data sessions.
  • An event operating on an aggregate of UE data sessions can be triggered if a metric based on a data traffic aggregate exceeds a definable threshold. This kind of event is a preferred kind of event. However, other kinds of events can be used for operating on an aggregate of UE data sessions depending on individual requirements.
  • each generalized policy rule can be assigned a precedence or priority value.
  • a higher priority means that a generalized policy rule is applied before a generalized policy rule with a lower priority value.
  • the management of traffic can be performed in the control plane and/or user plane. The selection of the location of performance can be dependent on individual requirements and circumstances.
  • a generalized PCRF session per connected PCEF can be provided to handle the at least one generalized policy rule.
  • Such a generalized PCRF session can be created at start-up of communication between PCEF and PCRF. However, other creation processes are possible.
  • Such a generalized PCRF session can be used for installation, modification and/or removal of generalized policy rules and/or for generalized event reporting. There can be provided different use cases for such a generalized PCRF session in an advantageous way.
  • a generalized event reporting can be used for monitoring a status of an aggregate of UE data sessions and/or for reporting the congestion level or a derived metric to the PCRF. This will enhance the efficiency of traffic handling.
  • the PCRF can update the generalized policy rule via a corresponding generalized PCRF session after having received an event report from the PCEF.
  • a generalized policy rule can be kept in an actual status corresponding to varying traffic situations.
  • congestion management can be performed by the inventive method and network.
  • a PCEF can evaluate the condition over all matching UE data sessions.
  • a reliable evaluation of the individual condition or conditions can be provided by the inventive method.
  • the PCEF can send action and/or event triggering messages selectively to all UEs with matching UE data sessions. This will also enhance the reliability of evaluation of the condition or conditions.
  • the PCEF can monitor data traffic of UE data sessions and can derive at least one metric for triggering an action and/or event. Such a monitoring function further enhances reliability and efficiency of the inventive method.
  • a UE data session can be an Internet Protocol Connectivity Access Network, IP-CAN, session, a Service Data Flow, SDF, a single traffic flow or a bearer.
  • the generalized policy rule can be a generalized Policy and Charging Control, PCC, rule.
  • At least one generalized policy or PCC rule defined by one or a plurality of conditions, actions and events, executed in the PCEF. Such actions and events operate either on a data traffic aggregate or on a set of individual data sessions matched by said conditions.
  • the corresponding data traffic aggregates and/or set of data sessions can be created based on the existence of a corresponding action or event in the generalized policy or PCC rule. Events based on aggregation metrics either for the traffic aggregate or the set of data sessions can trigger a notification towards the PCRF.
  • Installing/modification/updating of generalized policy or PCC rules in the PCRF can be performed by means of a single generalized Gx session per rule.
  • policy or PCC rules are based on matching conditions for aggregated handling, independent of IP-CAN sessions.
  • PCRF sessions between PCEF and PCRF can be realized.
  • the inventive method and network provide a significant reduction of the amount of control signaling on Gx interface.
  • An aggregated modelling of UEs and/or bearers is allowed.
  • an efficient handling of traffic aggregates in PCC is allowed.
  • Fig. 2 is illustrating a high level flow of information for control of a known IP-CAN session by PCRF
  • Fig. 3 is illustrating a grouping model according to the state of the art
  • Fig. 4 is illustrating an embodiment of a method for operating a network according to the invention wherein an A-SET/A-SDF creation based on existence of A-SET/A-SDF actions/events is shown,
  • Fig. 5 is illustrating the concept of generalized PCC rules and generalized PCRF sessions according to an embodiment of the invention
  • Fig. 6 is illustrating an example of PCRF controlled congestion handling based on aggregate policy handling according to an embodiment of the invention and Fig. 7 is showing an example of PCRF controlled non-3GPP offload control based on aggregate policy handling according to an embodiment of the invention.
  • an A-SET is a set of IP-CAN sessions, SDFs, or bearers which matches a set of conditions of a G-PCC rule.
  • An A-SDF is the corresponding data traffic aggregate of an A-SET.
  • G-PCC rules operate on A-SDFs and/or on A-SETs.
  • QoS control rules on maximum/guaranteed bitrates are applied to the whole traffic aggregate of an A-SDF, thus allowing efficient handling of traffic aggregates.
  • data session refers to an IP-CAN session, an SDF, a single traffic flow or a bearer.
  • Applying a G-PCC rule in PCEF may include the following procedural steps, as illustrated in Fig. 4: 1. Match all data sessions, e.g. IP-CAN sessions, SDFs, bearers, against the specified condition or conditions.
  • Match all data sessions e.g. IP-CAN sessions, SDFs, bearers, against the specified condition or conditions.
  • A-SET comprising the matched data sessions as target for further actions
  • A- SDF a traffic aggregate - denoted as "Aggregate SDF", A- SDF - comprising the totality of the data traffic of the matched data sessions. 3. Calculate metrics based on aggregate traffic of an A-SDF or based on accumulated individual events of A-SETs. These metrics are calculated in the PCEF/TDF.
  • matching conditions are e.g.
  • type of traffic source e.g. unattended vs. attended traffic
  • group identifier e.g. for M2M type of communication.
  • Actions operating on individual data sessions One example is to switch on user location reporting for a plurality of users reporting user plane congestion for IP-CAN sessions. Another example is to drop all bearers of a QoS Class Index, QCI, of low priority in case of reported heavy user plane congestion. A further example is to trigger WLAN offloading for all users with ongoing video download.
  • QCI QoS Class Index
  • Actions operating on data traffic aggregates A-SDF.
  • A-SDF One example is limiting the data traffic of an A-SDF to a certain bandwidth for purpose of congestion mitigation.
  • Another example is to prioritize a certain type of traffic before other type of traffic.
  • Events operating on A-SETs are triggered if the accumulated number of individual data sessions of the monitored data sessions exceeds a defined threshold. For example, an event is triggered if out of 100 sessions in an A- SET, for 20 the minimum bandwidth cannot be fulfilled.
  • Events operating on A-SDFs are triggered if a metric based on the data traffic aggregate exceeds a certain threshold, e.g. a certain data volume. For example, an event is triggered if the average minimum bandwidth of the A-SDF traffic aggregate cannot be fulfilled.
  • a certain threshold e.g. a certain data volume. For example, an event is triggered if the average minimum bandwidth of the A-SDF traffic aggregate cannot be fulfilled.
  • each G- PCC rule has a precedence, or priority value.
  • a higher priority means that a G- PCC, and specifically the action triggered by it, is applied before G-PCC rules and IP-CAN session PCC rules with a lower priority value.
  • a default value which allows G-PCC rules with higher and lower priorities, e.g. a priority value of "5" for IP-CAN session PCC rules allows G-PCC rules with higher and lower priorities.
  • IP-CAN sessions on Gx level i.e. PCRF sessions
  • PCRF sessions are uniquely identified by Subscription-Id and PDN-Connection-ID, possibly together with RAT-type, see 3GPP TS 29.212, "Policy and Charging Control, PCC, over Gx/Sd reference point".
  • DIAMETER level the unique identification is provided by Session-Id; for every instantiation of an IP-CAN session a different DIAMETER Session-Id will be used.
  • a generalized PCRF session is required per connected PCEF to handle G-PCC rules. It should be created at start-up of communication between these nodes and is used for installation, modification and removal of G-PCC rules as well as generalized event reporting.
  • Actions can be used to trigger specific handling in the user data plane and associated control plane for all applicable IP-CAN sessions, that is, all which fulfill the condition, e.g.:
  • Event reports can be used to monitor the status of a whole, large set of IP-CAN sessions or SDFs - possibly all those currently handled on the PCEF - as an aggregate.
  • the occurrence of user plane overload in a 3GPP RAT will be detected whenever one of the UEs currently handled in the corresponding RAT experiences congestion in the user plane.
  • One example of handling RAN user plane congestion in such a way is to include an indication, e.g. a RAN user plane congestion information, RCI/RUCI, element in the event report to the PCRF, comprising a congestion level for a RAN cell, UE, or bearer.
  • Fig. 6 a procedure by which PCRF can support congestion handling in the 3GPP RAN, based on the concept of aggregate policy handling described above.
  • the PCRF has requested from PCRF event reporting of type of congestion using a generalized PCRF session;
  • UEs have established their data communication via the 3GPP RAT normally;
  • the 3GPP RAN runs into congestion and notifies this status to the PGW.
  • the assumption here is that this happens in the user plane, but note that this is only one of several possibilities; a similar notification could also be achieved via the control plane - signaling via MME, S-GW to P-GW.
  • the PCRF installs a policy rule with conditions "congestion” and "bearer has QCI type 2" - video - and an action "packet marking".
  • the PCEF evaluates the condition over all IP-CAN sessions.
  • the PCEF activates packet marking for all packets matching both conditions - UE is in congested area and the bearer is of QCI value 5.
  • the conditions result in un-mixed packets - either all marked or all unmarked - being delivered per UE; this would be the case if all UEs in the congested areas incidentally have only video streaming ongoing. In reality many UEs would receive both marked and unmarked packets, according to how the two conditions match.
  • the system likes to push offload data traffic like youtube and p2p from 3GPP access towards non-3GPP access, for multimode capable UEs that are in coverage of an alternative, non-3GPP RAT.
  • This may be e.g. according to a well-known schedule and location, like in dense metro areas at peak traffic hours, e.g. Shinagawa station in Tokyo.
  • specific offload policies have been provisioned via Access Network Discovery and Selection Function, ANDSF, to UEs in advance and that a mechanism for triggering them from EPC is available.
  • ANDSF Access Network Discovery and Selection Function
  • PCRF has established - at some earlier point in time - a generalized Gx session with PCEF/P-GW.
  • UEs have established communication / bearers via the 3GPP RAT.
  • PCRF detects that it is time to offload non-essential services from 3GPP access.
  • PCRF activates a generalized policy rule towards PCEF, with the condition describing in which area and for which type of traffic, e.g. youtube and p2p, the action should apply.
  • the action is defined as "trigger offload to non- 3GPP access”.
  • the PCEF/P-GW evaluates the condition and determines which UEs are affected. Note: the location information of UEs may be known when location reporting is on.
  • the PCEF/P-GW sends messages selectively to affected UEs, triggering the non-3GPP ANDSF offload policies.
  • a corresponding capability in the control plane exists.
  • the PCRF provides G-PCC rules at start-up time to PCEF/TDF.
  • the G-PCC rules contain: conditions for application type / IP flows, subscriber class, congestion level
  • the PCEF/TDF monitors the traffic and derives appropriate metrics to trigger events/actions.
  • the PCRF updates the G-PCC rules via the corresponding aggregated Gx sessions, e.g. as soon as it receives an event report from the PCEF.

Landscapes

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

Abstract

L'invention porte sur un procédé d'exploitation d'un réseau, en particulier un réseau radio, pour permettre une gestion de trafic très efficace par des moyens simples. Dans le procédé, une gestion de trafic provenant d'une pluralité d'équipements utilisateur, UE, est réalisée par application d'une ou plusieurs règles de politique pouvant être définies sur des sessions de données d'UE. Le procédé est caractérisé en ce qu'au moins une règle de politique généralisée pour une application sur des sessions de données d'UE est définie sur la base d'au moins une condition et en ce que l'au moins une règle de politique généralisée est appliquée sur des sessions de données d'UE correspondant à ladite condition. En outre, un réseau correspondant est revendiqué, de préférence pour réaliser le procédé mentionné ci-dessus.
PCT/EP2014/059434 2013-05-08 2014-05-08 Procede d'exploitation d'un reseau et reseau associe WO2014180949A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP13167064 2013-05-08
EP13167064.8 2013-05-08

Publications (1)

Publication Number Publication Date
WO2014180949A1 true WO2014180949A1 (fr) 2014-11-13

Family

ID=48326165

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2014/059434 WO2014180949A1 (fr) 2013-05-08 2014-05-08 Procede d'exploitation d'un reseau et reseau associe

Country Status (1)

Country Link
WO (1) WO2014180949A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI714613B (zh) * 2015-10-06 2021-01-01 美商蘋果公司 用於無線蜂巢式網路之無承載體架構

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030021283A1 (en) * 2001-07-30 2003-01-30 See Michael E. Distributed network management system using policies
WO2010086013A1 (fr) 2009-01-27 2010-08-05 Telefonaktiebolaget Lm Ericsson (Publ) Gestion de session de groupe pour commande de politique
EP2566197A1 (fr) * 2010-04-29 2013-03-06 ZTE Corporation Procédé d'application de politique pour communication de type machine et fonction de mise en pratique de politique et de facturation

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030021283A1 (en) * 2001-07-30 2003-01-30 See Michael E. Distributed network management system using policies
WO2010086013A1 (fr) 2009-01-27 2010-08-05 Telefonaktiebolaget Lm Ericsson (Publ) Gestion de session de groupe pour commande de politique
EP2566197A1 (fr) * 2010-04-29 2013-03-06 ZTE Corporation Procédé d'application de politique pour communication de type machine et fonction de mise en pratique de politique et de facturation

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; IP flow mobility and seamless Wireless Local Area Network (WLAN) offload; Stage 2 (Release 11)", 12 September 2012 (2012-09-12), XP050725483, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg_sa/WG2_Arch/Latest_SA2_Specs/Rel-11/> [retrieved on 20130723] *
"Digital cellular telecommunications system (Phase 2+); Universal Mobile Telecommunications System (UMTS); LTE; Policy and charging control architecture (3GPP TS 23.203 version 11.9.0 Release 11); ETSI TS 123 203", 2 April 2013 (2013-04-02), XP055136711, Retrieved from the Internet <URL:http://www.etsi.org/deliver/etsi_ts/123200_123299/123203/11.09.00_60/ts_123203v110900p.pdf> [retrieved on 20140827] *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI714613B (zh) * 2015-10-06 2021-01-01 美商蘋果公司 用於無線蜂巢式網路之無承載體架構
TWI751856B (zh) * 2015-10-06 2022-01-01 美商蘋果公司 無承載體架構之用戶設備、方法以及基頻處理器
TWI793871B (zh) * 2015-10-06 2023-02-21 美商蘋果公司 無承載體架構之用戶設備、方法以及基頻處理器
US11792838B2 (en) 2015-10-06 2023-10-17 Apple Inc. Bearer-less architecture for a wireless cellular network

Similar Documents

Publication Publication Date Title
US9509575B2 (en) Method, apparatus and system for marking service data packet
JP6025926B2 (ja) サービスを制御する方法、装置及びシステム
RU2654488C2 (ru) Объект mtc-iwf, объект pcrf и способ связи
US8495207B2 (en) Network system for policing resource intensive behaviors
EP2091178B1 (fr) Procédé, équipement et système de mise en oevre du contrôle des conditions d&#39;utilisation et de la facturation
KR101414921B1 (ko) 가입자에 관련된 변경에 대한 응답에서 인터넷 프로토콜 연결 액세스 네트워크(ip-can) 가입자 세션의 관리
EP2521305B1 (fr) Procédé, dispositif et système destinés à commander une police de séance d&#39;utilisateur
EP2704380A1 (fr) Signalement de congestion dans un réseau de communications
WO2013082789A1 (fr) Procédé et dispositif de contrôle de congestion de réseau
US10116694B2 (en) Network signaling interface and method with enhanced traffic management during signaling storms
CN106162758B (zh) 业务处理方法、pcrf以及业务处理系统
US9820183B2 (en) User plane congestion control
EP2888835A1 (fr) Procédés de commande de politique et de facturation sensibles au service avancés, n uds de réseau et programmes informatiques
EP2466790B1 (fr) Système de gestion de réseau
US20130326034A1 (en) Pcrf rule rollback due to insufficient resources on a downstream node
US10484245B2 (en) Selective inactivation of control rules parameters
EP2856785B1 (fr) Application de limite de comptage par flux et par session
WO2014180949A1 (fr) Procede d&#39;exploitation d&#39;un reseau et reseau associe
EP2950581B1 (fr) Serveur de politiques, dispositif d&#39;application de politiques et divers procédés d&#39;exclusion dynamique d&#39;add-ons de service actif à partir du ralentissement d&#39;une porteuse pour des terminaux utilisateurs
WO2022022840A1 (fr) Règles de politique dépendant de la qualité de service
CN108781475B (zh) 一种事件上报的方法及装置
US20150222710A1 (en) Policy decision point management
US20140059201A1 (en) Per flow dynamic metering selection

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

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

Country of ref document: EP

Kind code of ref document: A1