EP2159959B1 - Procédé de détermination d'une topologie, composants de réseau et unité centrale - Google Patents

Procédé de détermination d'une topologie, composants de réseau et unité centrale Download PDF

Info

Publication number
EP2159959B1
EP2159959B1 EP08015041.0A EP08015041A EP2159959B1 EP 2159959 B1 EP2159959 B1 EP 2159959B1 EP 08015041 A EP08015041 A EP 08015041A EP 2159959 B1 EP2159959 B1 EP 2159959B1
Authority
EP
European Patent Office
Prior art keywords
component
line
network
topology
central unit
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.)
Active
Application number
EP08015041.0A
Other languages
German (de)
English (en)
Other versions
EP2159959A1 (fr
Inventor
Jahanzaib Imtiaz
Jürgen Prof. Jasperneite
Gunnar Lessmann
Karl Dr. Weber
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.)
Phoenix Contact GmbH and Co KG
Siemens AG
Original Assignee
Phoenix Contact GmbH and Co KG
Siemens AG
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 Phoenix Contact GmbH and Co KG, Siemens AG filed Critical Phoenix Contact GmbH and Co KG
Priority to EP08015041.0A priority Critical patent/EP2159959B1/fr
Publication of EP2159959A1 publication Critical patent/EP2159959A1/fr
Application granted granted Critical
Publication of EP2159959B1 publication Critical patent/EP2159959B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L2012/4026—Bus for use in automation systems

