← Back to Patent Explorer
US5448561A Expired / Lapsed US ⏱️ 0.0 years remaining

Method & apparatus for data exchange in data processing installations

Assignee: Robert Bosch GmbH
•
Filing: 1992-09-16
•
Granted: 1995-09-05
•
Expires: 2012-09-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An improved method for exchange of data in data processing installations, especially Controller Areas Networks (CAN), permits acknowledged and segmented transmission of data strings, of arbitrarily long length, between at least two stations in the network or other data processing installation. The method includes the transmission of the messages associated with the data by means of frames; the frames contain a header field and a data field. In the event of contention between multiple stations of the data processing installation for access to the bus connection, which frame has priority is determined by evaluating the respective header fields. In the data field of the frame, there is a control information field (58, 95) containing a message code which serves to identify the message type. The message codes distinguish among activation messages (AR, AC), data messages (DT), and acknowledgement (AK) messages. This permits transmission of data strings, of limited length, with acknowledgement. Further, the control information fields (58, 95) of certain messages contain a sequence number, a receiver status code, a message end code, and a code specifying how many data bytes are being transmitted in the frame. With this additional information, data strings of arbitrarily long length may be transmitted as segments. The receipt of the individual partial messages is confirmed by sending back an acknowledgment in each case.

Inventors

  • 👤 Karl-Heinz Kaiser
  • 👤 Herbert Lohner
  • 👤 Hans-Joerg Mathony
  • 👤 Jan Unruh
  • 👤 Uwe Zurmuehl
  • 👤 Udo Brunke
  • 👤 Juergen Glasser
  • 👤 Olaf Linne

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 04:38
CPC Classifications
H; H04; H04L; H04L41/00; H04L41/08; H04L41/0803; H04L41/0806; H04L12/00; H04L12/28; H04L12/40; H04L12/40169; H04L12/40176; H04L9/00; H04L9/40; H04L2012/40208; H04L2012/40215; H04L2012/40267; H04L2012/40273; H04L67/00; H04L67/01; H04L67/12

Claims Analysis

Total Claims: 27
Claim 1
Independent Claim 390 words
Method for exchange of data with the help of a message in data processing installations having at least two stations (33, 34) connected to one another via a bus, comprising the steps of: defining a connection (24) between a pair of stations (33, 34) by a pair of oppositely-directed channels (31, 32), each channel extending from a sending object (37, 36) stored in one of said pair of stations to a receiving object (35, 38) stored in the other of said pair of stations; defining, for purposes of each channel (31, 32), the station storing the sending object (37, 36) as a sending station, and the station storing the receiving object (35, 38) as a receiving station, said sending and receiving stations together defining the connection (24); transmitting each message, via said connection, in a frame which contains at least a header field and a data field, with said header field being at a beginning portion of said frame, identifying the frame, and indicating a priority value of the frame for purposes of automatic arbitration of access to said bus; establishing, activating and deactivating said connections (24), via said bus, between pairs of said stations (33, 34); exchanging messages using said connections; and said step of establishing connections including the steps of: storing, in each station of one said connection (24), information defining a sending object (36, 37), and storing, in each station of said connection (24), information defining a receiving object (35, 38); each of said sending object (36, 37) and said receiving object (35, 38) including a header field (39) and a data field (40); said header field (39) of said sending object (36, 37) specifying the content of a header field of a frame transmitted from said station (34, 33) in which said sending object (37, 36) is stored to said station (33, 34) in which a corresponding receiving object (35, 38) is stored; and said frame contains said header field (39) and a control information field (58, 95), which in turn contains at least one message code characterizing what kind of message said frame is carrying and thereby distinguishing among at least: a message (AR) requesting activation of a connection, a message (AC) confirming activation of a connection, a message (DT) transmitting data via said connection, and a message (AK) acknowledging receipt of a data message.
Claim 2
Dependent Claim 390 words
Method for exchange of data with the help of a message in data processing installations having at least two stations (33, 34) connected to one another via a bus, comprising the steps of: defining a connection (24) between a pair of stations (33, 34) by a pair of oppositely-directed channels (31, 32), each channel extending from a sending object (37, 36) stored in one of said pair of stations to a receiving object (35, 38) stored in the other of said pair of stations; defining, for purposes of each channel (31, 32), the station storing the sending object (37, 36) as a sending station, and the station storing the receiving object (35, 38) as a receiving station, said sending and receiving stations together defining the connection (24); transmitting each message, via said connection, in a frame which contains at least a header field and a data field, with said header field being at a beginning portion of said frame, identifying the frame, and indicating a priority value of the frame for purposes of automatic arbitration of access to said bus; establishing, activating and deactivating said connections (24), via said bus, between pairs of said stations (33, 34); exchanging messages using said connections; and said step of establishing connections including the steps of: storing, in each station of one said connection (24), information defining a sending object (36, 37), and storing, in each station of said connection (24), information defining a receiving object (35, 38); each of said sending object (36, 37) and said receiving object (35, 38) including a header field (39) and a data field (40); said header field (39) of said sending object (36, 37) specifying the content of a header field of a frame transmitted from said station (34, 33) in which said sending object (37, 36) is stored to said station (33, 34) in which a corresponding receiving object (35, 38) is stored; and said frame contains said header field (39) and a control information field (58, 95), which in turn contains at least one message code characterizing what kind of message said frame is carrying and thereby distinguishing among at least: a message (AR) requesting activation of a connection, a message (AC) confirming activation of a connection, a message (DT) transmitting data via said connection, and a message (AK) acknowledging receipt of a data message.
Claim 3
Dependent Claim 57 words
Method according to claim 1, further comprising the steps of activating a connection by sending an Activation Request (AR) from one of said connection-defining stations to the other, confirming receipt of said Request by sending an Activation Confirmation (AC) back from said other station; and indicating activation of said connection (24) to a user of said connection.
Claim 4
Dependent Claim 50 words
Method according to claim 1, wherein each of said connection-defining stations contains a memory adapted for storage of a connection status value; and further comprising the step of deactivating a connection by setting each of said memories of the stations defining said connection (24) to a predetermined value representing deactivation.
Claim 5
Dependent Claim 23 words
Method according to claim 1, wherein at least one predefined bit of said control information field is used to represent said message code.
Claim 6
Dependent Claim 62 words
Method according to claim 1, further comprising the steps of sending at least one Data Transmission message (DT) from said sending station to said receiving station; confirming receipt of said message in said receiving station by sending an AcKnowledgement message (AK) back from said receiving station to said sending station, each of said messages being transmitted in the form of a frame.
Claim 7
Dependent Claim 68 words
Method according to claim 1, further comprising the steps of allocating a portion (64,102) of said control information field (58, 95) of said frame for use as a sequence number (SN); and generating successive sequence numbers as part of successive frames, thereby permitting distinguishing among successive Data Transmission messages (DT), recognizing of duplicate messages, and facilitating association of AcKnowledgement messages (AK) with their respective Data Transmission messages (DT).
Claim 8
Dependent Claim 17 words
Method according to claim 6, wherein at least one bit is allocated for said sequence number (SN).
Claim 9
Dependent Claim 36 words
Method according to claim 1, further comprising allocating a portion (64,102) of a control information field (58, 95) of each frame which transmits an AcKnowledgement message (AK) for use as a receiver status field (65, 105).
Claim 10
Dependent Claim 19 words
Method according to claim 8, wherein at least one bit is allocated for said receiver status field (65, 105).
Claim 11
Dependent Claim 46 words
Method according to claim 1, wherein each frame which transmits an AcKnowledgement message (AK) contains a header field (39) which differs in at least one significant bit from a corresponding bit in a header field (39) of each frame which transmits a Data Transmission message (DT).
Claim 12
Dependent Claim 26 words
Method according to claim 10, wherein said at least one differing bit is the bit in last position (41) in each of said header fields (39).
Claim 13
Dependent Claim 38 words
Method according to claim 1, further comprising segmenting a message into multiple data segments; transmitting different segments of said message in different frames; and reassembling said multiple data segments into a single message, following receipt of said frames.
Claim 14
Dependent Claim 35 words
Method according to claim 12, further comprising allocating part of said control information field of each frame carrying merely one portion of a larger message for an indication that the frame contains only said portion.
Claim 15
Dependent Claim 34 words
Method according to claim 13, further comprising identifying each frame, which is carrying a final portion of a larger message, by an indication in a predetermined subfield (103) of its control information field (95).
Claim 16
Dependent Claim 31 words
Method according to claim 13, further comprising including, in said control information field (95) of each frame, an indication of a length of a following data field contained in said frame.
Claim 17
Dependent Claim 30 words
Method according to claim 15, wherein said indication of length of a following data field is contained only in one field (104) of a frame transmitting a last message segment.
Claim 18
Dependent Claim 42 words
Method according to claim 1, further comprising timing an interval between sending of a message and receipt of an acknowledgement of said message and, in the event of expiration of a predetermined allotted time, without receipt of such acknowledgement, automatically resending,said message.
Claim 19
Dependent Claim 33 words
Method according to claim 17, further comprising setting a predetermined Maximum Number of Times for resending of unacknowledged messages and, upon reaching said predetermined Maximum Number of Times, ceasing resending of a message.
Claim 20
Dependent Claim 31 words
Method according to claim 18, further comprising the steps of upon exceeding said predetermined Maximum Number of Times, deactivating said connection, and indicating, to a user of said connection, said deactivation.
Claim 21
Dependent Claim 188 words
A data communications system for transmitting, with acknowledgement, data messages comprising at least two stations (33,34), each containing a computer; an interface unit in each station; a bus interconnecting the interface units of the stations; means, in each interface unit, for generating and transmitting a frame, for receiving a frame, and for recognizing an error in a received frame; means, within each station, for transferring data between the interface unit and the computer; means, in each interface unit, for serial data communication over said bus; wherein said stations contain protocol means for establishing, activating, and deactivating connections, including sending objects and receiving objects, (24) among said stations; for exchange of data, with acknowledgement, among stations, via activated connections, a first one of the stations defining a connection sends a Data Transmission (DT) to at least one other station, the other station sends back an AcKnowledgement (AK), the interface unit of the receiving station informs the computer of the receiving station of receipt of the Data Transmission (DT), and the interface unit of the sending station informs the computer of the sending station of receipt of the AcKnowledgement (AK).
Claim 22
Dependent Claim 188 words
A data communications system for transmitting, with acknowledgement, data messages comprising at least two stations (33,34), each containing a computer; an interface unit in each station; a bus interconnecting the interface units of the stations; means, in each interface unit, for generating and transmitting a frame, for receiving a frame, and for recognizing an error in a received frame; means, within each station, for transferring data between the interface unit and the computer; means, in each interface unit, for serial data communication over said bus; wherein said stations contain protocol means for establishing, activating, and deactivating connections, including sending objects and receiving objects, (24) among said stations; for exchange of data, with acknowledgement, among stations, via activated connections, a first one of the stations defining a connection sends a Data Transmission (DT) to at least one other station, the other station sends back an AcKnowledgement (AK), the interface unit of the receiving station informs the computer of the receiving station of receipt of the Data Transmission (DT), and the interface unit of the sending station informs the computer of the sending station of receipt of the AcKnowledgement (AK).
Claim 23
Dependent Claim 36 words
A data communications system according to claim 20, further comprising, in each station, means for segmenting messages which exceed a predetermined length into shorter segments for purposes of transmission, thereby permitting transmission of arbitrarily long messages.
Claim 24
Dependent Claim 88 words
A data communications system according to claim 20, wherein, for exchange of segmented data, with acknowledgement, among stations, via activated connections, a first one of the stations defining a connection sends a data segment to at least one other station, the other station sends back an AcKnowledgement (AK), the interface unit of the receiving station informs the computer of the receiving station of receipt of the data segment, and the interface unit of the sending station informs the computer of the sending station of receipt-of the AcKnowledgement (AK).
Claim 25
Dependent Claim 113 words
A data communications system according to claim 22, further comprising means, in each interface unit, for assigned successive Sequence Numbers (SN) to successive data segments; means, in each interface unit, for storing a next-expected Sequence Number; means, in each interface unit, for storing a value representing status of a connection which its station defines; means, in each interface unit, for storing count of retransmissions of a frame; means, in each interface unit, for storing and decrementing an allotted time until expected receipt of an acknowledgement, and a Maximum Number of Times for retransmissions of a frame; and means, in each interface unit, for storing a number of data bytes contained in a message.
Claim 26
Dependent Claim 307 words
method for exchange of data with the help of a message in data processing installations having at least two stations (33, 34) connected to one another via a bus, wherein a first one of said at least two stations (33, 34) is defined as a sending station, and a second one of said stations is defined as a receiving station, said sending and receiving stations together defining a connection (24); each message is transmitted in a frame; said frame contains at least a header field and a data field; said header field is at a beginning portion of said frame identifies the frame, and indicates a priority value of the frame for purposes of automatic arbitration of access to said bus, and wherein connections (24), via said bus, between pairs of said stations (33,34) are established, activated, and deactivated; messages are exchanged using said connections: wherein connections are established by the steps of storing, in each station of a connection (24), information defining a sending object (36), and storing, in each station of said connection (24), information defining a receiving object (35); each of said sending object (36) and said receiving object (35) includes a header field (39) and a data field (40); said header field (39) of said sending object (36) specifies the content of a header field of a frame transmitted from said station; and said frame contains not only said header field (39) but also a control information field (58, 95), which in turn contains at least one message code, consisting of only two bits, characterizing what kind of message said frame is carrying and thereby distinguishing among at least: a message (AR) requesting activation of a connection, a message (AC) confirming activation of a connection, a message (DT) transmitting data via said connection, and a message (AK) acknowledging receipt of a data message.
Claim 27
Dependent Claim 307 words
method for exchange of data with the help of a message in data processing installations having at least two stations (33, 34) connected to one another via a bus, wherein a first one of said at least two stations (33, 34) is defined as a sending station, and a second one of said stations is defined as a receiving station, said sending and receiving stations together defining a connection (24); each message is transmitted in a frame; said frame contains at least a header field and a data field; said header field is at a beginning portion of said frame identifies the frame, and indicates a priority value of the frame for purposes of automatic arbitration of access to said bus, and wherein connections (24), via said bus, between pairs of said stations (33,34) are established, activated, and deactivated; messages are exchanged using said connections: wherein connections are established by the steps of storing, in each station of a connection (24), information defining a sending object (36), and storing, in each station of said connection (24), information defining a receiving object (35); each of said sending object (36) and said receiving object (35) includes a header field (39) and a data field (40); said header field (39) of said sending object (36) specifies the content of a header field of a frame transmitted from said station; and said frame contains not only said header field (39) but also a control information field (58, 95), which in turn contains at least one message code, consisting of only two bits, characterizing what kind of message said frame is carrying and thereby distinguishing among at least: a message (AR) requesting activation of a connection, a message (AC) confirming activation of a connection, a message (DT) transmitting data via said connection, and a message (AK) acknowledging receipt of a data message.

References Cited (Backward Citations)

US5001642A Cited
US5050166A Cited
US5111460A Cited
US5216674A Cited
US4999834A Cited
DE4129205A1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-09-04 1999-03-06 1999-09-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-09-04 2003-03-06 2003-09-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-09-04 2007-03-06 2007-09-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag