Patent US4499576A successfully refreshed from Google Patents.
US4499576A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiplexed first-in, first-out queues
Assignee: Nokia of America Corp
•
Filing: 1982-08-13
•
Granted: 1985-02-12
•
Expires: 2002-08-13
Abstract
Abstract Messages, comprising a plurality of multiplexed packets of information bits, are received on a transmission line from each of a plurality of sources. All packets from the same source have the same source identification number and are stored in one of a plurality of first-in, first-out queues. After at least one of said packets has been stored, it is available for being read out from the first-in, first-out queue. In order to insure that each queue has an equal chance of being accessed by a utilization means, the status of all queues is registered in a status register.
Inventors
- 👤 Alexander G. Fraser
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 08:46
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; G; G06; G06F; G06F5/00; G06F5/06; G06F5/065
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
167 words
Apparatus for temporarily storing a plurality of packets in a plurality of first-in, first-out queues, each of said packets comprising one or more information bits being received on a transmission line as a multiplexed stream of said packets transmitted from a plurality of sources, each of said packets being identified with one of said sources, said apparatus characterized by means for identifying said source of each of said packets, means for assigning each of said packets to one of said first-in, first-out queues, means for storing said packets in said first-in, first-out queues, and means for indicating when each of said first-in, first-out queues has at least one of said packets stored therein, said indicating means further comprising means for registering the change of state in response to said first-in, first-out queue having entered therein at least one of said packets, and means for periodically and simultaneously reading and storing therein the status of all of said first-in, first-out queues registered in said change of state means.
Claim 2
Dependent Claim
167 words
Apparatus for temporarily storing a plurality of packets in a plurality of first-in, first-out queues, each of said packets comprising one or more information bits being received on a transmission line as a multiplexed stream of said packets transmitted from a plurality of sources, each of said packets being identified with one of said sources, said apparatus characterized by means for identifying said source of each of said packets, means for assigning each of said packets to one of said first-in, first-out queues, means for storing said packets in said first-in, first-out queues, and means for indicating when each of said first-in, first-out queues has at least one of said packets stored therein, said indicating means further comprising means for registering the change of state in response to said first-in, first-out queue having entered therein at least one of said packets, and means for periodically and simultaneously reading and storing therein the status of all of said first-in, first-out queues registered in said change of state means.
Claim 3
Dependent Claim
15 words
The apparatus according to claim 1 wherein said storage means comprises a random access memory.
Claim 4
Independent Claim
158 words
A method for temporarily storing a plurality of packets in a plurality of first-in, first-out queues, each of said packets comprising one or more information bits, said packets being received on a transmission line as a multiplexed stream of said packets from a plurality of sources, each of said packets being identified with one of said sources, said method comprising the steps of (1) identifying each of said sources of each of said packets; (2) assigning each of said packets to one of said first-in, first-out queues, (3) storing said packets in said first-in, first-out queues, and (4) indicating when each of said first-in, first-out queues has entered therein at least one of said packets, said indicating step further comprising the steps of registering when at least one of said packets has been entered in any of said first-in, first-out queues, periodically, and simultaneously, reading the status of all of said first-in, first-out queues, and storing said status.
Claim 5
Independent Claim
158 words
A method for temporarily storing a plurality of packets in a plurality of first-in, first-out queues, each of said packets comprising one or more information bits, said packets being received on a transmission line as a multiplexed stream of said packets from a plurality of sources, each of said packets being identified with one of said sources, said method comprising the steps of (1) identifying each of said sources of each of said packets; (2) assigning each of said packets to one of said first-in, first-out queues, (3) storing said packets in said first-in, first-out queues, and (4) indicating when each of said first-in, first-out queues has entered therein at least one of said packets, said indicating step further comprising the steps of registering when at least one of said packets has been entered in any of said first-in, first-out queues, periodically, and simultaneously, reading the status of all of said first-in, first-out queues, and storing said status.
References Cited (Backward Citations)
FR33672E
Cited
US3979733A
Cited
US4312065A
Cited
US4314367A
Cited
FR2472245A1
Cited
US4365328A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-02-12 | 1988-08-13 | 1989-02-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-02-12 | 1992-08-13 | 1993-02-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-02-12 | 1996-08-13 | 1997-02-12 | $7700.00 | Window Closed / Lapsed |