Definitions

  • the invention relates to a method for determining a topology of a data network constructed from components with a central unit, an initial component and at least one end component.
  • Topology refers to the way in which various components involved, in particular network communication components, are connected in the data network by physical or logical pathways.
  • connections and nodes In the data network, there are connections and nodes through which, if appropriate, branches from each area of the data network can be routed to any other area of the data network.
  • the invention relates to a network component comprising at least a first input / output port for a predecessor component and a second input / output port for a successor component, and a monitoring means for monitoring a telegram.
  • the invention relates to a central unit for connection to a data network with an initial component and at least one end component.
  • alias ie a name in the manner of an address, in particular an alias next to their network address, eg an IP address, or a MAC address, is assigned or is, which provides information about a hierarchical position of Network component in the data network.
  • a disadvantage of this method is that although thus any network with any number of network components configured and each network component can be assigned a unique address, but by the procedure does not reach the user to a description of the topology of the network configured in this way.
  • an existing network configured with addresses exists and a second network, in particular a real-time Ethernet domain, is connected to this network, so it is no longer possible for the user for this network to make a statement about the topology of the resulting overall network close.
  • From the EP 1 780 943 A1 is a method for determining a layer 2 topology of an IT infrastructure with interconnected devices that communicate with each other via ports known. In this case, it is checked for each individual component or each device, which direct or indirect "neighboring components" this can reach via which ports, with first a PIN query is performed to determine which components are even present in the data network. Each individual connected component then checks which neighboring components can be reached via which ports.
  • a similar method is used in US 5 297 138 described. There, it is first determined which components are basically present. In a further step, it is determined via which ports one Component, which neighboring components are directly or indirectly audible. Subsequently, a component from a group that is audible over a common port is selected and, in turn, checked on that component to see which neighboring components are audible over which ports of the selected component.
  • the object is achieved by a method according to claim 1. Accordingly, for a data network constructed from components having a central processing unit, an initial component and at least one end component, in a first step i) starting from an end component in a line of a plane, an end position is written to a data area of a telegram, in a second step ii) this Telegram transmitted in the direction of the initial component to the central unit, and determined in a third step iii) in the central unit based on the data area, the topology of the data network.
  • said data network consists of an initial component and an end component, the end component preferably having a unique address.
  • the end component is characterized in that it is interconnected only with a predecessor component.
  • These two network components form a line consisting of the starting component and the end component connected behind it.
  • the initial component preferably the initial component then has the station address or position "one" and the end component the station address or position "two".
  • the position "two" corresponds to the end position, according to the method, this end position is written in a data area of a telegram and transmitted via the initial component to the central unit.
  • the topology is described as a two-element line.
  • the method ends when an end position is reached, ie when no further node is connected or the node does not participate in the method.
  • step i) it is checked whether the end component has a branch into a further line of a further level and, in the presence of a branch, a branch position is written into the data area and the method is continued with step i) for the further line.
  • the data networks are structured in hierarchical line topologies. In these hierarchical line topologies, the data network consists of several levels. Several lines may be present in the planes, wherein a line is formed by a series connection of at least two network components. For example, a line may be in a first level of the data network and a branch of the first line in the first level may branch to another level hierarchically subordinate to the first level.
  • step ii) when the telegram passes through further components in the line, it is checked in each case whether the respective component has a branch into a further line of a further level and, in the presence of a branch, writes a branching position into the data area and for the further line Process with step i) continued.
  • the telegram which is on the "return path" to the central unit and already has end positions and branching positions in its data area, can again encounter a component with a branching position on this return journey by passing through the components, and this branching position of the component then additionally enters the data area This describes the extended topology.
  • the message is not forwarded immediately, but penetrates into the branch and examines the further topology after this branching and returns to the component with corresponding structure data of the subordinate line or topology after this branching point, in an advantageous manner the entire topology of the network will be described.
  • the data area by adding the each end position and the respective branching position grow into a variable length string.
  • a delimiter which describes a change to another level is added after a branching position in the character string.
  • the string consists for example of a byte string, each byte can each take a position and a byte between the positions, for example, for a delimiter, preferably a parenthesis, can be used.
  • the sign "(" means: there is now a series of characters which again have end positions and branch positions to the higher-level network component with a branch Ethernet technology in automation technology is increasingly being added to domains of field devices flexibly to existing network topologies / for example when adapting a tooling to changing production conditions.
  • the method allows the integration of an Ethernet real-time domain in an Ethernet system and the recognition of the resulting new boundaries. It can be implemented with minimal effort and allows a system to boot up in a short time. This can be synonymous with Changing the topology will be responded in a timely manner.
  • the object is achieved by the central unit for connection to a data network having an initial component and at least one end component according to claim 3, characterized in that there are determination means which are designed to perform a method for determining a topology according to claims 1 to 2.
  • Such a central unit is preferably configured with processing means for displaying the topology on a display or for forwarding the structured topology data to a host computer.
  • FIG. 1 is a data network 30 with a first component 1, which also represents an initial component AK, a second component 2 and a third component 3 is shown.
  • the network component For communication of the first component 1, which is also referred to as a network component, the network component has a first input / output port P and a second input / output port S. Via the first input / output port P, the network component is interconnected with a predecessor via an Ethernet cable. In this example, the predecessor of the network component 1 is a central processing unit 40. Via the second input / output port S, the network component 1 is interconnected with a further network component, in the example the network component 2.
  • a data network 30 can thus be constructed from a plurality of network components as a line structure.
  • the method according to the invention is used, with individual method steps in a monitoring means 50 are implemented.
  • the monitoring means 50 is designed as a freely programmable ASIC module.
  • each network component in the data network to be analyzed has a monitoring means 50.
  • the central unit 40 has as its "counterpart" to the monitoring means 50 a determination means 60.
  • this determination means 60 which in turn is preferably configured as a freely programmable ASIC module, the topology data determined according to the method are processed.
  • a display 70 which is also connected by means of an Ethernet cable to the central unit 40, the topology data or the topology of the network can be graphically displayed. Furthermore, it is possible to pass on the topology data for further processing to a master computer 72 via a processing means 71.
  • a telegram T is sent starting from the end component EK in the direction of the initial component AK to the central unit 40.
  • L Link Layer Discovery Protocol
  • a telegram T is sent starting from the end component EK in the direction of the initial component AK to the central unit 40.
  • This symbolic network component serves, on the one hand, to illustrate that the line formed from the network components 1, 2, 3 can in principle be continued as desired, and, on the other hand, indicates that the second input / output port S of the network component 3 is no longer connected to another network component .
  • An event transmitted by the central unit 40 which is intended to determine the topology of the network 30, would thus trigger a timeout on reaching the network component 3 at the second input / output port S.
  • the network component has a first in-out port S, a second in-out port P, and a third in-out port P.
  • the first in-out port S and the second in-out port B serve to daisy-chain several network components to one line.
  • the third input-output port B serves to connect from a hierarchically higher level to a hierarchically lower level, for example a connection from the first level E1 to the second level E2.
  • the second network component 2, the fourth network component 4, the fifth network component 5, the sixth network component 6 and the ninth network component 9 each have a third input-output port B for branching into another level. Due to the branching possibility of said network components, the individual lines can be interconnected to the contiguous network 30.
  • the second network component 2 of the first level E1 thereby enables a connection to the fifth network component 5, which lies in the second level E2.
  • the fourth network component 4 of the first level E1 due to the branching, allows a connection to the eighth network component 8, which likewise lies in the second level E2.
  • the fifth network component 5 from the second level E2 connects the twelfth network component 12 from the third level E3.
  • the sixth network component 6 connects the fourteenth network component 14 from the plane E3 via its branch point.
  • the end position of the end component EK is written into a data area 22 of a telegram T.
  • the "fourth" network component 4 is the end component EK, and since it is the fourth network component in the first line, it has an end position of significance "four".
  • the boxes of the network components 1 to 17 are shown in quotation marks "the valences of the network components according to their rank in each line to the right of the boxes of network components with a branching position is shown as a single half of the construction of the position data.
  • the telegram T has a destination address, a source address, a type and an area for standard TLVs.
  • An area 21 forms an LLDP frame.
  • the data area 22 may be mentioned, in which the respective end positions 25 and the branching positions 26 are hung behind one another as a string.
  • the end position "four" of the fourth network component 4 has already been written into the data area 22 of the telegram T with the first method step and stored at the beginning of the data area 22 as a first end position 25. It is now further checked whether the end component EK, in this case, the fourth network component 4 has a branch into another line of another level E2 and in the presence of this branch, a branch position 26 is written in the data area 22 and the method for the other line Step i.) Continued.
  • the fourth network component 4 Since the fourth network component 4 has a branch from the first line from the first plane E1 to the second plane E2 and thus connects the first line to the third line, the aforementioned check has been positive and the data area 22 is written to the previously written End position 25 "four" another branching position "four” attached. Thus, a string having the content "four, four" has arisen, wherein the first "four” describes the end position of the fourth network component 4 in the first line and the second "four” in the character string additionally describes that this network component 4 also has a Branching point in another level has. Since a further level, namely the second level E2 with the third line, has been reached via this branch point, the method is continued in a recursive manner with step i.).
  • the eleventh network component 11 writes an end position 25 "four" in the data area 22 of the telegram T.
  • the telegram T is now transmitted in the direction of the central unit 40. It happens that the tenth network component 10 without an action of a position recording in the data area 22, because the tenth network component 10 has no branch point.
  • the branching leads from the second level E2 to the third level E3.
  • the branching position "two" is now written into the data area 22. Since the line constructed from the sixteenth network component 16 and the seventeenth network component 17 contains two network components, ie the second network component of this line again represents an end component EK and has the significance "two", the end position "two" is written into the data area according to the method.
  • a string of "four, two, two” has been put together as a topology feature. Together with the topology of the first line in the first level E1, a string of "four, four, (four, two, two)” has now been created.
  • the characters "(", ")" are mapped in the string as separators for a layer change, ie a change of hierarchy.
  • the telegram T is now forwarded in the direction of the central unit 40 by the fourth network component 4 and thereby passes the third network component 3, since this network component 3 again has no branch point, no change is made to the data area 22.
  • the second network component 2 is a branch point in a has another line of another level. In this case, it is again a plane change from the first plane E1 to the second plane E2.
  • the telegram T is in turn sent to the end component EK of this line.
  • the end component EK in this case is the seventh network component 7 with the end position 25 with the significance "three".
  • the result for the topology of this substructure is a character string with the following content "three, two, two, one, two".
  • This character string of the substructure is in turn appended to the previously described character string of the previously determined structure, and thus a complete character string is created, which describes the topology of the data network 30 with the content "(4,4, (4,2,2), 2 (3,2,2,1,2) ".
  • the telegram T with the aforementioned content of the character string will now continue to be transmitted in the direction of the central unit 40 since the first network component 1 has no branching point, nothing will change in the content of the character string and the character string can thus be transferred into the central unit 40 by the telegram T. be transmitted and to evaluate the topology with the FIG. 1 described determination means 60 are passed.

