EP4211873A1 - Procédé pour faire fonctionner un réseau - Google Patents

Procédé pour faire fonctionner un réseau

Info

Publication number
EP4211873A1
EP4211873A1 EP21770212.5A EP21770212A EP4211873A1 EP 4211873 A1 EP4211873 A1 EP 4211873A1 EP 21770212 A EP21770212 A EP 21770212A EP 4211873 A1 EP4211873 A1 EP 4211873A1
Authority
EP
European Patent Office
Prior art keywords
time
network
time slots
data packets
communication
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.)
Pending
Application number
EP21770212.5A
Other languages
German (de)
English (en)
Inventor
Arne KAUFMANN
Lukas WÜSTENEY
René HUMMEN
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.)
Hirschmann Automation and Control GmbH
Original Assignee
Hirschmann Automation and Control GmbH
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 Hirschmann Automation and Control GmbH filed Critical Hirschmann Automation and Control GmbH
Publication of EP4211873A1 publication Critical patent/EP4211873A1/fr
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H04L49/253—Routing or path finding in a switch fabric using establishment or release of connections between ports
    • H04L49/254—Centralised controller, i.e. arbitration or scheduling
    • 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
    • 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/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • 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/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H04L12/4645—Details on frame tagging
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/36—Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]
    • H04L47/365—Dynamic adaptation of the packet size
    • 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 present invention relates to a method for operating a network, in particular an automation network.
  • the method should be suitable for integrating components of an automation network into an existing multifunctional network, for example into an Ethernet network, in particular into a fieldbus network which is designed as an Ethernet bus.
  • TSN was developed to enable time-sensitive data transmissions in a network. TSN functions also make transmission times predictable.
  • the TSN network is standardized under IEEE 802.1. In which.
  • Example of a SERCOS III network the packet size of the data to be sent and/or received can be determined at the start of communication between two participants in the network. Since at the beginning of the communication it is not yet certain how much data will actually be sent, the packet size of the data is initially maximized.
  • the packet size can then be adapted to the amount of data during communication in order to optimize communication in the network.
  • the setting of the packet size is a tool for planning the data transmission.
  • time slots are provided for the data packets, within which the data packets are sent.
  • the individual time slots can then be added to calculate the total communication time, since all data packets are sent or received within these time slots.
  • a correspondingly known communication in an automation network is known, for example, from WO 2018/215209 A1.
  • the devices are mainly connected in a line topology and made possible by appropriate communication using data telegrams.
  • a method for industrial communication via TSN is also known from WO 2017/093014 A1.
  • basic communications and protocols in a TSN-enabled network are disclosed.
  • EP 1 193 926 A2 discloses an automation network with data communication that uses time slots. Changing the data packets within the time slots is also disclosed.
  • US 2011/0182300 A1 further discloses a network using time slots.
  • the individual data packets can be transferred to other time slots.
  • this procedure carries the risk that the time range required when moving is already occupied by another data stream.
  • the object of the present invention is therefore to integrate an automation network into an existing network, in particular into a TSN network.
  • the data transmission should be time-optimized with regard to the communication between network participants.
  • a method is thus proposed for operating a network with a number of participants and at least one switch.
  • the switch serves as a node in the network and can send or receive data in the old directions of the node.
  • the switch also contains programmable logic that can store and use the relationships to the other participants in the network.
  • the network also includes at least two end devices and a controller.
  • the controller is also referred to as the master in an automation network.
  • the controller can send data to a specific end device via an application protocol in order to control it.
  • the application protocol is implemented via the application layer of the OSI network model. This means that communication is implemented via the application protocol in OSI layer 7.
  • the data sent in this way is divided into data packets in accordance with the specification for Internet networks and sent via the data link layer of the network.
  • the data packets are thus transmitted in layer 2 as frames or in layer 3 as packets.
  • the data is advantageously sent as a TSN data stream.
  • time slots are now provided for sending and/or receiving the data.
  • these time slots are initially adapted to a maximum and/or minimum or any other conceivable packet size or number of packets.
  • the amount of data that is to be sent is not yet certain, so that the time slots are initially set to the maximum packet size or number of packets.
  • the time slots each contain a time start and a time end.
  • old time slots have a propagation time, by means of which the transmission time of the data can be calculated, namely by adding the propagation times of the time slots.
  • the transmission time of the data can be calculated purely from the transmission speed and data volume and is not influenced by the time slots.
  • the initiation of the communication can take place via an authorized participant in the network.
  • this participant When using a SERCOS III network, this participant will usually be a controller or master.
  • the packet size of the data packets can be optimized during communication. This means that the initial packet size is reduced or increased during communication within the limits of the minimum and maximum packet size and number of packets. This changes the occupancy of the available time slot by the data packet. As a result, the entire transmission either takes longer (with a larger amount of data) or the transmission is shortened (due to a reduced amount of data).
  • the oversized time slots ensure that communication is not artificially slowed down, for example by planning for a reduced packet size.
  • the reservation of the time slots can be optimized. So far it is only known that the time slot ends are adapted to the communication requirements, since the initial reservation has previously set the time slot start to the maximum packet size. This creates Intervals in which the packets have to pause on the switches until the next time slot begins.
  • Optimizing such gaps would mean moving all time slots forward. This means that the communication duration changes on the fly, which is known as jitter. Such jitter should be avoided in streaming applications in particular, as it prevents effective data transmission and causes gaps or dropouts at the receiver. In the case of a SERGOS III network, this will go into an error state as soon as jitter occurs.
  • time slots are initially designed for the minimum and/or maximum packet size, it is possible not only to shift the time ends, but also the time starts. Because of the overdimensioning of the time slots at the beginning of the communication, the time slots can now overlap in time and the start of the time slot is before the start of the data packets actually sent.
  • these can preferably be adapted to the minimum packet size to be expected. This is done by selecting the start of time for the individual time slots in such a way that the following time slot has a start of time which corresponds to the minimum packet size to be expected.
  • time slots overlap in time, a gap between the individual data packets can be avoided when the data packets are reduced in size.
  • the time slots can then be adjusted to the packet size of the data packets via the start and end of time.
  • the adaptation of the time slots is therefore not time-critical in the claimed method. Accordingly, the change in packet size can be decoupled from the adjustment of the time slots, without a jitter effect or an error condition occurring.
  • the control of the data packets and their size is carried out using a protocol in layer 2 or 3 of the OSI model, so that the application protocol does not recognize the optimization of the data transmission.
  • the switches should be placed at the nodes of the networks, preferably between the controller and end devices. As a result, different topologies can be interconnected in a network from these nodes.
  • the end devices of the automation networks can be connected in series, depending on the topology in a ring or in a line. This also corresponds to the normal function of an automation network. In principle, several automation networks can thus be connected together in one network using the switches, with subscribers who do not belong to the automation network also being able to participate in the same network.
  • controllers and terminals are participants in an automation bus. This bus is then operated as an automation network with Ethernet specification.
  • the number of controllers and end devices in the network is not limited.
  • routers also contain the functions of a switch.
  • Other participants such as PCs, servers and/or hubs, can also be present.
  • controller and/or the switch (or the router) be configured by a network management system, which is preferably implemented as software, in order to be able to carry out the desired flow of the data from a network subscriber to the terminal device. Further characteristics can be found in the attached drawing. It shows
  • Figure 1 Block diagram of the previous problem of a packet size change
  • FIG. 2 Block diagram of the method according to the invention
  • FIG. 1 shows a schematic representation of part of a communication in a network.
  • the data to be transmitted is divided into data packets and sent or received in the currently available bandwidth of the network.
  • the data packets are shown in FIG. 1 as obliquely hatched areas. It is shown as an example that the communication contains three data packets, which are sent or received via different cycles of the network.
  • the term cycle is understood according to IEEE 802.1 Q (“Time-Aware Shaping”).
  • the cycles are shown here as dotted areas and can be addressed via three switches 10, 11, 12.
  • Time slots are provided for the data packets, which are represented by vertical hatching. At the start of communication, these time slots are set to the maximum packet size. The time starts of the time slots are therefore the same as the start of the data packets. The time ends of the time slots are possibly larger than the time ends of the data packets due to the maximum size assumption. The maximum packet size is determined by the amount of data and the available bandwidth. This is standardized in the IEEE 802.1Qbv.
  • the respective packet size of the data packets is changed to a temporal optimum. This shortens the data packets, which is shown in step 1.
  • the individual time slots are designed to be contiguous, which means that the end of a time slot represents the start of another time slot at the same time. This results in end-to-end communication. In the case of reduced data packets, however, the available bandwidth is not used effectively.
  • the time slots can be shortened by adapting the time ends of the time slots to the time ends of the data packets. This is shown in step 2.
  • this leads to gaps in the data stream during communication, which is known as the jitter effect and causes errors in the network. In the case of a SERCOS III network, this causes an error condition.
  • step 3 The time slots must therefore be offset or shifted so that a coherent data stream is created again. This is shown in step 3.
  • steps 2 and 3 would have to be carried out together (at the same time), which corresponds to step 4 but cannot be implemented in practice, since the shifting of a time slot is also subject to errors. Due to a shift, a time slot could end up in a time range that has already been reserved.
  • FIG. 2 shows the solution approach according to the invention for the aforementioned problem.
  • time slots are also generated at the start of communication, which are adapted to the maximum possible packet sizes.
  • the time slots are designed in such a way that they overlap. A continuous data stream is ensured by the different time starts of the data packets within the time slots. The time starts of the time slots are therefore no longer identical to the time starts of the data packets.
  • step 5 If the data packets are now reduced in size, the overlapping of the time slots can still ensure a continuous data stream without an error situation occurring. This is shown in step 5.
  • step 6 it is proposed to adapt the time slots to the reduced data packets in such a way that not only the time ends of the time slots are adapted to the data packets, but also the time starts. This is shown in step 6.
  • This method enables the size of the data packets to be optimized without having to shift the time slots.
  • the adaptation of the time slots to the data packets is also decoupled from the reduction in the size of the data packets, so that a possible source of error is eliminated.
  • the method is explained in FIG. 3 using SERCOS III operation phases.
  • the communication with SERCOS III is initialized (NRT) and then in direction M the topology of the network is defined according to the application protocol (CPO).
  • CPO application protocol
  • the configuration is then loaded and executed in direction S (CP1).
  • the data packet size is defined and optimized during communication (CP2).
  • the end devices which act as communication receivers, are sensitive to jitter from this point onwards.
  • CP3 includes the actual communication with optimized packet sizes.
  • CP4 terminates the communication and enables the next communication, which works on the same principle.
  • the initial packet size and time slot size is defined from CP2 and optimized between CP2 and CP3 (see steps 5 and 6 from FIG. 2).
  • a router or server could be used instead of at least one switch.
  • Other participants such as PCs or hubs could also be used.

