Method, in particular time-controlled fault-tolerant method, for periodic transport of real-time data in a computer system, in particular distributed computer system, which computer system comprises node computers, in particular a plurality of node computers, and distribution units (131, 132, 133, 151), in particular a plurality of distribution units (131, 132, 133, 151), the node computers and the distribution units having access to a global time, and real-time data being transported by means of time-controlled real-time messages, characterized in that the topology of the computer system corresponds to an in-tree, wherein node computers are arranged at the leaves of the in-tree, to each of said node computers one or more sensors being assigned, and wherein said node computers arranged at the leaves of the in-tree transmit sensor data in the payload of time-controlled real-time messages towards a control centre located at the root of the in-tree at preferably synchronized times, and wherein distribution units at inner nodes of the in-tree, in particular all distribution units (131, 132, 133, 151) at inner nodes of the in-tree, which receive real-time messages from several senders, i.e. from at least two node computers, or from at least two distribution units, or from at least one node computer and at least one distribution unit, copy payloads of the two or more real-time messages arriving at the respective distribution unit in an, in particular a priori defined, time or time window respectively into the payload of at least one new real-time message, preferably into the payload of one new real-time message, and wherein said at least one new real-time message, in particular said one new real-time message, is transmitted at a time defined a priori, in particular by the distribution units, towards the control centre, and wherein the payload of one or more real-time messages incoming at a distribution unit is transported from the distribution unit with an outgoing real-time message, and wherein an individual schedule is created for each distribution unit a priori, which schedule contains a periodically recurring start time of transmission for a real-time message outgoing from the respective distribution unit, which is calculated a priori from - the a priori known time of arrival of a determining, for example defined a priori, payload to be transported of one of the incoming real-time messages, in particular a time-critical payload to be transported of one of the incoming messages, - minus the a priori known lead time interval ([391,393]) of the outgoing real-time message, - plus at least one time interval ([323,393]) needed for copying a data element of the determining payload, in particular the time-critical payload of the incoming real-time message, into a data element of the payload of the outgoing real-time message, and wherein the payloads of the incoming real-time messages are copied into the payload of the outgoing real-time message by executing this a priori created schedule. - the a priori known time of arrival of a determining, for example defined a priori, payload to be transported of one of the incoming real-time messages, in particular a time-critical payload to be transported of one of the incoming messages, - minus the a priori known lead time interval ([391,393]) of the outgoing real-time message, - plus at least one time interval ([323,393]) needed for copying a data element of the determining payload, in particular the time-critical payload of the incoming real-time message, into a data element of the payload of the outgoing real-time message,