DE102020207119A1 - Procedure for configuring a network - Google Patents

Abstract

The invention relates to a method for configuring a network (100), a plurality of network participants (111, 112, 113, 121, 122, 123, 130) being connected in the network (100) via a communication system (150), in Depending on data transfer-relevant information relating to the large number of network participants (111, 112, 113, 121, 122, 123, 130) with the help of data transfer-relevant expected values, expected data transmissions of individual network participants of the large number of network participants (111, 112, 113, 121, 122, 123 , 130) are estimated during the operation of the network (100), resources of the network (100) being reserved for the estimated data transfers to be expected and a schedule for the estimated data transfers to be expected being determined in accordance with the reserved resources. In particular, the network (100) is then operated in the course of a checking phase (220) in accordance with the specific schedule.

Description

The present invention relates to a method for configuring a network as well as a processing unit and a computer program for its implementation.

State of the art

In automation technology or industrial control technology, it is common to connect components of a machine or system, in particular control units and field devices, such as electrical controls, drive controllers, I / O devices, etc., to one another in a network. So that, for example, movements of different units of the machine can run synchronously and coordinated with one another, it is important that data transmission between the individual networked machine components can take place deterministically in real time. Real-time capability means that the transmitted data will reach or have reached the desired participant at a definable point in time. For this purpose, the components in the network can be connected via a real-time communication system. Such real-time-capable communication systems can be wired, for example, real-time-capable fieldbus networks, which are often based on Ethernet, e.g. Sercos III, EtherCAT, Profinet, Ethernet / IP, etc. Wireless, real-time-capable communication systems are also conceivable, for example in the form of real-time-capable cellular networks based on 5G standards.

In networks with real-time communication systems, it is usually necessary to manage network resources, for example bandwidth, time slots or time slots for the transmission of data packets, etc. Time can be processed. For example, a corresponding bandwidth can be reserved for time-critical data to be transmitted along the entire network path from the transmitter to the receiver in order to be able to guarantee transmission within the guaranteed real-time. Depending on the network topology, this connection can run over several hops or distributors and consist of several network segments. For example, each such connection between two switches can be subject to its own reservation. The coordination of all reservations required in a network can be very complex depending on the number of network participants and communication links.

In particular, a dynamic reservation of resources can be important, for example in order to be able to react to new communication connections which are newly generated during the operation of the network by adding network participants. Such new communication connections can be generated in an industrial context, for example, by adding machines or machine components or starting new services at runtime.

Disclosure of the invention

Against this background, a method for configuring a network and a processing unit and a computer program for its implementation with the features of the independent claims are proposed. Advantageous refinements are the subject matter of the subclaims and the description below.

A large number of network subscribers are connected in the network via a communication system, in particular via a real-time communication system. In particular, the network can also include a large number of distributors, switches or nodes via which the individual network participants can be connected.

In the course of a planning or configuration phase, especially before commissioning or before the start of a regular runtime of the network, a schedule is created according to which resources of the network are reserved for certain communication connections of individual network participants or for certain data transfers during later operation.

For this purpose, in the context of the method, depending on data transmission-relevant information regarding the large number of network participants, expected data transmissions of individual network participants of the large number of network participants in the later operation of the network are estimated with the help of data transmission-relevant expected values. This data transmission-relevant information describes in particular a class or classification of the participant (for example sensor, actuator, control device, etc.) and thus expediently the type and function of the individual network participants. The expected values relevant to data transmission describe, in particular, expected data traffic from individual participants or classes, for example which class of network participants how much data is sent and received during operation. The expected values relevant to data transmission can in particular be based on empirical values or statistics obtained by evaluating collected data of the network or comparable networks.

Based on the information relevant to data transmission, it is therefore estimated or predicted which specific data or network traffic is to be expected during operation. In particular, based on properties and intended functions of the individual network participants, it is evaluated which network participants will exchange how much data during operation and, in particular, with what frequency data packets are transmitted over individual communication connections.

