Patent EP0494037A2 successfully refreshed from Google Patents.
EP0494037A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Early frame release in modified HDLC protocol
Assignee: International Business Machines Corp
•
Filing: 1991-12-06
•
Granted: —
•
Expires: 2011-12-06
Abstract
Abstract A method of early data frame release using a modified High-level Data Link Control (HDLC) protocol is disclosed. A destination link station delivers received data frames immediately upon receipt. The data frames are directed to an intelligent application layer with sufficient information to permit resequencing the out-of-order data frames to maintain data synchronization. A transmitter maintains and assigns sequential sequence numbers to each of a plurality of data frames in a radix cycle from zero to seven and back to zero. A transmit toggle bit is provided for data frame receipt confirmation with the transmitter altering the transmit toggle bit each time the same sequence number is reused. Each data frame must be confirmed before a sequence number can be made available for reuse.
Inventors
- 👤 Michael Emmerich Nagy
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-31 14:24
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/12; H04L1/16; H04L1/1607; H04L1/1671; H04L1/1642
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
95 words
A method of transmitting a plurality of data frames to an intelligent application layer, said intelligent application layer located at the receiving end of a communications link and capable of assembling said plurality of data frames into a block; comprising the steps of: assigning a sequential sequence number and a transmit toggle values to each of said plurality of data frames; transmitting said data frames over said communication link to a receiver; receiving said data frames at said receiver and immediately directing said data frames to said intelligent application layer for assembly into said block.
Claim 2
Dependent Claim
26 words
A method of transmitting a plurality of data frames as in claim 1, where the assigning of said sequential sequence number is done in radix notation.
Claim 3
Dependent Claim
26 words
A method of transmitting a plurality of data frames as in claim 1, where the assigning of said sequential sequence number is done in radix-8 notation.
Claim 4
Dependent Claim
25 words
A method of transmitting a plurality of data frames as in claim 1, where said intelligent application layer maintains a list of unacknowledged data frames.
Claim 5
Dependent Claim
27 words
A method as in claim 1 further including the step of determining at said application layer if one of said plurality of data frames contains an error.
Claim 6
Independent Claim
87 words
A method of transmitting a plurality of data frames from a sender to a receiver over a communications link, comprising the steps of: assigning a sequential sequence number and toggle bit value to each one of said plurality of data frames at said sender; transmitting over said communications link said plurality of data frames to said receiver; and immediately releasing said plurality of data frames to a queue having therein an intelligent application layer for assembling said plurality of data frames into a block for additional processing.
Claim 7
Dependent Claim
84 words
A modified high-level data link protocol for transmitting a plurality of sequentially numbered data frames over a communication channel, said transmission protocol capable of conveying the presence of a plurality of data frames having errors within said plurality of sequentially numbered data frames to a receiver, and where the presence of said data frames, comprising the steps of: assigning a sequential sequence number and toggle bit value to each of said plurality of data frames; transmitting said plurality of data frames to said receiver.
Claim 8
Independent Claim
88 words
A method providing the immediate release of a plurality of data frames transmitted over a communications link upon arrival at a receiver, said receiver capable of directing said data frames to one of a plurality of destination queues, comprising the steps of: receiving a plurality of data frames at said receiver; distributing said plurality of data frames immediately to one of said plurality of destination queues; and assembling said plurality of data frames into a block at one of said plurality of destination queues for transmission or storage.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.