Method for the transmission of data telegrams in a switched cyclical communication system

• US 20060018327A1
• Filed: 03/21/2005
• Published: 01/26/2006
• Est. Priority Date: 09/20/2002
• Status: Active Grant

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Krause, Karl-Heinz, Klotz, Dieter, Weber, Karl, Brueckner, Dieter
• Granted Patent: US 7,656,865 B2
• Time in Patent Office: Days
• US Class Current: 370/400
• CPC Class Codes: G06F 11/1625 in communications, e.g. transmission, interfaces
• CPC Class Codes: G06F 11/2005 using redundant communication controllers
• CPC Class Codes: G06F 11/2007 using redundant communication media
• CPC Class Codes: G06F 21/6218 to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06F 21/6245 Protecting personal data, e.g. for financial or medical purposes
• CPC Class Codes: G06F 2221/2101 Auditing as a secondary aspect
• CPC Class Codes: G06F 2221/2141 Access rights, e.g. capability lists, access control lists, access tables, access matrices
• CPC Class Codes: G06F 2221/2149 Restricted operating environment
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 20/1235 with control of digital rights management [DRM]
• CPC Class Codes: G06Q 20/385 using an alias or single-use codes
• CPC Class Codes: G06Q 20/425 using two different networks, one for transaction and one for security confirmation
• CPC Class Codes: G06Q 30/0277 Online advertisement
• CPC Class Codes: G06Q 30/0609 Buyer or seller confidence or verification
• CPC Class Codes: G06Q 50/188 Electronic negotiation
• CPC Class Codes: G07F 17/16 for devices exhibiting advertisements, announcements, pictures or the like
• CPC Class Codes: H04B 7/0604 with predefined switching scheme
• CPC Class Codes: H04B 7/084 Equal gain combining, only phase adjustments antenna beam scanning or forming by phase or amplitude control H01Q3/26, e.g. phased arrays
• CPC Class Codes: H04B 7/0894 using different delays between antennas
• CPC Class Codes: H04B 7/15507 Relay station based processing for cell extension or control of coverage area, network planning with network coordinated processing with regard to cell extension H04W16/26; network topologies using dedicated repeater stations H04W84/047; terminal devices adapted for relaying to or from an other terminal H04W88/04
• CPC Class Codes: H04B 7/15535 : Control of relay amplifier gain amplifier gain control in general H03G3/00; gain control reducing self - or loop interference H04B7/15578
• CPC Class Codes: H04J 13/12 : Generation of orthogonal codes
• CPC Class Codes: H04L 1/0041 : Arrangements at the transmitter end
• CPC Class Codes: H04L 1/0045 : Arrangements at the receiver end
• CPC Class Codes: H04L 1/0066 : Parallel concatenated codes
• CPC Class Codes: H04L 1/0069 : Puncturing patterns
• CPC Class Codes: H04L 1/0071 : Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 1/06 : using space diversity
• CPC Class Codes: H04L 1/08 : by repeating transmission, e.g. Verdan system H04L1/1858 and H04L1/189 take precedence
• CPC Class Codes: H04L 1/1819 : with retransmission of additional or different redundancy
• CPC Class Codes: H04L 1/1841 : Resequencing
• CPC Class Codes: H04L 1/1845 : Combining techniques, e.g. code combining
• CPC Class Codes: H04L 1/1848 : Time-out mechanisms
• CPC Class Codes: H04L 12/12 : Arrangements for remote connection or disconnection of substations or of equipment thereof
• CPC Class Codes: H04L 12/2856 : Access arrangements, e.g. Internet access asynchronous transfer mode networks H04L12/5601; broadband local area networks H04L12/2801; optical access or distribution networks H04Q11/0067; access to open networks H04L12/5691; digital subscriber line end-user equipment and bit-level processing of data on a PSTN-based network H04M11/00; home network gateways H04L12/2834; wireless access networks H04W
• CPC Class Codes: H04L 12/2874 : Processing of data for distribution to the subscribers
• CPC Class Codes: H04L 12/40078 : Bus configuration home automation networks H04L12/2803; arrangements for maintenance or administration H04L41/00
• CPC Class Codes: H04L 12/40195 : by using a plurality of nodes
• CPC Class Codes: H04L 12/44 : Star or tree networks
• CPC Class Codes: H04L 12/6418 : Hybrid transport
• CPC Class Codes: H04L 2001/0096 : Channel splitting in point-to-point links
• CPC Class Codes: H04L 2012/40241 : Flexray
• CPC Class Codes: H04L 2012/40273 : the transportation system being a vehicle
• CPC Class Codes: H04L 2012/6462 : Movable boundaries in packets or frames
• CPC Class Codes: H04L 2209/127 : Trusted platform modules [TPM]
• CPC Class Codes: H04L 27/2602 : Signal structure
• CPC Class Codes: H04L 41/12 : Discovery or management of network topologies
• CPC Class Codes: H04L 47/10 : Flow control; Congestion control
• CPC Class Codes: H04L 47/22 : Traffic shaping
• CPC Class Codes: H04L 47/2441 : relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/28 : in relation to timing considerations
• CPC Class Codes: H04L 47/34 : ensuring sequence integrity, e.g. using sequence numbers
• CPC Class Codes: H04L 47/50 : Queue scheduling
• CPC Class Codes: H04L 47/621 : Individual queue per connection or flow, e.g. per VC
• CPC Class Codes: H04L 5/0023 : Time-frequency-space
• CPC Class Codes: H04L 5/0042 : intra-user or intra-terminal allocation
• CPC Class Codes: H04L 5/0044 : allocation of payload
• CPC Class Codes: H04L 5/0083 : symbol-by-symbol
• CPC Class Codes: H04L 63/0428 : wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/065 : for group communications cryptographic mechanisms or cryptographic arrangements for key management involving conference or group key H04L9/0833
• CPC Class Codes: H04L 63/08 : for authentication of entities cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32
• CPC Class Codes: H04L 63/0807 : using tickets, e.g. Kerberos cryptographic mechanisms or cryptographic arrangements for entity authentication using tickets or tokens H04L9/3213
• CPC Class Codes: H04L 63/102 : Entity profiles
• CPC Class Codes: H04L 63/1441 : Countermeasures against malicious traffic countermeasures against attacks on cryptographic mechanisms H04L9/002
• CPC Class Codes: H04L 67/14 : Session management for real-time applications in data packet communications networks H04L65/1066
• CPC Class Codes: H04L 67/306 : User profiles
• CPC Class Codes: H04L 67/51 : Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 69/16 : Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
• CPC Class Codes: H04L 69/168 : specially adapted for link layer protocols, e.g. asynchronous transfer mode [ATM], synchronous optical network [SONET] or point-to-point protocol [PPP]
• CPC Class Codes: H04L 69/324 : in the data link layer [OSI layer 2], e.g. HDLC
• CPC Class Codes: H04L 9/32 : including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
• CPC Class Codes: H04M 1/2535 : adapted for voice communication over an Internet Protocol [IP] network Voice over Internet Protocol (VoIP) network equipment and services H04M7/006; implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP] H04L69/16
• CPC Class Codes: H04M 7/0057 : Services where the data services network provides a telephone service in addition or as an alternative, e.g. for backup purposes, to the telephone service provided by the telephone services network
• CPC Class Codes: H04M 7/0069 : comprising a residential gateway, e.g. those which provide an adapter for POTS or ISDN terminals
• CPC Class Codes: H04N 21/6125 : involving transmission via Internet transmission by internet of broadcast information H04H60/82
• CPC Class Codes: H04N 21/64738 : Monitoring network characteristics, e.g. bandwidth, congestion level data switched network analysis H04L41/14; monitoring functioning in data switched networks H04L43/0817; flow control in packet networks H04L47/10
• CPC Class Codes: H04N 21/64784 : Data processing by the network data processing in packet switching systems H04L12/56; flow control in packet networks H04L47/10; intermediate storage or scheduling H04L49/90; provisioning of proxy services in data packet switching networks H04L67/56
• CPC Class Codes: H04W 28/14 : using intermediate storage
• CPC Class Codes: H04W 48/16 : Discovering, processing access restriction or access information
• CPC Class Codes: H04W 52/143 : Downlink power control
• CPC Class Codes: H04W 52/225 : Calculation of statistics, e.g. average, variance
• CPC Class Codes: H04W 52/24 : using SIR [Signal to Interference Ratio] or other wireless path parameters
• CPC Class Codes: H04W 52/241 : taking into account channel quality metrics, e.g. SIR, SNR, CIR, Eb/lo
• CPC Class Codes: H04W 52/242 : taking into account path loss
• CPC Class Codes: H04W 52/245 : taking into account received signal strength
• CPC Class Codes: H04W 52/46 : in multi hop networks, e.g. wireless relay networks
• CPC Class Codes: H04W 52/48 : during retransmission after error or non-acknowledgment
• CPC Class Codes: H04W 74/02 : Hybrid access
• CPC Class Codes: H04W 76/10 : Connection setup
• CPC Class Codes: H04W 8/005 : Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 8/04 : Registration at HLR or HSS [Home Subscriber Server]
• CPC Class Codes: H04W 84/12 : WLAN [Wireless Local Area Networks]
• CPC Class Codes: Y10S 707/99933 : Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99936 : Pattern matching access
• CPC Class Codes: Y10S 707/99939 : Privileged access

Abstract

A method for the transmission of data messages in a switched cyclical communication system (38, 39) with a linear or ring arrangement of the users. Real-time critical data messages are transmitted in a first segment (20) of a transmission cycle (31), without the need to first plan the send and receive instants in the forwarding users, such that the chronological start (21) of the first segment (20) of a transmission cycle (31) is guaranteed by all users in all transmission cycles through monitoring. The duration of the first segment (20) of a transmission cycle (31) can be fixedly specified or automatically adjusted using a timeout procedure.

Claims

1. A method for transmitting data messages in a switched cyclical communication system having a plurality of users that are interconnected by network connections, in which, each user is configured as at least one of a sender and a receiver of data messages, and in which each said user has at least one buffer memory for storage of data messages, and where the data messages are transmitted in transmission cycles and each transmission cycle has at least one first segment for transmission of data messages with real-time critical data and at least one additional segment for transmission of data messages with non-real-time critical data, the method comprising:

identifying the data messages containing real-time critical data;

determining a chronological start of each of the at least one first segment of a respective transmission cycle within the respective transmission cycle;

ensuring that the transmission of a non-real-time critical data message is completed when each of the at least one first segment of the respective transmission cycle starts; and

transmitting the real-time critical data messages in the at least one first segment of the transmission cycle.

