US20230291695A1 - Method of operating a network - Google Patents

Method of operating a network Download PDF

Info

Publication number
US20230291695A1
US20230291695A1 US18/019,927 US202118019927A US2023291695A1 US 20230291695 A1 US20230291695 A1 US 20230291695A1 US 202118019927 A US202118019927 A US 202118019927A US 2023291695 A1 US2023291695 A1 US 2023291695A1
Authority
US
United States
Prior art keywords
network
time slots
data packets
time
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
US18/019,927
Inventor
Arne Kaufmann
Lukas WUESTENEY
Rene 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
Assigned to HIRSCHMANN AUTOMATION AND CONTROL GMBH reassignment HIRSCHMANN AUTOMATION AND CONTROL GMBH ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: HUMMEN, RENE, KAUFMANN, Arne, WUESTENEY, LUKAS
Publication of US20230291695A1 publication Critical patent/US20230291695A1/en
Assigned to HIRSCHMANN AUTOMATION AND CONTROL GMBH reassignment HIRSCHMANN AUTOMATION AND CONTROL GMBH ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: HUMMEN, RENE, KAUFMANN, Arne, BECHTEL, Lukas
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • H04L49/253Routing or path finding in a switch fabric using establishment or release of connections between ports
    • H04L49/254Centralised controller, i.e. arbitration or scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40Bus networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46Interconnection of networks
    • H04L12/4641Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46Interconnection of networks
    • H04L12/4641Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H04L12/4645Details on frame tagging
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/36Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]
    • H04L47/365Dynamic adaptation of the packet size
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40Bus networks
    • H04L2012/4026Bus for use in automation systems

