EP0712260B1 - Verfahren zur Einfügung von Zellen in einen ATM-Strom und Anlage zur Durchführung des Verfahrens - Google Patents

Verfahren zur Einfügung von Zellen in einen ATM-Strom und Anlage zur Durchführung des Verfahrens Download PDF

Info

Publication number
EP0712260B1
EP0712260B1 EP95402477A EP95402477A EP0712260B1 EP 0712260 B1 EP0712260 B1 EP 0712260B1 EP 95402477 A EP95402477 A EP 95402477A EP 95402477 A EP95402477 A EP 95402477A EP 0712260 B1 EP0712260 B1 EP 0712260B1
Authority
EP
European Patent Office
Prior art keywords
cells
cell
flow
user
characteristic
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.)
Expired - Lifetime
Application number
EP95402477A
Other languages
English (en)
French (fr)
Other versions
EP0712260A1 (de
Inventor
Jean-Yves Cabinet Ballot-Schmit Tremel
Bertrand Cabinet Ballot-Schmit Mathieu
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.)
Orange SA
Original Assignee
France Telecom SA
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 France Telecom SA filed Critical France Telecom SA
Publication of EP0712260A1 publication Critical patent/EP0712260A1/de
Application granted granted Critical
Publication of EP0712260B1 publication Critical patent/EP0712260B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5625—Operations, administration and maintenance [OAM]