Landscapes

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

Abstract

L'invention concerne un procédé pour faire fonctionner un réseau avec plusieurs participants dans le réseau. À cet effet, le réseau comprend au moins un commutateur (10, 11, 12), au moins deux terminaux, et au moins un dispositif de commande. Selon l'invention, le dispositif de commande peut communiquer avec l'un des terminaux par l'intermédiaire d'un protocole d'application. À cet effet, des données sont transmises et/ou reçues sous forme de paquets de données. Pour permettre une planification temporelle de la communication, des créneaux temporels sont prévus pour l'émission des paquets de données, ces créneaux temporels étant adaptés à la taille de paquet la plus grande possible. À cet effet, les créneaux temporels ont un début et une fin qui peuvent se chevaucher dans des branches différentes du réseau. Afin d'optimiser le temps de communication, les tailles de paquets (5) peuvent être modifiées. Pour éviter de gaspiller de la bande passante dans le réseau, les créneaux temporels sont adaptés (6) à la taille de paquet de manière correspondante par modification des débuts et des fins.
EP21770212.5A 2020-09-07 2021-09-02 Procédé pour faire fonctionner un réseau Pending EP4211873A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102020123275 2020-09-07
PCT/EP2021/074225 WO2022049175A1 (fr) 2020-09-07 2021-09-02 Procédé pour faire fonctionner un réseau

Publications (1)

Publication Number Publication Date
EP4211873A1 true EP4211873A1 (fr) 2023-07-19

Family

ID=77774910

Family Applications (3)

Application Number Title Priority Date Filing Date
EP21770210.9A Pending EP4211871A1 (fr) 2020-09-07 2021-09-02 Procédé pour faire fonctionner un réseau
EP21770211.7A Pending EP4211872A1 (fr) 2020-09-07 2021-09-02 Procédé pour faire fonctionner un réseau
EP21770212.5A Pending EP4211873A1 (fr) 2020-09-07 2021-09-02 Procédé pour faire fonctionner un réseau

Family Applications Before (2)

Application Number Title Priority Date Filing Date
EP21770210.9A Pending EP4211871A1 (fr) 2020-09-07 2021-09-02 Procédé pour faire fonctionner un réseau
EP21770211.7A Pending EP4211872A1 (fr) 2020-09-07 2021-09-02 Procédé pour faire fonctionner un réseau

Country Status (5)

Country Link
US (3) US20230291695A1 (fr)
EP (3) EP4211871A1 (fr)
CN (3) CN116018785A (fr)
DE (3) DE102021122686A1 (fr)
WO (3) WO2022049173A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116708536B (zh) * 2023-08-09 2023-10-24 江苏中威科技软件系统有限公司 一种基于雾计算的跨平台终端互联的通讯协议实现的方法

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6717956B1 (en) * 2000-03-03 2004-04-06 Luminous Networks, Inc. Dual-mode virtual network addressing
DE10047925A1 (de) 2000-09-27 2002-05-02 Siemens Ag Verfahren zur Echtzeitkommunikation zwischen mehreren Netzwerkteilnehmern in einem Kommunikationssystem mit Ethernet-Physik sowie korrespondierendes Kommunikationssystem mit Ethernet-Physik
DE10254580A1 (de) * 2002-11-22 2004-06-03 Robert Bosch Gmbh Verfahren und Vorrichtung zur Übertragung von Daten in Nachrichten auf einem Bussystem
DE10319323B3 (de) * 2003-04-29 2004-12-16 Siemens Ag Verfahren zur automatischen Konfiguration einer Kommunikationseinrichtung
CN101512944A (zh) * 2006-09-06 2009-08-19 Nxp股份有限公司 网络和时间触发网络中集群时钟同步的方法
US9143349B2 (en) * 2008-09-19 2015-09-22 Lantiq Deutschland Gmbh Configurable media access controller
US8295287B2 (en) 2010-01-27 2012-10-23 National Instruments Corporation Network traffic shaping for reducing bus jitter on a real time controller
DE102014100628B4 (de) * 2013-01-21 2016-08-18 Voice Inter Connect Gmbh Bussystem und Verfahren zur Übertragung von Daten in Echtzeit
DE102013211406A1 (de) * 2013-06-18 2014-12-18 Siemens Aktiengesellschaft Kommunikationsgerät zur Verbindung eines Feldgeräts eines industriellen Automatisierungssystems mit einer ausfallgesicherten Steuerungseinheit und industrielles Automatisierungssystem
US9936003B1 (en) * 2014-08-29 2018-04-03 Cavium, Inc. Method and system for transmitting information in a network
DE102014226994A1 (de) * 2014-12-29 2016-06-30 Robert Bosch Gmbh Kommunikationssystem zum Betreiben eines Datennetzwerks
CN104703273B (zh) * 2015-03-17 2016-01-20 中南大学 一种Quorum时隙自适应调整的同步无线传感器网络MAC方法
WO2017092879A1 (fr) 2015-11-30 2017-06-08 Siemens Aktiengesellschaft Procédé de communication industrielle par protocole tsn
DE102017208735A1 (de) 2017-05-23 2018-11-29 Siemens Aktiengesellschaft Verfahren und Vorrichtung zum Schutz einer Kommunikation zwischen mindestens einer ersten Kommunikationseinrichtung und wenigstens einer zweiten Kommunikationseinrichtung insbesondere innerhalb eines Kommunikationsnetzwerkes einer industriellen Fertigung und/oder Automatisierung
EP3448000A1 (fr) * 2017-08-23 2019-02-27 Siemens Aktiengesellschaft Procédé de génération d'un identificateur d'adressage unique pour un flux de données d'une application dans un réseau compatible avec les normes tsn et dispositif correspondant
EP3522477B1 (fr) * 2018-01-31 2021-08-11 Siemens Aktiengesellschaft Procédé de communication de données dans un dispositif de réseau à base d'ethernet, en particulier industriel, destiné à la mise en uvre dudit procédé, programme informatique ainsi que support lisible par ordinateur
US20210392084A1 (en) * 2018-11-13 2021-12-16 Abb Schweiz Ag Transmission Of Packets Over A TSN Aware Network
DE102018129809A1 (de) 2018-11-26 2020-05-28 Beckhoff Automation Gmbh Verteilerknoten, Automatisierungsnetzwerk und Verfahren zum Übertragen von Telegrammen
EP3672163A1 (fr) * 2018-12-20 2020-06-24 Siemens Aktiengesellschaft Procédé de communication de données, appareil de communication, programme informatique et support lisible par ordinateur
US11039409B2 (en) * 2018-12-27 2021-06-15 Qualcomm Incorporated Network coordination
EP3697034A1 (fr) 2019-02-14 2020-08-19 Siemens Aktiengesellschaft Procédé de transmission des données, appareil, programme informatique et support lisible par ordinateur
DE102019114309A1 (de) 2019-05-28 2020-12-03 Beckhoff Automation Gmbh Verfahren zum Routen von Telegrammen in einem Automatisierungsnetzwerk, Datenstruktur, Automatisierungsnetzwerk und Netzwerkverteiler
CN111490842A (zh) * 2020-03-23 2020-08-04 腾讯科技（深圳）有限公司 时间同步方法、装置、计算机可读介质及电子设备
CN111600754B (zh) * 2020-05-11 2022-02-25 重庆邮电大学 一种面向tsn和非tsn互联的工业异构网络调度方法

Also Published As

Publication number Publication date
WO2022049173A1 (fr) 2022-03-10
EP4211871A1 (fr) 2023-07-19
EP4211872A1 (fr) 2023-07-19
DE102021122686A1 (de) 2022-03-10
WO2022049174A1 (fr) 2022-03-10
US20230291695A1 (en) 2023-09-14
CN116018785A (zh) 2023-04-25
DE102021122685A1 (de) 2022-03-10
DE102021122684A1 (de) 2022-03-10
CN116018786A (zh) 2023-04-25
US20230336380A1 (en) 2023-10-19
WO2022049175A1 (fr) 2022-03-10
CN116057897A (zh) 2023-05-02
US20230362033A1 (en) 2023-11-09

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
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
WO2019001718A1 (fr) Procédé de réservation de voies de transmission redondantes au maximum pour la transmission de paquets de données et dispositif
EP3622692A1 (fr) Procédé de transmission performante de données dans un réseau de données, à conditions en partie en temps réel, et dispositif de mise en oeuvre dudit procédé
EP3577871B1 (fr) Procédé et dispositif permettant l'orientation modulaire d'un flux avb
DE60013950T2 (de) Netzwerk-Synchronisiersystem und Netzwerk-Synchronisierverfahren
EP3679691A1 (fr) Procédé de transmission de données et réseau de communication
WO2016045885A1 (fr) Procédé de transmission de données et nœud de réseau associé et réseau associé
EP4211873A1 (fr) Procédé pour faire fonctionner un réseau
EP1826646B1 (fr) Procédé, noeud et réseau destinés à l'envoi cyclique de télégrammes par Ethernet
WO2011147653A1 (fr) Procédé et dispositif d'échange de données entre deux appareils d'un réseau d'automatisation
EP1540905B1 (fr) Procede de transmission de messages de donnees dans un systeme de communication cyclique commute
WO2000070822A2 (fr) Reseau et appareil de couplage pour relier deux segments dans un reseau de ce type et noeuds de reseau
EP3556060A1 (fr) Procédé d'optimisation de la reconnaissance de défaillance des protocoles de redondance contenant des paquets de données d'essai
DE102011088812A1 (de) Verfahren zum Übertragen von Nutzdaten
EP4026276A1 (fr) Procédé de transmission de données, télégramme de segment et réseau de communication d'automatisation
EP2355609B1 (fr) Procédé de commande d'un système de réseau, système de réseau et programme informatique
EP3758310A1 (fr) Procédé de communication de données, dispositif de commande de réseau, réseau, programme informatique et support lisible par ordinateur
EP1371193B1 (fr) Circuit electronique et procede pour interface de communication a memoire tampon pseudo-transit
WO2019145297A1 (fr) Procédé de communication de données dans un réseau, en particulier industriel, basé ethernet dispositif pour la mise en oeuvre dudit procédé ainsi que programme informatique et support lisible par ordinateur
WO2020169280A1 (fr) Procédé de transmission de données, appareil, programme d'ordinateur et support lisible par ordinateur
WO2020020579A1 (fr) Procédé de transmission de données temporellement critiques à l'intérieur d'un système de communication pour système d'automatisation industrielle et système de communication
EP1453230A2 (fr) Synchronisation dans un réseau de données à commutation
DE102011118046A1 (de) Synchronisationsgerät und -verfahren zur Synchronisation von Datenpaketen in einem Feldbusnetz

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20230222

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

RIN1 Information on inventor provided before grant (corrected)

Inventor name: HUMMEN, RENE

Inventor name: BECHTEL, LUKAS

Inventor name: KAUFMANN, ARNE

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)