Definitions

  • the present invention relates to a method of operating a network, in particular an automation network.
  • the method is intended to be usable for integrating components of an automation network into an existing multifunction network, for example into an Ethernet network, in particular into a fieldbus network designed as an Ethernet bus.
  • TSN was developed to enable time-sensitive data transfers in a network. TSN functions also make transmission times predictable.
  • the TSN network is standardized under IEEE 802.1.
  • the packet size of the data to be sent and/or received can be specified at the start of a communication between two nodes in the network. Since it is not yet known at the beginning of the communication how much data will be sent at all, the packet size of the data is initially maximized.
  • the packet size can then be adjusted to the amount of data in order to optimize communication in the network.
  • the setting of the packet size is an aid to the predictability of 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 together to calculate the total communication time, because 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 [U.S. Pat. No. 11,336,657].
  • the devices are mainly connected in a line topology and enabled by corresponding communication through data telegrams.
  • WO 2017/093014 [U.S. Pat. No. 11,153,416] also discloses a method for industrial communication via TSN. Here, basic communications and protocols in a TSN-enabled network are disclosed.
  • EP 1 198 926 [U.S. Pat. No. 7,272,152] 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 [U.S. Pat. No. 8,295,287] further discloses a network using time slots.
  • the individual data packets can be transferred to other time slots.
  • this method involves the risk that the time slot required for transfer is already occupied by another data stream.
  • the object of the present invention is thus to integrate an automation network into an existing network, in particular into a TSN network. Furthermore, the data transmission is to be time-optimized with respect to the communication between network nodes.
  • a method for operating a network with several subscribers and at least one switch serves as a node in the network and can send or receive data in all directions of the node. Furthermore, the switch includes programmable logic that can store and use the relationships to the other subscribers in the network.
  • the network contains at least two terminals and a controller.
  • the controller is also referred to as the master in an automation network.
  • the controller can send data to a specific terminal 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 via the application protocol is implemented in OSI layer 7.
  • the data sent in this way is divided into data packets and sent via the network's link layer.
  • the data packets are thus transmitted in layer 2 as frames or in layer 3 as packets.
  • the data is sent as a TSN data stream.
  • the data stream of the sent and/or received data is provided with time-sensitive features according to IEEE 802.1.
  • time slots are now provided for sending and/or receiving the data. These time slots are initially adjusted to a maximum and/or minimum or any other conceivable packet size or number of packets when a communication is initiated. At the beginning of a communication, the amount of data to be sent is not yet fixed, so that the time slots are first set to the maximum packet size or number of packets.
  • the time slots each contain a start time and an end time.
  • all time slots have a runtime from which the transmission time of the data can be calculated, namely by adding the runtimes of the time slots.
  • the transmission time of the data can be calculated purely by the transmission speed and data quantity and is not influenced by the time slots.
  • the initiation of the communication can be done by an authorized subscriber in the network.
  • this subscriber When using a SERCOS III network, this subscriber will usually be a controller or master.
  • the packet size of the data packets can be optimized. 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 (due to a larger data volume) or is shortened (due to a reduced data volume).
  • the oversized time slots ensure that communication is not artificially slowed down, for example, by already scheduling a reduced packet size.
  • the reservation of the time slots can be optimized. Up to now, it is only known that the time slot ends are adapted to the communication demand, since up to now the initial reservation has set the time slot start to the maximum packet size. This creates gaps in which the packets on the switches have to pause until the next time slot starts.
  • Optimizing such gaps would mean that all time slots would be moved forward. This means that the communication duration changes during operation, which is known as jitter. In streaming applications in particular, such jitter must be avoided, since it prevents effective data transmission on the one hand and causes gaps or dropouts at the receiver on the other. In the case of a SERCOS III network, it will enter an error state as soon as jitter occurs.
  • the reduced time slots must be shifted.
  • the reduction and shifting of the time slots must actually happen simultaneously, which has not been practically possible so far.
  • time slots are initially designed for the minimum and/or maximum packet size, it is possible to shift not only the end times but also the start times. This is because the oversizing of the time slots at the start of communication means that the time slots can now overlap in time and the start times of the time slots are before the start time of the data packets actually sent.
  • the time slots For overlapping the time slots, they can preferably be adapted to the minimum packet size to be expected. This is done by selecting the start times of the individual time slots in such a way that the subsequent time slot has a start time that corresponds to the minimum packet size to be expected.
  • time slots overlap in time means that a gap can be avoided between the individual data packets when they are reduced in size.
  • the time slots can then be adapted to the packet size of the data packets via the start and end times.
  • control of the data packets and their size is performed by 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 located at the nodes of the networks, preferably between the controller and the terminals. This allows different topologies to be interconnected in a network starting at these nodes.
  • the terminals of the automation networks can be connected in series, in a ring or in a line, depending on the topology. This also corresponds to the normal function of an automation network.
  • several automation networks can thus be interconnected in a network by the switches so that subscribers not belonging to the automation network can also be part of the same network.
  • controller and the terminals are parts of an automation bus.
  • This bus is then operated as an automation network with Ethernet specification.
  • the number of controllers and terminals in the network is not limited.
  • routers As a special embodiment, it is possible to replace the switches with routers, since routers also include the functions of switches. Also, further subscribers such as PCs, servers and/or hubs can be present.
  • a network management that is preferably software, in order to be able to perform the desired progression of data from a network subscriber to the terminal.
  • FIG. 1 is a block diagram of the previous problem of a packet size change
  • FIG. 2 is a block diagram of the process according to the invention.
  • FIG. 3 shows operation phases using the example of a SERCOS III network
  • FIG. 1 is 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 the figure as diagonally shaded areas.
  • the communication contains three data packets that are sent and received over different cycles of the network.
  • the term cycle is understood according to IEEE 802.1Q (“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 that are represented by vertical hatching. At the start of communication, these time slots are set to the maximum packet size. This means that the start times of the time slots correspond to the start times of the data packets. The end times of the time slots may be later than the end times of the data packets due to the maximum-size assumption. The maximum packet size is thus determined by the amount of data and the available bandwidth. This is standardized in IEEE 802.1Qbv.
  • the individual time slots are designed to be contiguous, which means that the end of one time slot simultaneously represents the start of another time slot. Thus, this results in continuous communication. In the case of the reduced data packets, however, the available bandwidth is not effectively utilized.
  • the time slots can be shortened by matching the end times of the time slots to the end times of the data packets. This is illustrated in step 2 .
  • this causes 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 be offset or shifted so that a coherent data stream is created again. This is shown in step 3 .
  • step 2 and 3 would have to be executed together (at the same time), which corresponds to step 4 , but is practically not feasible, since the shifting of a time slot is also error-prone. A shift could cause a time slot to enter a time slot that has already been reserved.
  • FIG. 2 shows the solution to the above problem according to the invention.
  • time slots are also generated at the start of communication and 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 start times of the data packets within the time slots. Thus, the start times of the time slots are no longer identical to the start times of the data packets.
  • step 5 If the data packets are now reduced in size, the overlap of the time slots can still ensure a continuous data stream without an error condition occurring. This is shown in step 5 .
  • step 6 it is proposed to adapt the time slots to the reduced data packets, such that not only the end times of the time slots are adapted to the data packets, but also the start times. This is shown in step 6 .
  • This procedure enables optimization of the size of the data packets without having to shift the time slots. Also, the adaptation of the time slots to the data packets is decoupled from the reduction of the data packets, so that a possible source of error is eliminated.
  • FIG. 3 the procedure is explained on the basis of SERCOS III operation phases.
  • communication is initialized by means of SERCOS III (NRT) and then, toward M, the topology of the network is defined according to the application protocol (CP0).
  • CP0 application protocol
  • the configuration is loaded and executed (CP1).
  • the data packet size is defined and optimized during communication (CP2).
  • the terminals that act as communication receivers, are jitter-sensitive from this point on.
  • CP3 comprises the actual communication with optimized packet sizes.
  • CP4 terminates the communication and enables the next communication that works according to the same principle.
  • the process according to the invention is executed within the marked area. Accordingly, the initial packet size and time slot size are s determined from CP2 and optimized between CP2 and CP3 (see steps 5 and 6 from FIG. 2 ).
  • the present application is not limited to the previous features. Rather, further embodiments are conceivable. For example, instead of at least one switch, a router or a server could also be used. Also, further subscribers, such as PCs or hubs, could 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

A method is proposed for operating a network with several subscribers in the network. For this purpose, the network has at least one switch (10, 11, 12), at least two terminals and at least one controller. According to the invention, the controller can now communicate with one of the terminals via an application protocol. For this purpose, data is sent and/or received as data packets. In order to be able to schedule the communication, time slots are provided for sending the data packets that are adapted to a maximum possible packet size. For this purpose, the time slots have a start time and an end time so that they can overlap in different branches of the network. To optimize communication time, the packet sizes (5) can be changed. To avoid wasting bandwidth in the network, the time slots are adapted to the packet size accordingly by changing the start times and the end times (6).

Description

  • The present invention relates to a method of operating a network, in particular an automation network.
  • The method is intended to be usable for integrating components of an automation network into an existing multifunction network, for example into an Ethernet network, in particular into a fieldbus network designed as an Ethernet bus.
  • In existing automation networks, such as SERCOS III, there is often the restriction that devices of the automation network are the sole users of the network. And although the automation network is also designed as an Ethernet network, it is not trivial to integrate such an automation network into an existing network.
  • These difficulties consist of restrictions, for example in terms of network topology, which make integration into other networks difficult or impossible.
  • It should also become possible to integrate automation networks into TSN networks. TSN was developed to enable time-sensitive data transfers in a network. TSN functions also make transmission times predictable. The TSN network is standardized under IEEE 802.1.
  • In the example of a SERCOS III network, the packet size of the data to be sent and/or received can be specified at the start of a communication between two nodes in the network. Since it is not yet known at the beginning of the communication how much data will be sent at all, the packet size of the data is initially maximized.
  • During communication, the packet size can then be adjusted to the amount of data in order to optimize communication in the network. Especially when using a TSN network, the setting of the packet size is an aid to the predictability of the data transmission.
  • For this purpose, corresponding time slots are provided for the data packets, within which the data packets are sent. The individual time slots can then be added together to calculate the total communication time, because 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 [U.S. Pat. No. 11,336,657]. Here, the devices are mainly connected in a line topology and enabled by corresponding communication through data telegrams.
  • WO 2017/093014 [U.S. Pat. No. 11,153,416] also discloses a method for industrial communication via TSN. Here, basic communications and protocols in a TSN-enabled network are disclosed.
  • EP 1 198 926 [U.S. Pat. No. 7,272,152] 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 [U.S. Pat. No. 8,295,287] further discloses a network using time slots. The individual data packets can be transferred to other time slots. However, this method involves the risk that the time slot required for transfer is already occupied by another data stream.
  • The object of the present invention is thus to integrate an automation network into an existing network, in particular into a TSN network. Furthermore, the data transmission is to be time-optimized with respect to the communication between network nodes.
  • This object is attained by the features of the main claim.
  • A method is thus proposed for operating a network with several subscribers and at least one switch. The switch serves as a node in the network and can send or receive data in all directions of the node. Furthermore, the switch includes programmable logic that can store and use the relationships to the other subscribers in the network.
  • Also, the network contains at least two terminals and a controller. The controller is also referred to as the master in an automation network.
  • According to the invention, the controller can send data to a specific terminal 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 via the application protocol is implemented in OSI layer 7.
  • In accordance with the specification for Internet networks, the data sent in this way is divided into data packets and sent via the network's link layer. This means that the individual data packets are transmitted within the link layer or the network layer, i.e. layer 2 or 3 of the OSI model. The data packets are thus transmitted in layer 2 as frames or in layer 3 as packets.
  • Advantageously, the data is sent as a TSN data stream. This means that the data stream of the sent and/or received data is provided with time-sensitive features according to IEEE 802.1.
  • According to the invention, time slots are now provided for sending and/or receiving the data. These time slots are initially adjusted to a maximum and/or minimum or any other conceivable packet size or number of packets when a communication is initiated. At the beginning of a communication, the amount of data to be sent is not yet fixed, so that the time slots are first set to the maximum packet size or number of packets.
  • The time slots each contain a start time and an end time. Thus, all time slots have a runtime from which the transmission time of the data can be calculated, namely by adding the runtimes of the time slots. Alternatively or additionally, the transmission time of the data can be calculated purely by the transmission speed and data quantity and is not influenced by the time slots.
  • The initiation of the communication can be done by an authorized subscriber in the network. When using a SERCOS III network, this subscriber will usually be a controller or master.
  • During communication, the packet size of the data packets can be optimized. 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 (due to a larger data volume) or is shortened (due to a reduced data volume).
  • The oversized time slots ensure that communication is not artificially slowed down, for example, by already scheduling a reduced packet size. After the communication has been finally established and the application has negotiated the final data volume, the reservation of the time slots can be optimized. Up to now, it is only known that the time slot ends are adapted to the communication demand, since up to now the initial reservation has set the time slot start to the maximum packet size. This creates gaps in which the packets on the switches have to pause until the next time slot starts.
  • Optimizing such gaps would mean that all time slots would be moved forward. This means that the communication duration changes during operation, which is known as jitter. In streaming applications in particular, such jitter must be avoided, since it prevents effective data transmission on the one hand and causes gaps or dropouts at the receiver on the other. In the case of a SERCOS III network, it will enter an error state as soon as jitter occurs.
  • To avoid jitter, the reduced time slots must be shifted. To avoid the above-described error condition, the reduction and shifting of the time slots must actually happen simultaneously, which has not been practically possible so far.
  • However, because the time slots are initially designed for the minimum and/or maximum packet size, it is possible to shift not only the end times but also the start times. This is because the oversizing of the time slots at the start of communication means that the time slots can now overlap in time and the start times of the time slots are before the start time of the data packets actually sent.
  • For overlapping the time slots, they can preferably be adapted to the minimum packet size to be expected. This is done by selecting the start times of the individual time slots in such a way that the subsequent time slot has a start time that corresponds to the minimum packet size to be expected.
  • The fact that the time slots overlap in time means that a gap can be avoided between the individual data packets when they are reduced in size. The time slots can then be adapted to the packet size of the data packets via the start and end times.
  • The fact that no gap happens when data packets are reduced avoids the jitter effect and keeps a data stream contiguous. The adaptation of the time slots is therefore not time-critical in the claimed method. Accordingly, packet size change can happen decoupled from the adjustment of the time slots without any jitter effect or error condition occurring.
  • In this case, control of the data packets and their size is performed by 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 located at the nodes of the networks, preferably between the controller and the terminals. This allows different topologies to be interconnected in a network starting at these nodes.
  • The terminals of the automation networks can be connected in series, in a ring or in a line, depending on the topology. This also corresponds to the normal function of an automation network. In principle, several automation networks can thus be interconnected in a network by the switches so that subscribers not belonging to the automation network can also be part of the same network.
  • Preferably, it is suggested that the controller and the terminals are parts of an automation bus. This bus is then operated as an automation network with Ethernet specification. The number of controllers and terminals in the network is not limited.
  • As a special embodiment, it is possible to replace the switches with routers, since routers also include the functions of switches. Also, further subscribers such as PCs, servers and/or hubs can be present.
  • Preferably, it is proposed to configure the controller and/or the switch (or the router) by a network management that is preferably software, in order to be able to perform the desired progression of data from a network subscriber to the terminal.
  • Further features are shown in the attached drawing.
  • Therein:
  • FIG. 1 is a block diagram of the previous problem of a packet size change;
  • FIG. 2 is a block diagram of the process according to the invention; and
  • FIG. 3 shows operation phases using the example of a SERCOS III network;
  • FIG. 1 is 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 the figure as diagonally shaded areas. As an example, the communication contains three data packets that are sent and received over different cycles of the network. The term cycle is understood according to IEEE 802.1Q (“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 that are represented by vertical hatching. At the start of communication, these time slots are set to the maximum packet size. This means that the start times of the time slots correspond to the start times of the data packets. The end times of the time slots may be later than the end times of the data packets due to the maximum-size assumption. The maximum packet size is thus determined by the amount of data and the available bandwidth. This is standardized in IEEE 802.1Qbv.
  • To optimize communication times, respective packet sizes of the data packets are changed to a time optimum. This shortens the data packets as shown under step 1.
  • The shortening of the data packets and the time slots that have remained the same length so far result in time gaps between the individual data packets. The individual time slots are designed to be contiguous, which means that the end of one time slot simultaneously represents the start of another time slot. Thus, this results in continuous communication. In the case of the reduced data packets, however, the available bandwidth is not effectively utilized.
  • To use the bandwidth effectively, the time slots can be shortened by matching the end times of the time slots to the end times of the data packets. This is illustrated in step 2. However, this causes 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.
  • Therefore, the time slots must be offset or shifted so that a coherent data stream is created again. This is shown in step 3. To avoid the error condition, step 2 and 3 would have to be executed together (at the same time), which corresponds to step 4, but is practically not feasible, since the shifting of a time slot is also error-prone. A shift could cause a time slot to enter a time slot that has already been reserved.
  • FIG. 2 shows the solution to the above problem according to the invention. Here, time slots are also generated at the start of communication and are adapted to the maximum possible packet sizes. However, according to the invention, the time slots are designed in such a way that they overlap. A continuous data stream is ensured by the different start times of the data packets within the time slots. Thus, the start times of the time slots are no longer identical to the start times of the data packets.
  • If the data packets are now reduced in size, the overlap of the time slots can still ensure a continuous data stream without an error condition occurring. This is shown in step 5.
  • The communication would now still work without errors, but would not be effective due to the length of the time slots.
  • Accordingly, it is proposed to adapt the time slots to the reduced data packets, such that not only the end times of the time slots are adapted to the data packets, but also the start times. This is shown in step 6.
  • This procedure enables optimization of the size of the data packets without having to shift the time slots. Also, the adaptation of the time slots to the data packets is decoupled from the reduction of the data packets, so that a possible source of error is eliminated.
  • In FIG. 3 , the procedure is explained on the basis of SERCOS III operation phases. First, communication is initialized by means of SERCOS III (NRT) and then, toward M, the topology of the network is defined according to the application protocol (CP0).
  • Then, in direction S, the configuration is loaded and executed (CP1). In the next step in direction S, the data packet size is defined and optimized during communication (CP2). The terminals that act as communication receivers, are jitter-sensitive from this point on.
  • CP3 comprises the actual communication with optimized packet sizes. CP4 terminates the communication and enables the next communication that works according to the same principle.
  • Accordingly, the process according to the invention is executed within the marked area. Accordingly, the initial packet size and time slot size are s determined from CP2 and optimized between CP2 and CP3 (see steps 5 and 6 from FIG. 2 ).
  • The present application is not limited to the previous features. Rather, further embodiments are conceivable. For example, instead of at least one switch, a router or a server could also be used. Also, further subscribers, such as PCs or hubs, could be used.

Claims (14)

1. A method of operating a network with multiple subscribers in the network and comprising at least one switch, at least two terminals, and at least one controller, the method comprising the steps of:
the controller communicating with one of the terminals via an application protocol by sending or receiving data as data packets,
providing time slots having respective start and end times that are adapted to a maximum possible packet size for sending the data packets, and,
when packet sizes are changed, adapting the time slots to the packet size by changing the start times and the end times.
2. The method according to claim 1, wherein the start times are adapted to a minimum possible packet size.
3. The method according to claim 1, wherein the network is an automation network.
4. The method according to claim 1, wherein sizes of the time slots are adjusted to the maximum possible packet size during an initialization of the communication via the controller.
5. The method according to claim 4, wherein the time slots overlap in time.
6. The method according to claim 1, wherein the change of packet sizes is performed during communication.
7. The method according to claim 1, wherein the change of the packet sizes and the change of the start times and the end times are independent of each other in terms of time.
8. The method according to claim 1, wherein the change in packet sizes and the change in start times and end times are controlled by a protocol that operates independently of the application protocol.
9. The method according to claim 1, wherein the subscribers are connected to the switches in ring or line topology.
10. The method according to claim 1, wherein a plurality of the terminals are connected in series.
11. The method according to claim 1, wherein communication takes place by data packets within the link layer of the network.
12. The method according to claim 1, wherein the switches are routers or servers.
13. The method according to claim 1, wherein several controllers are present as subscribers in the network.
14. The method according to claim 1, wherein a configuration of the controller or the switch is performed by a network management.
US18/019,927 2020-09-07 2021-09-02 Method of operating a network Pending US20230291695A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE102020123275 2020-09-07
DE102020123275.6 2020-09-07
PCT/EP2021/074225 WO2022049175A1 (en) 2020-09-07 2021-09-02 Method for operating a network

Publications (1)

Publication Number Publication Date
US20230291695A1 true US20230291695A1 (en) 2023-09-14

Family

ID=77774910

Family Applications (3)

Application Number Title Priority Date Filing Date
US18/019,915 Pending US20230362033A1 (en) 2020-09-07 2021-09-02 Method of operating a network
US18/019,887 Pending US20230336380A1 (en) 2020-09-07 2021-09-02 Method of operating a network
US18/019,927 Pending US20230291695A1 (en) 2020-09-07 2021-09-02 Method of operating a network

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US18/019,915 Pending US20230362033A1 (en) 2020-09-07 2021-09-02 Method of operating a network
US18/019,887 Pending US20230336380A1 (en) 2020-09-07 2021-09-02 Method of operating a network

Country Status (5)

Country Link
US (3) US20230362033A1 (en)
EP (3) EP4211872A1 (en)
CN (3) CN116018785A (en)
DE (3) DE102021122685A1 (en)
WO (3) WO2022049173A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116708536B (en) * 2023-08-09 2023-10-24 江苏中威科技软件系统有限公司 Method for realizing communication protocol of cross-platform terminal interconnection based on fog calculation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100074263A1 (en) * 2008-09-19 2010-03-25 Charles Bry Configurable Media Access Controller
DE102014100628B4 (en) * 2013-01-21 2016-08-18 Voice Inter Connect Gmbh Bus system and method for transmitting data in real time
US9936003B1 (en) * 2014-08-29 2018-04-03 Cavium, Inc. Method and system for transmitting information in a network
US20200213958A1 (en) * 2018-12-27 2020-07-02 Qualcomm Incorporated Network coordination

Family Cites Families (20)

* 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 (en) 2000-09-27 2002-05-02 Siemens Ag Process for real-time communication between several network participants in a communication system with ethernet physics and corresponding communication system with ethernet physics
DE10254580A1 (en) * 2002-11-22 2004-06-03 Robert Bosch Gmbh Method and device for transmitting data in messages on a bus system
DE10319323B3 (en) * 2003-04-29 2004-12-16 Siemens Ag Method for automatic configuration of a communication device
JP5050057B2 (en) * 2006-09-06 2012-10-17 エヌエックスピー ビー ヴィ Time-triggered network and clock synchronization method for clusters in the network
US8295287B2 (en) 2010-01-27 2012-10-23 National Instruments Corporation Network traffic shaping for reducing bus jitter on a real time controller
DE102013211406A1 (en) * 2013-06-18 2014-12-18 Siemens Aktiengesellschaft Communication device for connecting a field device of an industrial automation system with a fail-safe control unit and industrial automation system
DE102014226994A1 (en) * 2014-12-29 2016-06-30 Robert Bosch Gmbh Communication system for operating a data network
CN104703273B (en) * 2015-03-17 2016-01-20 中南大学 A kind of synchronous wireless sensor network MAC method of Quorum time slot self-adaptative adjustment
WO2017092879A1 (en) 2015-11-30 2017-06-08 Siemens Aktiengesellschaft Method for industrial communication via tsn
DE102017208735A1 (en) 2017-05-23 2018-11-29 Siemens Aktiengesellschaft Method and device for protecting a communication between at least one first communication device and at least one second communication device, in particular within a communication network of an industrial manufacturing and / or automation
EP3448000A1 (en) * 2017-08-23 2019-02-27 Siemens Aktiengesellschaft Method for generating a unique addressing id for a data stream of an application in a tsn-compliant network and apparatus for same
EP3522477B1 (en) * 2018-01-31 2021-08-11 Siemens Aktiengesellschaft Method for communicating data in an industrial network in particular, device for carrying out the method, computer program and computer-readable medium
EP3881508A1 (en) * 2018-11-13 2021-09-22 ABB Schweiz AG Transmission of packets over a tsn aware network
DE102018129809A1 (en) 2018-11-26 2020-05-28 Beckhoff Automation Gmbh Distribution node, automation network and method for transmitting telegrams
EP3672163A1 (en) * 2018-12-20 2020-06-24 Siemens Aktiengesellschaft Method for data communication, communication device, computer program and computer readable medium
EP3697034A1 (en) 2019-02-14 2020-08-19 Siemens Aktiengesellschaft Method for data transmission, device, computer program and computer readable medium
DE102019114309A1 (en) 2019-05-28 2020-12-03 Beckhoff Automation Gmbh Method for routing telegrams in an automation network, data structure, automation network and network distributor
CN111490842B (en) * 2020-03-23 2024-08-30 腾讯科技(深圳)有限公司 Time synchronization method, device, computer readable medium and electronic equipment
CN111600754B (en) * 2020-05-11 2022-02-25 重庆邮电大学 Industrial heterogeneous network scheduling method for interconnection of TSN (transmission time network) and non-TSN (non-Transmission time network)

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100074263A1 (en) * 2008-09-19 2010-03-25 Charles Bry Configurable Media Access Controller
DE102014100628B4 (en) * 2013-01-21 2016-08-18 Voice Inter Connect Gmbh Bus system and method for transmitting data in real time
US9936003B1 (en) * 2014-08-29 2018-04-03 Cavium, Inc. Method and system for transmitting information in a network
US20200213958A1 (en) * 2018-12-27 2020-07-02 Qualcomm Incorporated Network coordination

Also Published As

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

Similar Documents

Publication Publication Date Title
US8972521B2 (en) Method and device for operating wind farm power grids with improved data transmission protocol
US7441048B2 (en) Communications system and method for synchronizing a communications cycle
Decotignie The many faces of industrial ethernet [past and present]
CN111279656B (en) Data transmission method and communication network
CN111670567A (en) Method, control method, device, computer program and computer-readable medium for data communication, in particular in an industrial network
JP2005278192A (en) Data transmission method
KR102271639B1 (en) Method and device for modular orientation of AVB streams
CN109921972B (en) Method for transmitting and/or receiving data packets
US20230291695A1 (en) Method of operating a network
US11323380B2 (en) Method of synchronization of data packet transmission
US7853706B2 (en) Method, interface and network for cyclical sending of Ethernet telegrams
US20230090803A1 (en) Network Infrastructure Device, Communication Terminal and Method for Synchronizing Control Applications via a Communication Network for Transferring Time-Critical Data
JP2002215482A (en) Method and system for transmitting data
US7420985B2 (en) Method for operating an isochronous cyclic communication system
US12047299B2 (en) Computer program and method for data communication
US20200287743A1 (en) Method for transmitting data and system comprising communicating entity
Aristova Ethernet in industrial automation: Overcoming obstacles
CA2499618A1 (en) Method for the transmission of data telegrams in a switched cyclical communication system
CN112753206B (en) Method and communication device for data transmission in industrial communication network
EP4376378A1 (en) Network device, time-sensitive network system and auto-configuration method thereof
CN101964721B (en) For the method and system of networking
King et al. A PCE-based framework for future internet deterministic and time-sensitive networks
KR20200125448A (en) Method and apparatus for transmitting and receiving data stream performed in vehicle network
CN117459521A (en) Flow control transmission method and device for communication data, host equipment and storage medium

Legal Events

Date Code Title Description
AS Assignment

Owner name: HIRSCHMANN AUTOMATION AND CONTROL GMBH, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KAUFMANN, ARNE;WUESTENEY, LUKAS;HUMMEN, RENE;SIGNING DATES FROM 20230222 TO 20230227;REEL/FRAME:063867/0071

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

AS Assignment

Owner name: HIRSCHMANN AUTOMATION AND CONTROL GMBH, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KAUFMANN, ARNE;BECHTEL, LUKAS;HUMMEN, RENE;SIGNING DATES FROM 20230806 TO 20230807;REEL/FRAME:065024/0128

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED