• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    In order to shorten the cycle time of the transmission cycles in a real-time capable Ethernet data network with little effort in a real-time capable Ethernet data network protocol, it is provided that a plurality of slaves (S1, S2, S3, S4, S5) are combined to form a summation frame group (SG) and a slave (S2, S4) of the sum frame group (SG) is defined as a collection node (SK) and all other slaves (S1, S2, S3, S4, S5) of the sum frame group (SK) each have their data with a collection data packet (DPS1, DPS2, DPS3, DPS4, DPS5) to the collecting node (SK), the collecting node (SK) the data of the other slaves (S1, S2, S3, S4, S5) of the sum frame group (SG) in a sum frame data packet (DPSR) and the collecting node (SK) sends the sum frame data packet (DPSR) to the master (M).
    公开号:AT517778A1
    申请号:T50833/2015
    申请日:2015-10-01
    公开日:2017-04-15
    发明作者:Dietmar Bruckner Dr
    申请人:Bernecker + Rainer Industrie-Elektronik Ges M B H；
    IPC主号:
    专利说明:

    A method of data communication with reduced overhead in a real-time capable Ethernet data network
    The subject invention relates to a method for data communication in a real-time capable Ethernet data network, in which at least one master is connected to a number of slaves via the Ethernet data network and data is sent in the form of data packets between the master (M) and the slaves.
    In a data network for data communication, a network protocol is implemented, with which data in data packets on the data network are transmitted between the network nodes connected to the data network. The most well-known and widely used network protocol today is the Ethernet protocol. For this purpose, Ethernet defines data packets (also called data frame or Ethernet frame) in which data of a higher-level communication protocol can be transmitted encapsulated in an Ethernet data packet. In this case, data of the communication protocol with a data length between 46 and 1500 bytes can be transmitted in an Ethernet data packet. The addressing in the Ethernet protocol takes place via the MAC (Media Access Control) addresses of the network nodes, which are assigned uniquely for each network device. From the point of view of the known OSI layer model, Ethernet is implemented exclusively on layers 1 and 2. Different communication protocols can be implemented in the higher layers. Here, a variety of communication protocols have been established, such as IP on layer 3 or TCP and UDP on layer 4, to name a few widely used communication protocols.
    In terms of hardware, today's Ethernet systems are so-called switched data networks, in which individual network nodes do not have to be directly connected to each other and can not communicate directly with each other, but can be connected via coupling elements, so-called network switches or network hubs. A coupling element for this purpose has a number of network ports, to which a network participant (either a network node or another coupling element) can be connected. Such a coupling element forwards an Ethernet data packet either to all ports (hub) or to a specific port (s) (switch). So-called point-to-point connections are made in a switched data network in which Ethernet data packets are forwarded from one network node via a number of coupling elements to another network node.
    Network nodes used in industrial automation often have a 3-port switch installed internally, whereby two ports are accessible from the outside and the third port is for internal wiring. In this way, it is possible to realize line topologies without additional external coupling elements, in which a network node is connected to the respectively next network node in the form of a line, which helps to reduce the wiring effort in an industrial environment. Of course, external network switches or external network hubs can also be used to set up the network topology. In principle, any network topology is possible, that is to say in particular a star topology, a line topology, a tree topology, a ring topology, etc., and also any combination thereof. In a ring topology, as is generally known, special precautions must be taken to prevent the uncontrolled circulation of multiple-address data packets.
    In order to be able to use Ethernet for industrial automation, real-time-capable Ethernet protocols have already been developed since the standard Ethernet network protocol is not known to have real-time capability. Examples of well-known Ethernet network protocols include Modbus / TCP, EtherNet / IP, ProfiNET IRT, EtherCAT, or Ethernet POWERLINK, just to name a few. In this context one often speaks of Industrial Ethernet. These real-time-capable Ethernet protocols are intended to ensure sufficiently fast and deterministic data communication for the respective application. It is thus intended in particular to ensure that a real-time-relevant data packet is transmitted within a predetermined period of time by a transmitting network node via the network to a receiving network node. In an industrial automation environment, real-time capability means, for example, that a fixed period of time must be maintained between the acquisition of a measured value, forwarding of the measured value to a control unit, calculation of a control value in the control unit on the basis of the measured value and transmission of the control value to an actuator for carrying out an action. In relation to the real-time capable Ethernet data network for the transmission of this data via the real-time capable Ethernet data network, the data transmission must be ensured within a predetermined period of time.
    In an industrial automation environment, there is usually at least one master network node (in short, also a master), which communicates with at least one associated, generally several assigned, slave network node (in short, also slaves). To realize a real-time capable Ethernet data network, the known real-time capable Ethernet network protocols have defined a transmission cycle with a predefinable cycle time, within which the master can communicate with each slave. This normally includes cyclically the possibility of a data packet from the master to each slave and vice versa, also at least one data packet of a slave, usually at least one data packet from each slave, to the associated master. The achievable and pre-determinable minimum cycle time results from the sum of the maximum run times of the data packets. The runtimes are hardware-dependent and result from the bit transmission times (length, payload) of the data packets, from the network infrastructure (e.g., delay times through coupling elements) and the network topology. The above-mentioned limits in the size of the Ethernet data packets are also to be considered.
    This cyclic (isochronous) traffic, which is the basis of real-time capability in the real-time capable Ethernet network protocol, is typically augmented by non-cyclic (asynchronous) data packets in each transmission cycle. Such asynchronous data packets are used by the data communication not subject to the real-time requirements, for example for the configuration of the slaves, for visualization purposes or for status queries. For such asynchronous data packets, bandwidth is reserved, i.e., a certain defined time is available for asynchronous data traffic in each transmission cycle. In the concrete implementation of the cyclic and asynchronous data traffic, the known real-time capable Ethernet protocols differ.
    Real-time capable Ethernet data networks are becoming ever larger, in the sense of more and more network nodes being integrated into the data network. The data communication bandwidth available on the data network must therefore be well planned to keep the reachable transfer times for real-time applications low.
    The bandwidth is also burdened by many very short data packets. The smallest Ethernet data packet contains 46 bytes of data. If the useful data to be sent are shorter, then the data packets must be filled up, generally with zeros (the so-called frame padding with padding data). In a real-time capable Ethernet data network, however, the slaves (eg sensors, I / O devices, encoders, etc.) often only send a small amount of data (in the sense of a small data length) to the master (eg a control unit), which causes a lot through these short data packets Bandwidth is wasted on the data network.
    In order to make better use of the available bandwidth, so-called summation frames have already been used, which contain data for or from several network nodes. In this way, overhead, and possibly Paddingdaten, many small data packets can be saved, so the bandwidth can be better utilized and the cycle time can be shortened. EtherCAT, for example, uses a summation frame method in which the master sends a data packet with data for all slaves to the first slave. This reads its data from the data package (outdata) and overwrites this data with data that the slave wants to send to the master (input data). This changed data packet is then sent to the second slave, and so on, until the data packet is sent back to the master by the last slave in reverse order. The disadvantage of this is that the reserved data in the sum frame per slave must always be as large as the maximum of input and output data of each slave, which reduces the available bandwidth. Furthermore, EtherCAT needs its own modules (ASICs) in the network nodes, as this procedure does not work with standard Ethernet hardware. In another known implementation of the summation frame method, the data packet is shortened from master towards the slaves by each slave takes its data from the data packet and extends in the reverse direction by each slave adds its data to the data packet to the master. A disadvantage of such a summation frame method is that the data packet at each point in the data network has different lengths and thus the data network is difficult to diagnose. Apart from that, also here for the realization of own building blocks in the network nodes must be used. Such a summary frame method is supported by ProfiNET IRT (Dynamic Frame Packing). POWERLINK sends a data packet from the master as summation frame to all slaves, and the master receives a separate Ethernet data packet from each slave. This method can be realized with standard Ethernet hardware because the sum frame is generated once in the master and then changed by no other network notes. However, the known methods are all based on the fact that the master abuts the data communication.
    These methods have already improved the utilization of the available bandwidth on the real-time capable Ethernet data network. That it was possible to send more data per time unit, or to shorten the cycle times of the transmission cycles.
    It is an object of the present invention to specify a method with which the cycle time of the transmission cycles in a real-time capable Ethernet data network can be shortened with little effort.
    This object is achieved in that a plurality of slaves are combined into a sum frame group and a slave of the sum frame group is set as a collection node and send all other slaves of the sum frame group their data with collective data packets to the collecting node, the collecting node, the data of the other slaves of the sum frame group is inserted in a sum frame data packet and the collection node sends the sum frame data packet to the master. This summation frame procedure does not have to be initiated by the master by sending a summation frame from the master to the slaves, whereby the slaves process this summation frame in some way. By virtue of this summation frame method, the slaves transmitting to the collection nodes can therefore be implemented as conventional Ethernet network nodes without additional functionality. Only the
    The collection node must have implemented the additional functionality of collecting the aggregate data packets and creating and sending the sum frame data packet to the master M. In this way, the effort to implement the summation frame method can be significantly reduced and still short cycle times can be achieved.
    It is particularly advantageous if the slave of the summation frame group is selected as the collective node, which is furthest removed from the master in the data network. Thus, the fact can be exploited that less data is sent from the master to the slaves in a conventional real-time capable Ethernet data network than vice versa. The transmission direction, in which less data traffic takes place, is thus utilized to send the collective data packets, which does not burden the data network. The data can then be sent with the advantages of the sum frame as a sum frame in the direction of the master.
    Alternatively, the slave of the sum frame group which is arranged closest to the master on the data network can be selected as the collective node. In this way, the network nodes farther away from the master can transmit at a lower data rate than the collection node, allowing network nodes with different data rates to be used.
    If a slave is selected in the middle of the bucket group as the hunt node, both advantages can be used.
    The subject invention will be explained in more detail below with reference to Figures 1 to 8, which show by way of example, schematically and not by way of limitation advantageous embodiments of the invention. It shows
    1 and 2, the communication on a real-time capable Ethernet data network, Figures 3 and 4, a first implementation of the summation frame method according to the invention,
    5 and 6 a further implementation of the summation frame method according to the invention and
    7 and 8 show a further implementation of the summation frame method according to the invention.
    A possible, real-time capable Ethernet network protocol underlying the invention will be explained with reference to FIG. 1, whereby, of course, other real-time-capable Ethernet network protocols could also be used. For description, an exemplary network topology in the form of a line topology is used in which network nodes, in this case a master M with a series of slaves S1... Sn connected in series, are connected to form a network. The slaves S1 ... Sn are designed here as network devices with integrated 3-port switch (coupling element), which allows such a line topology without external coupling elements. The master M can communicate with each slave S1 ... Sn in each transmission cycle Z, with a given cycle time tz, by sending Ethernet data packets DP (hereinafter referred to simply as data packets DP) on the Ethernet data network 1. A dispatched data packet DP is indicated in FIG. 1 as an arrow, the arrowhead indicating the transmission direction (ie from master M to a slave S or vice versa). Each horizontal line is assigned to a network node (master M or slaves S1... Sn) and represents a timeline. The network-related latency when transmitting the data packets DP via the Ethernet data network 1 is indicated by the oblique arrows, the processing duration of the data packets DP in the coupling elements and the latency by the finite propagation speed in the medium (copper cable, optical fiber) summarized and simplified as a constant assumption.
    A transmission cycle Z (m) is precisely time-divided by defining the times tM, i, tM, 2, ·, tM, x, ts, i, ..., ts, y, to which each network node, the master M or the slaves S1 ... Sn, may send data packets DP. Thus, by scheduling the time points, data collisions on the Ethernet data network 1 can be avoided. After Ethernet allows full-duplex data communication, however, data packets DP can travel in both directions simultaneously on one network segment. In this way, each of the participating network nodes (master M, slaves S) knows at which time within a transmission cycle Z it is allowed to send data packets DP and when to receive data.
    These times tM, i, ϊμ, 2>, tM, x, ts, i, ..., ts, y within the transmission cycle Z can be planned very precisely in advance if it is known how many data (bytes) in each data packet DP are transferred. The larger the expected data packet DP, the farther apart are the points in time tM, i, ϊμ, 2>, tM, x, ts, i, ts, y. If the data size is not known in advance, then a maximum data size, e.g. the maximum frame size of an Ethernet frame. Between two data packets DP, a predetermined pause must also be maintained on the data network 1 in each case.
    The number of network nodes, master M and slaves S1... Sn, and the size of the data sent is thus also decisive for the achievable cycle time tz.
    In FIG. 1, in the transmission cycle Z (m), the master M transmits a data packet DP1 (m) to the last slave Sn at the instant tM, i. However, this data packet DP1 (m) could also be a summation frame which contains data for all slaves S1 ... Sn (indicated in the transmission cycle Z (m + 1)) and from which the slaves S1 ... Sn read their data. At a fixed time tM, 2 thereafter, the master M sends the next data packet DP2 (m), hereby. to the slave S2. At the same time, the slave S2 can also send a data packet DP3 (m) to the master M. This principle is also observed by the remaining network nodes, whereby not every slave S1 ... Sn has to receive or send a data packet DP. The communication is by the specification of the times tM, i, tM, 2>, tM, x, ts, i, ..., ts, y but advantageously planned so that the data packets DP from the slaves S1 ... Sn on Master M consecutively and without time gap (apart from a pause to be respected) arrive. This communication sequence is then repeated in the subsequent transmission cycles Z (m + i), wherein the same network nodes do not have to send or receive data packets DP in each transmission cycle Z, as indicated in FIG.
    This planned data communication takes place cyclically and it is provided in each transmission cycle Z a temporal portion tzyki for this isochronous traffic. In each transmit cycle Z, however, a section tasynch is also reserved for asynchronous data traffic, in which Ethernet data communication takes place, which need not meet any hard real-time requirements.
    If the cyclic communication differs from transmit cycle to transmit cycle (as exemplified in FIG. 1 between Z (m) and Z (m + 1)), then there is at least a maximum period duration (a transmit cycles) within which the transmit patterns will be exact repeat, d. H. the cyclic data packets in Z (m) are equal to those in Z (m + a). In each individual transmission cycle Z, however, the ratio between tzyki and tasynch can change, depending on the number of planned cyclic data packets.
    Of course, this communication principle also applies in other network topologies, as described with reference to FIG. 2 using the example of a star topology. Here, a star topology is constructed by means of an external network switch SW, wherein in each branch a line topology, as described in Figure 1, is realized. The master M is also connected to the network switch SW. In the example shown, at the time tM, i at the beginning of each transmission cycle Z, a data packet DP1 (m) in the form of a sum frame is sent to all slaves S1... Sn. This data packet DP1 (m) is forwarded by the network switch SW in the two branches and there sent to all slaves S1 ... Sn. The other data packets DP are then sent back to the designated times tM, x, ts, y within the transmission cycle Z (m). However, it has to be considered here that the data packets DP, which are sent back to the master M by the slaves S1... Sn, are preferably to be planned in such a way that no data jams can arise in the master M and in the intervening network switch SW. The timing of the data packet DP2 (m) from the slave Sn to the master M is e.g. so planned that this data packet DP2 (m) does not collide with other data packets from the other branch of the star topology, as shown in FIG. The between master M and network switch SW reciprocating data packets DP are shown for clarity in Fig.2 only partially.
    The inventive method for data communication in a real-time capable Ethernet data network will now be explained with reference to FIG. The real-time capable Ethernet data network 1 here consists of a master M network node, a network switch SW and a number of slaves S1, ..., Sn network nodes. Of course, the network switch SW could also be omitted and the master M could be connected directly to the first slave S1. A number of the slaves S1,..., Sn, here the slaves S1, S2, S3, S4, are logically combined to form a summation frame group SG for implementing the summation frame method according to the invention.
    Any slave S4 of the sum frame group SG is defined as a collection node SK. All other slaves S1, S2, S3 of the sum frame group SG send their data D1, D2, D3, which they want to send to the master M, in collecting data packets DPS1, DPS2, DPS3 to the collecting node SK. For this purpose, the slaves S1, S2, S3 of the summation frame group SG sending to the collection node SK only have to be correspondingly configured so that the data is not sent to the master M but to the collection node SK. For this purpose, only the address entries in the slaves S1, S2, S3 in the address tables must be configured accordingly. The collection data packets DPS1, DPS2, DPS3 thus correspond to the data packets that would normally be sent from the slaves S1, S2, S3 to the master M. These slaves S1, S2, S3 of the sum frame group SG can thus be simple standard Ethernet network nodes. Only in the collecting node SK, the additional functionality of collecting the collective data packets DPS1, DPS2, DPS3 and the creation and sending of the sum frame data packet DPSR must be implemented to the master M.
    The collecting node SK collects this data D1, D2, D3, which it receives with the collecting data packets DPS1, DPS2, DPS3, and inserts these into a summation frame data packet DPSR or generates therefrom a summation frame data packet DPSR. The collecting node SK can also insert its own data D4 in the summation frame data packet DPSR, as indicated in Figure 3. The collecting node SK then sends the finished sum frame data packet DPSR via the data network 1 to the master M.
    The known overhead data of an Ethernet data packet such as the sum frame data packet DPSR, and possibly necessary padding data of the short data packets D1, D2, D3, are not shown in FIG. 3 for the sake of simplicity. The overhead data, and possibly data by frame padding, of an Ethernet data packet are much less than the overhead data of many individual data packets from the slaves S1, S2, S3, S4 to the
    Master M. Since now only the overhead data for the sum frame data packet DPSR must be sent, and the cycle time tz of the transmission cycles can be reduced, since in total less data in the direction of master M are sent.
    In the exemplary embodiment according to FIG. 3, the collecting node SK is further away from the master M than the other slaves S1, S2, S3 of the summation frame group SG. Thus, the summation frame data packet DPSR when transmitting to the master M also reaches all other slaves S1, S2, S3 of the summation frame group SG. This has the advantage that direct cross traffic between two slaves S1, S2, S3, S4 of the sum frame group can be realized in this way at the same time, because the created summation frame data packet DPSR on the way to the master M by all slaves S1, S2, S3 of the sum frame group SG is passed through. That is, in this way, two (or even more) slaves S1, S2, S3, S4 can directly exchange data with each other.
    The arrangement of the collecting node SK as far away as possible from the master, preferably farthest from the master M, has advantages, in particular in a line topology as shown in FIG. In common real-time Ethernet network protocols, the data traffic from the master M to the slaves Sx is less than from the slaves Sx to the master M. If one arranges the collecting node SK in the vicinity of the master M, then occupy the collective data packet DPSx of the Slaves Sx (with the respective overhead data) the data network and you would have through the sum frame data packet DPSR little or no profit. The closer the collection node SK is to the master M, the less profit can be expected. On the other hand, if the collecting node SK is further away from the master M than the (or at least some of) the slaves S1, S2, S3 of the summing frame group SG, then the higher available bandwidth from the master M in the direction of the slaves Sx can be exploited to detect the collection Data packets DPS1, DPS2, DPS3. So you "give away" in the direction of the master M to the slaves Sx bandwidth, which you usually do not need in any case to save in the direction of the slave Sx to the master M cycle time.
    In Figure 4, the data packet traffic over the data network 1 is shown again (for simplicity, without network switch SW). As already described, the data traffic on the real-time capable Ethernet data network 1 is planned precisely in time. Thus, the collective data packet DPS1, DPS2, DPS3 must also be planned precisely in time and performed in addition to the conventional data traffic. At the times ts, i, ts, 2, ts, 3, of a transmission cycle Z (m), it is provided that slaves S1, S2, S3 of the summation frame group SG send their data D1, D2, D3 to the collection node SK. At time ts, sR, after the collecting node SK has received all the expected data D1, D2, D3, and after the collecting node SK has prepared the sum frame data packet DPSR, the collecting node SK sends the sum frame data packet DPSR to the master M.
    The direct data communication of a slave S2, S3 of the sum frame group SG to the master M via direct addressing can also be superfluous with the summation frame data packet DPSR. The data packets DP3 and DP4 of the slaves S2, S3 could thus be saved, as indicated by dashed lines in FIG.
    5 and 6 another embodiment of the invention is shown. Here, the collecting node SK is the slave S2 of the sum frame group SG which is closest to the master M in the data network 1. The collecting node SK receives from the downstream (ie further from the master M) slaves S3, S4, S5 of the summation frame group SG the collecting data packets DPS3, DPS4, DPS5 of the slaves S3, S4, S5, which again at the predetermined times ts, 3, ts, 4, ts, 5, a transmission cycle Z (m) (Figure 6) are sent. At the time ts, sR> after the collecting node SK has received all the expected data D3, D4, D5 and after the collecting node SK has created the summation frame data packet DPSR (possibly with its own data D2), the collecting node SK sends the summation frame data packet DPSR Master M. Although this mitigates the above-described advantage of the sum frame data packet DPSR, this arrangement has another advantage, namely, that one can handle different slices S1, S2, S3, S4 of the sum frame group SG with it. The slaves S3, S4, S5 lying behind the collecting node SK from the perspective of the master M may have a lower data rate (e.g., 100 Mbit) than the collecting node SK (e.g., 1 Gbit). The fast collection node SK can then transmit the sum frame data packet DPSR with the high data rate over the data network (eg in a tree topology).
    In a further embodiment of the invention according to FIGS. 7 and 8, a summation frame group SG comprising a plurality of slaves S3, S4, S5 is again provided, in which case the collection node SK (slave S4) is located somewhere in the middle of the slaves S3, S4, S5 the summation frame group SG is arranged. As a result, the collecting node SK collecting data packet DPS3, DPS5 receives from both sides of the data network 1. Otherwise, the process is exactly the same. At the time ts, sR (FIG. 8), after the collecting node SK has received all the expected data D3, D5 and after the collecting node SK has created the summation frame data packet DPSR (possibly with its own data D4), the collecting node SK sends the summation frame Data packet DPSR to the master M.
    It should be noted that the slaves S1, S2, S3, S4, S5 of a sum frame group SG on the data network 1 need not be arranged directly behind one another or in a row, as in the exemplary embodiments shown.
    In principle, it would even be possible to distribute the transmission of a sum frame data packet DPSR over several transmission cycles tz. For this purpose, the collecting node Sk can collect the collective data packets DPS1, DPS2, DPS3 over several transmission cycles tz and, after receiving all the collective data packets DPS1, DPS2, DPS3, send the summation frame data packet DPSR.
    The fact that the summation frame data packet DPSR is created only at one point (in the collection node SK) and then sent unchanged via the data network 1 has, however, another advantage. An Ethernet data packet is usually protected against transmission errors by redundancy data, such as a cyclic redundancy code (CRC). If the summation frame data packet DPSR were to be changed during the transmission of different network nodes, for example because network nodes extract or add data, then each network node would have to protect the transmitted data packet specifically with redundant data, since otherwise it would not be possible to determine at the receiver end which data was corrupted. The reason for this is that each network node automatically calculates new Ethernet redundancy data before inserting a data packet DP and inserts it into the Ethernet data packet. Even if a bit falls over now and the Ethernet redundancy data are not correct at one point, they are correctly calculated and overwritten by the next network node and afterwards it is no longer possible to detect that the data packet DP is actually broken. The error may be in the header or in the data, which can not be determined. As a result, the entire sum frame data packet DPSR would have to be discarded and the resending of the sum frame data packet DPSR initiated. Apart from that, it also costs computing power and space in the summation frame. This would be a problem, or even inadmissible, in particular in a real-time capable Ethernet network protocol because the necessary cycle times could no longer be met. In the summing frame method according to the invention with collecting node SK, it is sufficient to include one additional bit per slave S1, S2, S3, S4 of the summation frame group SG in the summation frame data packet DPSR, which indicates whether the data D1, D2, D3, D4 have arrived at the collecting node SK are and are valid. As a result, the additional overhead in the sum frame data packet DPSR can be kept very small. The collecting node SK creates the sum frame data packet DPSR and calculates the Ethernet redundancy data for this Ethernet data packet. The master M can check the Ethernet redundancy data and the additional bits. If everything fits, the master M can start from a correct, error-free sum frame data packet DPSR. If the Ethernet redundancy data does not match, the sum frame data packet DPSR must be discarded. If an additional bit is not set for a slave S1, S2, S3, S4, the master M can not use the data of all other slaves for correct Ethernet redundancy data, only from the one slave for which the additional bit is not set ,
    权利要求:
    Claims (5)
    [1]
    claims
    1. Method for data communication in a real-time capable Ethernet data network (1), in which at least one master (M) is connected via the Ethernet data network (1) to a number of slaves (S1, Sn) and between the master (M) and the slaves (S1, Sn) data in the form of data packets (DP) are sent, characterized in that a plurality of slaves (S1, S2, S3, S4, S5) are combined to a sum frame group (SG) and a slave ( S2, S4) of the sum frame group (SG) is defined as a collection node (SK) and all other slaves (S1, S2, S3, S4, S5) of the sum frame group (SK) their data each with a collective data packet (DPS1, DPS2, DPS3 , DPS4, DPS5) send to the collecting node (SK) that the collecting node (SK) inserts the data of the other slaves (S1, S2, S3, S4, S5) of the sum frame group (SG) in a sum frame data packet (DPSR) and the collection node (SK) sends the sum frame data packet (DPSR) to the master (M).
    [2]
    2. The method according to claim 1, characterized in that as a collecting node (SK) of the slave (S4) of the sum frame group (SG) is selected, which is the data network (1) farthest from the master (M).
    [3]
    3. The method according to claim 1, characterized in that as a collecting node (SK) of the slave (S2) of the sum frame group (SG) is selected, which is arranged on the data network (1) closest to the master (M).
    [4]
    4. The method according to claim 1, characterized in that as a collecting node (SK) a slave (S3) in the middle of the summation frame group (SG) is selected.
    [5]
    5. The method according to any one of claims 1 to 4, characterized in that in the sum frame data packet (DPSR) for each to the collecting node (SK) transmitting slave (S1, S2, S3, S4, S5) of the sum frame group (SG) one bit which indicates whether the data has been validly received by the collecting node (SK).
    类似技术:
    公开号 | 公开日 | 专利标题
    EP1894113B1|2020-06-03|Method for data communication of bus users in an open automation system
    EP1826646B1|2011-01-05|Method, node and network for cyclical transmission of ethernet telegrams
    EP3522482B1|2020-08-26|Method for communicating data in an industrial network , control method, device, computer program and computer-readable medium
    EP3183851A1|2017-06-28|Distribution node, automation network, and method for transmitting real-time-relevant and non-real-time relevant data packets
    EP2137893B1|2013-06-26|Packet switching device and local communication network with such a packet switching device
    DE10304637A1|2004-08-19|Network coupler, network and data processing method for Ethernet telegrams
    WO2008089901A1|2008-07-31|Method and installation for the optimized transmission of data between a control device and a plurality of field devices
    EP3151474B1|2018-09-05|Method for data communication with reduced overhead in a real-time ethernet data network
    EP3151492B1|2018-06-06|Method for data communication with reduced overhead in a real-time ethernet data network
    DE102015010969A1|2017-03-02|Network module for sending and / or receiving data packets from a network device and method
    DE10004425A1|2002-01-17|Network with subscriber device, esp. field device, enables transmitter, receiver transmission, reception time delays to be taken into account for time synchronisation
    EP3151475B1|2018-06-06|Method for asynchronous data communication in a real-time ethernet data network
    EP3151476B1|2021-06-30|Method for cross-traffic between two slaves of a ring -shaped data network
    DE102010000995B3|2011-06-16|Increasing the real-time capability of Ethernet networks
    EP3151473B1|2020-06-17|Method for isochronous data communication in a real-time cable ethernet data network
    EP1436950A1|2004-07-14|User device for a high performance communication system
    WO2001058067A1|2001-08-09|Clock synchronisation in a network and network users, in particular a field device for said network
    EP1371193B1|2011-04-27|Elektronischer schaltkreis und verfahren fur eine kommunikationsschnittstelle mit cut-through pufferspeicher
    DE10004426A1|2001-08-09|Network participants, in particular field device, and network with such a network participant
    DE10147432A1|2002-10-31|Method and electronic circuit for a scalable communication interface in automation components
    DE10141424A1|2002-10-17|Electronic circuit and method for a communication interface with cut-through buffer memory
    同族专利:
    公开号 | 公开日
    US20170099223A1|2017-04-06|
    EP3151492A2|2017-04-05|
    EP3151492B1|2018-06-06|
    AT517778B1|2021-10-15|
    US10069735B2|2018-09-04|
    EP3151492A3|2017-04-19|
    CA2943865A1|2017-04-01|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    US5214647A|1990-02-08|1993-05-25|Nec Corporation|CSMA type communication system|
    EP0963078A2|1998-06-06|1999-12-08|PHOENIX CONTACT GmbH & Co.|Method for half-duplex transmission of an added frame protocol|DE102018129774A1|2018-11-26|2020-05-28|Beckhoff Automation Gmbh|Method for operating a network participant and network participant|KR100434270B1|2001-05-30|2004-06-04|엘지전자 주식회사|Control System for Home Appliance Network|
    WO2005018161A1|2003-08-19|2005-02-24|Keio University|Radio communication device, ad hoc system, and communication system|
    US20080089361A1|2005-10-06|2008-04-17|Metcalf Thomas D|System and method for transferring data|
    WO2006067922A1|2004-12-21|2006-06-29|Matsushita Electric Industrial Co., Ltd.|Wireless node power supply managing method|
    DE102005016596A1|2005-04-11|2006-10-19|Beckhoff Automation Gmbh|Subscriber, master unit, communication system and method of operating the same|
    AT537632T|2006-03-29|2011-12-15|Yamaha Corp|AUDIO NETWORK SYSTEM|
    DE102008018633B4|2008-04-11|2013-10-10|Phoenix Contact Gmbh & Co. Kg|Method, bus components and control system for Ethernet-based control of an automation system|
    US9946680B2|2012-10-05|2018-04-17|Analog Devices, Inc.|Peripheral device diagnostics and control over a two-wire communication bus|US10938516B1|2018-01-05|2021-03-02|Marvell Asia Pte, Ltd.|Systems and methods for ethernet packet error detection and correction in automotive environments|
    法律状态:
    优先权:
    申请号 | 申请日 | 专利标题
    ATA50833/2015A|AT517778B1|2015-10-01|2015-10-01|Method for data communication with reduced overhead in a real-time capable Ethernet data network|ATA50833/2015A| AT517778B1|2015-10-01|2015-10-01|Method for data communication with reduced overhead in a real-time capable Ethernet data network|
    EP16191509.5A| EP3151492B1|2015-10-01|2016-09-29|Method for data communication with reduced overhead in a real-time ethernet data network|
    US15/281,810| US10069735B2|2015-10-01|2016-09-30|Method for data communication with reduced overhead in a real-time capable Ethernet data network|
    CA2943865A| CA2943865A1|2015-10-01|2016-09-30|Method for data communication with reduced overhead in a real-time capable ethernet data network|
    [返回顶部]