2. The method as claimed in claim 1, wherein the communication system comprises one or more sections, and wherein at least one section has no branchings and no junctions.

3. The method as claimed in claim 1, wherein the communication system comprises one or more sections, and wherein at least one section has either no branchings or no junctions.

4. The method as claimed in claim 1, wherein data messages that contain real-time critical data are identified by a unique header identifier.

5. The method as claimed in claim 1, wherein:

prior to the chronological start of the at least one first segment of the transmission cycle, a non-real-time critical data message queued for transmission in a user is not transmitted and is buffered in the buffer memory of a user if the transmission of the data message is not completed before the chronological start of the at least one first segment of the transmission cycle and is sent only after end of the at least one first segment of the transmission cycle.

6. The method as claimed in claim 1, wherein time length of each of the at least one first segment of the transmission cycle is fixedly set.

7. The method as claimed in claim 1, wherein time length of each of the at least one first segment of the transmission cycle is automatically adjusted using a timeout procedure.

8. The method as claimed in claim 7, wherein a timeout period starts to run:

with the chronological start of the at least one first segment of the transmission cycle, or

after an end of a transmission of a real-time critical data message,

wherein the at least one first segment of the transmission cycle is terminated with an elapse of the timeout period if no requests for transmission of a real-time critical data message falls within this timeout period, or

wherein the at least one first segment is not terminated if the transmission start of a real-time critical data message falls within the timeout period.

9. The method as claimed in claim 7, wherein a duration of the timeout period is adjustable.

10. The method as claimed in claim 1, wherein:

free memory space is reserved in the buffer memory of a user and the real-time critical data messages are buffered into the reserved free memory space of the buffer memory of the user, and

a maximum size of the reserved free memory space matches amount of data or data messages that are to be injected at a respective user.

11. The method as claimed in claim 10, wherein, to control the reservation of the free memory space in the buffer memory of the respective user, a marking is set, and wherein the set marking corresponds to the maximum size of the free memory space that is to be reserved.

12. The method as claimed in claim 11, wherein, if less than the free memory space identified by the marking and less than the free memory space to be reserved in the buffer memory of the respective user, is available, the respective user accepts real-time critical data messages and control diagrams and performs at least one of rejecting and discarding non-real-time critical data messages.

