US5557608A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for transmission of high priority traffic on low speed communication links
Assignee: International Business Machines Corp
•
Filing: 1995-05-22
•
Granted: 1996-09-17
•
Expires: 2015-05-22
Abstract
Abstract In a packet switched communications system an incoming real-time packet is imbedded after the next block of data of the non-real-time packet being transmitted. This object is accomplished by transmitting each packet along with at least a 1-byte trailer which is used to indicate the packet type, whether the current block of non real time data is preempted or whether the current block of non real time data is resumed.
Inventors
- 👤 Jean Calvignac
- 👤 Claude Galand
- 👤 Didier Giroir
- 👤 Gerald Lebizay
- 👤 Daniel Mauduit
- 👤 Victor Spagnol
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 22:42
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/50; H04L47/56; H04L47/10; H04L47/24; H04L47/245; H04L47/62; H04L47/6215; H04L47/622; H04L47/623; H04L47/625; H04L47/6255; H04L47/627; H04L49/00; H04L49/90; H04L49/9057; H04L9/00; H04L9/40; H04L69/00; H04L69/30; H04L69/32; H04L69/322; H04L69/324
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
151 words
For use in a data packet communication system having nodes and links between nodes for transporting low-priority packets in blocks of one or more bytes and high-priority packets, a priority-responsive packet handling system at one or more of the nodes, said packet handling system including: a) priority packet detector for determining whether a high-priority packet is ready to be transported; b) packet preempt/resume logic for determining whether data currently being transported is a high-priority packet which preempted a low-priority packet block or a low-priority packet block which is to be preempted by a following high-priority packet or which has been resumed following an earlier preemption by a high-priority packet; c) a trailer generator receiving outputs from said said priority packet detector and said packet preempt/resume logic for generating a multi-bit trailer having a bit pattern indicating the packet type of the current data and the preempt/resume status of such current data.
Claim 2
Dependent Claim
151 words
For use in a data packet communication system having nodes and links between nodes for transporting low-priority packets in blocks of one or more bytes and high-priority packets, a priority-responsive packet handling system at one or more of the nodes, said packet handling system including: a) priority packet detector for determining whether a high-priority packet is ready to be transported; b) packet preempt/resume logic for determining whether data currently being transported is a high-priority packet which preempted a low-priority packet block or a low-priority packet block which is to be preempted by a following high-priority packet or which has been resumed following an earlier preemption by a high-priority packet; c) a trailer generator receiving outputs from said said priority packet detector and said packet preempt/resume logic for generating a multi-bit trailer having a bit pattern indicating the packet type of the current data and the preempt/resume status of such current data.
Claim 3
Dependent Claim
101 words
A packet handling system as set forth in claim 1 further including: a) packet insertion logic responsive to an output from the priority packet detector for inserting a high-priority packet into the data being transported following a current block of low-priority data or following a current high-priority packet; b) a packet buffer for temporarily storing a low-priority packet block which has been preempted by a high-priority packet; and c) resume logic responsive to a predetermine bit pattern in a trailer in a high-priority packet currently being transported to resume transport of a low-priority packet block temporarily stored in said packet buffer.
Claim 4
Dependent Claim
112 words
A packet handling system as set forth in either of claims 1 or 2 further including receiver logic for processing data received over a link to another node, said receiver logic including: a) a trailer detector for determining the status of each of the bits in a trailer in data currently being received; b) detection logic responsive for outputs from the trailer detector for identifying data currently being received either as a high-priority packet or a block of low-priority data and, where the data is identified as a block of low-priority data, for identifying whether the block is an initial, an intermediate or a final block of data in a low-priority packet.
Claim 5
Dependent Claim
33 words
A packet handling system as set forth in claim 3 further including a receive buffer for buffering one or more blocks of low-priority data when such data has been preempted by high-priority packets.
Claim 6
Dependent Claim
41 words
A packet handling system as set forth in claim 4 further including means responsive to outputs from the detection logic for reassembling a low-priority data packet from one or more blocks either currently being received or stored in the receive buffer.
Claim 7
Dependent Claim
167 words
For use in a data packet communication system having nodes and links between nodes for transporting low-priority packets in blocks of one or more bytes and high-priority packets, a method of interleaving high-priority data with low-priority data, said method comprising the steps of: a) determining whether the data currently being transported is a block of low-priority data or a high-priority packet; b) detecting the presence of a high-priority packet awaiting transport; c) where the data currently being transported is a block of low-priority data, determining whether the block is part of a low-priority packet that had previously been preempted to permit at least one high-priority packet to be transported; d) generating a trailer byte having bit patterns identifying the priority of the data currently being transported and, where the data is part of a low-priority packet, whether it is to be preempted to permit transport of a waiting high-priority packet; and e) inserting the trailer byte into a predetermined position relative to the data currently being transported.
Claim 8
Dependent Claim
167 words
For use in a data packet communication system having nodes and links between nodes for transporting low-priority packets in blocks of one or more bytes and high-priority packets, a method of interleaving high-priority data with low-priority data, said method comprising the steps of: a) determining whether the data currently being transported is a block of low-priority data or a high-priority packet; b) detecting the presence of a high-priority packet awaiting transport; c) where the data currently being transported is a block of low-priority data, determining whether the block is part of a low-priority packet that had previously been preempted to permit at least one high-priority packet to be transported; d) generating a trailer byte having bit patterns identifying the priority of the data currently being transported and, where the data is part of a low-priority packet, whether it is to be preempted to permit transport of a waiting high-priority packet; and e) inserting the trailer byte into a predetermined position relative to the data currently being transported.
Claim 9
Dependent Claim
31 words
A method as set forth in claim 6 wherein the trailer byte is inserted at the end of a block of low-priority data or at the end of a high-priority packet.
Claim 10
Dependent Claim
54 words
A method as set forth in claim 7 including the additional steps of: a) temporarily storing those blocks of a low-priority packet which have yet to be transported while one or more preempting high-priority packets are being transported; and b) resuming transport of the low-priority data when no further high-priority packets are awaiting transport.
Claim 11
Dependent Claim
111 words
A method as set forth in claim 8 including the additional steps of: a) detecting the trailer byte in received data to determine whether the data represents a block of low-priority data or a high-priority packet and, where the data represents a block of low-priority data, whether that block is the initial, an intermediate or the final block of data in the low-priority packet; b) temporarily storing any data which is found to be low-priority but not the final block of a low-priority packet; c) when the final block of a low-priority packet is detected, reassembling the received blocks of low-priority data in appropriate order to reproduce the complete low-priority packet.
References Cited (Backward Citations)
US4500987A
Cited
US4510599A
Cited
US4707693A
Cited
US4761781A
Cited
US5051946A
Cited
US4819230A
Cited
EP0512290A2
Cited
EP0582537A2
Cited
US5343473A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-09-17 | 2000-03-18 | 2000-09-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-09-17 | 2004-03-18 | 2004-09-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-09-17 | 2008-03-18 | 2008-09-17 | $7700.00 | Window Closed / Lapsed |