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

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

Extract from the Register of European Patents

EP About this file: EP2139178

EP2139178 - Method of determining a routing path [Right-click to bookmark this link]
StatusThe application has been refused
Status updated on  15.02.2013
Database last updated on 02.11.2024
Most recent event   Tooltip15.02.2013Refusal of applicationpublished on 20.03.2013  [2013/12]
Applicant(s)For all designated states
Alcatel Lucent
3, avenue Octave Gréard
75007 Paris / FR
[N/P]
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
Schubartstrasse 9
70190 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)Zinsinger, Norbert, et al
Louis Pöhlau Lohrentz
Patentanwälte Partnerschaft mbB
Merianstraße 26
90409 Nürnberg / DE
[N/P]
Former [2010/01]Zinsinger, Norbert, et al
Louis Pöhlau Lohrentz, P.O. Box 30 55
90014 Nürnberg / DE
Application number, filing date08290626.427.06.2008
[2010/01]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report 
No.:EP2139178
Date:30.12.2009
Language:EN
[2009/53]
Search report(s)(Supplementary) European search report - dispatched on:EP10.12.2008
ClassificationIPC:H04L12/56, H04L29/08
[2010/01]
CPC:
H04L67/104 (EP,US); H04L45/00 (EP,US); H04L45/64 (EP,US);
H04L67/1053 (EP,US)
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 Bestimmung eines Routingpfades[2010/01]
English:Method of determining a routing path[2010/01]
French:Procédé de détermination d'un chemin de routage[2010/01]
Examination procedure08.06.2009Amendment by applicant (claims and/or description)
10.06.2009Examination requested  [2009/53]
15.09.2009Despatch of a communication from the examining division (Time limit: M06)
02.02.2010Reply to a communication from the examining division
06.08.2010Despatch of a communication from the examining division (Time limit: M06)
23.12.2010Reply to a communication from the examining division
24.11.2011Despatch of a communication from the examining division (Time limit: M04)
22.03.2012Reply to a communication from the examining division
09.10.2012Cancellation of oral proceeding that was planned for 17.10.2012
17.10.2012Date of oral proceedings (cancelled)
05.11.2012Despatch of communication that the application is refused, reason: substantive examination [2013/12]
15.11.2012Application refused, date of legal effect [2013/12]
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  15.09.2009
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.
Documents cited:Search[X]WO2007034313  (FUHRMANN THOMAS FRIEDRICH THEO [DE], et al) [X] 1-10 * page 14, line 27 - page 16, line 25 * * page 56, line 36 - page 57, line 24 * * page 58, line 7 - line 9 * * page 62, line 21 - page 63, line 19 *;
 [XY]  - WANXIA XIE ET AL, "Optimizing Peer Virtualization and Load Balancing", DATABASE SYSTEMS FOR ADVANCED APPLICATIONS LECTURE NOTES IN COMPUTER SCIENCE;;LNCS, SPRINGER, BERLIN, DE, (20060101), vol. 3882, ISBN 978-3-540-33337-1, pages 357 - 373, XP019030008 [X] 1-3,9,10 * Sections 1, 3, 3.1, 4.1 * [Y] 4-8

DOI:   http://dx.doi.org/10.1007/11733836_26
 [XY]  - HANCONG DUAN ET AL, "Proximity Neighbor Selection in Structured P2P Network", COMPUTER AND INFORMATION TECHNOLOGY, 2006. CIT '06. THE SIXTH IEE E INTERNATIONAL CONFERENCE ON, IEEE, PI, (20060901), ISBN 978-0-7695-2687-4, pages 52 - 52, XP031021668 [X] 1-3,9,10 * Sections 1, 3, 3.1, 3.2 * [Y] 4-8
 [X]  - ZHIYONG XU ET AL, "HIERAS: a DHT based hierarchical P2P routing algorithm", PARALLEL PROCESSING, 2003. PROCEEDINGS. 2003 INTERNATIONAL CONFERENCE ON 6-9 OCT. 2003, PISCATAWAY, NJ, USA,IEEE, (20031006), ISBN 978-0-7695-2017-9, pages 187 - 194, XP010664168 [X] 1-3,8-10 * Sections 1, 2.1, 2.2, 3.1, 3.2 *

DOI:   http://dx.doi.org/10.1109/ICPP.2003.1240580
 [X]  - YI JIANG ET AL, "A Low Latency Chord Routing Algorithm for DHT", PERVASIVE COMPUTING AND APPLICATIONS, 2006 1ST INTERNATIONAL SYMPOSIUM ON, IEEE, PI, (20060801), ISBN 978-1-4244-0325-7, pages 825 - 830, XP031014545 [X] 1-3,8-10 * figure 3 * * Sections 1, 3.1, 3.2, 4.1, 4.3 *
 [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-3,8-10 * the whole document *
by applicant   - "Optimizing Peer Virtualization and Load Balancing", WANXIA XIE ET AL., DATABASE SYSTEMS FOR ADVANCED APPLICATIONS LECTURE NOTES IN COMPUTER SCIENCE, SPRINGER, (20060101), vol. 3882, pages 357 - 373
    - HANCONG DUAN ET AL., "Proximity Neighbor Selection in Structured P2P Network", THE SIXTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, (20060901), pages 52 - 52, XP031021668
    - ION STOICA ET AL., "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications", IEEE / ACM TRANSACTIONS ON NETWORKING, (20030201), vol. 11, no. 1, XP011077215
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.