Landscapes

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

Claims (4)

  1. Procédé de détermination d'une topologie linéaire hiérarchique d'un réseau de données (30) constitué de composants, avec une unité centrale (40), un composant initial (AK) et au moins un composant terminal (EK),
    où le composant initial (AK) est relié à l'unité centrale (40), et
    où, dans cette topologie linéaire hiérarchique, le réseau de données se compose de plusieurs plans (E1, E2, E3) et plusieurs lignes peuvent être présentes sur les plans, une ligne étant formée par un montage successif d'au moins deux composants de réseau, un composant terminal (EK) d'une ligne étant caractérisé en ce que celui-ci n'est couplé qu'à un composant antérieur sur cette ligne,
    où
    i) à partir d'un composant terminal (EK) sur une ligne d'un plan (E1), une valeur d'une position terminale (25) de ce composant terminal (EK) est écrite dans une plage de données (22) d'un télégramme (T), la valeur correspondant au rang du composant terminal sur cette ligne,
    ii) ledit télégramme (T) est transmis à l'unité centrale (40) dans la direction du composant initial (AK) et par l'intermédiaire du composant initial (AK),
    iii) la topologie est déterminée dans l'unité centrale (40) à partir de la plage de données (22), où
    il est contrôlé à l'étape i) si le composant terminal (EK) d'une ligne présente une ramification vers une autre ligne d'un autre plan (E2), une valeur d'une position de ramification (26) étant écrite dans la plage de données (22) en cas de présence d'une ramification, la valeur correspondant au rang du composant terminal (EK) sur la ligne concernée, le procédé se poursuivant par l'étape i) pour l'autre ligne, où
    il est contrôlé à l'étape ii), lors du passage du télégramme (T) depuis d'autres composants sur la ligne, si le composant concerné présente une ramification vers une autre ligne d'un autre plan (E3), la valeur de la position de ramification (26) correspondant au rang de ce composant sur la ligne concernée étant écrite dans la plage de données (22) en cas de présence d'une ramification, le procédé se poursuivant par l'étape i) pour l'autre ligne,
    la plage de données (22) croissant de manière à former une chaîne de caractères de longueur variable, par ajout des valeurs de la position terminale (25) respective et de la position de ramification (26) respective,
    un caractère séparateur décrivant un passage vers un autre plan (E1, E2, E3) étant ajouté derrière la valeur de la position de ramification dans la chaîne de caractères.
  2. Procédé selon la revendication précédente, où la topologie est déterminée par des appareils de champ en technique d'automatisation pour un réseau de données (30) industriel.
  3. Unité centrale (40) destinée à être raccordée à un réseau de données (30) avec un composant initial (AK) et au moins un composant terminal (EK),
    caractérisée en ce que des moyens de détermination (60) sont présents, lesquels sont prévus pour l'exécution d'un procédé de détermination d'une topologie selon la revendication 1 ou 2.
  4. Unité centrale (40) selon la revendication 3, où des moyens de préparation (70) sont présents pour la représentation de la topologie sur un écran (70) ou pour la transmission à un ordinateur de commande (72) des données topologiques structurées.
