EP2139205B1 - Procédé de stockage de données redondant - Google Patents

Procédé de stockage de données redondant Download PDF

Info

Publication number
EP2139205B1
EP2139205B1 EP08290624A EP08290624A EP2139205B1 EP 2139205 B1 EP2139205 B1 EP 2139205B1 EP 08290624 A EP08290624 A EP 08290624A EP 08290624 A EP08290624 A EP 08290624A EP 2139205 B1 EP2139205 B1 EP 2139205B1
Authority
EP
European Patent Office
Prior art keywords
node
peer
physical hardware
nodes
runs
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.)
Active
Application number
EP08290624A
Other languages
German (de)
English (en)
Other versions
EP2139205A1 (fr
Inventor
Nico Dipl.-Informatiker Schwan
Thomas Dipl.-Ing. Strauss (BA)
Marco Dipl.-Ing. Tomsu
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.)
Alcatel Lucent SAS
Original Assignee
Alcatel Lucent SAS
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 Alcatel Lucent SAS filed Critical Alcatel Lucent SAS
Priority to EP08290624A priority Critical patent/EP2139205B1/fr
Priority to PCT/EP2009/057043 priority patent/WO2009156263A1/fr
Priority to US12/457,367 priority patent/US8126849B2/en
Priority to CN2009101491955A priority patent/CN101616184B/zh
Publication of EP2139205A1 publication Critical patent/EP2139205A1/fr
Application granted granted Critical
Publication of EP2139205B1 publication Critical patent/EP2139205B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
    • G06F11/2053—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
    • G06F11/2094—Redundant storage or storage space
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1046—Joining mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1048—Departure or maintenance mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] 
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Quality & Reliability (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer And Data Communications (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Claims (7)

  1. Procédé de stockage de données redondantes dans un superposé poste à poste (N) présentant une structure de topologie DUT en anneau, le réseau superposé poste à poste (N) comprenant une pluralité de noeuds (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240), le procédé comprenant les suivantes :
    identifier un matériel physique sur lequel un premier noeud (211) parmi ladite pluralité de noeuds (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) est exécuté ;
    déterminer au moins un deuxième noeud (240) parmi ladite pluralité de noeuds (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) qui est exécuté sur un matériel physique différent de celui du premier noeud (211) ; et
    stocker une réplique (203) de données dont le premier noeud (211) est responsable sur l'au moins un deuxième noeud (240) en plus ou au lieu de stocker une réplique (203) des données sur un noeud logique suivant (223) du premier noeud, dans lequel ledit noeud logique suivant (223) est un noeud parmi la pluralité de noeuds (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) voisin du premier noeud (211) par apport à la structure de topologie DHT en anneau du réseau superposé poste à poste (N), dans lequel le deuxième noeud (240) est déterminé comme étant le noeud logique suivant après le premier noeud (211) par apport à la structure de topologie DUT en anneau qui est exécuté sur un matériel physique différent de celui du premier noeud (211),
  2. Procédé selon la revendication 1,
    caractérisé en ce que
    le procédé comprend l'étape suivante :
    identifier ledit matériel physique sur lequel le premier noeud (211) est exécuté et/ou déterminer ledit au moins un deuxième noeud (240) en récupérant des informations à partir d'une plate-forme du premier noeud (211) et/ou dudit au moins un deuxième noeud (240), respectivement.
  3. Procédé selon la revendication 1,
    caractérisé en ce que
    le procédé comprend l'étape suivante :
    identifier ledit matériel physique sur lequel le premier noeud (211) est exécuté et/ou déterminer ledit au moins un deuxième noeud (240) en récupérant des informations à partir d'une unité de gestion externe reliée au premier noeud (211) et/ou audit au moins un deuxième noeud (240), respectivement.
  4. Procédé selon la revendication 1,
    caractérisé en ce que
    le procédé comprend l'étape suivante :
    identifier ledit matériel physique sur lequel le premier noeud (211) est exécuté et/ou déterminer ledit au moins un deuxième noeud (240) au moyen de la récupération d'informations correspondantes à partir d'un opérateur de réseau du réseau poste à poste (N) et/ou d'un utilisateur du premier noeud (211) et/ou d'un utilisateur de l'au moins un deuxième noeud (240), respectivement.
  5. Procédé selon la revendication 1,
    caractérisé en ce que
    le procédé comprend l'étape suivante :
    identifier ledit matériel physique sur lequel le premier noeud (211) est exécuté et/ou déterminer ledit au moins un deuxième noeud (240) au moyen d'une mesure de latence sur une couche d'application du réseau superposé poste à poste (N).
  6. Procédé selon la revendication 1,
    caractérisé en ce que
    le procédé comprend en outre les suivantes :
    inclure, au moyen du premier noeud (211), une description du matériel physique sur lequel le premier noeud (211) est exécuté dans un message poste à poste envoyé du premier noeud (211) vers le noeud logique suivant (223) du premier noeud (211), le noeud logique suivant (223) stockant une réplique (203) des données ;
    vérifier, au moyen du noeud logique suivant (223), si le matériel physique sur lequel le premier noeud (211) est exécuté est le même que le matériel physique sur lequel le noeud logique suivant (223) est exécuté ; et
    si le matériel physique sur lequel le premier noeud (211) est exécuté est le même que le matériel physique sur lequel le noeud logique suivant (223) est exécuté, transférer, au moyen du noeud logique suivant (223), la réplique (203) des données vers l'au moins un deuxième noeud (240).
  7. Produit de programme informatique pour le stockage de données redondantes dans un réseau superposé poste à poste (N) présentant une structure de topologie DHT en anneau, le réseau superposé poste à poste (N) comprenant une pluralité de noeuds (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240), le produit de programme informatique, lorsqu'il est exécuté par un noeud parmi ladite pluralité de noeuds (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240), exécutant les étapes suivantes :
    identifier un matériel physique sur lequel un premier noeud (211) parmi ladite pluralité de noeuds (0, 20, 50, 87, 112, 140. 179, 200, 211, 223, 240) est exécuté ,
    déterminer au moins un deuxième noeud (240) parmi ladite pluralité de noeuds (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) qui est exécuté sur un matériel physique différent de celui du premier noeud (211) : et
    initier un stockage d'une réplique (203) de données dont le premier noeud (211) est responsable sur l'au moins un deuxième noeud (240) en plus ou au lieu de stocker une réplique (203) des données sur un noeud logique suivant (223) du premier noeud, dans lequel ledit noeud logique suivant (223) est un noeud parmi la pluralité de noeuds (0, 20, 50, 87. 112. 140, 179, 200, 211, 223, 240) voisin du premier noeud (211) par rapport à la structure de topologie DHT en anneau du réseau superposé poste à poste (N), dans lequel le deuxième noeud (240) est détermine comme étant le noeud logique suivant après le premier noeud (211) par rapport à la structure de topologie DHT en anneau qui est exécuté sur un matériel physique différent de celui du premier noeud (211).
EP08290624A 2008-06-27 2008-06-27 Procédé de stockage de données redondant Active EP2139205B1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP08290624A EP2139205B1 (fr) 2008-06-27 2008-06-27 Procédé de stockage de données redondant
PCT/EP2009/057043 WO2009156263A1 (fr) 2008-06-27 2009-06-08 Procédé de stockage de données redondantes
US12/457,367 US8126849B2 (en) 2008-06-27 2009-06-09 Method of redundant data storage
CN2009101491955A CN101616184B (zh) 2008-06-27 2009-06-26 冗余数据存储方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP08290624A EP2139205B1 (fr) 2008-06-27 2008-06-27 Procédé de stockage de données redondant

Publications (2)

Publication Number Publication Date
EP2139205A1 EP2139205A1 (fr) 2009-12-30
EP2139205B1 true EP2139205B1 (fr) 2012-10-31

Family

ID=39884330

Family Applications (1)

Application Number Title Priority Date Filing Date
EP08290624A Active EP2139205B1 (fr) 2008-06-27 2008-06-27 Procédé de stockage de données redondant

Country Status (4)

Country Link
US (1) US8126849B2 (fr)
EP (1) EP2139205B1 (fr)
CN (1) CN101616184B (fr)
WO (1) WO2009156263A1 (fr)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5442841B2 (ja) * 2009-03-23 2014-03-12 テレフオンアクチーボラゲット エル エム エリクソン（パブル） ピア・ツー・ピア・ネットワークにおけるイベント識別
CN101895482A (zh) * 2009-05-18 2010-11-24 华为技术有限公司 对点到点技术网络的逻辑拓扑信息进行抽象的方法和装置
US8326798B1 (en) * 2009-09-14 2012-12-04 Network Appliance, Inc. File system agnostic replication
US8874505B2 (en) * 2011-01-11 2014-10-28 Hitachi, Ltd. Data replication and failure recovery method for distributed key-value store
US8782364B2 (en) 2011-12-13 2014-07-15 Hewlett-Packard Development Company, L.P. Determining availability of data elements in a storage system
CN102868682B (zh) * 2012-08-21 2015-02-25 北京邮电大学 一种流媒体资源共享的方法和装置
US9680659B2 (en) * 2012-08-27 2017-06-13 Ricoh Company, Ltd. Obtaining, managing and archiving conference data
CN103034739A (zh) * 2012-12-29 2013-04-10 天津南大通用数据技术有限公司 一种分布式存储系统及其更新和查询方法
US10075519B2 (en) * 2013-01-10 2018-09-11 Telefonaktiebolaget Lm Ericsson (Publ) Connection mechanism for energy-efficient peer-to-peer networks
US9210219B2 (en) 2013-07-15 2015-12-08 Red Hat, Inc. Systems and methods for consistent hashing using multiple hash rings
US10303567B2 (en) * 2013-08-15 2019-05-28 Entit Software Llc Managing database nodes
CN105659213B (zh) * 2013-10-18 2018-12-14 株式会社日立制作所 无共享分布式存储系统中的目标驱动独立数据完整性和冗余恢复
CN103810061B (zh) * 2014-01-28 2017-05-31 河南科技大学 一种高可用云存储方法
US10412158B2 (en) * 2016-07-27 2019-09-10 Salesforce.Com, Inc. Dynamic allocation of stateful nodes for healing and load balancing
US10698780B2 (en) * 2016-08-05 2020-06-30 Nutanix, Inc. Implementing availability domain aware replication policies
JP7074018B2 (ja) * 2018-10-22 2022-05-24 日本電信電話株式会社 分散処理システムおよび分散処理方法
JP7149313B2 (ja) * 2020-09-28 2022-10-06 株式会社日立製作所 記憶システム及びその制御方法

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6073209A (en) * 1997-03-31 2000-06-06 Ark Research Corporation Data storage controller providing multiple hosts with access to multiple storage subsystems
GB0002972D0 (en) * 2000-02-09 2000-03-29 Orange Personal Comm Serv Ltd Data handling system
US20020083163A1 (en) * 2000-10-26 2002-06-27 Metilinx Multi-platform optimization model
US6771666B2 (en) * 2002-03-15 2004-08-03 Meshnetworks, Inc. System and method for trans-medium address resolution on an ad-hoc network with at least one highly disconnected medium having multiple access points to other media
US6937602B2 (en) * 2001-10-23 2005-08-30 Meshnetworks, Inc. System and method for providing a congestion optimized address resolution protocol for wireless ad-hoc networks
US6928476B2 (en) * 2002-08-23 2005-08-09 Mirra, Inc. Peer to peer remote data storage and collaboration
US8005918B2 (en) * 2002-11-12 2011-08-23 Rateze Remote Mgmt. L.L.C. Data storage devices having IP capable partitions
US20050108276A1 (en) * 2003-11-13 2005-05-19 Ramani Sriram Methods and system for dynamic database content persistence and information management
US7904913B2 (en) * 2004-11-02 2011-03-08 Bakbone Software, Inc. Management interface for a system that provides automated, real-time, continuous data protection
US20080130516A1 (en) * 2004-12-21 2008-06-05 Electronics And Telecommunications Research Institute P2p Overplay Network Construction Method and Apparatus
CN1328879C (zh) * 2005-01-26 2007-07-25 北京大学 基于数据分块冗余和虚拟化存储的在线备份方法
US8365301B2 (en) * 2005-02-22 2013-01-29 Microsoft Corporation Peer-to-peer network communication
US20060190715A1 (en) * 2005-02-22 2006-08-24 Microsoft Corporation Peer-to-peer network information retrieval
US7849303B2 (en) * 2005-02-22 2010-12-07 Microsoft Corporation Peer-to-peer network information storage
US7656810B2 (en) * 2005-03-25 2010-02-02 Microsoft Corporation System and method for monitoring and reacting to peer-to-peer network metrics
ATE463917T1 (de) * 2006-02-21 2010-04-15 Microsoft Corp Topologieverwaltung in peer-to-peer datenverteilungswolken
US9047310B2 (en) * 2006-02-22 2015-06-02 Microsoft Technology Licensing, Llc Reliable, efficient peer-to-peer storage
US20070230468A1 (en) * 2006-03-31 2007-10-04 Matsushita Electric Industrial Co., Ltd. Method to support mobile devices in a peer-to-peer network
DE102006024982A1 (de) 2006-05-29 2007-12-13 Nokia Siemens Networks Gmbh & Co.Kg Peer-to-Peer-Kommunikationseinrichtung, Verfahren zum Bilden einer Peer-to-Peer-Identifikationsangabe und Verfahren zum Betreiben eines Peer-to-Peer-Kommunikationsnetzwerks
US8041942B2 (en) * 2006-09-05 2011-10-18 Panasonic Corporation Robust peer-to-peer networks and methods of use thereof
CN101170572A (zh) * 2006-10-23 2008-04-30 日电（中国）有限公司 基于p2p sip技术实现的多媒体网络通信系统
US20080147821A1 (en) * 2006-12-19 2008-06-19 Dietrich Bradley W Managed peer-to-peer content backup service system and method using dynamic content dispersal to plural storage nodes
US8090792B2 (en) * 2007-03-08 2012-01-03 Nec Laboratories America, Inc. Method and system for a self managing and scalable grid storage
US8762664B2 (en) * 2007-08-30 2014-06-24 Red Hat, Inc. Replicating cache nodes in a cluster

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SALTER JAMES ET AL: "ROME: Optimising DHT_based Peer-to-Peer Networks", 17 April 2005 (2005-04-17), pages 81 - 88, XP000863947, Retrieved from the Internet <URL:http://www.jamessalter.me.uk/personal/publications/pdf/inc2005FINAL.pdf> [retrieved on 20050705] *

Also Published As

Publication number Publication date
US20090327364A1 (en) 2009-12-31
US8126849B2 (en) 2012-02-28
CN101616184A (zh) 2009-12-30
EP2139205A1 (fr) 2009-12-30
CN101616184B (zh) 2013-08-28
WO2009156263A1 (fr) 2009-12-30

Similar Documents

Publication Publication Date Title
EP2139205B1 (fr) Procédé de stockage de données redondant
EP2139202B1 (fr) Procédé de fourniture d&#39;une liste de successeurs
Lua et al. A survey and comparison of peer-to-peer overlay network schemes
Wang et al. Peer-to-peer overlay networks: A survey
Pourebrahimi et al. A survey of peer-to-peer networks
US20110010578A1 (en) Consistent and fault tolerant distributed hash table (dht) overlay network
Locher et al. eQuus: A provably robust and locality-aware peer-to-peer system
US20090323700A1 (en) Method of determining a routing path
Zöls et al. On hierarchical DHT systems–An analytical approach for optimal designs
Bertier et al. D2HT: the best of both worlds, Integrating RPS and DHT
Zhang et al. PeerCast: Churn-resilient end system multicast on heterogeneous overlay networks
Janson et al. A self-stabilizing locality-aware peer-to-peer network combining random networks, search trees, and dhts
Lua et al. ASurvey AND COMPARISON OF PEER-TO-PEER OVERLAY NETWORK SCHEMES
Merz et al. Fault-tolerant resource discovery in peer-to-peer grids
Chan et al. Malugo: A peer-to-peer storage system
Sacha et al. A service-oriented peer-to-peer architecture for a digital ecosystem
Antonopoulos et al. A Multi-Ring Method for Efficient Multi-Dimensional Data Lookup in P2P Networks.
Lu et al. A scalable P2P overlay based on arrangement graph with minimized overhead
Salter et al. ROME: Optimising DHT-based peer-to-peer networks
Lu et al. Design and analysis of arrangement graph-based overlay systems for information sharing
Rout et al. A centralized server based cluster integrated protocol in hybrid p2p systems
Dobre et al. DistHash: A robust P2P DHT-based system for replicated objects
Shafaat et al. Dealing with bootstrapping, maintenance, and network partitions and mergers in structured overlay networks
Chang et al. A distributed P2P network based on increasing reliability and scalability for internet applications
Aung et al. A Framework for supporting consistent lookup in Distributed Hash Table

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA MK RS

AKX Designation fees paid

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

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

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0029140000

Ipc: G06F0011200000

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 29/14 20060101ALI20120427BHEP

Ipc: H04L 29/08 20060101ALI20120427BHEP

Ipc: G06F 11/20 20060101AFI20120427BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

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): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 582347

Country of ref document: AT

Kind code of ref document: T

Effective date: 20121115

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

Country of ref document: DE

Effective date: 20121227

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 582347

Country of ref document: AT

Kind code of ref document: T

Effective date: 20121031

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20121031

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

26N No opposition filed

Effective date: 20130801

REG Reference to a national code

Ref country code: FR

Ref legal event code: GC

Effective date: 20131018

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602008019752

Country of ref document: DE

Effective date: 20130801

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

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

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

Ref country code: CH

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

Effective date: 20130630

Ref country code: IE

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

Effective date: 20130627

Ref country code: LI

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

Effective date: 20130630

REG Reference to a national code

Ref country code: FR

Ref legal event code: RG

Effective date: 20141016

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

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 8

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

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

Ref country code: LU

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

Effective date: 20130627

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

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

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

Ref country code: FR

Payment date: 20230510

Year of fee payment: 16

Ref country code: DE

Payment date: 20230502

Year of fee payment: 16

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

Ref country code: GB

Payment date: 20230504

Year of fee payment: 16