Method for Transmission of Messages in a Computer Network and Computer Network
The invention concerns a method for the transmission of messages in a computer network, wherein the computer network comprises nodes ( 101, 102, 103, 104, 101 a, 101 b, 102 a ), which are connected to each other by communication lines ( 110 ), e.g., in which each time two nodes are connected to each other, and wherein the nodes ( 101, 102, 103, 104, 101 a, 101 b, 102 a ) exchange messages with each other, and wherein data (D 101 , D 102 , D 103 ) in the form of messages is communicated between the nodes, and wherein at least two first nodes ( 101, 102; 102, 103 ) send data (D 101 , D 102 ; D 102 , D 103 ) to a common second node ( 103; 104 ), wherein the computer network is designed such that at least one first node ( 102; 103 ) lies in at least one communication pathway of an additional first sending node ( 101; 102 ) or the plurality of additional first sending nodes to the common second node ( 103; 104 ), and wherein at least one first node ( 102; 103 )—the so-called integration node ( 102; 103 )—which is situated closer to the common second node ( 103; 104 ) than at least one other first node ( 101; 102 ) integrates the data (D 101 , D 102 ) from at least one of the messages of the at least one node ( 101; 102 ) further removed from the common second node ( 103; 104 ) into at least one message generated by the integration node ( 102; 103 ), which this integration node ( 102; 103 ) sends to the common second node ( 103; 104 ), and wherein the at least one integration node ( 102; 103 ) for the purpose of this integration after the transmission of the proper integration node data (D 102 ; D 103 ) to be transmitted by it continues with the transmission of at least one message transmitting this proper integration node data (D 102 ; D 103 ), a so-called integration message, by inserting the data (D 101 , D 102 ) being integrated of the at least one additional first node ( 101; 102 ) and/or fill data (S 102 ) into this at least one message.
1 . A method for the transmission of messages in a computer network, wherein the computer network comprises nodes ( 101 , 102 , 103 , 104 , 101 a , 101 b , 102 a ), which are connected to each other by communication lines ( 110 ), e.g., in which each time two nodes are connected to each other, and wherein the nodes ( 101 , 102 , 103 , 104 , 101 a , 101 b , 102 a ) exchange messages with each other, and wherein data (D 101 , D 102 , D 103 ) in the form of messages is communicated between the nodes, and wherein
at least two first nodes ( 101 , 102 ; 102 , 103 ) send data (D 101 , D 102 ; D 102 , D 103 ) to a common second node ( 103 ; 104 ), wherein the computer network is designed such that at least one first node ( 102 ; 103 ) lies in at least one communication pathway of an additional first sending node ( 101 ; 102 ) or the plurality of additional first sending nodes to the common second node ( 103 ; 104 ), and wherein
at least one first node ( 102 ; 103 )—the so-called integration node ( 102 ; 103 )—which is situated closer to the common second node ( 103 ; 104 ) than at least one other first node ( 101 ; 102 ) integrates the data (D 101 ; D 102 ) from at least one of the messages of the at least one node ( 101 ; 102 ) further removed from the common second node ( 103 ; 104 ) into at least one message generated by the integration node ( 102 ; 103 ), which this integration node ( 102 ; 103 ) sends to the common second node ( 103 ; 104 ), and wherein the at least one integration node ( 102 ; 103 ) for the purpose of this integration after the transmission of the proper integration node data (D 102 ; D 103 ) to be transmitted by it continues with the transmission of at least one message transmitting this proper integration node data (D 102 ; D 103 ), a so-called integration message, by inserting the data (D 101 ; D 102 ) being integrated of the at least one additional first node ( 101 ; 102 ) and/or fill data (S 102 ) into this at least one message.
2 . The method of claim 1 , wherein fill data (S 102 ) is integrated by a defined pattern (PAD, SDF) into the at least one integration message.
3 . The method of claim 1 , wherein the data (D 101 , D 102 , D 103 ) transmitted by the at least two first and the common second nodes contains check sums.
4 . The method of claim 1 , wherein the at least two first and the common second nodes ( 101 , 102 , 103 ) can transmit time-triggered messages, for example messages at configured moments of time (T 1 , T 2 , T 3 ) in a global time.
5 . The method of claim 4 , wherein sending nodes ( 101 , 102 , 103 ) have the same moment of time (T 1 , T 2 , T 3 ) configured for the transmission, preferably for the sending time, of at least one of their messages each time.
6 . The method of claim 1 , wherein the at least one integration node ( 102 ; 103 ) waits for a configurable or configured period of time and
if within this period of time data (D 101 ; D 102 ) from at least one additional first node ( 101 ; 102 ) begins to arrive, the integration node ( 102 ; 103 ) integrates this data (D 101 ; D 102 ) into the message generated by it or begins to integrate it, preferably immediately after the proper integration node data (D 103 ) or after fill data (S 102 ) which follows the proper integration node data (D 103 ), and
if within this period of time no data (D 101 ; D 102 ) begins to arrive from additional first nodes ( 101 ; 102 ), the integration node ( 102 ; 103 ) terminates the message generated by it and transmits this to a receiver ( 103 ; 104 ).
7 . The method of claim 1 , wherein the at least one integration node ( 102 ; 103 ) integrates fill data (S 102 ) arriving from at least one additional first node ( 101 ; 102 ) in the message generated by it, or preferably it does not integrate this fill data.
8 . A computer network comprising:
nodes ( 101 , 102 , 103 , 104 , 101 a , 101 b , 102 a ), which are connected to each other by communication lines ( 110 ), e.g., in which each time two nodes are connected to each other, and wherein the nodes ( 101 , 102 , 103 , 104 , 101 a , 101 b , 102 a ) exchange messages with each other, and wherein data (D 101 , D 102 , D 103 ) in the form of messages is communicated between the nodes, and wherein
at least two first nodes ( 101 , 102 ; 102 , 103 ) send data (D 101 , D 102 ; D 102 , D 103 ) to a common second node ( 103 ; 104 ), wherein the computer network is designed such that at least one first node ( 102 ; 103 ) lies in at least one communication pathway of an additional first sending node ( 101 ; 102 ) or the plurality of additional first sending nodes to the common second node ( 103 ; 104 ), and wherein
at least one first node ( 102 ; 103 )—the so-called integration node ( 102 ; 103 )—which is situated closer to the common second node ( 103 ; 104 ) than at least one other first node ( 101 ; 102 ) integrates the data (D 101 ; D 102 ) from at least one of the messages of the at least one node ( 101 ; 102 ) further removed from the common second node ( 103 ; 104 ) into at least one message generated by the integration node ( 102 ; 103 ), which this integration node ( 102 ; 103 ) sends to the common second node ( 103 ; 104 ), and wherein
the at least one integration node ( 102 ; 103 ) for the purpose of this integration after the transmission of the proper integration node data (D 102 ; D 103 ) to be transmitted by it continues with the transmission of at least one message transmitting this proper integration node data (D 102 ; D 103 ), a so-called integration message, by inserting the data (D 101 ; D 102 ) being integrated of the at least one additional first node ( 101 ; 102 ) and/or fill data (S 102 ) into this at least one message.
9 . The computer network of claim 8 , wherein fill data (S 102 ) is integrated by a defined pattern (PAD, SDF) into the at least one integration message.
10 . The computer network of claim 8 , wherein the data (D 101 , D 102 , D 103 ) transmitted by the at least two first and the common second nodes contains check sums.
11 . The computer network of claim 8 , wherein the at least two first and the common second nodes ( 101 , 102 , 103 ) can transmit time-triggered messages, for example messages at configured moments of time (T 1 , T 2 , T 3 ) in a global time.
12 . The computer network of claim 11 , wherein sending nodes ( 101 , 102 , 103 ) have the same moment of time (T 1 , T 2 , T 3 ) configured for the transmission, preferably for the sending time, of at least one of their messages each time.
13 . The computer network of claim 8 , wherein the at least one integration node ( 102 ; 103 ) waits for a configurable or configured period of time and
if within this period of time data (D 101 ; D 102 ) from at least one additional first node ( 101 ; 102 ) begins to arrive, the integration node ( 102 ; 103 ) integrates this data (D 101 ; D 102 ) into the message generated by it or begins to integrate it, preferably immediately after the proper integration node data (D 103 ) or after fill data (S 102 ) which follows the proper integration node data (D 103 ), and
if within this period of time no data (D 101 ; D 102 ) begins to arrive from additional first nodes ( 101 ; 102 ), the integration node ( 102 ; 103 ) terminates the message generated by it and transmits this to a receiver ( 103 ; 104 ).
14 . The computer network of claim 8 , wherein the at least one integration node ( 102 ; 103 ) integrates fill data (S 102 ) arriving from at least one additional first node ( 101 ; 102 ) in the message generated by it, or preferably it does not integrate this fill data.
15 . A real-time computer system, especially a distributed real-time computer system, which comprises at least one communication system, wherein the at least one communication system is configured as the computer network of claim 8 .