Resources of the network are reserved for the expected data transfers and a schedule for the expected data transfers is determined in accordance with the reserved resources. In particular, resources, in particular bandwidth or a data transfer rate or time slots or time slots, are reserved for specific data transmissions via specific communication links. The reservations can be stored accordingly in the schedule.

By estimating by means of the expected values relevant to data transmission, the data or network traffic to be expected during operation can be estimated, in particular with a heuristic view or a heuristic approach. Heuristics generally designates analytical procedures in order to be able to make statements about the system based on limited information about a system with the help of presumptive conclusions. In the context of the present method, heuristic conclusions with regard to data transmissions to be carried out can expediently be made based on the information relating to the classes or classification of individual network participants.

With this heuristic estimation or with the data transfer-relevant expected values, however, it is usually not possible to determine in a binding manner which data transfers are actually carried out during operation. Rather, using the expected or empirical values, it is expedient to estimate which data transmissions are likely to be carried out with a high degree of probability. Since there can therefore be a discrepancy or uncertainty between estimated and actual data transmissions, the schedule and the reservations are particularly expediently not determined as unchangeable, binding specifications for the processing of data transmissions during runtime, but rather as placeholders or recommendations. During operation, the reservations and the schedule can expediently be dynamically adapted to the data transfers actually to be carried out and, if necessary, changed.

In particular, the resources are reserved with certain reserves so that there is a flexible response to unexpected changes during operation, for example if individual network participants do not or only partially use their reserved resources or if network participants need more resources than expected or if unexpected, new ones Data transfers are to be carried out, for example because new network subscribers are to be inserted into the network or new applications are to be carried out in the network. In such unexpected cases, the reservations can be flexibly adjusted and redistributed if necessary.

The present method is thus based on a combination of a schedule or flow chart planned in advance on the basis of expected values with reserved bandwidths, which is filled with specific communication connections at runtime. In this way, in particular, new communication connections can be established without a completely new flow chart or schedule being determined dynamically.

The present method differs from conventional configuration options, for example from a central configuration approach or a decentralized configuration approach. For example, in the case of a central configuration approach, a schedule is usually predefined in a fixed manner, which usually cannot be easily changed at runtime. In most cases, each data transmission takes place on individual segments for maximum communication performance within a finely specified time slot that is specified by the central schedule. The transmissions of a communication link along individual network segments are mostly coordinated for minimal latency and shifted against each other in the cycle rate in such a way that forwarding from one switch to the next can take place without long waiting times. Since in most cases only one transmission can take place at the same time on a network segment and individual network segments are shared by different communication connections with different requirements, the determination of such a central schedule for all connections is very complex and time-consuming. If a new communication connection is required during operation, for example by adding new components or starting new applications, the entire schedule usually has to be changed or completely recreated in order to be able to integrate this new communication connection. An automatically initiated change from a schedule to a new one Communication connections are mostly not possible with such a central configuration approach.

With a decentralized configuration approach, no such central schedule is usually specified. Rather, reservations for resources are made “on demand”, especially in the course of the data transfer itself or shortly before this is to be carried out. A bandwidth reservation can be established automatically during a communication configuration. For this purpose, appropriate algorithms can be implemented within the network infrastructure, for example the switches and end nodes, in which a reservation request propagates from the sender to the recipient through the network and makes a reservation directly along the way. While this approach manages without a central configuration unit, there can be a high latency of the data transmissions, since individual communication connections are usually not efficiently "scheduled" over the entire path, but mostly according to the so-called "FIFO" principle within their priority class ( “First In - First Out”).

The present invention makes it possible to determine a flow chart or schedule in advance during the network configuration, which can nevertheless be changed dynamically during operation. In contrast to a decentralized configuration approach, the present method can in particular achieve higher performance and lower latency, since the reservations determined in advance can be coordinated with one another and, in particular, determined as a function of known properties of the respective communication connections. Furthermore, the reservations and the schedule can be carried out less complex and less expensive than with a central configuration approach. Individual reservations or individual entries in the schedule can be changed with little effort during operation in order to react to changed communication connections without creating a completely new schedule.