13. The method as claimed in claim 10, wherein, if less than the free memory space identified by the marking and less than the free memory space to be reserved in the buffer memory of the respective user, is available, the respective user accepts real-time critical data messages and control diagrams and performs at least one of rejecting and discarding non-real-time critical data messages.

14. A user in a switched cyclical communication system that has at least one section that has no branchings and/or no junctions, where the user is configured as at least one of a sender and a receiver of data messages, and where the user has at least one buffer memory for storage of data messages that are transmitted in transmission cycles, each transmission cycle having at least one first segment for transmission of data messages with real-time critical data and at least one additional segment for transmission of data messages with non-real-time critical data, the user comprising:

a module identifying the data messages containing real-time critical data;

a module determining a chronological start of a first segment of a transmission cycle within the transmission cycle;

a module ensuring that the transmission of a non-real-time critical data message is completed prior to the start of the first segment of the transmission cycle; and

a module transmitting the real-time critical data messages in the first segment of the transmission cycle.

15. The user as claimed in claim 14, wherein the user identifies the data messages containing real-time critical data by a unique header identifier.

16. The user as claimed in claim 14, wherein, if the transmission of a non-real-time critical data message to be sent is not completed by the chronological start of the first segment of the transmission cycle,

the user does not send the non-real-time critical data message queued for transmission prior to the chronological start of the first segment of the transmission cycle,

the user buffers the unsent non-real-time critical data message in the buffer memory of the respective user, and

the user sends the buffered non-real-time critical data message only after an end of the first segment of the transmission cycle.

17. The user as claimed in claim 14, wherein the user fixedly sets time length of the first segment of the transmission cycle.

18. The user as claimed in claim 14, wherein the user automatically adjusts the time length of the first segment of the transmission cycle using a timeout procedure.

19. The user as claimed in claim 18, wherein the user allows a timeout period to run with the chronological start of the first segment of the transmission cycle or after the end of the transmission of the real-time critical data message, and

wherein the user terminates the first segment of the transmission cycle with an elapse of the timeout period if no request to start sending a real-time critical data message falls within this timeout period, or wherein the user does not terminate the first segment if the request to start sending the real-time critical data message falls within the timeout period.

20. The user as claimed in claim 19, wherein the user sets a duration of the timeout period.

21. The user as claimed in claim 18, wherein the user sets a duration of the timeout period.

22. The user as claimed in claim 14, wherein:

the user reserves free memory space in the buffer memory of the user, the buffer memory is buffering the real-time critical data messages, and

a maximum size of the free memory space to be reserved matches amount of data or data messages to be injected at the user.

23. The user as claimed in claim 22, wherein the user sets a marking to control the reservation of the free memory space in the buffer memory of the user, the marking corresponds to a maximum size of the free memory space to be reserved.

24. The user as claimed in claim 22, wherein, if less than the free memory space identified by the marking and to be reserved in the buffer memory is available, the user accepts at least one of real-time critical data messages and control diagrams and the user performs at least one of rejecting and discarding non-real-time critical data messages.

25. The user as claimed in claim 14, wherein the user is a network node with an integrated coupling unit.

26. The user as claimed in claim 25, wherein the integrated coupling unit is a Real-Time Ethernet switch.

27. The user as claimed in claim 14, wherein the user is an automation device.

28. A communication system having a plurality of users, each user is as claimed in claim 14.

29. The communication system as claimed in claim 28, wherein the communication system is an automation system.

30. The communication system as claimed in claim 28, wherein the communication system has a linear or a ring arrangement of users.

31. A switched cyclical communication system for transmitting data, comprising:

a plurality of users, each user having at least one buffer memory and each user being configured as at least one of a sender and a receiver of data; and

a plurality of network connections interconnecting the plurality of users,

wherein the communication system transmits data from one user to another user in transmission cycles, each transmission cycle comprises a first type segment transmitting only real-time critical data and at least one second type segment transmitting only non-real-time critical data,

wherein the first type segment comprises a timeout period before and after sending a unit of the real-time critical data, and

wherein, if an additional unit of the real-time critical data designated for transmission is received during the timeout period by a respective user, duration of the first type segment is extended.

32. The switched cyclical communication system as claimed in claim 31, wherein, if the additional unit of the real-time critical data designated for transmission is received during the timeout period by the respective user, the duration of the first type segment is extended by a transmission time of the received additional unit of the real-time critical data and an additional timeout period, and wherein the timeout period is of a preset duration.