EP08015041.0A 2008-08-26 2008-08-26 Procédé de détermination d'une topologie, composants de réseau et unité centrale Active EP2159959B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP08015041.0A EP2159959B1 (fr) 2008-08-26 2008-08-26 Procédé de détermination d'une topologie, composants de réseau et unité centrale

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP08015041.0A EP2159959B1 (fr) 2008-08-26 2008-08-26 Procédé de détermination d'une topologie, composants de réseau et unité centrale

Publications (2)

Publication Number Publication Date
EP2159959A1 EP2159959A1 (fr) 2010-03-03
EP2159959B1 true EP2159959B1 (fr) 2013-06-19

Family

ID=40239726

Family Applications (1)

Application Number Title Priority Date Filing Date
EP08015041.0A Active EP2159959B1 (fr) 2008-08-26 2008-08-26 Procédé de détermination d'une topologie, composants de réseau et unité centrale

Country Status (1)

Country Link
EP (1) EP2159959B1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2466406B1 (fr) 2010-12-15 2016-03-02 Siemens Aktiengesellschaft Procédé de génération automatique de groupes de "dynamic frame packing"
DE102011011587A1 (de) 2011-02-17 2012-08-23 Phoenix Contact Gmbh & Co. Kg Portunabhängiges topologisch geplantes Echtzeitnetzwerk

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5297138A (en) 1991-04-30 1994-03-22 Hewlett-Packard Company Determining physical topology across repeaters and bridges in a computer network
DE10046312B4 (de) * 2000-09-19 2004-02-26 Siemens Ag Verfahren zur Ermittlung von Netzwerktopologien
EP1780943A1 (fr) 2005-10-31 2007-05-02 Hewlett-Packard Development Company, L.P. Découverte de ISO couche-2 topologie

Also Published As

Publication number Publication date
EP2159959A1 (fr) 2010-03-03

Similar Documents

