EP2688354B1 - Funkzugangspunkt für die verwaltung der benutzerebene mehrerer lager - Google Patents
Funkzugangspunkt für die verwaltung der benutzerebene mehrerer lager Download PDFInfo
- Publication number
- EP2688354B1 EP2688354B1 EP12177350.1A EP12177350A EP2688354B1 EP 2688354 B1 EP2688354 B1 EP 2688354B1 EP 12177350 A EP12177350 A EP 12177350A EP 2688354 B1 EP2688354 B1 EP 2688354B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- node
- tunnel endpoint
- user
- plane
- processor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Not-in-force
Links
- 238000000034 method Methods 0.000 claims description 31
- 238000012545 processing Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 7
- 230000008569 process Effects 0.000 claims description 7
- 230000011664 signaling Effects 0.000 claims description 3
- 230000005641 tunneling Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 13
- 230000005540 biological transmission Effects 0.000 description 9
- 230000006870 function Effects 0.000 description 9
- 230000032258 transport Effects 0.000 description 8
- 238000007726 management method Methods 0.000 description 6
- 230000015654 memory Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 230000004913 activation Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/10—Connection setup
- H04W76/12—Setup of transport tunnels
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
Definitions
- the present invention relates to a first node of a wireless network adapted to manage user-plane transmitted over a plurality of bearers established for ingress flow between said first node and a second node of said wireless network.
- the invention also relates to a corresponding method.
- Such first node is in a non-limitative example an eNodeB of a LTE wireless network.
- a first node of a wireless network adapted to manage user-plane transmitted over a plurality of bearers established for ingress flow between said first node and a second node of said wireless network comprises a processing unit which handles all said user-planes.
- One problem of this solution is that even a high capacity fist node which is needed when thousands of bearers have to be handled simultaneously may not be sufficient. Moreover, such solution leads to a single-point of failure for all bearers.
- a first node of a wireless network comprising a radio access network and an enhanced packet core, said first node being adapted to manage user-plane of a plurality of bearers established for ingress flow between said first node and a second node of said wireless network, said first node comprising a first processor, a front-end processor and a plurality of end-points:
- the method proposes a simple architecture of the first node which permits to distribute the user-plane processing of a plurality of bearers through a plurality of virtual path over a plurality of processing units.
- the first node according to the invention may also have one or more of the additional features below, taken individually or in any technically feasible combination:
- the invention relates to a method for managing user-plane transmitted over a plurality of bearers established for ingress flow between a first node of a wireless network comprising a radio access network and an enhanced packet core, and a second node of said wireless network, said first node comprising a first processor unit, a front-end processor and endpoints, said method comprising:
- said method comprises the initial steps of:
- a computer program product for a first node of a wireless network comprising a set of instructions, which when loaded into said first node, causes the first node to carry out the method for managing user-plane as characterized above.
- non transitory computer readable medium comprising a computer program product comprising a set of instructions, which when loaded into a first node of a wireless network, causes said first node to carry out the method for managing user-plane as characterized above.
- the present invention relates to a first node Nd1 of a wireless network NTW adapted to manage user-plane U transmitted over a plurality of bearers Br established for ingress flow between said first node and a second node Nd2 of said wireless network.
- the first node Nd1 is a radio access point eNodeB of a radio access network E-UTRAN
- the ingress flow is a downlink communication
- the second node Nd2 is a node of an enhances packet core EPC such as in a non-limitative example a serving gateway SGW.
- the eNodeB is therefore the receiving side
- the node Nd2 is the transmitting side. It is to be reminded that communications from the EPC to the UEs via the E-UTRAN are called downlink communication. Communications from the UEs via the E-UTRAN to the EPC are called uplink communications.
- the first node Nd1 is a radio access point eNodeB of said radio access network E-UTRAN and the second node Nd2 is another eNodeB' of said radio access network E-UTRAN.
- the ingress flow is therefore a direct communication from the eNodeB to a peer eNodeB' (peer communication meaning direct communication eNodeB to eNodeB').
- the first node Nd1 is a node of the enhanced packet core EPC
- the ingress flow is an uplink communication
- the second node Nd2 is a radio access point eNodeB of said radio access network E-UTRAN.
- the node of the EPC is therefore the receiving side
- the eNodeB is the transmitting side.
- the wireless network which is in a non-limitative embodiment a LTE network (or LTE advanced network) comprises as illustrated in Fig. 1 : A radio access network called E-UTRAN comprising a plurality of radio access points, which are called eNodeB and a plurality of User Equipments UE.
- E-UTRAN comprising a plurality of radio access points, which are called eNodeB and a plurality of User Equipments UE.
- Uu which comprises a L2 layer and a physical layer called L1.
- the L2 layer comprises the following protocols:
- the communication between the MME and an eNodeB is taken care through an S1 protocol stack also called S1-MME stack comprising a physical protocol such as in a non-limitative embodiment the Ethernet protocol, the transport IP protocol (optionally V4 or V6 IPSEC protocol), the Stream Control Transmission Protocol also called SCTP and the S1 Application Protocol also called S1AP protocol.
- S1-MME stack supports an S1-C interface (also called S1-MME interface) for exchanges with an eNodeB which are for Control-Plane.
- the MME comprises the S1 protocol stack to support the S1-MME interface with eNodeB, and a S11 control plane stack to support an S11 interface with a serving gateway SGW (described below).
- the S11 control plane stack comprising the IP protocol, UDP protocol and the GTPv2-C (see http://www.3gpp.orq/ftp/Specs/html-info/29274.htm) protocol (GRPS tunneling protocol for the control plane).
- GTPv2-C protocol is responsible for creating, maintaining and deleting tunnels. It is used for the control plane path management, tunnel management and mobility management.
- the communication between the SGW and an eNodeB is taken care through an S1 data plane stack comprising a physical protocol such as in a non-limitative embodiment the Ethernet protocol, the transport IP protocol (optionally V4 or V6 IPSEC protocol), the user IP protocol, and the UDP (User Datagram) protocol and the GTPv1-U protocol (GPRS tunneling protocol for the user plane).
- the S1 data plane stack supports an S1-U (3GPP reference, see http://www.3gpp.orq/ftp/Specs/html-info/29281.htm) interface for exchanges with an eNodeB which are for User-Plane.
- the SGW comprises the S1 data plane stack to support the S1 user plane interface S1-U with eNodeB, and also the S11 control plane stack to support a S11 interface with MME, and a S5/S8 control and data plane to support a S5/S8 interface with PGW.
- the GTPv1-U protocol tunnels user data between eNodeB and the SGW as well as between the SGW and the PGW and encapsulates all end user IP packets.
- GTP shall be understood as meaning GTPv1-U.
- the user-plane comprises the L2 layer and the L1 layer mentioned above.
- the user-plane comprises the layers mentioned above (physical, IP, UDP and GTP).
- User-Plane dedicated to a UE is transmitted over a bearer Br established for ingress flow between a first node Nd1 and a second node Nd2 of said wireless network.
- such User-Plane comprises in non-limitative example some user IP packets coming from a webpage to which a UE wants to connect, or some user IP packets coming from a VOIP service, thus some user IP packets coming from some operator's IP services OIPS as illustrated in Fig. 1 .
- such User-Plane comprises in non-limitative example some user IP packets coming from said another eNodeB'.
- such User-Plane comprises in non-limitative example some user IP packets coming from an email which a UE wants to transmit, or some user IP packets coming from a VOIP message an UE wants to send, thus some user IP packets coming from an UE.
- the user IP packets are tunneled:
- the GTP protocol is used on an X2-C interface for Control-Plane and on an X2-U interface for User-Plane between the eNodeB and another eNodeB'.
- the bearer is allocated Br; secondly the User-Plane is transmitted over said bearer Br.
- a bearer is allocated when for example, an UE wants to connect the first time to an eNodeB (it goes from an idle mode to a connected mode) or in another example during handover procedure.
- a tunnel endpoint identifier TEID is defined by the receiving side and sent to the sending side.
- said eNodeB will define such TEID.
- a node of the EPC is the first node Nd1
- said node will define such TEID.
- the bearer Br transports user-plane packets to the tunnel endpoint identified by a TEID.
- a bearer is well known by the man skilled in the art (a definition of said bearer may be found in 3GPP 36.300 ⁇ 13.1).
- GTP tunnels are unidirectional. Therefore, the TEID also called GTP TEID allows identifying a given bearer Br in a given direction.
- a GTP message comprises a GTP header comprising a tunnel endpoint identifier field, where the value of said tunnel endpoint identifier can be setup.
- tunnel endpoint identifiers TEID will be allocated to different bearers Br.
- a first node Nd1 comprises a first processor PR0, a front-end processor PR1 and end-points N illustrated PR2, PR2', PR2", PR2" ⁇ Said end-points are also called GTP end-points or GTP SAP (Service Access Point).
- Said first processor PR0 is adapted to:
- one or a plurality of sets SB of tunnel endpoint identifiers TEID is associated for one or a plurality of IP addresses associated to the first node Nd1.
- one set may be allocated for one IP address or for a group of IP addresses, or a plurality of IP sets may be allocated for one IP address or for a group of IP addresses, or the full range of TEID (within one set) may be allocated to all the IP addresses.
- an eNodeB may handle a plurality of IP addresses, depending on the number of Ethernet cards it contains or when said eNodeB handles multiple PLMNIDs (Public Land Mobile Network) for E-UTRAN sharing (sharing of a given eNodeB by multiple operators) or for any other reason.
- PLMNIDs Public Land Mobile Network
- subsets S of contiguous tunnel endpoint identifier TEID are defined within said set SB.
- a set is coded on 32 bits, that is to say said set if composed of 2 32 -1 bits, or less.
- said set is coded on 12 bits.
- a virtual path GTP_Pth (illustrated in doted lines in Fig. 1a, Fig. 1b and Fig. 1c ) is defined as being a path for routing user-plane of bearers from the second node Nd2 (a node of the EPC or a peer eNodeB 'or an eNodeB) to the first node Nd1 (more particularly to an end-point of the eNodeB or of an end-point of the EPC).
- the radio access point comprises four unit processors PR2, PR2', PR2", PR2'''.
- the first subset of TEID 0 to 1023 is allocated to the first unit processor PR2
- the second subset of TEID 1024 to 2047 is allocated to the second unit processor PR2'
- the third subset of TEID 2048 to 3071 is allocated to the third unit processor PR2
- the fourth subset of TEID 3072 to 4095 is allocated to the fourth unit processor PR2'''.
- the virtual path GTP_Pth is coded on the most significant bits MSB of the set of bits used for allocating a TEID number.
- the most significant bits MSB for example the bits #10 and #11 are used to code the virtual path GTP_Pth whereas all the 12 bits are used to define a TEID number for a bearer.
- TEID Chose a tunnel endpoint identifier TEID within a subset S and send said tunnel endpoint identifier TEID to the second node Nd2 for associating said tunnel endpoint identifier TEID to a bearer Br to be established for ingress flow of a user-plane between said first node Nd1 and said second Node Nd2.
- the TEID is sent via the S1-AP or X2-AP control interface.
- the TEID value chosen by the receiving node Nd1 may depend on a load balancing algorithm. Also, it may be adapted depending on possible failures of the PR2, Pr2' etc. processing entities for reliability question.
- this step permits the concerned end-point to know on which bearer it will receive the user data, the concerned end-point N being the processing unit corresponding to the allocated subset S of TEID to which the TEID chosen belongs to.
- the TEID is signaled to peer side of the tunnel via the S1-C interface for S1 case and via X2-C for X2 case.
- the first processor PR0 handles the S1-C/X2-C, S1-AP/X2-AP interfaces. It interfaces with the MME (via S1AP), with the peer eNodeB (via X2AP) and with UE (via RRC) as a minimum.
- Said front-end processor PR1 is adapted to: 4) Receive the user-plane U from said second node Nd2 over the bearer associated to said tunnel endpoint identifier TEID chosen.
- the front-end processor PR1 receives the user-plane U from said node SGW or eNodeB' or eNodeB through the bearer associated to said tunnel endpoint identifier TEID chosen.
- the front-end processor PR1 desencapsulates the user IP packets received until the GTP layer in order to retrieve the TEID corresponding to the allocated bearer Br, said TEID being in the GTP header as previously mentioned).
- the desencapsulation takes into account the different protocols of the S1-U which have been mentioned previously (Ethernet, transport IP, optionally IPSEC, GTP) and which have been used to encapsulate the user IP packets before the transmission from the second node Nd2 to the first node Nd1.
- the front-end processor PR1 routes the user-plane to the processor unit corresponding to said tunnel endpoint identifier TEID.
- Said End-points PR2, PR2', PR2", PR2''' are adapted to: 6) process the user-plane received from said front-end processor PR1.
- the process comprises the encapsulation of the user IP packets with at least the PDCP protocol on the E-UTRAN side for the first so that they may be transmit over the air to the UE.
- Nd1 eNodeB
- Nd2 SGW
- the process comprises the encapsulation of the user IP packets with at least the PDCP protocol on the E-UTRAN side for the first so that they may be transmit over the air to the UE.
- the following method M for distributing user-plane U processing of a plurality of bearers Br to be established for ingress flow between said first node Nd1 and said second node Nd2 is performed.
- the second node Nd2 is a node of the EPC or an eNodeB referenced eNodeB' of the E-UTRAN, and the first node Nd1 an eNodeB of the E-UTRAN, whereas when the ingress flow refers to an uplink traffic, the second node Nd2 is an eNodeB of the E-UTRAN and the first node is a node of the EPC.
- the second node Nd2 which is the transmitter node wishes to transmit the user-plane dedicated to an UE or originating from said UE to a receiver, it will transmits said user-plane over the bearer associated with the tunnel endpoint identifier TEID chosen by said second node Nd2.
- the following steps of the method M are performed by the receiving node Nd1.
- the method M comprises;
- Fig. 3 illustrates schematically the different functions which are performed by the different elements PR0, PR1, N of the first node Nd1.
- any functional blocks labeled as "PR" or “N” for processor or processor unit may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software.
- the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared.
- processor or “controller” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, system on chip SoC, digital signal processor (DSP) hardware, network processor, application specific integrated circuit (ASIC), field programmable gate array (FPGA), read only memory (ROM) for storing software, random access memory (RAM), and non volatile storage. Other hardware, conventional and/or custom, may also be included.
- DSP digital signal processor
- ASIC application specific integrated circuit
- FPGA field programmable gate array
- ROM read only memory
- RAM random access memory
- non volatile storage Other hardware, conventional and/or custom, may also be included.
- any switches shown in the FIGS. are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the implementer as more specifically understood from the context.
- any block diagrams herein represent conceptual views of illustrative circuitry embodying the principles of the invention.
- any flow charts, flow diagrams, state transition diagrams, pseudo code, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.
- program storage devices e.g., digital data storage media, which are machine or computer readable and encode machine-executable, wherein said instructions perform some or all of the steps of said above-described methods.
- the program storage devices are therefore non transitory computer readable media and may be, e.g., digital memories, magnetic storage media such as a magnetic disks and magnetic tapes, hard drives, or optically readable digital data storage media.
- the embodiments are also intended to cover computers programmed to perform said steps of the above-described method.
- One or a plurality of computer program products PG as illustrated in Fig. 3 can be contained in the radio access point eNodeB, said the radio access point eNodeB comprising a front-end processor PR1 and a plurality of processor units N.
- a processor unit N comprises one or a plurality of processors.
- a plurality of computer program products PG is contained in the front-end processor PR1 and in the processor units N.
- the computer program products PG comprise a set of instructions.
- said set of instructions contained, for example, in a radio access point memory may cause the radio access point eNodeB to carry out the different steps of the method M.
- some embodiments of the invention may comprise one or a plurality of the following advantages:
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Claims (10)
- Ein erster Netzknoten (Nd1) eines drahtlosen Netzwerks bestehend aus einem Funkzugangsnetz und einem erweiterten Packet-Core, wobei der besagte Netzknoten (Nd1) so ausgelegt ist, dass er die Nutzerebene (U) einer Vielzahl von Trägern (Br) verwaltet, die für den einströmenden Datenfluss von einem zweiten Netzknoten (Nd2) des besagten drahtlosen Netzwerks zum besagten ersten Netzknoten (Nd1) eingerichtet wurde, wobei der erste Netzknoten (Nd1) einen ersten Prozessor (PRO), einen Front-End-Prozessor (PR1) und eine Vielzahl von Endpunkt-Einheit Prozessoren (PR2, PR2', PR", PR2''') umfasst.- wobei der besagte erste Prozessor (PR0) so ausgelegt ist, dass er:∘ Teilmengen (S) für zusammenhängende Tunnelendpunkt-IDs innerhalb einer Menge (SB) von Tunnelendpunkt-IDs definiert;∘ eine Teilmenge (S) von zusammenhängenden Tunnelendpunkt-IDs jedem Endpunkt-Einheit Prozessor (PR2, PR2', PR2", PR2''') zuordnet zur Bestimmung eines virtuellen Pfades für den besagten einströmenden Datenfluss mittels mindestens eines Bits der zusammenhängenden Tunnelendpunkt-ID;∘ eine Tunnelendpunkt-ID innerhalb einer Teilmenge (S) auswählt und die besagte Tunnelendpunkt-ID an den besagten zweiten Netzknoten (Nd2) sendet, damit ein Träger (Br) für den einströmenden Datenfluss vom besagten zweiten Netzknoten (Nd2) an den besagten ersten Netzknoten (Nd1) hergestellt wird;∘ die besagte Tunnelendpunkt-ID, die für den entsprechenden Endpunkt-Einheit Prozessor (PR2, PR2', PR2", PR3''') ausgewählt wurde, anzeigt.- wobei der besagte Front-End Prozessor (PR1) so ausgelegt ist, dass er:∘ die Nutzerebene (U) vom besagten zweiten Netzknoten (Nd2) über den Träger empfängt, für den die besagte Tunnelendpunkt-ID ausgewählt wurde;∘ die Nutzerebene (U) des besagten Trägers zu einem Endpunkt-Einheit Prozessor (PR2, PR2', PR2", PR2''') durch den virtuellen Pfad leitet, der der Teilmenge (S) entspricht, bestehend aus der besagten Tunnelendpunkt-ID;- wobei die besagten Endpunkt-Einheit Prozessoren (PR2, PR2', PR2", PR2''') so ausgelegt sind, dass sie die vom besagten Front-End Prozessor (PR1) empfangene Nutzerebene verarbeiten.
- Ein erster Netzknoten (Nd1) gemäß Anspruch 1, wobei die Nutzerebene über GPRS Tunneling Protocol (GTP) Tunnel transportiert wird.
- Ein erster Netzknoten (Nd1) gemäß Anspruch 1 oder 2, wobei eine oder eine Vielfalt von Mengen (SB) der Tunnelendpunkt-ID für eine oder eine Vielfalt von IP-Adressen dem ersten Netzknoten (Nd1) zugeordnet wird.
- Ein erster Netzknoten (Nd1) gemäß einem der vorstehenden Ansprüche, wobei es sich bei dem ersten Netzknoten (Nd1) um eine Funkzugangsstelle des Funkzugangsnetzes handelt.
- Ein erster Netzknoten (Nd1) gemäß Anspruch 4, wobei es sich bei dem zweiten Netzknoten (Nd2) um eine Funkzugangsstelle des Funkzugangsnetzes handelt.
- Ein erster Netzknoten (Nd1) gemäß Anspruch 4, wobei es sich bei dem zweiten Netzknoten (Nd2) um einen Netzknoten des erweiterten Packet-Core handelt.
- Ein erster Netzknoten (Nd1) gemäß einem der Ansprüche 1 bis 3, wobei es sich bei dem ersten Netzknoten (Nd1) um einen Netzknoten des erweiterten Packet-Core und bei dem zweiten Netzknoten (Nd2) um eine Funkzugangsstelle des Funkzugangsnetzes handelt.
- Eine Methode (M) für die Verwaltung der Nutzerebene (U) über eine Vielfalt von Trägern (Br), die für den einströmenden Datenfluss von einem zweiten Netzknoten (Nd2) eines drahtlosen Netzwerks zu einem ersten Netzknoten (Nd1) des besagten drahtlosen Netzwerks hergestellt wird, wobei das drahtlose Netzwerk aus einem Funkzugangsnetz und einem erweiterten Packet-Core besteht, der besagte erste Netzknoten (Nd1) bestehend aus einer ersten Prozessor-Einheit (PR0), einem Front-End Prozessor (PR1) sowie Endpunkt-Einheit Prozessoren (PR2, PR2', PR2", PR3'''), wobei die besagte Methode folgendes umfasst:- Definition von Teilmengen (S) für zusammenhängende Tunnelendpunkt-IDs innerhalb einer Menge (SB) von Tunnelendpunkt-IDs;- Zuordnung einer Teilmenge (S) von zusammenhängenden Tunnelendpunkt-IDs zu jedem Endpunkt-Einheit Prozessor (PR2, PR2', PR2", PR2''') zur Bestimmung eines virtuellen Pfades für den einströmenden Datenfluss mittels mindestens eines Bits der zusammenhängenden Tunnelendpunkt-IDs;- Wahl einer Tunnelendpunkt-ID innerhalb einer Teilmenge (S) und das Versenden der besagten Tunnelendpunkt-ID an den besagten zweiten Netzknoten (Nd2), damit ein Träger (Br) für den besagten einströmenden Datenfluss vom besagten zweiten Netzknoten (Nd2) an den besagten ersten Netzknoten (Nd1) hergestellt wird;- Anzeige der besagten Tunnelendpunkt-ID, die für den entsprechenden Endpunkt-Einheit Prozessor (PR2, PR2', PR2", PR3''') ausgewählt wurde.- Weiterleitung der Nutzerebene (U) des besagten Trägers zu einem Endpunkt-Einheit Prozessor (PR2, PR2', PR2", PR2''') durch den virtuellen Pfad, der der Teilmenge (S) entspricht, bestehend aus der besagten Tunnelendpunkt-ID; und- Verarbeitung der Nutzereben, die vom besagten Front-End Prozessor (PR1) empfangen wurden.
- Ein Computerprogramm (PG), mit einer Reihe von Anweisungen, das bei dem Betrieb durch einen ersten Netzknoten (Nd1) eines drahtlosen Netzwerks, dazu führt, dass der erste Netzknoten (Nd1) die Methode für die Verwaltung der Nutzerebene gemäß Anspruch 8 ausführt.
- Ein nicht transistorisches computerlesbares Speichermedium, das ein Computerprogramm (PG) umfasst, mit einer Reihe von Anweisungen, das bei dem Betrieb durch einen ersten Netzknoten (Nd1) eines drahtlosen Netzwerks, dazu führt, dass dieser erste Netzknoten (Nd1) die Methode für die Verwaltung der Nutzerebene gemäß Anspruch 8 ausführt.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP12177350.1A EP2688354B1 (de) | 2012-07-20 | 2012-07-20 | Funkzugangspunkt für die verwaltung der benutzerebene mehrerer lager |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP12177350.1A EP2688354B1 (de) | 2012-07-20 | 2012-07-20 | Funkzugangspunkt für die verwaltung der benutzerebene mehrerer lager |
Publications (2)
Publication Number | Publication Date |
---|---|
EP2688354A1 EP2688354A1 (de) | 2014-01-22 |
EP2688354B1 true EP2688354B1 (de) | 2019-07-10 |
Family
ID=46578892
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP12177350.1A Not-in-force EP2688354B1 (de) | 2012-07-20 | 2012-07-20 | Funkzugangspunkt für die verwaltung der benutzerebene mehrerer lager |
Country Status (1)
Country | Link |
---|---|
EP (1) | EP2688354B1 (de) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105515720B (zh) * | 2014-09-25 | 2019-02-26 | 中国电信股份有限公司 | 信令与数据的关联方法、装置与系统 |
CN110915290B (zh) * | 2017-07-07 | 2023-09-01 | 诺基亚通信公司 | 支持多供应方4g/5g网络的多空中接口聚合 |
CN111787060B (zh) * | 2020-05-28 | 2022-01-07 | 网宿科技股份有限公司 | 一种流量调度方法、系统及装置 |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8560708B2 (en) * | 2010-06-29 | 2013-10-15 | Alcatel Lucent | Method and apparatus for allocating bundles of sessions in a network element |
US8345603B2 (en) * | 2010-09-30 | 2013-01-01 | Alcatel Lucent | Method and apparatus for processing GTP triggered messages |
-
2012
- 2012-07-20 EP EP12177350.1A patent/EP2688354B1/de not_active Not-in-force
Also Published As
Publication number | Publication date |
---|---|
EP2688354A1 (de) | 2014-01-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP7303833B2 (ja) | 情報伝送方法及び装置 | |
US9999028B2 (en) | Data transmission method, base station, and user equipment | |
US9077430B2 (en) | Method, device and system for transmitting relay data | |
WO2016161915A1 (zh) | 数据无线承载配置方法、数据传输方法及设备 | |
CN109246747B (zh) | 前向接口的建立方法、ue接入方法、ue切换方法及装置 | |
US20160157155A1 (en) | Selective Bearer Splitting in Cell System | |
KR102391106B1 (ko) | 노드 및 통신 방법 | |
US9363835B2 (en) | Methods and nodes for improved network signaling | |
TW201735715A (zh) | 用於中繼傳輸的方法和裝置以及中繼終端設備 | |
EP3229552B1 (de) | Verfahren und vorrichtung zur konfigurierung einer getrennten tcp-verbindung in einem kommunikationssystem | |
CN111050343B (zh) | 无线接入网设备、数据处理方法和ip报文处理方法 | |
JP7482997B2 (ja) | データパケット送信方法および装置 | |
JP2022550751A (ja) | ルーティングおよびベアラマッピング構成のための方法およびデバイス | |
US9503393B2 (en) | S-GW relocation and QoS change without mobility | |
CN109479215A (zh) | 多连接通信方法和设备 | |
CN112514521A (zh) | Nr-nr双连接(nr-dc)的协议和架构 | |
EP4213514A1 (de) | Datenübertragungsverfahren und -vorrichtung | |
EP2688354B1 (de) | Funkzugangspunkt für die verwaltung der benutzerebene mehrerer lager | |
US20220210647A1 (en) | User Plane Security in Split RAN Architectures | |
WO2020042986A1 (zh) | 一种多跳数据传输方法及装置 | |
US20220264602A1 (en) | Communication method and apparatus | |
CN112771919A (zh) | 用于分组隧道传输的隧道端点标识符的生成 | |
RU2803196C1 (ru) | Способ передачи пакета данных и устройство | |
WO2015144213A1 (en) | Methods and nodes for improved network signaling | |
WO2015020582A1 (en) | S-gw relocation and qos change without mobility |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ALCATEL LUCENT |
|
17P | Request for examination filed |
Effective date: 20140721 |
|
RBV | Designated contracting states (corrected) |
Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20170418 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ALCATEL LUCENT |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602012061842 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: H04W0076020000 Ipc: H04W0076120000 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04W 72/00 20090101ALN20181204BHEP Ipc: H04W 76/12 20180101AFI20181204BHEP |
|
INTG | Intention to grant announced |
Effective date: 20190108 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04W 76/12 20180101AFI20181217BHEP Ipc: H04W 72/00 20090101ALN20181217BHEP |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP Ref country code: AT Ref legal event code: REF Ref document number: 1154920 Country of ref document: AT Kind code of ref document: T Effective date: 20190715 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602012061842 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20190710 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1154920 Country of ref document: AT Kind code of ref document: T Effective date: 20190710 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191010 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191111 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191010 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191011 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191110 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20190731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20190731 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20190731 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20190720 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20190731 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200224 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602012061842 Country of ref document: DE |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
PG2D | Information on lapse in contracting state deleted |
Ref country code: IS |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20190720 |
|
26N | No opposition filed |
Effective date: 20200603 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20120720 Ref country code: MT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20210611 Year of fee payment: 10 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20190710 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20220606 Year of fee payment: 11 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20220531 Year of fee payment: 11 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220731 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 602012061842 Country of ref document: DE |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20230720 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20240201 Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20230720 |