blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability
Register Forum

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
FAQ - Register Alert
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP2139205

EP2139205 - Method of redundant data storage [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  06.09.2013
Database last updated on 26.07.2024
Most recent event   Tooltip17.07.2015Lapse of the patent in a contracting state
New state(s): HU, LU		published on 19.08.2015  [2015/34]
Applicant(s)For all designated states
Alcatel Lucent
3, avenue Octave Gréard
75007 Paris / FR
[2012/44]
Former [2012/08]For all designated states
Alcatel Lucent
3 avenue Octave Gréard
75007 Paris / FR
Former [2010/01]For all designated states
Alcatel Lucent
54, rue la Boétie
75008 Paris / FR
Inventor(s)01 / Schwan, Nico, Dipl.-Informatiker
Reinburgstrasse 163
70197 Stuttgart / DE
02 / Strauss, Thomas, Dipl.-Ing. (BA)
Jurastrasse 61
73734 Esslingen / DE
03 / Tomsu, Marco, Dipl.-Ing.
Adalbert-Stifter-Strasse 12
71254 Ditzingen / DE
 [2010/01]
Representative(s)Wetzel, Emmanuelle
Alcatel-Lucent
Intellectual Property Business Group
70430 Stuttgart / DE
[N/P]
Former [2012/35]Wetzel, Emmanuelle
Alcatel Lucent Intellectual Property & Standards
70430 Stuttgart / DE
Former [2010/01]Zinsinger, Norbert, et al
Louis Pöhlau Lohrentz, P.O. Box 30 55
90014 Nürnberg / DE
Application number, filing date08290624.927.06.2008
[2010/01]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report 
No.:EP2139205
Date:30.12.2009
Language:EN
[2009/53]
Type: B1 Patent specification 
No.:EP2139205
Date:31.10.2012
Language:EN
[2012/44]
Search report(s)(Supplementary) European search report - dispatched on:EP12.12.2008
ClassificationIPC:G06F11/20, H04L29/14, H04L29/08
[2012/23]
CPC:
H04L67/104 (EP,US); G06F11/2094 (EP,US); H04L67/1046 (EP,US);
H04L67/1048 (EP,US); H04L67/1065 (EP,US); H04L67/1095 (EP,US);
H04L69/40 (EP,US) (-)
Former IPC [2010/01]H04L29/14, H04L29/08
Designated contracting statesAT,   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 [2010/01]
TitleGerman:Verfahren zur redundanten Datenspeicherung[2010/01]
English:Method of redundant data storage[2010/01]
French:Procédé de stockage de données redondant[2010/01]
Examination procedure30.04.2009Examination requested  [2009/53]
27.05.2009Despatch of a communication from the examining division (Time limit: M04)
03.06.2009Reply to a communication from the examining division
15.09.2009Despatch of a communication from the examining division (Time limit: M06)
03.02.2010Reply to a communication from the examining division
06.08.2010Despatch of a communication from the examining division (Time limit: M04)
09.12.2010Reply to a communication from the examining division
15.12.2011Despatch of a communication from the examining division (Time limit: M02)
22.02.2012Reply to a communication from the examining division
23.03.2012Despatch of a communication from the examining division (Time limit: M02)
24.04.2012Reply to a communication from the examining division
12.06.2012Communication of intention to grant the patent
21.09.2012Fee for grant paid
21.09.2012Fee for publishing/printing paid
Divisional application(s)The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  27.05.2009
Opposition(s)01.08.2013No opposition filed within time limit [2013/41]
Fees paidRenewal fee
29.06.2010Renewal fee patent year 03
22.06.2011Renewal fee patent year 04
31.03.2012Renewal fee patent year 05
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU27.06.2008
AT31.10.2012
BE31.10.2012
CY31.10.2012
CZ31.10.2012
DK31.10.2012
EE31.10.2012
FI31.10.2012
HR31.10.2012
IT31.10.2012
LT31.10.2012
LV31.10.2012
MC31.10.2012
MT31.10.2012
NL31.10.2012
PL31.10.2012
RO31.10.2012
SE31.10.2012
SI31.10.2012
SK31.10.2012
TR31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
IE27.06.2013
LU27.06.2013
CH30.06.2013
LI30.06.2013
[2015/34]
Former [2015/32]AT31.10.2012
BE31.10.2012
CY31.10.2012
CZ31.10.2012
DK31.10.2012
EE31.10.2012
FI31.10.2012
HR31.10.2012
IT31.10.2012
LT31.10.2012
LV31.10.2012
MC31.10.2012
MT31.10.2012
NL31.10.2012
PL31.10.2012
RO31.10.2012
SE31.10.2012
SI31.10.2012
SK31.10.2012
TR31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
IE27.06.2013
CH30.06.2013
LI30.06.2013
Former [2015/13]AT31.10.2012
BE31.10.2012
CY31.10.2012
CZ31.10.2012
DK31.10.2012
EE31.10.2012
FI31.10.2012
HR31.10.2012
IT31.10.2012
LT31.10.2012
LV31.10.2012
MC31.10.2012
MT31.10.2012
NL31.10.2012
PL31.10.2012
RO31.10.2012
SE31.10.2012
SI31.10.2012
SK31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
IE27.06.2013
CH30.06.2013
LI30.06.2013
Former [2014/20]AT31.10.2012
BE31.10.2012
CY31.10.2012
CZ31.10.2012
DK31.10.2012
EE31.10.2012
FI31.10.2012
HR31.10.2012
IT31.10.2012
LT31.10.2012
LV31.10.2012
MC31.10.2012
NL31.10.2012
PL31.10.2012
RO31.10.2012
SE31.10.2012
SI31.10.2012
SK31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
IE27.06.2013
CH30.06.2013
LI30.06.2013
Former [2014/08]AT31.10.2012
BE31.10.2012
CY31.10.2012
CZ31.10.2012
DK31.10.2012
EE31.10.2012
FI31.10.2012
HR31.10.2012
IT31.10.2012
LT31.10.2012
LV31.10.2012
MC31.10.2012
NL31.10.2012
PL31.10.2012
RO31.10.2012
SE31.10.2012
SI31.10.2012
SK31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
Former [2013/37]AT31.10.2012
BE31.10.2012
CY31.10.2012
CZ31.10.2012
DK31.10.2012
EE31.10.2012
FI31.10.2012
HR31.10.2012
IT31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
RO31.10.2012
SE31.10.2012
SI31.10.2012
SK31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
Former [2013/35]AT31.10.2012
BE31.10.2012
CY31.10.2012
CZ31.10.2012
DK31.10.2012
EE31.10.2012
FI31.10.2012
HR31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
SE31.10.2012
SI31.10.2012
SK31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
Former [2013/34]AT31.10.2012
BE31.10.2012
CY31.10.2012
DK31.10.2012
FI31.10.2012
HR31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
SE31.10.2012
SI31.10.2012
BG31.01.2013
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
Former [2013/31]AT31.10.2012
BE31.10.2012
CY31.10.2012
FI31.10.2012
HR31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
SE31.10.2012
SI31.10.2012
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
Former [2013/28]BE31.10.2012
CY31.10.2012
FI31.10.2012
HR31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
SE31.10.2012
SI31.10.2012
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
PT28.02.2013
Former [2013/26]BE31.10.2012
CY31.10.2012
FI31.10.2012
HR31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
SE31.10.2012
SI31.10.2012
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
Former [2013/24]BE31.10.2012
CY31.10.2012
FI31.10.2012
HR31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
SE31.10.2012
NO31.01.2013
GR01.02.2013
ES11.02.2013
IS28.02.2013
Former [2013/23]CY31.10.2012
FI31.10.2012
HR31.10.2012
LT31.10.2012
LV31.10.2012
NL31.10.2012
PL31.10.2012
SE31.10.2012
NO31.01.2013
ES11.02.2013
IS28.02.2013
Former [2013/22]FI31.10.2012
LT31.10.2012
NL31.10.2012
SE31.10.2012
NO31.01.2013
ES11.02.2013
IS28.02.2013
Former [2013/21]LT31.10.2012
SE31.10.2012
NO31.01.2013
Former [2013/20]LT31.10.2012
NO31.01.2013
Documents cited:Search[XY]  - KRISTIAN WAAGAN, "Building a Replicated Data Store using Berkeley DB and the Chord DHT", UNDERGRADUATE THESIS, (20050822), pages I - 91, URL: http://www.diva-portal.org/ntnu/abstract.xsql?dbid=624, (20081011), XP002504247 [X] 1,2,4,9-11 * figure 6.1b * * Chapters 5.2.3, 5.3.1, 6.5, 7.1 / page 67 * [Y] 3,5-8
 [Y]  - STEFAN ZOELS, ZORAN DESPOTOVIC, WOLFGANG KELLERER, "Load balancing in a Hierarchical DHT-based P2P System", INTERNATIONAL CONFERENCE ON COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING, 2007. COLLABORATECOM 2007., ISBN 978-1-4244-1318-8, (20071112), pages 353 - 361, URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4553855, (20081112), XP002503697 [Y] 3 * Section III B *
 [YA]  - GISIK KWON ET AL, "BYPASS: topology-aware lookup overlay for dht-based P2P file locating services", PARALLEL AND DISTRIBUTED SYSTEMS, 2004. ICPADS 2004. PROCEEDINGS. TENT H INTERNATIONAL CONFERENCE ON NEWPORT BEACH, CA, USA 7-9 JULY 2004, PISCATAWAY, NJ, USA,IEEE, ISBN 978-0-7695-2152-7, (20040707), pages 297 - 304, XP010710896 [Y] 5-8 * Sections 2.1, 3.2, 5 * [A] 1,10,11

DOI:   http://dx.doi.org/10.1109/ICPADS.2004.1316108
 [A]  - ION STOICA ET AL, "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications", IEEE / ACM TRANSACTIONS ON NETWORKING, IEEE / ACM, NEW YORK, NY, US, (20030201), vol. 11, no. 1, ISSN 1063-6692, XP011077215 [A] 1-11 * the whole document *
 [A]  - RIECHE S ET AL, "A thermal-dissipation-based approach for balancing data load in distributed hash tables", COMPUTATIONAL SYSTEMS BIOINFORMATICS CONFERENCE, 2004. CSB 2004. PROCE EDINGS. 2004 IEEE TAMPA, FL, USA 16-18 NOV. 2004, LOS ALAMITOS, CA, USA,IEEE (COMPUT. SOC, US, (20041116), ISBN 978-0-7695-2260-9, pages 15 - 23, XP010753053 [A] 1,2,8-11 * Section 2.1.1 *

DOI:   http://dx.doi.org/10.1109/LCN.2004.10
Examination   - SALTER JAMES ET AL, "ROME: Optimising DHT_based Peer-to-Peer Networks", (20050417), pages 81 - 88, PROCEEDINGS OF THE FIFTH INTERNATIONAL NETWORK CONFERENCE (INC 2005), SAMOS ISLAND, GREECE, URL: http://www.jamessalter.me.uk/personal/publications/pdf/inc2005FINAL.pdf, (20050705), XP000863947
by applicant   - KRISTIAN WAAGAN, "Building a Replicated Data Store using Berkeley DB and the Chord DHT", UNDERGRADUATED THESIS, (20050822), pages 1 - 91
    - ION STOICA ET AL., "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications", IEEE / ACM TRANSACTIONS ON NETWORKING; IEEE / ACM; NEW YORK, (20030201), vol. 11, no. 1, XP011077215
    - SALTER; JAMES; ANTONOPOULOS; NICK, "ROME: Optimising DHT-based Peer-to-Peer Networks", PROCEEDINGS OF THE FIFTH INTERNATIONAL NETWORK CONFERENCE, (20050705), pages 81 - 88
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.