Publication Publication Date Title
EP3522482B1 (fr) Procédé de communication de données dans un réseau industriel, procédé de commande, dispositif, programme informatique et support lisible par ordinateur
EP2625822B1 (fr) Procédé pour configurer un ou plusieurs appareils dans un réseau de communication basé sur ethernet
DE69434330T2 (de) Übertragungsvorrichtgung und verfahren
EP3183851A1 (fr) Noeud de distribution, réseau d'automatisation et procédé de transmission de paquets de données sensibles au temps réel et non sensibles au temps réel
WO2003067853A2 (fr) Systeme et procede pour analyser un reseau et/ou produire la topologie d'un reseau
EP2269347A2 (fr) Procédé et ensemble filtre pour filtrer des messages entrant par un bus de données sériel chez un abonné d'un réseau de communication
EP3577871B1 (fr) Procédé et dispositif permettant l'orientation modulaire d'un flux avb
EP3932020B1 (fr) Procédé de routage de télégrammes dans un réseau d'automatisation, structure de données, réseau d'automatisation et répartiteur de réseau
EP1729454B1 (fr) Dispositif et procédé pour une transmission combinée de données d'entrée-sortie dans des systèmes bus d'automatisation
DE102017125086A1 (de) Datenübertragungsverfahren und Kommunikationsnetzwerk
EP3008859B2 (fr) Abonné d'un réseau
DE102014105207B4 (de) Verfahren zum Betreiben eines Kommunikationsnetzwerks und Kommunikationsnetzwerk
EP2895925B1 (fr) Système de bus de terrain en cascade
DE602004001837T2 (de) Flugtestdatenvermittlungsanlage mit Paketformat
EP3042473A1 (fr) Procédé de transmission de messages dans un réseau d'ordinateurs ainsi que réseau d'ordinateurs
EP2159959B1 (fr) Procédé de détermination d'une topologie, composants de réseau et unité centrale
DE102014210505A1 (de) Übertragungseinheit mit Prüffunktion
WO2012110541A1 (fr) Procédé de transmission de données par le biais d'un bus de données série synchrone
WO2020211921A1 (fr) Procédé de transmission de données, nœuds de réseau, réseau, programme informatique et support lisible par ordinateur
EP3654594A1 (fr) Procédé de transmission de données, appareil de communication, programme informatique et support lisible par ordinateur
EP3632054B1 (fr) Determination de noeuds d'un bus de données local
DE102021122684A1 (de) Verfahren zum betreiben eines netzwerks
WO2020164810A1 (fr) Procédé de transmission de données, appareil, programme d'ordinateur et support lisible par ordinateur
WO2012052270A2 (fr) Réseau
EP3963839B1 (fr) Distributeur de réseau, réseau d'automatisation et procédé de transmission de données dans un réseau d'automatisation

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 HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA MK RS

17P Request for examination filed

Effective date: 20100809

17Q First examination report despatched

Effective date: 20100830

AKX Designation fees paid

Designated state(s): DE FR GB IT

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

Owner name: PHOENIX CONTACT GMBH & CO. KG

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 502008010137

Country of ref document: DE

Representative=s name: BLUMBACH ZINNGREBE, DE

Ref country code: DE

Ref legal event code: R082

Ref document number: 502008010137

Country of ref document: DE

Representative=s name: BLUMBACH ZINNGREBE PATENT- UND RECHTSANWAELTE , DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 502008010137

Country of ref document: DE

Effective date: 20130814

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 502008010137

Country of ref document: DE

Effective date: 20140320

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 502008010137

Country of ref document: DE

Representative=s name: BLUMBACH ZINNGREBE PATENTANWAELTE PARTG MBB, DE

Ref country code: DE

Ref legal event code: R082

Ref document number: 502008010137

Country of ref document: DE

Representative=s name: BLUMBACH ZINNGREBE, DE

Ref country code: DE

Ref legal event code: R081

Ref document number: 502008010137

Country of ref document: DE

Owner name: PHOENIX CONTACT GMBH & CO. KG, DE

Free format text: FORMER OWNERS: PHOENIX CONTACT GMBH & CO. KG, 32825 BLOMBERG, DE; SIEMENS AKTIENGESELLSCHAFT, 80333 MUENCHEN, DE

Ref country code: DE

Ref legal event code: R082

Ref document number: 502008010137

Country of ref document: DE

Representative=s name: BLUMBACH ZINNGREBE PATENT- UND RECHTSANWAELTE , DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20170914 AND 20170920

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

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

Ref country code: FR

Payment date: 20190827

Year of fee payment: 12

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

Ref country code: GB

Payment date: 20190829

Year of fee payment: 12

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

Ref country code: IT

Payment date: 20200820

Year of fee payment: 13

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

Effective date: 20200826

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

Effective date: 20200831

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 502008010137

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012240000

Ipc: H04L0041000000

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210826

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230525

P02 Opt-out of the competence of the unified patent court (upc) changed

Effective date: 20230531

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

Ref country code: DE

Payment date: 20231027

Year of fee payment: 16