If a data transmission is to be carried out during operation, it is advantageously determined whether this data transmission is carried out by means of one or more of the reserved resources of the schedule. In particular, it can be checked whether this data transmission to be carried out corresponds to one of the expected data transmissions. In this case, this data transfer can in particular be carried out using the appropriately reserved resources. The corresponding data transmission thus uses its reserved resources, which are expediently made available during operation in accordance with the schedule.

If, on the other hand, an unexpected data transfer is to be carried out, this data transfer can, if necessary, be carried out using resources which have been reserved in advance for another data transfer. In particular, on the basis of a specifiable criterion, it can be determined by means of which of the reserved resources this unexpected data transmission is carried out.

With the expected values relevant to data transmission, it may not be possible to predict all data transmissions which are actually carried out during operation, or data transmissions can possibly be predicted which may not be carried out at all or only very rarely during operation. By determining at runtime which data transmission uses which of the reserved resources, it is possible to react flexibly to such possible inaccuracies in the expected values relevant to data transmission and thus to the heuristic view and also to possible unexpected changes in the network. The reservations are expediently used as placeholders which, if necessary, can be dynamically adapted to the data transfers actually to be carried out. The schedule with reserved resources, determined in advance before the start of the runtime, is particularly expediently filled in during operation with specific communication connections

If, therefore, new communication connections or data transmissions to the network are added during operation, it is in particular not necessary to create a completely new schedule and to reconfigure all resources. Instead, the resources reserved in advance can be flexibly redistributed during operation. In this way, a dynamic adaptation and an at least partial reconfiguration of the resource reservations and the schedule is made possible in a particularly expedient manner.

As a prescribable criterion it can be taken into account, for example, whether the unexpected data transmission is similar to one of the expected data transmissions, for example whether the corresponding communication link runs at least partially over the same switches and accounts as for one of the expected data transmissions. The corresponding resources can, for example, be permanently assigned to the new data transmission or the originally reserved and the new data transmission can also split the resources. Appropriately can also resources reserved as reserve for this unexpected data transfer can also be used.

Such unexpected data transfers can occur, for example, when a new network subscriber is added to the network during operation of the network or a new application is executed in the network. Furthermore, unexpected data transmissions can occur, for example, if network participants want to communicate with one another unexpectedly, whose data transmission was not estimated during the planning phase, for example due to an error or an inaccuracy of the expected values relevant to data transmission. It is nevertheless possible to react flexibly to such inaccuracies or errors during operation, so that there are in particular no conflicts in the schedule and when processing the data transfers to be carried out.

If a new communication connection is established during runtime, it is expediently determined via which communication connections already reserved a corresponding data source can be connected to a corresponding data sink. The stream or data stream is then booked in, in particular within the previously agreed reservations. For example, feedback about the network path to be used can be provided by a simple, central algorithm that determines a possible path within the reservations. Alternatively, switch routing tables could expediently be adapted in such a way that the connections automatically run along the reservations.

If a reserved resource is not used by a respective estimated expected data transmission during operation and another data transmission is to be carried out, for which in particular no resources are reserved, this other data transmission is preferably carried out under a predeterminable condition using this reserved resource. For example, the corresponding estimated data transmission cannot yet use its reserved resource in this case or cannot use it at a current point in time. It is also conceivable that the estimated data transmission does not use the reserved resource at all, for example due to an error or an inaccuracy of the expected values relevant to the data transmission. In this case, the resource can be redistributed to the other data transmission, temporarily or permanently, depending on the specific case. In particular, this other data transmission can be a transmission with a lower priority, which in particular has a lower priority than the actually expected data transmission and for which, for example, higher latency times are permitted. As a corresponding condition, it can expediently be specified that the resource is released again until the respective expected data transmission takes it up, so that there is in particular no collision between the expected and the other data transmission.

The resources reserved in advance can therefore expediently be used for other priority classes until they are required by the corresponding communication links. For example, the reservation can be divided into active and inactive for this purpose using a status. The reservations calculated in advance can initially be appropriately designated as “inactive reserved” or “pre-scheduled”. In this way it can be indicated in which time slot reservations can be placed. The bandwidth can then continue to be used, for example, through other priority classes. If a connection (so-called stream) is established during runtime in order to carry out an expected data transmission, the corresponding portion of the previously “inactively reserved” bandwidth is appropriately assigned as “actively reserved”. The bandwidth is then available in particular exclusively for the expected data transmission.

The network is advantageously operated in the course of a checking or test phase in accordance with the specific schedule. The schedule and thus in particular the reserved resources and also the expected values relevant to data transmission are checked, in particular for errors and / or optimization potential. It is expedient to check how precisely the data traffic during operation was predicted by the data transfer-relevant expected values and how effectively the resources were reserved and the schedule created on the basis of these predictions. Depending on a result of this check, it is advantageously determined whether the expected values relevant to data transmission are adapted and whether an adapted schedule for the ongoing operation of the network is determined with the aid of correspondingly adapted expected values relevant to data transmission. If, for example, an error or optimization potential is recognized in the course of the check, the expected values relevant to data transmission can be corrected and adapted. The data transfer-relevant expected values can be designed to be locally learning, so that the schedule can be checked within the review phase and the expected values can be adjusted if necessary. Since the estimates made with the help of the data transfer-relevant expected values can deviate from the actual operation of the network, the expected values or their results can be compared in the verification phase with the data transfers actually to be carried out. The expected values and thus the heuristic view can thus be improved in order to minimize the probability of conflicts. In particular, a learning heuristic algorithm can thus be provided.

The checking phase is preferably carried out before the actual operation of the network and / or at the start of operation of the network.

As an alternative or in addition, the checking phase is preferably carried out during operation of the network at predefinable time intervals. The check and, if necessary, the adaptation of the heuristic and the flow chart can expediently be repeated during regular operation, for example at regular, fixed intervals or also at flexible intervals, which can be specified, for example, depending on the result of the respective check.

Furthermore, an additional amount of resources is advantageously reserved as a reserve. Thus, particularly in the course of the configuration, resources of the network are not only reserved for the data transmissions to be expected, but a certain amount of resources is expediently additionally reserved, but not assigned to any data transmission. This reserve of reserved resources can be made available during operation, for example, for unexpected data transfers or, for example, also for expected data transfers which, however, require more resources than are reserved for them.

Advantageously, the data transmission-relevant information includes a classification of the individual network participants, for example a type or a type of the respective network participants, from which, with the aid of the data transmission-relevant expected values, it can be concluded in particular whether and, if so, with which other network participants this network participant will exchange data. In particular, it is also possible to specify and classify special network participants that suggest increased data traffic. This class includes, for example, instances such as line servers, edge clouds, central control computers, Kl computing clusters, database systems, etc. Such systems are in particular central nodes in a domain or in the entire network and, as a data sink, have a higher data exchange rate than other nodes . The specification in the network can be based on the affiliation to a switch as well as on the basis of one or more specific ports on the switch, the use of which must then be ensured in the physical implementation. In particular, redundant paths can also be taken into account.

Alternatively or additionally, the data transmission-relevant information preferably includes information about a subdivision of the network into, in particular, local sub-networks, in particular into domains or segments. In particular, increased communication between individual network subscribers can be expected in such sub-networks, since the subscribers are subject to a logical link.

As an alternative or in addition, the information relevant to data transmission preferably includes information about a classification of network subscribers of individual sub-networks. Within the individual sub-networks, the individual network subscribers can thus be further specified again in order to be able to infer which network subscribers in a sub-network will communicate with one another to a greater extent.

The communication system is advantageously based at least in part on Ethernet and / or on IEEE 802 standards and / or on TSN standards. The communication system expediently serves to network components of a machine in automation technology. The communication system is expediently an Ethernet-based real-time field bus, e.g. Sercos, EtherCAT, Profinet, Ethernet / IP, etc. IEEE 802 contains a number of norms or standards in the area of local, in particular wired networks, in particular Ethernet networks. "Time Sensitive Networking" (TSN) represents a series of standards or norms which, among other things, deal with the synchronization of network participants in a network, in particular in order to meet real-time requirements, in particular for data transmission via Ethernet. TSN standards are becoming more and more important in the course of Industry 4.0.

The communication system can also be designed to be at least partially wireless. The communication system preferably comprises a real-time capable mobile radio network and / or is based at least in part on 5G standards. After UMTS (3G) and LTE (4G), 5G is the fifth generation of the so-called 'Next Generation Mobile Networks' (NGMN for short), a project by cell phone companies and cell phone suppliers to develop cell phone generations. 5G builds on its direct predecessor 4G, but has considerable compared to this Improvements, especially a significantly improved real-time behavior.

The communication system is particularly advantageously based on TSN standards and 5G standards. For example, network participants can be networked in individual sub-networks using TSN standards (wired) and in other sub-networks using 5G standards (wireless). Likewise, for example, individual TSN-based subnetworks can be connected to one another via wireless connections in accordance with 5G standards, or vice versa, individual wireless 5G subnetworks can also be connected to one another via wired connections in accordance with TSN standards.

According to a particularly preferred embodiment, the network participants are each designed as a component of a machine or system, which are networked with one another via the network. Such machine components can, for example, be designed as field devices, e.g. as sensors, actuators, etc., or also as controls, e.g. as CNC control (Computerized Numerical Control), RC control (Robot Control), PAC control (Programmable Automation Controller), NC control (numerical control), programmable logic controller (PLC), motion logic control (MC - Motion Control), etc.

The invention is advantageously suitable for a wide range of machines and applications, for example for general automation, robotics, semiconductor handling, hydraulic punching / pressing, tunnel boring machines, etc. The machine can in particular be used as a machine tool such as a welding system Screw system, a wire saw or a milling machine, or be designed as a web processing machine, such as a printing machine, a newspaper printing machine, a gravure printing, screen printing machine, an inline flexographic printing machine or a packaging machine. The machine can also be designed as a (conveyor) system for the manufacture of an automobile or for the manufacture of components of an automobile (e.g. internal combustion engines or control units).

A computing unit according to the invention, for example a control unit of a printing press, is set up, in particular in terms of programming, to carry out a method according to the invention.

The implementation of a method according to the invention in the form of a computer program or computer program product with program code for performing all method steps is advantageous, since this causes particularly low costs, especially if an executing control device is used for other tasks and is therefore available anyway. Suitable data carriers for providing the computer program are, in particular, magnetic, optical and electrical memories, such as hard drives, flash memories, EEPROMs, DVDs, etc. A program can also be downloaded via computer networks (Internet, intranet, etc.).

Further advantages and embodiments of the invention emerge from the description and the accompanying drawing.

It goes without saying that the features mentioned above and those yet to be explained below can be used not only in the respectively specified combination, but also in other combinations or on their own, without departing from the scope of the present invention.

The invention is shown schematically in the drawing using exemplary embodiments and is described in detail below with reference to the drawing.

Figure list

• 1 shows schematically a system with machine components which are networked in a network and which can be the basis of a preferred embodiment of a method according to the invention.
• 2 shows schematically a preferred embodiment of a method according to the invention as a block diagram.

Detailed description of the drawing

In 1 a system is shown schematically, which can be designed, for example, as a web processing system for producing and / or processing workpieces. Individual components of this system are via a network 100 networked with each other.

The system can, for example, be a first machine 110 and a second machine 120 include, the first machine 110 for example one assembly line and the second machine 120 For example, a robot-controlled tool, for example to machine workpieces that are moving on the conveyor belt, for example welding arms, screwing tools, milling machines, etc.

To this end, the machines point 110 and 120 each has a large number of machine components. So can the first machine 110 for example a variety of sensors 111 and actuators 112 include, which via a communication system 150 with one controller 113 are connected, for example with a programmable logic controllers (PLC). The second machine can do the same 120 Sensors 121 and actuators 122 include that with a controller designed as a PLC 123 are connected.

