EP1395004A1 - Flushing method with separated sets for type 5 link state advertisement in open shortest path first protocol - Google Patents
Flushing method with separated sets for type 5 link state advertisement in open shortest path first protocol Download PDFInfo
- Publication number
- EP1395004A1 EP1395004A1 EP03253454A EP03253454A EP1395004A1 EP 1395004 A1 EP1395004 A1 EP 1395004A1 EP 03253454 A EP03253454 A EP 03253454A EP 03253454 A EP03253454 A EP 03253454A EP 1395004 A1 EP1395004 A1 EP 1395004A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- lsas
- network
- flushing
- protocol
- lsa
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/03—Topology update or discovery by updating link state protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
Definitions
- the present invention relates to data communications.
- the present invention relates to a flushing method with separated sets for type 5 Link State Advertisement (LSA) in the Open Shortest Path First (OSPF) protocol.
- LSA Link State Advertisement
- OSPF Open Shortest Path First
- OSPF protocol a widely used routing protocol, employs a link-state arithmetic.
- each router tests its link state to each of its neighbors and forms LSAs. Then each router calculates the routing information according to all received LSAs that propagate throughout the autonomous system network.
- type 5 LSA is used to represent external routing.
- the Internet Engineering Task Force (IETF) Request For Comments (RFC) 2328 standard defines that all the LSAs originated by routers are flushed at every interval, say 1,800 seconds, i.e., each new version of every LSA is sent out at the interval. In this instance, a LSA will be regarded by other routers that it has been deleted if it is not flushed within 3,600 seconds.
- a network device After originating a LSA, a network device will send a new version of it after 1,800 seconds, i.e., flush for once.
- This mode has a disadvantage that the flushing processing will occupy a great lot of network bandwidth resources if the number of type 5 LSAs is huge enough. This will decrease the network traffic and impact on the processing of other network devices.
- a network device originates several hundred thousand type 5 LSAs at one time, then all the LSAs will be flushed simultaneously in 1,800 seconds. At the moment, several ten thousand packets appeared in the network. It is very possible that the network cannot be loaded with such intense traffic, then parts of the packets are lost and will be multiply re-transmitted. Moreover, the flushed LSAs will propagate to all network devices in this network, which impacts on other devices. Some network devices, especially those with low processing capabilities, may suffer from block, no response and services interruption etc.
- the method according to the present invention comprises:
- the network device running OSPF protocol can be a router or an Ethernet level 3 exchange.
- the network flushing interval is defined by the IETF RFC 2328.
- the mapping method may include adding 1 to the remainder of the ID value of a LSA divided by S .
- the mapping method may includes:
- the method according to the present invention can effectively reduce the impact of instantaneous traffic on network.
- the traffic is effectively distributed to different instants, and the network always keeps a low level load.
- running the OSPF protocol will not cause out burst of peak traffic on the network. This will avoid the impact on other network devices on the network and it will make for stable and high-efficient operation of all network devices. It is obvious that all the type 5 LSAs are flushed once within every 1,800 seconds after processing of separating sets has been accomplished. This ensures the normal operation of OSPF protocol mechanism.
- the invention is implemented on a router.
- a router originates 10,000 LSAs. Firstly, separate all the LSAs into 251 sets, that is, map the ID values of all LSAs onto the numbers ranging from 1 to 251.
- the mapping method can make use of a modular arithmetic, i.e., adding 1 to the remainder of the ID value of a LSA divided by 251. It is seen that all the LSAs are evenly separated into 251 sets after this step, with the set number as 1, 2, ... 251.
- the invention is implemented on an Ethernet level 3 exchange.
- an Ethernet level 3 exchange originates 100 thousand LSAs.
- separate all the LSAs into 1,000 sets namely, map the ID values of all LSAs onto the numbers ranging from 1 to 1,000.
- the mapping method can use an overlap exclusive-OR, which will be described specifically as follow.
- the method according to the present invention is very efficient and can be applied for various kinds of routers and exchanges.
- the above-mentioned mapping method can employ a modular arithmetic or an overlap exclusive-OR arithmetic. So it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
- Small-Scale Networks (AREA)
- Communication Control (AREA)
Abstract
Description
- The present invention relates to data communications. In particular, the present invention relates to a flushing method with separated sets for type 5 Link State Advertisement (LSA) in the Open Shortest Path First (OSPF) protocol.
- OSPF protocol, a widely used routing protocol, employs a link-state arithmetic. In brief, each router tests its link state to each of its neighbors and forms LSAs. Then each router calculates the routing information according to all received LSAs that propagate throughout the autonomous system network.
- In OSPF protocol, type 5 LSA is used to represent external routing. With the great development of network technology, the number of type 5 LSAs will be exceedingly increased, possibly reaching several hundred thousand. The Internet Engineering Task Force (IETF) Request For Comments (RFC) 2328 standard defines that all the LSAs originated by routers are flushed at every interval, say 1,800 seconds, i.e., each new version of every LSA is sent out at the interval. In this instance, a LSA will be regarded by other routers that it has been deleted if it is not flushed within 3,600 seconds.
- This is a simple fixed interval processing mode. In this mode, after originating a LSA, a network device will send a new version of it after 1,800 seconds, i.e., flush for once. This mode has a disadvantage that the flushing processing will occupy a great lot of network bandwidth resources if the number of type 5 LSAs is huge enough. This will decrease the network traffic and impact on the processing of other network devices.
- Suppose a network device originates several hundred thousand type 5 LSAs at one time, then all the LSAs will be flushed simultaneously in 1,800 seconds. At the moment, several ten thousand packets appeared in the network. It is very possible that the network cannot be loaded with such intense traffic, then parts of the packets are lost and will be multiply re-transmitted. Moreover, the flushed LSAs will propagate to all network devices in this network, which impacts on other devices. Some network devices, especially those with low processing capabilities, may suffer from block, no response and services interruption etc.
- In order to reduce traffic impact on network and to ensure stable operation, it is an object of the present invention to provide a flushing method with separated sets for type 5 LSA in OSPF protocol.
- The method according to the present invention comprises:
- 1. when there are a great lot of type 5 LSAs in a network device running OSPF protocol, separating all the LSAs into S sets evenly with a mapping method, naming the number of each set as 1, 2 ... S respectively, i.e., mapping the identification (ID) values of LSAs onto the numbers ranging from 1 to S;
- 2. recording the number of current processing set as N whose value is 1, 2 ... S in the network device;
- 3. for each set waiting for a flushing interval whose length is that of the network flushing interval divided by S;
- 4. flushing all LSAs in the N th set, then adding 1 to N and determining whether N is greater than S; if so, setting N to 1 and returning to step 3 and step 4, otherwise returning to step 3 and step 4 directly.
-
- In the above-mentioned method, the network device running OSPF protocol can be a router or an Ethernet level 3 exchange. The network flushing interval is defined by the IETF RFC 2328.
- In the above-mentioned method, the mapping method may include adding 1 to the remainder of the ID value of a LSA divided by S. In addition, the mapping method may includes:
- . a. dividing the ID value of a LSA into P bytes, wherein P is an even number;
- b. making exclusive-OR operation for the first P/2 bytes and the last P/2 bytes;
- c. adding 1 to the remainder of the result of exclusive-OR operation divided by S.
-
- The method according to the present invention can effectively reduce the impact of instantaneous traffic on network. The traffic is effectively distributed to different instants, and the network always keeps a low level load. With this method, running the OSPF protocol will not cause out burst of peak traffic on the network. This will avoid the impact on other network devices on the network and it will make for stable and high-efficient operation of all network devices. It is obvious that all the type 5 LSAs are flushed once within every 1,800 seconds after processing of separating sets has been accomplished. This ensures the normal operation of OSPF protocol mechanism.
- The invention will be described in detail hereinafter, with reference to two embodiments.
- In the first embodiment, the invention is implemented on a router.
- Suppose that a router originates 10,000 LSAs. Firstly, separate all the LSAs into 251 sets, that is, map the ID values of all LSAs onto the numbers ranging from 1 to 251. The mapping method can make use of a modular arithmetic, i.e., adding 1 to the remainder of the ID value of a LSA divided by 251. It is seen that all the LSAs are evenly separated into 251 sets after this step, with the set number as 1, 2, ... 251.
- Secondly, record the number of current set as N in the router, and sets 1 as the initial value of N.
- Thirdly, wait for 7 seconds (7 is the approximate value of the reminder of 1,800 divided by 251), and then all the LSAs in set 1 are processed and flushed. Next, add 1 to number N, which is 1 at this time, and flush all the LSAs in the set 2 and so on. When N exceeds 251, it will be set to 1 again, Then, after waiting for another 7 seconds, repeat the above-mentioned procedures from set 1.
- It can be seen that 10,000 LSAs need to be flushed at one time before the invention is applied, which will have impact on the network, i.e. the network may possibly be blocked to a certain degree. In contrast to prior art, the LSAs are flushed every 7 seconds and only about 40, the approximate value of the reminder of 10,000 divided by 251, LSAs are flushed each time with this invention.
- In the second embodiment, the invention is implemented on an Ethernet level 3 exchange.
- Suppose that an Ethernet level 3 exchange originates 100 thousand LSAs. Firstly, separate all the LSAs into 1,000 sets, namely, map the ID values of all LSAs onto the numbers ranging from 1 to 1,000. The mapping method can use an overlap exclusive-OR, which will be described specifically as follow.
- a. Divide the ID value of a LSA that is a 32 bits integral into 4 bytes.
- b. Make exclusive-OR operation for the first two bytes and the last two bytes, and get a new 16 bits integral.
- c. Add 1 to the remainder of the result obtained at step b divided by 1,000.
-
- It can be seen that all LSAs are basically even separated into 1,000 sets, with the set number as 1, 2 ... 1,000.
- Then, record the number of current set as N in the Ethernet level 3 exchange, and sets 1 as the initial value of N.
- Next, wait for 1.8 seconds (1.8 is the value of the reminder of 1,800 divided by 1,000), and then all the LSAs in set 1 are flushed. Then, add 1 to number N, which is 1 at this time, and flush all the LSAs in the set 2 and so on. When N exceeds 1,000, it will be set to 1 again. Then, after waiting for another 1.8 seconds, repeat the above-mentioned procedures from set 1.
- It also can be seen that 100 thousand LSAs are flushed each time before the invention is applied, which will have a large impact on the network. In this instance, because of this impact, the network may be interrupted temporarily, and some network devices may stop response. With the method, LSAs are flushed every 1.8 seconds, and about 1,000, the value of the reminder of 100 thousand divided by 1,000, LSAs are flushed each time. In this way, only several tens messages of route information are sent out. This will not affect the work of the network link again and will effectively protect the network devices also.
- The method according to the present invention is very efficient and can be applied for various kinds of routers and exchanges. The above-mentioned mapping method can employ a modular arithmetic or an overlap exclusive-OR arithmetic. So it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
- Attention is directed to all papers and documents which are filed concurrently with or previous to this specification in connection with this application and which are open to public inspection with this specification, and the contents of all such papers and documents are incorporated herein by reference.
- All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and/or all of the steps of any method or process so disclosed, may be combined in any combination, except combinations where at least some of such features and/or steps are mutually exclusive.
- Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise. Thus, unless expressly stated otherwise, each feature disclosed is one example only of a generic series of equivalent or similar features.
- The invention is not restricted to the details of the foregoing embodiment(s). The invention extends to any novel one, or any novel combination, of the features disclosed in this specification (including any accompanying claims, abstract and drawings), or to any novel one, or any novel combination, of the steps of any method or process so disclosed.
Claims (6)
- A flushing method with separated sets for type 5 Link State Advertisement (LSA) in Open Shortest Path First (OSPF) protocol, comprising:(1) separating all the type 5 LSAs originated in a network device into S sets with a mapping method;(2) recording the number of current processing set as N that is an integral among 1, 2, ... S;(3) for each set waiting for a flushing interval whose length is that of the network flushing interval divided by S; and(4) flushing all LSAs in the N th set, then adding 1 to N and determining whether N is greater than S; if so, setting N to 1 and returning to step(3), otherwise returning to step(3) directly.
- The method of Claim 1, wherein the step(1) further includes: mapping the identification values of LSAs onto the numbers ranging from 1 to S.
- The method of Claim 2, wherein the mapping method comprises adding 1 to the remainder of the ID value of a LSA divided by S.
- The method of Claim 2, wherein the mapping method comprises:a. dividing the ID value of a LSA into P bytes, wherein P is an even number;b. making exclusive-OR operation for the first P/2 bytes and the last P/2 bytes; andc. adding 1 to the remainder of the result of exclusive-OR operation divided by S.
- The method of Claim 1, wherein the network device is a router or an Ethernet level 3 exchange.
- The method of Claim 1, wherein the network flushing interval is defined by the Internet Engineering Task Force (IETF) Request For Comment (RFC) 2328.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN02122922 | 2002-06-06 | ||
CNB021229228A CN1192564C (en) | 2002-06-06 | 2002-06-06 | Method for opening grouping updating of fifth group link state notice of shortest route priority procotol |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1395004A1 true EP1395004A1 (en) | 2004-03-03 |
EP1395004B1 EP1395004B1 (en) | 2005-12-14 |
Family
ID=29743371
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP03253454A Expired - Lifetime EP1395004B1 (en) | 2002-06-06 | 2003-06-02 | Flushing method with separated sets for type 5 link state advertisement in open shortest path first protocol |
Country Status (6)
Country | Link |
---|---|
US (1) | US7327733B2 (en) |
EP (1) | EP1395004B1 (en) |
JP (1) | JP3801581B2 (en) |
CN (1) | CN1192564C (en) |
AT (1) | ATE313192T1 (en) |
DE (1) | DE60302732D1 (en) |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TW200813014A (en) * | 2002-03-28 | 2008-03-16 | Astrazeneca Ab | Quinazoline derivatives |
DE102004003547B3 (en) * | 2004-01-23 | 2005-06-30 | Siemens Ag | Shortest path routing method for packet-based communications network with updating of optimal routing path determined in dependence on communications link costs upon increasing of latter dependent on traffic loading |
CN100420242C (en) * | 2006-08-01 | 2008-09-17 | 华为技术有限公司 | Routing device chain circuit state data synchronizing method |
CN100394742C (en) * | 2006-08-17 | 2008-06-11 | 北京邮电大学 | Monitoring and analyzing system for opening shortest path priority route protocol and working method |
CN100527745C (en) * | 2006-12-31 | 2009-08-12 | 中国科学院计算技术研究所 | A LSA passive collection method under the OSPF full adjacent connection condition |
JP5739802B2 (en) * | 2008-05-13 | 2015-06-24 | アストラゼネカ アクチボラグ | 4- (3-Chloro-2-fluoroanilino) -7-methoxy-6-{[1- (N-methylcarbamoylmethyl) piperidin-4-yl] oxy} quinazoline fumarate |
CN102404228B (en) * | 2011-12-12 | 2014-12-24 | 杭州华三通信技术有限公司 | GR processing method and equipment based on OSPF protocol |
US9162701B2 (en) | 2013-03-13 | 2015-10-20 | Steering Solutions Ip Holding Corporation | Steering column energy absorbing rake lock |
CN103490922B (en) * | 2013-09-10 | 2017-02-08 | 迈普通信技术股份有限公司 | Control system and method for OSPF protocol neighbor setup process |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6856627B2 (en) * | 1999-01-15 | 2005-02-15 | Cisco Technology, Inc. | Method for routing information over a network |
US6985959B1 (en) * | 2000-11-01 | 2006-01-10 | Nortel Networks Limited | Constraint route dissemination using distributed route exchanges |
US7069343B2 (en) * | 2001-09-06 | 2006-06-27 | Avaya Technologycorp. | Topology discovery by partitioning multiple discovery techniques |
US20030123457A1 (en) * | 2001-12-27 | 2003-07-03 | Koppol Pramod V.N. | Apparatus and method for distributed software implementation of OSPF protocol |
-
2002
- 2002-06-06 CN CNB021229228A patent/CN1192564C/en not_active Expired - Fee Related
-
2003
- 2003-06-02 DE DE60302732T patent/DE60302732D1/en not_active Expired - Lifetime
- 2003-06-02 AT AT03253454T patent/ATE313192T1/en not_active IP Right Cessation
- 2003-06-02 EP EP03253454A patent/EP1395004B1/en not_active Expired - Lifetime
- 2003-06-03 JP JP2003158018A patent/JP3801581B2/en not_active Expired - Lifetime
- 2003-06-05 US US10/454,495 patent/US7327733B2/en active Active
Non-Patent Citations (1)
Title |
---|
ZININ A: "Guidelines for Efficient LSA Refreshment in OSPF draft-ietf-ospf-refresh-guide-01.txt", INTERNET DRAFT, June 2000 (2000-06-01), pages 1 - 11, XP002263378 * |
Also Published As
Publication number | Publication date |
---|---|
US20040013091A1 (en) | 2004-01-22 |
CN1466338A (en) | 2004-01-07 |
JP2004015808A (en) | 2004-01-15 |
JP3801581B2 (en) | 2006-07-26 |
EP1395004B1 (en) | 2005-12-14 |
ATE313192T1 (en) | 2005-12-15 |
DE60302732D1 (en) | 2006-01-19 |
US7327733B2 (en) | 2008-02-05 |
CN1192564C (en) | 2005-03-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6871235B1 (en) | Fast path forwarding of link state advertisements using reverse path forwarding | |
US6606325B1 (en) | Fast path forwarding of link state advertisements using multicast addressing | |
WO2020001622A1 (en) | Method for generating label forwarding table, packet transmission method, apparatus, and device | |
US20030053414A1 (en) | Method of transferring packets and router device therefor | |
US20070280100A1 (en) | Network routing device and network routing method | |
WO2008055426A1 (en) | Method, system and node apparatus for transmitting ethernet connectibvity fault management message | |
JP2007142629A (en) | Reply communication apparatus and arp reply communication apparatus | |
US11962491B2 (en) | Source routing tunnel ingress protection | |
JP2004274703A (en) | Router device and packet transfer control method | |
EP4012987A1 (en) | Method and apparatus for processing link state information | |
EP3823223A1 (en) | Multicast support | |
US7327733B2 (en) | Flushing method with separated sets for type 5 link state advertisement in open shortest path first protocol | |
CN111213345A (en) | Apparatus, method and system for transmitting or receiving message containing control information | |
US8223629B2 (en) | Core router capable of securing the output router of an autonomous system | |
US11888727B2 (en) | Extending BGP protection for SR path ingress protection | |
CN113785542A (en) | System and method for Interior Gateway Protocol (IGP) fast convergence | |
JP2006174451A (en) | Method for tracing route in wireless network including multiple nodes and wireless network of nodes configured to trace route | |
WO2021114838A1 (en) | Method for reducing routing loops, apparatus and system | |
US20100177702A1 (en) | Method, system and installation for forwarding data transmission frames | |
EP1504565A1 (en) | Monitoring the state of a communications network | |
EP3972206A1 (en) | Method, network device and system for processing bier packet | |
WO2020244471A1 (en) | Processing method and apparatus based on link error code | |
CN111614574A (en) | Communication method, device and system | |
CN114041279B (en) | System and method for abstracting IGP partitions | |
EP2649758B1 (en) | Minimizing the number of not-via addresses |
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 |
|
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 HU IE IT LI LU MC NL PT RO SE SI SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK |
|
17P | Request for examination filed |
Effective date: 20040811 |
|
AKX | Designation fees paid |
Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR |
|
17Q | First examination report despatched |
Effective date: 20041029 |
|
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 HU IE IT LI LU MC NL PT RO SE SI SK TR |
|
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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20051214 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: 20051214 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: 20051214 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;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED. Effective date: 20051214 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: 20051214 Ref country code: CH 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: 20051214 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: 20051214 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: 20051214 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: 20051214 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: 20051214 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: 20051214 |
|
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 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REF | Corresponds to: |
Ref document number: 60302732 Country of ref document: DE Date of ref document: 20060119 Kind code of ref document: P |
|
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: 20060314 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: 20060314 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: 20060314 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: 20060314 |
|
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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20060315 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20060325 |
|
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: 20060515 |
|
NLV1 | Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act | ||
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: 20060602 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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 Effective date: 20060615 |
|
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 NON-PAYMENT OF DUE FEES Effective date: 20060630 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
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: 20060915 |
|
EN | Fr: translation not filed | ||
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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20070202 |
|
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: 20051214 |
|
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: 20060602 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: 20051214 |
|
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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20051214 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: 20051214 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20170531 Year of fee payment: 15 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20180602 |
|
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: 20180602 |