US6118786A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for multiplexing with small buffer depth
Assignee: WESTAR CAPITAL
•
Filing: 1998-09-02
•
Granted: 2000-09-12
•
Expires: 2018-09-02
Abstract
Abstract An optimal multiplexing method is disclosed which allows buffers to be two packets in depth. For a plurality of buffers, with each buffer associated with a packetized data stream, packets are received at respective buffer input rates. The buffers are serviced at a service rate at least equal to a sum of the buffer input rates. For each buffer, once a full packet has been received therein, a time interval until that buffer is expected to reach its buffer depth is determined. The buffer having the least time interval is then serviced first, such that overflow of the buffers is avoided.
Inventors
- 👤 James C. Tiernan
- 👤 Maha Achour
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 12:15
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/20; H04N21/23; H04N21/236; H04N21/23608; H04N21/2365; H04N21/23655
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
135 words
A method of multiplexing comprising the steps of: providing a plurality of input data streams, each data stream comprising fixed length packets; providing a plurality of buffers, each buffer associated with a respective input data stream and having a buffer depth; receiving packets for each stream in the associated buffer at a respective buffer input rate; and servicing the buffers at a service rate at least equal to a sum of the buffer input rates to provide an output data stream, the servicing step including: determining for each buffer, once a full packet has been received therein, a time interval until that buffer is expected to reach its buffer depth; and based on time interval, first extracting a packet from that buffer having the least time interval, such that overflow of the buffers is avoided.
Claim 2
Independent Claim
135 words
A method of multiplexing comprising the steps of: providing a plurality of input data streams, each data stream comprising fixed length packets; providing a plurality of buffers, each buffer associated with a respective input data stream and having a buffer depth; receiving packets for each stream in the associated buffer at a respective buffer input rate; and servicing the buffers at a service rate at least equal to a sum of the buffer input rates to provide an output data stream, the servicing step including: determining for each buffer, once a full packet has been received therein, a time interval until that buffer is expected to reach its buffer depth; and based on time interval, first extracting a packet from that buffer having the least time interval, such that overflow of the buffers is avoided.
Claim 3
Dependent Claim
24 words
The method of claim 1 wherein the step of providing buffers includes providing buffers each having a buffer depth of at least two packets.
Claim 4
Dependent Claim
18 words
The method of claim 1 wherein the step of providing input data streams includes providing MPEG transport streams.
Claim 5
Dependent Claim
18 words
The method of claim 1 wherein the step of providing input data streams includes providing ATM packet streams.
Claim 6
Dependent Claim
34 words
The method of claim 1 wherein the servicing step further includes sending at least one null packet in the output data stream until at least one of the buffers has received a full packet.
Claim 7
Dependent Claim
32 words
The method of claim 1 wherein for the extracting step, if more than one buffer has the least time interval, then that buffer having the fastest buffer input rate is serviced first.
Claim 8
Dependent Claim
130 words
A multiplexing apparatus comprising: a plurality of input data streams, each data stream comprising fixed length packets; a plurality of buffers, each buffer coupled to a respective input data stream for receiving packets at an associated buffer input rate, each buffer having a buffer depth; and a multiplexer for servicing the buffers at a service rate at least equal to a sum of the buffer input rates to provide an output data stream, the multiplexer including means for determining for each buffer, once a full packet has been received therein, a time interval until that buffer is expected to reach its buffer depth and means for first extracting, based on time interval, a packet from that buffer having the least time interval, such that overflow of the buffers is avoided.
Claim 9
Dependent Claim
130 words
A multiplexing apparatus comprising: a plurality of input data streams, each data stream comprising fixed length packets; a plurality of buffers, each buffer coupled to a respective input data stream for receiving packets at an associated buffer input rate, each buffer having a buffer depth; and a multiplexer for servicing the buffers at a service rate at least equal to a sum of the buffer input rates to provide an output data stream, the multiplexer including means for determining for each buffer, once a full packet has been received therein, a time interval until that buffer is expected to reach its buffer depth and means for first extracting, based on time interval, a packet from that buffer having the least time interval, such that overflow of the buffers is avoided.
Claim 10
Dependent Claim
18 words
The multiplexing apparatus of claim 7 wherein each buffer has a buffer depth of at least two packets.
Claim 11
Dependent Claim
15 words
The multiplexing apparatus of claim 7 wherein the input data streams include MPEG transport streams.
Claim 12
Dependent Claim
15 words
The multiplexing apparatus of claim 7 wherein the input data streams include ATM packet streams.
Claim 13
Dependent Claim
36 words
The multiplexing apparatus of claim 7 wherein the multiplexer further includes means for sending at least one null packet in the output data stream until at least one of the buffers has received a full packet.
Claim 14
Dependent Claim
35 words
The multiplexing apparatus of claim 7 wherein the means for first extracting includes means for first servicing that buffer having the fastest buffer input rate whenever more than one buffer has the least time interval.
References Cited (Backward Citations)
US5400401A
Cited
US5319707A
Cited
WO1995023495A2
Cited
US5420866A
Cited
US5521927A
Cited
US5541919A
Cited
US5859980A
Cited
US5914962A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-09-12 | 2004-03-13 | 2004-09-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-09-12 | 2008-03-13 | 2008-09-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-09-12 | 2012-03-13 | 2012-09-12 | $7700.00 | Window Closed / Lapsed |