Definitions

  • the subject of the present invention is a method inserting cells into a cell stream of type ATM ("Asynchronous Transfer Mode") seen by example of measuring the quality of a network or equipment.
  • the transmission according to the standard ATM is done by transferring blocks of information from constant length.
  • the elementary quantity of transmitted information is 48 bytes.
  • the block transmitted in ATM is called cell and is identified by a 5-byte label called header.
  • the total length of a cell is therefore 53 bytes.
  • the ATM standard allows time multiplexing to several levels by organizing the flow of cells in VP virtual path and virtual path VC ("Virtual Channel").
  • An ATM network allows the transmission of information digital with various bit rates that can be very large, in fact up to 155 Mbit / s.
  • the maintenance flows relating to a given virtual channel use the same way that useful cells. They are distinguished by a particular coding of the PT field.
  • Insertion of a flow of characteristic cells whether maintenance flow or otherwise can reduce the flow offered to users. In effect, the insertion is made in a forced manner at the at the expense of the speeds offered to users.
  • the subject of the present invention is a method insertion of characteristic cells allowing insert in real time while not not reducing the flow rate of flows offered to users whatever these debits.
  • the invention also relates to a device for implementation of the process.
  • the insertion process is mainly characterized in that each time that a characteristic cell insertion is made, an empty cell in the incident flow is deleted, the deletion is not necessarily fair after insertion, the number of empty cells at delete being counted.
  • the treatments carried out in real time according to the process allow insertions of cells independently of the incoming flow rate and without disturbing this flow.
  • the device comprises a pre-treatment circuit 100 of the incident flow of S0 cells.
  • This circuit makes it possible to form in real time a characteristic ME message for each cell entering.
  • This message notably includes an indication on the state or more precisely on the type of cell to find out whether it is an empty cell or a user cell or other predetermined type of cell.
  • This we will qualify all of the user cells and non-user cells by non-empty cells.
  • non-user cells By non-user cells cells with a VCI of less than 15 and characteristic cells.
  • the pre-treatment circuit also allows select cells in the incoming flow not empty to store them as you go.
  • the device further comprises a circuit for processing 200 which, from the stored messages, lets you know when to generate a characteristic cell in the output stream. So, according to the invention the circuit makes it possible to generate the characteristic cell and delete a cell vacuum of the incoming flow whenever a number X determined of user cells has been issued.
  • the circuit allows to successively emit the flow cells incoming whether they are user cells or empty cells. In the event that a empty cell, the circuit generates this cell since, as we will see below, we do not store the incoming empty cells.
  • the pre-treatment circuit includes a circuit 101 for detecting user cells and training messages for each cell.
  • This circuit includes besides a translation memory 102 and a circuit FIFO type buffer.
  • the circuit 101 allows on the one hand, detect user cells from headers cells to store them in buffer 103 and, on the other hand, to address the memory of translation 102.
  • the incoming flow cells are used by the circuit 101 to address the translation memory 102 which issues a pre-registered code for each.
  • the circuit 101 form using this code and cell information, a message including a first word M1 for coding the virtual path number IPV and a second word M2 to indicate the type of cell.
  • a third word M3 contains bits of BIP16 parity calculated on the data contained in cells.
  • the word M2, indicating the type of cell lets you know if the cell received is a cell empty or a user cell or a non-user cell, to know for example a maintenance cell or a user cell with a VC ⁇ 15.
  • S3 information flowing between circuit 101 and the processing circuit 201 of block 200 correspond to the messages formed by the circuit 101 for each cell received.
  • the processing circuit 200 has a cell generation circuit 201 characteristics receiving S3 information from message formation circuit.
  • This circuit of treatment 200 further includes an insertion circuit of cells capable of inserting a characteristic cell in the flow of user cells S5, obtained by reading of the buffer memory 103 when it receives it the order of the generation circuit 201.
  • the cell processed by circuit 201 is the cell relating to the message which is located at the bottom of stack 203.
  • the circuit transmits on S4 to the circuit 202 a read command signal from the buffer 103 and send on S6 of this cell and waiting for a cell whose message formed by circuit 101 will be placed at the top of the stack 203.
  • the circuit increments the user cell counter 204 by 1 received on this virtual conduit and performs the necessary treatments relating to user cells and the maintenance cell.
  • This treatment consists on the one hand, for each cell of each conduit, to calculate the content of field BIP16 by making an exclusive OR between the BIP16 of the previous cells and the BIP16 of the current cell and on the other hand, to determine the content of the TUC ("Total User Cell") field. This content is determined by the value of the cells.
  • the circuit 201 sends a signal to circuit 202 command to read from memory 103, to transmit on S6 of the user and waiting cell of a cell.
  • the circuit 201 sends on S4 the order to read from the stack 103 the corresponding cell and to send it on S6.
  • the processing carried out is the same as that which has just been described above for a user cell (for example, waiting for the next message S3).
  • circuit 201 sends an order of generation of a maintenance cell at circuit 202. It calculates the BIP16 of this cell and sends it to the circuit 202 as well as its VPI, it also sends the MSN content of counter 205 and the total number of TUC user cells given by the counter 204. The MSN content represents the cell number of maintenance issued. Counter 205 is incremented by 1 to each maintenance cell issued.
  • circuit 201 increments the counter of maintenance cells issued 206. It is this counter which will allow to know how many empty cells should be deleted.
  • circuit 201 sends a order on S4 to generate an empty cell in case counter 206 is zero and waits for message S3. In if this counter is not zero, then the cell vacuum is not emitted, counter 206 is decremented by one and the next cell is immediately processed.
  • the insertion of maintenance flows can be performed on one or more ATM conduits and even on all conduits according to the process. In addition, insertion is carried out independently of the flow user.
  • the process we insert a cell characteristic of all X user cells of the same virtual conduit.
  • the number X can be set once for all or variable depending on the chosen application.
  • This insertion is carried out in accordance with process while maintaining the flow of the user flow.
  • X cells of the same duct have been emitted, we will insert a characteristic cell and delete an empty cell. We will therefore wait for the arrival an empty cell to delete it after inserting a characteristic cell.
  • the cell feature can be issued at any time in the interval between cell X and the cell (X + 1).
  • the flow S0 corresponds to the flow of cells ATM.
  • the received cells are detected by their header, cells with the wrong header being eliminated.
  • Wrong headers are detected in a way known by the content of the HEC header field.
  • the non-empty cell detection is performed conventionally by comparison with the fixed content of a empty cell header.
  • Flow S1 corresponds to non-empty cells detected. These cells are put on hold as and as they arrive in a buffer memory 103.
  • the waiting time corresponds in practice to the duration of treatment of the previous cell by the circuit 201.
  • the circuit 101 While detecting the user cells, the circuit 101 also makes it possible to form the message ME for each cell in the stream.
  • the first word M1 preferably corresponds to the 12-bit coding of the VPI virtual path indicator and indicator virtual channel to which the cell belongs.
  • the second word M2 is the type (or state) indicator of the cell.
  • this word M2 allows indicate whether the received cell is an empty cell, or a user cell, or a non-user cell (typically a maintenance cell).
  • the third word M3 contains 16 bits of BIP16 parity calculated on the data contained in the cell. The message as well formed is transmitted to the processing circuit 201 for be stored in a buffer memory 203.
  • the translation memory 102 in the case where the received cell is an empty cell or a user cell, we go through the translation memory 102.
  • This memory allows, as has been described, to obtain a word M1 of reduced size compared to the size of the information that should be processed since in the absence of this coding we would have 32 bits (VPI + VCI) per cell.
  • the word M1 is formed directly without passing through the translation memory, this is the cell's VPI virtual path indicator.
  • the process according to the invention stores these messages in a buffer over time treatment of cells previously placed in the buffer memory.
  • This memory is of the FIFO type.
  • the messages are read successively to be processed by circuit 201.
  • the buffer memory 203 includes a predetermined number M of messages. This introduces a delay of M cells on the real flow, however, this delay is small enough not to be binding.
  • the messages thus memorized are read one after the other. following the others as soon as the number M is reached.
  • the message from cell X + 1 is memorized.
  • Memory in this case always contains M messages.
  • the circuit 202 When the message read represents the X th user cell, the circuit 202 is instructed to read the FIFO 103, then a characteristic cell is generated and a message S3 is awaited. At the first of the following messages representing an empty cell, this cell is not emitted and the following message is read without waiting for a message corresponding to a new cell to arrive.
  • This figure represents the movement of messages formed by cells in stack 203.
  • the processing begins with the message from cell 1. Suppose it is an empty cell.
  • circuit 201 transmits to circuit 202 a indication to him to reconstitute the cell empty and issue it. This circuit 201 awaits the message of the next cell (cell 14).
  • This circuit 202 then processes the message of the cell 2 which is for example a user cell and wait for the next cell message (cell 4).
  • the message from cell 5 indicates that it is an empty cell and the inserted cell counter is not zero, then this cell is to be deleted, it is not issued and the circuit processes the message of the next cell 6 without waiting for the message from the next cell arrives.
  • the message from cell 7 indicates that it is of an empty cell and the counter is zero, so we emits this cell and the circuit waits for the message next, that is the message from cell 10 and and so on.
  • Figure 3 illustrates, schematically on the first line, an incident flow in which the cells have been numbered from 1 to 13 and in which the different types of cells have been shown separately according to the legend indicated.
  • the second line represents the resulting flow, after insertion of a maintenance cell and deletion of an empty cell at the indicated location, ie after the X th cell of the same VP56 virtual path (for example).
  • FIG. 4 illustrates a second alternative embodiment.
  • a maintenance cell is introduced into the incident flow shown on the first line so that it is in the middle of two cells of the same VP56 conduit, the first being the X th cell of this VP56.
  • the medium between two cells in the same duct is defined by the distance between them in time, ie the flow. This distance is easily measurable since it involves measuring the flow and divide by two to find the location of the cell to insert.
  • Figures 5 and 6 correspond to the cases where the insertion of the cells is done in a ATM equipment.
  • the interface 300 represents the adaptation between the ATM level and physical level.
  • this device can also be implanted on a network terminal, and in this case it will be placed at the exit of the terminal as shown in the figure 6.
  • Figure 7 corresponds to the case where the insertion is made outside of ATM equipment.
  • the device is placed on the line of the network. It receives the flow carried by this line and emits the stream on the network line after insertion cells (for maintenance).
  • a measuring device 500 on reception to carry out network quality measures.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Claims (8)

  1. Verfahren zur Einfügung eines Stroms charakteristischer Zellen in einen eintreffenden, der ATS-Norm oder einer analogen Norm entsprechenden Zellenstrom von beliebiger Datenübertragungsgeschwindigkeit, wobei der Strom insbesondere Benutzerzellen und Leerzellen enthält,
    dadurch gekennzeichnet, daß es die folgenden Schritte umfaßt:
    einerseits Durchführen einer Echtzeit-Vorverarbeitung des eintreffenden Stroms,
    andererseits Bilden einer jede empfangene Zelle charakterisierenden und insbesondere eine Information über den Zellentyp liefernden charakteristischen Nachricht,
    Auswählen der Benutzerzellen und Abspeichern von jeder von ihnen während der nachfolgenden Verarbeitungszeit,
    Durchführen einer Echzeitverarbeitung aufgrund gebildeter Nachrichten, um eine charakteristische Zelle zu erzeugen und sie jedesmal dann zu senden, wenn eine bestimmte Benutzerzellenzahl gesendet wurde, und die gesendeten charakteristischen Zellen zu verbuchen, um eine entsprechende Leerzellenzahl zu beseitigen, andernfalls Senden einer wartenden Benutzerzelle oder Senden einer Leerzelle.
  2. Verfahren zum Einfügen eines Zellenstroms nach Anspruch 1, dadurch gekennzeichnet, daß das Einfügen einer charakteristischen Zelle in eine virtuelle Leitung direkt nach Erscheinen der Xten Zelle des Flusses erfolgt und die Beseitung der Leerzelle gleich mit dem Erscheinen einer Leerzelle in dem Strom nach oder während dieser Einfügung stattfindet.
  3. Verfahren zum Einfügen eines Zellenstroms nach Anspruch 1, dadurch gekennzeichnet, daß das Einfügen einer charakteristischen Zelle in eine virtuelle Leitung zu jedem Zeitpunkt innerhalb des Zeitintervalls erfolgt, das die Xte und die (X+1)te Zelle der Leitung trennt, und dadurch, daß bei Fehlen einer zu beseitigenden Leerzelle ihre Zahl verbucht wird.
  4. Verfahren zum Einfügen eines Zellenstroms nach einem der vorangehenden Ansprüche, dadurch gekennzeichnet, daß die eingefügten Zellen Qualitätaufrechterhaltungs-Überwachungszellen (F4 oder F5) sind.
  5. Verfahren zum Einfügen eines Zellenstroms nach einem der vorangehenden Ansprüche, dadurch gekennzeichnet, daß die eingefügten Zellen Zellen eines spezifischen Stroms sind, definiert für eine Sonderanwendung.
  6. Anlage zum Einfügen eines Stroms charakteristischer Zellen in einen eintreffenden, der ATS-Norm oder einer analogen Norm entsprechenden Zellenstrom von beliebiger Datenübertragungsgeschwindigkeit, wobei der Strom insbesondere Benutzerzellen und Leerzellen entsprechend einem der vorangehenden Ansprüche enthält,
    dadurch gekennzeichnet, daß sie umfaßt:
    Echtzeit-Vorverarbeitungseinrichtungen (100), die ermöglichen, eine Nachricht für jede eintreffende Zelle zu bilden, wobei diese Einrichtungen außerdem ermöglichen, die Benutzerzellen zu detektieren, um sie zu speichern,
    Echtzeit-Verarbeitungseinrichtungen (200), um die Benutzerzellen zu zählen, die charakteristischen Zellen aufgrund der gebildeten Nachrichten zu erzeugen, nach dem Senden von X Benutzerzellen eine charakteristische Zelle zu senden, die gesendeten charakteristischen Zellen zu verbuchen und eine Leerzelle zu beseitigen.
  7. Anlage zum Einfügen eines Zellenstroms nach Anspruch 6, dadurch gekennzeichnet, daß die Vorverarbeitungseinrichtungen (100) Benutzerzellen-Detektionseinrichtungen (101), einen Übersetzungsspeicher (102) und einen Pufferspeicher (103) umfassen.
  8. Anlage zum Einfügen eines Zellenstroms nach Anspruch 6, dadurch gekennzeichnet, daß die Verarbeitungseinrichtungen (200) Einrichtungen (201) zur Erzeugung charakteristischer Zellen (201), einen Pufferspeicher (203) und Einfügungseinrichtungen (202) der erzeugten Zellen in den Ausgangsstrom umfassen.
EP95402477A 1994-11-08 1995-11-07 Verfahren zur Einfügung von Zellen in einen ATM-Strom und Anlage zur Durchführung des Verfahrens Expired - Lifetime EP0712260B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR9413403A FR2726710B1 (fr) 1994-11-08 1994-11-08 Procede d'insertion de cellules dans un flux de type atm et dispositif de mise en oeuvre
FR9413403 1994-11-08

Publications (2)

Publication Number Publication Date
EP0712260A1 EP0712260A1 (de) 1996-05-15
EP0712260B1 true EP0712260B1 (de) 1998-05-27

Family

ID=9468626

Family Applications (1)

Application Number Title Priority Date Filing Date
EP95402477A Expired - Lifetime EP0712260B1 (de) 1994-11-08 1995-11-07 Verfahren zur Einfügung von Zellen in einen ATM-Strom und Anlage zur Durchführung des Verfahrens

Country Status (5)

Country Link
US (1) US5724354A (de)
EP (1) EP0712260B1 (de)
JP (1) JPH08214011A (de)
DE (1) DE69502686T2 (de)
FR (1) FR2726710B1 (de)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09270804A (ja) * 1996-04-03 1997-10-14 Toshiba Corp Ａｔｍ交換機
JP3662084B2 (ja) * 1996-11-18 2005-06-22 株式会社東芝 Ａｔｍ交換装置
JPH10262064A (ja) * 1997-03-19 1998-09-29 Fujitsu Ltd 複数回線終端装置及び複数回線終端装置のｏａｍ処理方法
KR100212064B1 (ko) 1997-05-21 1999-08-02 윤종용 2n X n 다중화 스위치 구조
US6449275B1 (en) 1998-12-17 2002-09-10 Telefonaktiebolaget Lm Ericsson (Publ) Internal routing through multi-staged ATM node
US6396811B1 (en) 1998-12-17 2002-05-28 Telefonaktiebolaget Lm Ericsson Segmented performance monitoring of multi-stage ATM node
WO2000038383A2 (en) * 1998-12-18 2000-06-29 Telefonaktiebolaget Lm Ericsson (Publ) Internet protocol handler for telecommunications platform with processor cluster
FR2821509B1 (fr) * 2001-02-27 2003-05-30 Thomson Csf Procede et dispositif pour transferer des donnees dans un reseau de communication comportant une artere a faible debit
US20030039256A1 (en) * 2001-08-24 2003-02-27 Klas Carlberg Distribution of connection handling in a processor cluster

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH088575B2 (ja) * 1989-08-11 1996-01-29 日本電気株式会社 Ａｔｍセル挿入方式
JP3278865B2 (ja) * 1991-06-28 2002-04-30 日本電気株式会社 トラヒック制御方法
US5392398A (en) * 1992-04-20 1995-02-21 International Business Machines Corporation System and method for deallocation a first message independently of the deallocation of a second message in a bundle of messages

