Patent US5933435A successfully refreshed from Google Patents.
US5933435A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Optimized method of data communication and system employing same
Assignee: International Business Machines Corp
•
Filing: 1991-02-19
•
Granted: 1999-08-03
•
Expires: 2011-02-19
Abstract
Abstract PCT No. PCT/GB91/00258 Sec. 371 Date Sep. 25, 1992 Sec. 102(e) Date Sep. 25, 1992 PCT Filed Feb. 19, 1991 PCT Pub. No. WO92/10894 PCT Pub. Date Jun. 25, 1992Described is a system and method of communicating between first and second nodes connected by a serial link wherein the data is transmitted between the nodes in the form of packets made up of multiple bit frames. Each packet that is correctly received by the second node is acknowledged by means of a pair of multibit frames. These frames may be interleaved among the frames making up any outgoing data packet that is being transmitted by the second node. The technique employed provides unambiguous acknowledgment of each data packet and if a data packet is received incorrectly, the packet is available in a buffer in the first node for resending.
Inventors
- 👤 Vinay Velji Shah
- 👤 Ian David Judd
- 👤 Reginald Beer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 16:18
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/12; H04L1/16; H04L1/18; H04L1/1803; H04L1/1607; H04L1/1829; H04L1/1835; H04L1/1867; H04L1/1874; H04L9/00; H04L9/40; H04L1/1887; H04L69/00; H04L69/28; H04L69/30; H04L69/32; H04L69/322; H04L69/324
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
89 words
A method of communicating between first and second nodes connected by a serial link, the method comprising the steps of; transmitting data between said nodes in the form of packets, each packet comprising a plurality of predefined fields, each field consisting of one or more multibit data frames; and controlling the flow of the data packets by means of multiple bit control frames having the same bit length as the data frames and being distinguishable from the data frames, the control frames being transmissible independently of the data packets.
Claim 2
Independent Claim
89 words
A method of communicating between first and second nodes connected by a serial link, the method comprising the steps of; transmitting data between said nodes in the form of packets, each packet comprising a plurality of predefined fields, each field consisting of one or more multibit data frames; and controlling the flow of the data packets by means of multiple bit control frames having the same bit length as the data frames and being distinguishable from the data frames, the control frames being transmissible independently of the data packets.
Claim 3
Dependent Claim
54 words
A method as claimed in claim 1, wherein said transmitting data step comprises full duplex data transmission between said first and second nodes in which packets of data are transmitted from the second node to the first node, and wherein the control frames may be interleaved between the frames making up the data packets.
Claim 4
Dependent Claim
95 words
A method as claimed in claim 1 wherein one type of control frame is an acknowledgement frame which is sent by the second node to the first node upon receipt of a packet of data sent by the first node to the second node, the method further comprising the step of: transmitting first and second packets of data from the first node to the second node, wherein transmission of the second data packet cannot be completed before an acknowledgement signal associated with the first packet is received by the first node from the second node.
Claim 5
Dependent Claim
45 words
A method as claimed in claim 3 wherein the data packets are delimited by predefined flag frames and whereby the end flag frame of the second packet is not transmitted until the first node has received the first packet acknowledgement frame from the second node.
Claim 6
Dependent Claim
43 words
A method as claimed in claim 4 wherein predefined control frames (NUL) are included in the second data packet until the first packet acknowledgement frame is received, after which the end flag delimiter is transmitted to complete transmission of the second data packet.
Claim 7
Dependent Claim
64 words
A method as claimed in claim 3 wherein a data packet is constructed from data stored in a buffer in the first node and wherein the data is held in the buffer until such time as an acknowledgement frame for that packet has been received by the first node, after which receipt the buffer may be cleared ready for the storage of new data.
Claim 8
Dependent Claim
15 words
A method as claimed in claim 1 wherein the control frames are transmitted in pairs.
Claim 9
Dependent Claim
63 words
A method as claimed in claim 1 wherein first and second nodes indicate readiness to receive data from second and first nodes respectively by means of a second type of control frame (RR) whereby when the second node is ready to receive data from the first node, an RR frame is sent from the second to the first node to indicate said readiness.
Claim 10
Dependent Claim
101 words
A data communication system comprising a first node connected to a second node by means of a serial link means in the first node for transmitting data over the serial link to the second node, the data being in the form of packets comprising a plurality of predefined fields, each field consisting of one or more multibit data frames, and means for controlling the flow of data between the nodes employing multiple bit control frames having the same bit length as the data frames and being distinguishable from the data frames, said control frames being transmissible independently of the data packets.
Claim 11
Dependent Claim
101 words
A data communication system comprising a first node connected to a second node by means of a serial link means in the first node for transmitting data over the serial link to the second node, the data being in the form of packets comprising a plurality of predefined fields, each field consisting of one or more multibit data frames, and means for controlling the flow of data between the nodes employing multiple bit control frames having the same bit length as the data frames and being distinguishable from the data frames, said control frames being transmissible independently of the data packets.
Claim 12
Dependent Claim
77 words
A system as claimed in claim 9, one type of control frame being an acknowledgement frame and the second node including means for transmitting packets of data over the serial link and means responsive to the receipt of a data packet from the first node to send an acknowledgement frame to the first node, wherein the acknowledgement frame may be interleaved between the data frames of a packet being transmitted from the second to the first node.
Claim 13
Dependent Claim
83 words
A system as claimed in claim 10, wherein the transmitting means in the first node transmits first and second packets of data to the second node and the responsive means in the second node sends an acknowledgement frame to the first node on receipt of said first data packet, the first node including means responsive to the receipt of said acknowledgment frame to cause the first node transmitting means to complete the transmission of said second packet of data to the second node.
Claim 14
Dependent Claim
65 words
A system as claimed in claim 11, the first node further including a transmit data buffer in which data making up the first and second packets is stored and wherein the data making up the first packet is held in the transmit buffer until the acknowledgement frame, indicating correct receipt by the second node of the first data packet, is received by the first node.
References Cited (Backward Citations)
US3979719A
Cited
US4352103A
Cited
US4554541A
Cited
EP0186343A2
Cited
US4803685A
Cited
US4914654A
Cited
US5084871A
Cited
EP0390015A1
Cited
EP0397138A2
Cited
US5027349A
Cited
US5027358A
Cited
US5265103A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-02 | 2003-02-01 | 2003-08-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-02 | 2007-02-01 | 2007-08-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-02 | 2011-02-01 | 2011-08-03 | $7700.00 | Window Closed / Lapsed |