EP2467978B1 - Procédé de limitation douce dans l'attribution de largeur de bande dynamique - Google Patents

Procédé de limitation douce dans l'attribution de largeur de bande dynamique Download PDF

Info

Publication number
EP2467978B1
EP2467978B1 EP10751873.0A EP10751873A EP2467978B1 EP 2467978 B1 EP2467978 B1 EP 2467978B1 EP 10751873 A EP10751873 A EP 10751873A EP 2467978 B1 EP2467978 B1 EP 2467978B1
Authority
EP
European Patent Office
Prior art keywords
bandwidth
value
limit
bucket
bandwidth allocation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Not-in-force
Application number
EP10751873.0A
Other languages
German (de)
English (en)
Other versions
EP2467978A1 (fr
Inventor
Bjorn Skubic
Elmar Trojer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP2467978A1 publication Critical patent/EP2467978A1/fr
Application granted granted Critical
Publication of EP2467978B1 publication Critical patent/EP2467978B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q11/0067—Provisions for optical access or distribution networks, e.g. Gigabit Ethernet Passive Optical Network (GE-PON), ATM-based Passive Optical Network (A-PON), PON-Ring
    • 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
    • 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/215—Flow control; Congestion control using token-bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0064—Arbitration, scheduling or medium access control aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0084—Quality of service aspects

Definitions

  • the present invention relates generally to dynamic bandwidth allocation for a communications network.
  • a Passive Optical Network comprises an Optical Line Termination (OLT), which resides in a Central Office (CO) and further comprises user modems, called Optical Network Terminals (ONT) or network units, called Optical Network Units (ONU).
  • OLT services a number of ONU's or ONT's, typically connected in a tree arrangement via an Optical Distribution Network (ODN) using an optical power splitter, which resides close to the user premises. Since the physical medium, of one or more communication links, is shared, the ONU's are scheduled by the OLT to transmit in the upstream direction in a Time Division Multiple Access (TDMA) manner.
  • TDMA Time Division Multiple Access
  • DBA dynamic bandwidth allocation
  • T-CONT Transmission Container
  • a T-CONT may be viewed as an upstream queue for a particular type of traffic (for example, video, voice and data).
  • Each ONU typically holds several T-CONT's.
  • the bandwidth assignment in the scheduling is done purely on a per T-CONT basis.
  • Each T-CONT in the PON system is identified by a so-called Alloc ID.
  • the OLT grants bandwidth to ONT's via a bandwidth map (BWmap) which comprises control signals sent in a downstream direction.
  • BWmap bandwidth map
  • a Service Layer Agreement associates each Alloc ID with respective bandwidth requirements to allow each Alloc-ID to be suitably serviced with bandwidth.
  • the bandwidth requirements for one Alloc ID are described in terms of multiple bandwidth allocation classes. Each class has an associated bandwidth value, and together the values provide an overall bandwidth value for servicing each Alloc-ID. These limits define how a queue should be serviced with bandwidth. For example fixed bandwidth, assured bandwidth, non-assured bandwidth and best-effort bandwidth classes could be included in the SLA.
  • a particular Alloc ID can be configured to obtain a certain amount of fixed bandwidth, up to a certain amount of assured bandwidth, up to a certain amount of non-assured bandwidth and up to a certain amount of best-effort bandwidth.
  • the OLT may either utilize traffic monitoring or a messaging mechanism that has been introduced in the GPON protocol where status reports (containing queue occupancy) are transmitted to the OLT upon request.
  • the OLT must, in addition to assigning bandwidth according to need, also enforce bandwidth guarantees, bandwidth capping and prioritization policies regarding traffic from different T-CONT's.
  • the OLT is required to continually re-calculate how bandwidth is shared since the extent of queued traffic in each T-CONT varies over time.
  • Another prior art system for allocating bandwidth in a PON is disclosed in EP 1 833 207 A2 (HUAWEI TECH CO LTD), 12 September 2007.
  • a method of dynamic bandwidth allocation comprising updating a limit value of bandwidth of a bandwidth allocation traffic class, the method comprising subtracting from an initial value a value indicative of previously assigned bandwidth, and adding a predetermined bandwidth limit value.
  • the invention may be viewed as determining a limit value of a bandwidth allocation traffic class using predetermined limit value and a value of bandwidth previously granted.
  • Bandwidth allocation may advantageously be determined using a token bucket model.
  • using a token bucket model provides the dynamic bandwidth allocation process with 'soft', or flexible, dynamic limits based on specified effective bandwidth limits and previously granted bandwidth, which results in improved bandwidth utilisation. Further advantageously, use of the token bucket model reduces jitter and average delay.
  • bandwidth allocation apparatus relates to bandwidth allocation apparatus, a communications network node and machine-readable instructions (for execution by a processor of bandwidth allocation apparatus of a communications network node).
  • a communications network node comprising a processor, the processor arranged to determine bandwidth allocation for at least two other communications network nodes, wherein the processor arranged to update a limit value of bandwidth by subtracting from an initial value a value indicative of previously assigned bandwidth, and adding a predetermined bandwidth value.
  • bandwidth allocation apparatus for a communications network node comprising a processor, the processor arranged to determine bandwidth allocation for at least two other communications network nodes, wherein the processor arranged to update a limit value of bandwidth by subtracting from an initial value a value indicative of previously assigned bandwidth, and adding a predetermined bandwidth value.
  • a processor of bandwidth allocation apparatus the instructions arranged to cause the processor to update a limit value of bandwidth by subtracting from an initial value a value indicative of previously assigned bandwidth, and adding a predetermined bandwidth value
  • FIG. 1 shows a communications network node comprising an Optical Line Termination (OLT) 1 connected to two further network nodes, namely Optical Network Units (ONU) 6 and 7.
  • the OLT 1 is arranged to implement Dynamic Bandwidth Allocation (DBA) for the ONU's 6 and 7.
  • DBA Dynamic Bandwidth Allocation
  • the OLT comprises a processor configured to determine a bandwidth map which is output to the ONU's to control use of the available bandwidth.
  • the three principle DBA tasks are: (i) bandwidth demand prediction, (ii) bandwidth sharing and (iii) grant scheduling.
  • Bandwidth demand prediction typically involves monitoring the amount of queued traffic at each ONU.
  • Bandwidth sharing involves calculating how the available bandwidth is divided over the various queues of traffic at each ONU.
  • Each queue at an ONU is called a T-CONT, identified by a respective Alloc-ID, and typically relates to a particular type of traffic (for example, video, voice and data).
  • Each ONU typically holds several T-CONT's.
  • the bandwidth assignment in the scheduling algorithm is done purely on a per T-CONT basis.
  • Each T-CONT is specified by a T-CONT descriptor which contains criteria relating to maximum permissible bandwidth to be assigned to the T-CONT as well as specifying how the granted bandwidth is to be shared over the different classes for each T-CONT, such as fixed bandwidth, assured bandwidth, non-assured bandwidth, best-effort bandwidth.
  • the T-CONT descriptor contains parameters that describe the bandwidth allocation service of a T-CONT and the descriptor may contain limits for maximum permissible bandwidth as well as maximum bandwidth for various bandwidth allocation classes.
  • GPON Gigabit Passive Optical Networking
  • the DBA process produces an upstream bandwidth map comprising a control signal, or sequence of control signals, sent to the ONU's which divides the bandwidth of a 125 ⁇ s upstream super frame between the ONU's.
  • the DBA process is executed with regular intervals at the OLT 1 producing an updated bandwidth map or sequence of bandwidth maps that can be used once or iteratively until it is updated.
  • the embodiment described below with reference to the flow diagram 200 in Figure 2 is a method of providing the DBA process with 'soft' , or flexible, dynamic limits for those classes based on specified effective bandwidth limits and previously granted bandwidth.
  • the method is based on the so-called 'token bucket' analogy.
  • tokens are placed into the bucket or logical container at a constant rate. If the bucket is full, excess tokens are discarded. Tokens are used to grant way for packets. Each arriving packet requires a token to pass. Tokens leave the bucket (ie are decremented) as packets are granted right to pass.
  • the token bucket method enables control over average packet rate through the token rate, while allowing for a certain amount of burstiness determined by the bucket size, N maxij . It will be appreciated that in the analogy, the number of tokens in the bucket at any one time represent available bandwidth and that reported bandwidth demand for a T-CONT play the role of arriving packets.
  • the maximum limit is set to the predetermined T-CONT descriptor value, T i1 . as shown at step 201.
  • Each bandwidth limit B max,i,j (for each Alloc ID and each of the traffic classes other than fixed bandwidth class) requires a token bucket.
  • one-byte tokens are used.
  • N ij sets to the maximum bandwidth limit for the specified Alloc ID and class.
  • the number of tokens in each bucket (bandwidth limit) is changed when a token update process is executed shown by step 202.
  • the token update process may be executed every n DBA cycles.
  • the bandwidth limit is then given by the number of tokens in a bucket divided by n (N ij /n).
  • the token update process both removes and adds tokens to the buckets.
  • step 202b the sum of tokens corresponding to all bandwidth that was granted to an Alloc ID, ⁇ k M ij k , during the past n DBA cycles, are removed from the buckets (at step 202a) for all the different classes corresponding to this Alloc ID.
  • the index k is used to denote the DBA cycle.
  • each bucket is then filled with the number of tokens corresponding to the nominal bandwidth limit (as defined in the T-CONT descriptor) for each class for the n coming DBA cycles.
  • the bucket is filled with tokens corresponding to n ⁇ T ij bytes, as shown at step 202d.
  • the size of each bucket, N max.ij specifies the softness of the limit. The larger the bucket is, the softer the limit is.
  • the bucket size is set to the smallest possible size, ie identical to the nominal bandwidth limit multiplied by n.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Claims (14)

  1. Un procédé d'attribution de bande passante dynamique dans un réseau optique passif, comprenant l'actualisation (200) d'une valeur limite, Bmax i,j, de bande passante d'une file d'attente d'un type de trafic particulier qui est une valeur limite d'une pluralité de valeurs limites de différentes classes de trafic, lesdites valeurs limites définissant conjointement comment la file d'attente doit être desservie en bande passante, le procédé comprenant la soustraction (202b) à partir d'une valeur initiale Nij d'une valeur indicative d'une bande passante attribuée antérieurement, et le procédé comprenant en outre l'ajout (202c) d'une valeur de bande passante prédéterminée, Tij, où l'indice i désigne un identifiant d'attribution et l'indice j désigne une classe d'attribution de bande passante.
  2. Un procédé selon la Revendication 1 dans lequel une valeur indicative de bande passante disponible restante est décrémentée proportionnellement à une bande passante attribuée.
  3. Un procédé selon la Revendication 2 dans lequel la valeur de bande passante disponible restante est incrémentée jusqu'à une valeur maximale, Nmax ij.
  4. Un procédé selon la Revendication 3 dans lequel la valeur de bande passante disponible restante est incrémentée à une vitesse prédéterminée.
  5. Un procédé selon l'une quelconque des Revendications 2, 3 et 4 dans lequel la bande passante disponible restante est représentée logiquement par des jetons conservés en mémoire dans un compartiment, où la bande passante disponible restante est incrémentée par des jetons qui sont placés dans le compartiment à une vitesse prédéterminée jusqu'à une valeur maximale, Nmax ij, à laquelle le compartiment est plein, et où, si la valeur maximale de jetons est atteinte, des jetons additionnels ne sont pas ajoutés au compartiment mais sont rejetés, et en outre où des jetons sont retirés du compartiment proportionnellement à la bande passante attribuée.
  6. Un procédé selon l'une quelconque des Revendications précédentes dans lequel la valeur initiale, Nij, comprend une valeur indicative d'une bande passante disponible restante.
  7. Un procédé selon l'une quelconque des Revendications précédentes dans lequel la valeur indicative d'une bande passante attribuée antérieurement porte une bande passante accordée antérieurement sur un nombre de cycles d'attribution de bande passante dynamique, n.
  8. Un procédé selon l'une quelconque des Revendications précédentes dans lequel la valeur de bande passante prédéterminée, Tij, est une limite de bande passante nominale incluse dans des informations de descripteur pour un type particulier de file d'attente de trafic.
  9. Un procédé selon l'une quelconque des Revendications précédentes dans lequel la valeur limite, Bmax i,j, est indicative d'une valeur de bande passante maximale.
  10. Un procédé selon l'une quelconque des Revendications précédentes dans lequel la même valeur de bande passante prédéterminée, Tij, est utilisée (202d) sur une pluralité de cycles d'attribution de bande passante dynamique, n.
  11. Un procédé selon l'une quelconque des Revendications précédentes comprenant l'actualisation (200) d'une valeur limite, Bmax i,j, de bande passante d'une classe de trafic d'attribution de bande passante.
  12. Un appareil d'attribution de bande passante pour un noeud de réseau de communication optique passif (1) comprenant un processeur (DBA), le processeur étant agencé de façon à déterminer une attribution de bande passante pour au moins deux autres noeuds de réseau de communication (6, 7), où le processeur est agencé de façon à actualiser une valeur limite, Bmax i,j, de bande passante par la soustraction à partir d'une valeur initiale, Nij, d'une valeur indicative d'une bande passante attribuée antérieurement, et l'ajout d'une valeur de bande passante prédéterminée, Tij, où la valeur limite est une valeur limite de bande passante d'une file d'attente d'un type de trafic particulier qui est une valeur d'une pluralité de valeurs limites de différentes classes de trafic, lesdites valeurs limites définissant conjointement comment la file d'attente doit être desservie en bande passante, où l'indice i désigne un identifiant d'attribution et l'indice j désigne une classe d'attribution de bande passante.
  13. Un noeud de réseau de communication (1) comprenant un appareil d'attribution de bande passante selon la Revendication 12.
  14. Des instructions lisibles par ordinateur destinées à être exécutées par un processeur d'un appareil d'attribution de bande passante, les instructions étant agencées de façon à amener le processeur à exécuter le procédé selon la Revendication 1.
EP10751873.0A 2009-08-21 2010-08-20 Procédé de limitation douce dans l'attribution de largeur de bande dynamique Not-in-force EP2467978B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US23582809P 2009-08-21 2009-08-21
PCT/EP2010/062196 WO2011020918A1 (fr) 2009-08-21 2010-08-20 Procédé permettant une limitation souple de la largeur de bande dans une allocation de largeur de bande dynamique

Publications (2)

Publication Number Publication Date
EP2467978A1 EP2467978A1 (fr) 2012-06-27
EP2467978B1 true EP2467978B1 (fr) 2013-10-09

Family

ID=43216915

Family Applications (1)

Application Number Title Priority Date Filing Date
EP10751873.0A Not-in-force EP2467978B1 (fr) 2009-08-21 2010-08-20 Procédé de limitation douce dans l'attribution de largeur de bande dynamique

Country Status (4)

Country Link
US (1) US9326051B2 (fr)
EP (1) EP2467978B1 (fr)
CN (1) CN102742217B (fr)
WO (1) WO2011020918A1 (fr)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8964538B2 (en) * 2010-09-24 2015-02-24 Broadcom Corporation Method and apparatus for supporting differentiated performance for multiple categories of packets in a passive optical network
JP5669613B2 (ja) * 2011-02-18 2015-02-12 沖電気工業株式会社 動的帯域割当方法、光通信ネットワーク及び局側装置
US8976688B2 (en) * 2011-06-17 2015-03-10 Calix, Inc. Grant scheduler for optical network devices
US8917993B2 (en) 2011-06-17 2014-12-23 Calix, Inc. Scheduling delivery of upstream traffic based on downstream traffic in optical networks
US9413484B2 (en) 2012-11-05 2016-08-09 Futurewei Technologies, Inc. System and method for passive optical network communication
US9509429B2 (en) * 2013-03-06 2016-11-29 Telefonaktiebolaget L M Ericsson (Publ) Energy conservation by means of traffic shaping
KR102105186B1 (ko) * 2013-03-18 2020-04-28 한국전자통신연구원 수동형 광 가입자 망의 광 선로 종단 장치 및 이를 이용한 상향 대역 제어 방법
CN104253766A (zh) * 2013-06-26 2014-12-31 富泰华工业（深圳）有限公司 网络流量分配系统及方法
US10002011B2 (en) 2013-11-04 2018-06-19 Amazon Technologies, Inc. Centralized networking configuration in distributed systems
US9712390B2 (en) 2013-11-04 2017-07-18 Amazon Technologies, Inc. Encoding traffic classification information for networking configuration
US9647904B2 (en) 2013-11-25 2017-05-09 Amazon Technologies, Inc. Customer-directed networking limits in distributed systems
US9674042B2 (en) 2013-11-25 2017-06-06 Amazon Technologies, Inc. Centralized resource usage visualization service for large-scale network topologies
CN104734989B (zh) * 2013-12-23 2018-09-14 腾讯数码（天津）有限公司 基于令牌桶的数据传输流量调度方法及其系统
US9654483B1 (en) * 2014-12-23 2017-05-16 Amazon Technologies, Inc. Network communication rate limiter
US10027559B1 (en) 2015-06-24 2018-07-17 Amazon Technologies, Inc. Customer defined bandwidth limitations in distributed systems
CN108449286B (zh) * 2018-03-01 2020-07-03 北京邮电大学 网络带宽资源分配方法及装置
US12238009B1 (en) * 2023-10-05 2025-02-25 Oracle International Corporation Distributed rate limiting

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100506209B1 (ko) * 2003-06-16 2005-08-05 삼성전자주식회사 이더넷 수동 광 가입자망에서 다중 서비스를 고려한 동적대역폭 할당방법
TWI241807B (en) * 2004-03-02 2005-10-11 Hon Hai Prec Ind Co Ltd System and method for network quality of service
CN101035389A (zh) * 2006-03-08 2007-09-12 上海交通大学 在无源光网络的远端设备内进行带宽分配的系统和方法
KR100809424B1 (ko) * 2006-09-29 2008-03-07 한국전자통신연구원 광가입자망을 위한 동적 대역폭 할당 장치 및 그 방법
CN100574278C (zh) 2006-12-26 2009-12-23 华为技术有限公司 流量限制技术中刷新令牌桶的方法及装置
CN101399758B (zh) * 2007-09-24 2011-07-13 中兴通讯股份有限公司 一种千兆无源光网络上行带宽管理方法
KR100950337B1 (ko) * 2007-11-27 2010-03-31 한국전자통신연구원 Ｔｄｍａ 기반 수동 광가입자망을 위한 효율적인 동적대역폭 할당 장치 및 방법
JP5005048B2 (ja) * 2009-01-20 2012-08-22 ピーエムシー−シエラ，インク 様々なｏｎｕが様々な速度で送信する受動型光学ネットワークにおける動的な帯域幅を割り当てる方法

Also Published As

Publication number Publication date
WO2011020918A1 (fr) 2011-02-24
CN102742217B (zh) 2015-08-19
US9326051B2 (en) 2016-04-26
CN102742217A (zh) 2012-10-17
EP2467978A1 (fr) 2012-06-27
US20120148247A1 (en) 2012-06-14

Similar Documents

Publication Publication Date Title
EP2467978B1 (fr) Procédé de limitation douce dans l'attribution de largeur de bande dynamique
KR100506209B1 (ko) 이더넷 수동 광 가입자망에서 다중 서비스를 고려한 동적대역폭 할당방법
US7620325B2 (en) Transmission apparatus with function of multi-step bandwidth assignment to other communication apparatuses
US8526815B2 (en) Dynamic bandwidth allocation for congestion management in PON channel aggregation
US8437355B1 (en) Systems and methods for scheduling business and residential services in optical networks
US10608940B2 (en) Systems and methods for allocating network bandwidth across access modules
US20100208747A1 (en) Output demultiplexing for dynamic bandwidth allocation in passive optical networks
US9729241B2 (en) Telecommunication systems and methods using dynamic shaping for allocating network bandwidth
CN105119682B (zh) WDM‑EPON中基于用户等级协议和QoS的动态波长带宽分配方法
Arokkiam et al. Refining the GIANT dynamic bandwidth allocation mechanism for XG-PON
CN111464890B (zh) 一种网络切片的动态带宽分配方法及olt
CN1953353B (zh) 基于吉比特无源光网络中多等级服务的动态带宽分配方法
KR100666989B1 (ko) Ｅｐｏｎ 시스템 및 ｅｐｏｎ 시스템의 트래픽 스케줄링방법
CN102055652A (zh) 动态带宽分配方法及装置
WO2011020516A1 (fr) Allocation de largeur de bande
JP2015033051A (ja) 動的帯域割当方法、局側装置、コンピュータプログラム及びｐｏｎシステム
Lu et al. Fine-granularity bandwidth allocation for diverse low-latency services in higher-speed passive optical networks
Kantarci et al. Periodic GATE optimization (PGO): A new service scheme for long-reach passive optical networks
Hwang et al. Polling cycle time analysis for waited-based DBA in GPONs
JP2002330147A (ja) 光加入者線端局装置及びａｐｏｎシステム及びセル遅延ゆらぎ抑制方法
CN113873361A (zh) 用于onu的上行业务传输能力的配置方法和光线路终端
Sang et al. Cluster-Based Fluctuation Counterbalance Enabled Deterministic Resource Scheduling for Industrial Passive Optical Networks
Yang et al. QoS provisioning in the EPON systems with traffic-class burst-polling based delta DBA
Liu et al. An ONUs Requesting based Full-Range Dynamic Bandwidth Allocation for OFDMA-PON With SLA and CoS
Miyoshi et al. D-CRED: Efficient Dynamic Bandwidth Allocation Algorithm in Ethernet Passive Optical Networks

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

17P Request for examination filed

Effective date: 20120315

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 SE SI SK SM TR

DAX Request for extension of the european patent (deleted)
REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602010010857

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012560000

Ipc: H04L0012000000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: H04Q 11/00 20060101ALI20130102BHEP

Ipc: H04L 12/00 20060101AFI20130102BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20130404

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO 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: 635928

Country of ref document: AT

Kind code of ref document: T

Effective date: 20131015

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602010010857

Country of ref document: DE

Effective date: 20131205

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 635928

Country of ref document: AT

Kind code of ref document: T

Effective date: 20131009

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20131009

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

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

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

Ref country code: SE

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

Effective date: 20131009

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

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

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

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

Ref country code: BE

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

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

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

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

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

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

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

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

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

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

Ref country code: PT

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

Effective date: 20140210

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602010010857

Country of ref document: DE

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

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

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

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

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

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

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

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

26N No opposition filed

Effective date: 20140710

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

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602010010857

Country of ref document: DE

Effective date: 20140710

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

Ref country code: LU

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

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

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

Effective date: 20140831

Ref country code: CH

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

Effective date: 20140831

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 6

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

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20150817

Year of fee payment: 6

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

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

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

Ref country code: MT

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

Effective date: 20131009

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

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

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

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

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20170428

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

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

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

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20210827

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20220629

Year of fee payment: 13

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

Effective date: 20220820

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

Ref country code: GB

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

Effective date: 20220820

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602010010857

Country of ref document: DE

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