For example, the components networked with one another 111 , 112 , 113 the first machine 110 as well as the connected components 121 , 122 , 123 the second machine 120 a local subnetwork or a segment or a domain of the network 100 form. Furthermore, the two machines 110 , 120 or their controls 113 , 123 with a higher-level control unit 130 via the communication system 150 be connected, which in particular to coordinate the two machines 110 , 120 or the two sub-networks can be formed. For example, the higher-level control unit 130 be provided as a programmable logic controller.

The individual network participants or components are networked with one another by means of an appropriate topology, particularly expediently by means of a line topology or a ring topology. In particular, there can also be redundancy of connections. For example, different topologies can also be provided in different domains.

It goes without saying that the system can also have further components and that the network 100 may include other network participants, for example infrastructure components such as distributors, switches, nodes, etc.

So that the movements of the assembly line and the robot can run synchronously and coordinated with one another, it is important that data transmission between the individual networked machine components 111 , 112 , 113 , 121 , 122 , 123 , 130 can take place in real time, so that the transmitted data reach or have reached the desired participant at a definable point in time.

The communication system 150 is designed as a real-time communication system for this purpose. For example, the communication system 150 be based on Ethernet, IEEE standards and also preferably on TSN standards and be designed, for example, as an Ethernet-based real-time fieldbus, for example Sercos, EtherCAT, Profinet, Ethernet / IP, etc. The real-time communication system can also 150 also be wireless, based on 5G standards and designed as a 5G cellular network.

Furthermore, in particular those components of the network that support time planning are synchronized with one another and thus have a common time base. All components of the network can expediently be synchronized with one another.

In addition, there is real-time communication over the network 100 To enable it, it matters the resources of the network 100 , such as the bandwidth, to be suitably managed in order to be able to provide appropriate resources for time-critical data transmissions, so that these transmissions can be processed up to a predetermined point in time. For this purpose, a schedule is to be created according to which resources are to be reserved for certain time-critical data transmissions. In particular, a dynamic reservation of resources can be important, for example in order to be able to react to new communication connections which are newly generated during the operation of the network by adding network participants. Furthermore, the schedule should be flexibly adaptable during operation so that new data transmissions and new communication connections can be incorporated, for example when new components are added to the system or when new services, applications or the like are started during runtime.

For this purpose the network 200 according to a preferred embodiment of a method according to the invention, which in 2 is shown schematically as a block diagram and is to be explained below, configured. For this purpose, a network structure, as for example in 1 is shown, with specific details of the network participants to be used, for example certain control devices, sensors, actuators, etc., but also network components such as switches, bridges, etc., in particular on a computer unit set up in terms of programming to carry out a method according to the invention, for example a PC with a network planning program.

In one preparatory step 211 information relevant to data transmission relating to the large number of network participants is first determined, which in particular provides information about the network traffic to be expected during the regular runtime of the network 100 enable.

For example, this data transmission-relevant information can be used to subdivide the network 100 into the segments or domains 110 , 120 concern and also the classification or the special type of the individual network participants in these segments. So can for example the sensors 111 , 121 and the actuators 112 , 122 classified as field devices or I / O devices. The controls 113 , 123 can for example each be classified as a control computer and the control unit 130 as a central control computer. This step can, for example, be carried out automatically on the processing unit if the individual data transmission-relevant information is available in connection with the network participants and network components used, for example in a corresponding database.

Based on this data transfer-relevant information, in the course of a planning or configuration phase 210 before commissioning the network 100 or before the start of operation, a flow chart or schedule is created and resources of the network are reserved for certain data transmissions and communication connections.

Depending on this specific information relevant to data transmission, step 212 With the help of data transfer-relevant expected values, data transfers to be expected from individual network participants in the operation of the network are estimated. For example, a heuristic algorithm can be provided for this purpose, which evaluates the data transmission-relevant information on the basis of certain criteria.

For example, it can be expected that the individual sensors 111 the first machine 110 or the first segment in operation more data transfers to the controller 113 carried out in order to transfer currently recorded measured values to them. Corresponding estimates apply to the sensors 121 and the controls 123 the second machine 120 or the second segment.

Furthermore, for example, increased data traffic from the controllers 113 , 123 to the individual actuators 112 or. 122 can be expected to deliver current control or setpoint values to the individual actuators depending on the current sensor measurement values 112 or. 122 to submit.

Increased data exchange from the controls can also occur 113 and 123 via the higher-level control unit 130 to be expected around the movements of the machines 110 , 120 to coordinate.

In step 213 become resources of the network 100 , in particular a bandwidth for which in step 212 Estimated expected data transfers are reserved and a schedule is drawn up accordingly.

Furthermore, in step 214 a certain amount of resources is additionally reserved as a reserve, but not assigned to any data transmission.

With the expected values relevant to data transmission, it is usually not possible to determine with certainty which data transmissions are actually carried out during operation. Since the corresponding heuristic algorithm uses presumptive conclusions to estimate which data transmissions could occur based on the data transmission-relevant expected values, there may be a discrepancy between expected and actual data transmissions.

In order to check the data transfer-relevant expected values and their results for errors and / or optimization potential, a test or checking phase is expediently carried out 220 accomplished. Thereby the network 100 in step 221 operated under specified test conditions according to the specified schedule and the reservations made.

In step 222 it is checked how precisely the data traffic during operation was predicted by the data transfer-relevant expected values and how effectively the resources were reserved and the schedule created.

In the event of discrepancies and collisions between actually carried out and expected data transmissions, the data transmission-relevant expected values in step 223 appropriately adapted accordingly and with the aid of correspondingly adapted data transmission-relevant expected values is an adapted flow chart for the ongoing operation of the network 100 definitely.

However, if the actual and the expected data transmissions at least essentially match, no changes can be made to the data transmission-relevant expected values and the originally determined schedule can be used for the ongoing operation of the network 100 be used. The review phase 220 can also be repeated during the regular running time at predefinable time intervals.

A block 230 now describes the regular operation of the network 100 . Thereby the network 100 in step 231 regularly put into operation according to the corresponding schedule and the reserved resources. In particular, the participating network participants, for example control devices, sensors, actuators, etc., and network components, for example switches, bridges, etc., are configured according to the corresponding schedule and the reserved resources. The heuristic algorithm is used for regular operation 230 expediently no longer required and can be deactivated.

When in operation 230 a data transfer is to be carried out in step 232 determined, for example by the control unit 130 whether this data transfer is carried out using one or more of the reserved resources in the schedule.

If one of the estimated data transfers to be expected is actually to be carried out, this data transfer is in step 233 carried out using the corresponding reserved resources and according to the specified schedule. For example, the estimated data transmissions from the sensors 111 , 121 to the controller 113 or. 123 as well as the expected data transfers from the controllers 113 or. 123 Sensors to the actuators 112 or. 123 to be carried out as planned.

When in operation 230 of the network 100 an unexpected data transmission is to be carried out which does not correspond to any of the estimated data transmissions to be expected is shown in step 232 determined on the basis of a predeterminable criterion, for example by the control unit 130 which of the reserved resources will be used to carry out this unexpected data transfer.

For example, such unexpected data transmission can occur when the system has new components and thus the network 100 new network participants are added or when new applications or functions are integrated into the system, which are controlled by the controls 113 , 123 , 130 are executed. In the present example, a new sensor is installed in the first machine 110 added.

In step 234 corresponding already reserved resources are allocated to this new data transfer and this data transfer is carried out accordingly. For example, the specifiable criterion that can be taken into account is whether the unexpected data transmission is similar to one of the expected data transmissions, for example whether the corresponding communication link runs at least partially over the same switches and nodes as an expected data transmission.

For example, if a new sensor is installed on the first machine 110 is added, its sensor values via the control 113 to the control unit 130 are to be transmitted, resources can be used for this data transmission, which are used for the communication connections of the sensors that are already present 111 via the controller 113 to the control unit 130 are reserved.

It is also possible to use previously reserved resources for other priority classes as long as no data transfers are expected. To do this, step in 232 can also be checked, for example by the control unit 130 whether a reserved resource is not used by a respective expected data transmission and another data transmission is to be carried out, for which in particular no resources are reserved. In this case, in step 235 this other data transmission can be carried out in accordance with this reserved resource under a predeterminable condition. As a predeterminable condition, it is particularly taken into account that the resource is released again until the respective expected data transmission takes it up, so that there is no collision between the expected and the other data transmission.

Claims (15)

Method for configuring a network (100), wherein in the network (100) a large number of network subscribers (111, 112, 113, 121, 122, 123, 130) are connected via a communication system (150), depending on information relevant to data transmission with regard to the multitude of network participants (111, 112, 113, 121, 122, 123, 130) with the help of data transfer-relevant expected values, data transmissions of individual network participants of the multitude of network participants (111, 112, 113, 121, 122, 123, 130) in the Operation (230) of the network (100) can be estimated (212), resources of the network (100) being reserved for the estimated expected data transfers and a schedule for the estimated expected data transfers being determined according to the reserved resources (213). Procedure according to Claim 1 , wherein, if a data transmission is to be carried out during operation (230), it is determined (232) whether this data transmission is carried out by means of one or more of the reserved resources of the schedule. Procedure according to Claim 1 or 2 wherein, if one of the expected data transmissions is actually to be carried out during operation (230) of the network (100), this data transmission is carried out (233) using the corresponding reserved resources and in accordance with the determined schedule. The method according to any one of the preceding claims, wherein when in operation (230) of the Network (100) an unexpected data transfer is to be carried out which does not correspond to any of the expected data transfers, is determined on the basis of a predeterminable criterion by means of which of the reserved resources this unexpected data transfer is carried out (234). Method according to one of the preceding claims, wherein if a reserved resource is not used by a respective expected data transmission during operation (230) of the network (100) and another data transmission is to be carried out, for which in particular no resources are reserved, this Another data transmission is carried out under a predeterminable condition using this reserved resource (235). Method according to one of the preceding claims, wherein the network (100) is operated in the course of a checking phase (220) according to the specific schedule, the schedule and the data transfer-relevant expected values are checked (222) and is determined as a function of a result of this check (223) whether the data transmission-relevant expected values are adapted and whether an adapted flow chart for the further ongoing operation (230) of the network (100) is determined with the aid of correspondingly adapted data transmission-relevant expected values. Procedure according to Claim 6 , the checking phase (220) before the start of the runtime (230) of the network (100) at and / or at the start of the runtime (230) of the network (100) and / or during operation (230) of the network (100) in specifiable Is carried out at intervals. The method of any preceding claim, further comprising reserving (214) an additional amount of resources as a reserve. Method according to one of the preceding claims, wherein the data transmission-relevant information is information about a classification of the individual network participants (111, 112, 113, 121, 122, 123, 130) and / or about a subdivision of the network (100) into sub-networks (110, 120) ) and / or via a classification of network subscribers (111, 112, 113, 121, 122, 123, 130) of individual sub-networks (110, 120) (211). Method according to one of the preceding claims, wherein the communication system (150) is based at least in part on Ethernet and / or on IEEE 802 standards and / or on TSN standards. Method according to one of the preceding claims, wherein the communication system (150) has a real-time capable mobile radio network and / or is at least partially based on 5G standards. Method according to one of the preceding claims, wherein the network participants (111, 112, 113, 121, 122, 123, 130) are each designed as a component of a machine or system which are networked with one another via the network (100). Computing unit which is set up to carry out a method according to one of the preceding claims. Computer program that prompts a computing unit, a method according to one of the Claims 1 until 12th to be carried out when it is executed on the processing unit. Machine-readable storage medium with a computer program stored thereon Claim 14 .

Images