Also Published As

Publication number Publication date
DE69502686T2 (de) 1998-09-24
DE69502686D1 (de) 1998-07-02
FR2726710B1 (fr) 1997-01-03
JPH08214011A (ja) 1996-08-20
EP0712260A1 (de) 1996-05-15
US5724354A (en) 1998-03-03
FR2726710A1 (fr) 1996-05-10

Similar Documents

Publication Publication Date Title
EP2940960B1 (de) Verfahren und vorrichtung zum ordnen von datenpaketen für ihr routing in einem netz mit impliziter bestimmung der pakete, die vorrangig zu verarbeiten sind
EP0707399A1 (de) Verfahren und Anlage zur Überlastregelung in einem Paketvermittlungsnetz
EP0609114B1 (de) Verfahren und Vorrichtung zur Bitratenverwaltung in ATM-Netzen
FR2754123A1 (fr) Systeme de gestion de trafic et de controle d'encombrement pour reseaux a base de paquets
EP0712260A1 (de) Verfahren zur Einfügung von Zellen in einen ATM-Strom und Anlage zur Durchführung des Verfahrens
FR2769778A1 (fr) Procede de securisation de la transmission de cellules d'un systeme de telecommunication
EP0667694B1 (de) Verfahren und Vorrichtung zum Messen von Leistungskennwerten eines ATM-Netzes
EP0650276B1 (de) Prüfungsgerät für ATM Telekommunikationsnetze und Messung der Qualität einer ATM Verbindung
EP0667699B1 (de) Verfahren zur Verarbeitung von Daten von einer Anpassungsschicht während der Übertragung gemäss einem asynchronen ATM-Übertragungsmodus.
FR2707819A1 (fr) Procédé et dispositif de surveillance et/ou de test d'un réseau de télécommunication de type ATM.
EP0771132B1 (de) Anlage zur Regulierung des ATM-Zellenflusses in einer ATM-Vermittlungsstelle
EP0603056B1 (de) Verfahren zur Simulation der Übertragung über ein asynchrones Transfermodus-Übertragungsnetz und Simulator zur Übertragung über ein solches Netz
EP0422550B1 (de) Vorrichtung zur Auswertung der Rate von virtuellen Verbindungen aus einer asynchronen Zeit-Multiplexlinie
EP0711054B1 (de) Verfahren und Vorrichtung zur Kopfteilübersetzung von ATM-Zellen
FR2766038A1 (fr) Commutateur de mode de transfert asynchrone pouvant traiter plusieurs protocoles, et procede de commande d'interfonctionnement
EP0547958B1 (de) Verfahren und System zur Übertragung von Kommunikationsinformation über eine Übertragungsverbindung von Datenblöcken variabler Länge und asynchronen Zeit
EP0857005B1 (de) Verfahren zum Zuordnen von Daten zu ATM Zellen
WO2001091405A2 (fr) Procede de transferts mutuels de parametres de commande a travers un reseau de communication
EP0878939B1 (de) ATM Zellenpositionierungsanlage
EP1175747A1 (de) Zugriffssystem für ein synchrones netz mit einer empfänger einrichtung und einer sender einrichtung
FR2776875A1 (fr) Procede et dispositif pour optimiser un controle de debit maxi-mini equitable au cours de sessions de communication utilisant un debit binaire disponible
FR2699299A1 (fr) Procédé de génération de gigue cellules dans un signal incident transmis en mode ATM et dispositif de mise en Óoeuvre.
EP0671839A1 (de) Verarbeitungsverfahren von Daten einer Übertragungsanpassungsschicht eines asynchronen Übertragungsmodus des ATM Typs
FR2717974A1 (fr) Dispositif d'adaptation entre un réseau temporel synchrone et un réseau temporel asynchrone.
EP1244329A1 (de) Verfahren und Vorrichtung zur Übertragung von Daten innerhalb eines eine Übertragungsleitung mit niedriger Datenrate enthaltenden Kommunikationsnetzes

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): DE GB

17P Request for examination filed

Effective date: 19960530

17Q First examination report despatched

Effective date: 19960808

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE GB

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 19980528

REF Corresponds to:

Ref document number: 69502686

Country of ref document: DE

Date of ref document: 19980702

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
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20011029

Year of fee payment: 7

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

Ref country code: DE

Payment date: 20011114

Year of fee payment: 7

REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

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

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 NON-PAYMENT OF DUE FEES

Effective date: 20030603

GBPC Gb: european patent ceased through non-payment of renewal fee