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

EP1813081 - METHOD AND DEVICE FOR SCHEDULING PACKETS FOR ROUTING IN A NETWORK WITH IMPLICIT DETERMINATION OF PACKETS TO BE TREATED AS A PRIORITY [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  13.11.2015
Database last updated on 02.09.2024
Most recent event   Tooltip20.07.2018Lapse of the patent in a contracting state
New state(s): PT		published on 22.08.2018  [2018/34]
Applicant(s)For all designated states
Orange
78, rue Olivier de Serres
75015 Paris / FR
[2013/39]
Former [2009/17]For all designated states
FRANCE TELECOM
6 Place d'Alleray
75015 Paris / FR
Former [2007/31]For all designated states
France Telecom S.A.
6, Place d'Alleray
75015 Paris / FR
Inventor(s)01 / ROBERTS, James
3 Rue Emeraude
F-78960 Voisins le Bretonneux / FR
02 / OUESLATI, Sara
31 Rue de Fontenay
F-92320 Chatillon / FR
03 / KORTEBI, Abdesselem
2 Avenue Lulli
F-92310 SEVRES / FR
 [2007/31]
Representative(s)Delumeau, François Guy, et al
Cabinet Beau de Loménie
158, rue de l'Université
75340 Paris Cedex 07 / FR
[N/P]
Former [2015/02]Delumeau, François Guy, et al
Cabinet Beau de Loménie 158, rue de l'Université
75340 Paris Cedex 07 / FR
Former [2007/31]Delumeau, François Guy, et al
Cabinet Beau de Loménie 158 Rue de l'Université
75340 Paris Cedex 07 / FR
Application number, filing date05819159.415.11.2005
[2007/31]
WO2005FR50949
Priority number, dateFR2004001206315.11.2004         Original published format: FR 0412063
[2007/31]
Filing languageFR
Procedural languageFR
PublicationType: A1 Application with search report
No.:WO2006051244
Date:18.05.2006
Language:FR
[2006/20]
Type: A1 Application with search report 
No.:EP1813081
Date:01.08.2007
Language:FR
The application published by WIPO in one of the EPO official languages on 18.05.2006 takes the place of the publication of the European patent application.
[2007/31]
Type: B1 Patent specification 
No.:EP1813081
Date:07.01.2015
Language:FR
[2015/02]
Search report(s)International search report - published on:EP18.05.2006
ClassificationIPC:H04L29/06
[2007/31]
CPC:
H04L47/20 (EP,US); H04L47/10 (EP,US); H04L47/11 (EP,US);
H04L47/15 (EP,US); H04L47/2441 (EP,US); H04L47/50 (EP,US);
H04L47/525 (EP,US); H04L47/527 (EP,US); H04L47/621 (EP,US);
H04L47/70 (EP,US); H04L47/822 (EP,US); H04L47/83 (EP,US) (-)
Designated contracting statesAT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   NL,   PL,   PT,   RO,   SE,   SI,   SK,   TR [2007/31]
TitleGerman:VERFAHREN UND VORRICHTUNG ZUR PAKETKOORDINATION ZUM ROUTEN IN EINEM NETZWERK MIT IMPLIZITER BESTIMMUNG VON ALS PRIORITÄT ZU BEHANDELNDEN PAKETEN[2007/31]
English:METHOD AND DEVICE FOR SCHEDULING PACKETS FOR ROUTING IN A NETWORK WITH IMPLICIT DETERMINATION OF PACKETS TO BE TREATED AS A PRIORITY[2007/31]
French:PROCEDE ET DISPOSITIF D'ORDONNANCEMENT DE PAQUETS POUR LEUR ROUTAGE DANS UN RESEAU AVEC DETERMINATION IMPLICITE DES PAQUETS A TRAITER EN PRIORITE[2007/31]
Entry into regional phase10.05.2007National basic fee paid 
10.05.2007Designation fee(s) paid 
10.05.2007Examination fee paid 
Examination procedure10.05.2007Examination requested  [2007/31]
29.09.2008Despatch of a communication from the examining division (Time limit: M06)
12.02.2009Reply to a communication from the examining division
18.11.2009Despatch of a communication from the examining division (Time limit: M04)
22.03.2010Reply to a communication from the examining division
16.02.2011Despatch of a communication from the examining division (Time limit: M06)
27.06.2011Reply to a communication from the examining division
16.11.2012Despatch of a communication from the examining division (Time limit: M04)
21.03.2013Reply to a communication from the examining division
18.06.2014Communication of intention to grant the patent
22.10.2014Fee for grant paid
22.10.2014Fee for publishing/printing paid
22.10.2014Receipt of the translation of the claim(s)
Divisional application(s)EP15150092.3  / EP2940960
The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  29.09.2008
Opposition(s)08.10.2015No opposition filed within time limit [2015/51]
Fees paidRenewal fee
28.11.2007Renewal fee patent year 03
26.03.2008Renewal fee patent year 04
25.11.2009Renewal fee patent year 05
29.11.2010Renewal fee patent year 06
28.11.2011Renewal fee patent year 07
23.11.2012Renewal fee patent year 08
29.11.2013Renewal fee patent year 09
25.11.2014Renewal fee patent year 10
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  TooltipHU15.11.2005
AT07.01.2015
CY07.01.2015
CZ07.01.2015
DK07.01.2015
EE07.01.2015
FI07.01.2015
IT07.01.2015
LT07.01.2015
LV07.01.2015
MC07.01.2015
NL07.01.2015
PT07.01.2015
RO07.01.2015
SE07.01.2015
SI07.01.2015
SK07.01.2015
TR07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
[2018/34]
Former [2017/39]HU15.11.2005
AT07.01.2015
CY07.01.2015
CZ07.01.2015
DK07.01.2015
EE07.01.2015
FI07.01.2015
IT07.01.2015
LT07.01.2015
LV07.01.2015
MC07.01.2015
NL07.01.2015
RO07.01.2015
SE07.01.2015
SI07.01.2015
SK07.01.2015
TR07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
Former [2016/28]AT07.01.2015
CZ07.01.2015
DK07.01.2015
EE07.01.2015
FI07.01.2015
IT07.01.2015
LT07.01.2015
LV07.01.2015
MC07.01.2015
NL07.01.2015
RO07.01.2015
SE07.01.2015
SI07.01.2015
SK07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
Former [2016/12]AT07.01.2015
CZ07.01.2015
DK07.01.2015
EE07.01.2015
FI07.01.2015
IT07.01.2015
LT07.01.2015
LV07.01.2015
NL07.01.2015
RO07.01.2015
SE07.01.2015
SI07.01.2015
SK07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
Former [2016/03]AT07.01.2015
CZ07.01.2015
DK07.01.2015
EE07.01.2015
FI07.01.2015
IT07.01.2015
LT07.01.2015
LV07.01.2015
NL07.01.2015
RO07.01.2015
SE07.01.2015
SK07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
Former [2015/49]AT07.01.2015
CZ07.01.2015
DK07.01.2015
EE07.01.2015
FI07.01.2015
LT07.01.2015
LV07.01.2015
NL07.01.2015
RO07.01.2015
SE07.01.2015
SK07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
Former [2015/39]AT07.01.2015
FI07.01.2015
LT07.01.2015
LV07.01.2015
NL07.01.2015
SE07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
Former [2015/38]AT07.01.2015
FI07.01.2015
LT07.01.2015
SE07.01.2015
BG07.04.2015
GR08.04.2015
IS07.05.2015
Former [2015/37]FI07.01.2015
LT07.01.2015
SE07.01.2015
BG07.04.2015
GR08.04.2015
Former [2015/36]FI07.01.2015
LT07.01.2015
SE07.01.2015
BG07.04.2015
Former [2015/35]LT07.01.2015
Cited inInternational search[X]  - TSAO S-C ET AL, "Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks", COMPUTER NETWORKS, ELSEVIER SCIENCE PUBLISHERS B.V., AMSTERDAM, NL, (200102), vol. 35, no. 2-3, ISSN 1389-1286, pages 287 - 305, XP004304846 [X] 1,4,5,10,11 * paragraph [3.PRE.ORDER.DEFICIT.ROUND.ROBIN]; figure 2 * * paragraph [3.2.ALGORITHM]; figure 3 * * figure 8 *

DOI:   http://dx.doi.org/10.1016/S1389-1286(00)00172-9
 [A]  - KANHERE S S ET AL, "Fair, efficient and low-latency packet scheduling using nested deficit round robin", HIGH PERFORMANCE SWITCHING AND ROUTING, 2001 IEEE WORKSHOP ON 29-31 MAY 2001, PISCATAWAY, NJ, USA,IEEE, (20010529), ISBN 0-7803-6711-1, pages 6 - 10, XP010542761 [A] 1-11 * paragraph [II.DEFICIT.ROUND.ROBIN] * * paragraph [III.NESTED.ROUND.ROBIN]; figures 1,2 *
 [A]  - MACGREGOR M H ET AL, "Deficits for bursty latency-critical flows: DRR++", NETWORKS, 2000. (ICON 2000). PROCEEDINGS. IEEE INTERNATIONAL CONFERENCE ON SEPTEMBER 5-8, 2000, PISCATAWAY, NJ, USA,IEEE, (20000905), ISBN 0-7695-0777-8, pages 287 - 293, XP010514114 [A] 1-11 * paragraph [1.3.DRR.PLUS.PLUS] *
 [A]  - S. BEN FREDJ, S. OUESLATI-BOULAHIA AND J.W. ROBERTS, "Measurement-based Admission Control for Elastic Traffic", ITC17, SALVADOR, BRAZIL, (200112), XP002332468 [A] 1-11 * paragraph [4.MEASUREMENT.BASED.ADMISSION.CONTROL] *
 [DA]  - SHREEDHAR M ET AL, "EFFICIENT FAIR QUEUING USING DEFICIT ROUND-ROBIN", IEEE / ACM TRANSACTIONS ON NETWORKING, IEEE INC. NEW YORK, US, (19960601), vol. 4, no. 3, ISSN 1063-6692, pages 375 - 385, XP000591077 [DA] 1-11 * paragraph [III.DEFICIT.ROUND.ROBIN]; figures 2,3 *

DOI:   http://dx.doi.org/10.1109/90.502236
by applicantFR2854296
    - M. SHREEDHAR; G. VARGHESE, "Efficient fair queuing using Deficit round robin", IEEE/ACM TRANSACTIONS ON NETWORKING, (199606), vol. 4, no. 3, pages 375 - 385
    - TSAO ET AL., Pre-order Déficit Round Robin : a new scheduling algorithm for packet-switched networks, COMPUTER NETWORKS ELSEVIER SCIENCE PUBLISHERS, (20010203), vol. 35
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.