Patent DE913092C successfully refreshed from Google Patents.
Patent US6148010A successfully refreshed from Google Patents.
US6148010A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for distributing and consolidating data packets onto multiple network interfaces
Assignee: Qualcomm Inc
•
Filing: 1998-06-24
•
Granted: 2000-11-14
•
Expires: 2018-06-24
Abstract
Abstract A method and apparatus for distributing and consolidating data packets onto multiple network interfaces includes using frame-based inverse multiplexing to parse high-speed data into frames for placement onto lower-speed E1 or T1 connections between a base station controller and a base station, or between two base station controllers, in a cellular telephony network. The inverse multiplexing algorithm may be implemented with hardware such as, e.g., FIFOs and registers. The frames are transmitted across the E1 or T1 connections and then received, buffered, and multiplexed into a single high-speed data stream.
Inventors
- 👤 Todd Sutton
- 👤 Juan Faus
- 👤 Roy G. Moss
- 👤 Douglas A. Robbins
- 👤 Houtan Dehesh
- 👤 Kuo-Chun Lee
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 06:49
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/90; H04L49/9047; H04L1/00; H04L1/24; H04L1/242; H04L1/243; H04L25/00; H04L25/02; H04L25/14; H04L47/00; H04L47/10; H04L47/30; H04L49/901; H04L49/9021; H04W; H04W24/00
Claims Analysis
Total Claims: 54
Claim 1
Independent Claim
203 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and wherein the plurality of connections includes associated buffers at the first entity, and wherein the parsing step comprises the steps of: determining for successive buffers whether a predetermined threshold storage quantity exceeds the number of data bytes stored in the buffer; selecting the first buffer determined to contain less data bytes than the predetermined threshold storage quantity; placing a data frame into the selected buffer; and repeating the determining, selecting, and placing steps as necessary to exchange all of the data between the first and second point-to-point entities.
Claim 2
Independent Claim
203 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and wherein the plurality of connections includes associated buffers at the first entity, and wherein the parsing step comprises the steps of: determining for successive buffers whether a predetermined threshold storage quantity exceeds the number of data bytes stored in the buffer; selecting the first buffer determined to contain less data bytes than the predetermined threshold storage quantity; placing a data frame into the selected buffer; and repeating the determining, selecting, and placing steps as necessary to exchange all of the data between the first and second point-to-point entities.
Claim 3
Dependent Claim
20 words
The method of claim 1, further comprising the step of ascertaining whether each buffer is associated with a functioning connection.
Claim 4
Dependent Claim
10 words
The method of claim 1, wherein the buffers are FIFOs.
Claim 5
Dependent Claim
21 words
The method of claim 1, wherein the connections are standardized E1/T1 lines and the wide area network is a telecommunication system.
Claim 6
Dependent Claim
16 words
The method of claim 1, wherein the connections are standardized Internet Protocol lines for data transfer.
Claim 7
Dependent Claim
14 words
The method of claim 1, wherein the connections are standardized Asynchronous Transfer Mode lines.
Claim 8
Dependent Claim
35 words
The method of claim 1, wherein the first entity is a base station controller, the second entity is a base station transceiver subsystem, and the wide area network is part of a wireless telecommunication system.
Claim 9
Dependent Claim
35 words
The method of claim 1, wherein the first entity is a base station transceiver subsystem, the second entity is a base station controller, and the wide area network is part of a wireless telecommunication system.
Claim 10
Dependent Claim
49 words
The method of claim 1, further comprising the step of removing data frames from the buffers at a constant data rate for transmission on the connections, and wherein the placing step is performed periodically at a rate equal to the constant data rate multiplied by the number of buffers.
Claim 11
Dependent Claim
14 words
The method of claim 1, wherein the predetermined threshold storage quantity is sixteen bytes.
Claim 12
Dependent Claim
175 words
An interface for transmitting digital data across multiple connections between first and second point-to-point entities in a wide area network, comprising: a frame-based inverse multiplexer residing in the first entity for placing digital data frames traveling at a first frame rate onto the multiple connections between the first and second entities at a second frame rate, the first frame rate being greater than the second frame rate; and a receiver residing in the second entity for buffering and multiplexing to the first frame rate the digital data frames received from the multiple connections between the first and second entities, wherein the first frame rate is an effective transfer rate between the first and second entities for a given group of digital data frames; and wherein the frame-based inverse multiplexer comprises: a plurality of buffers, each buffer being coupled to a respective connection; and a frame distribution logic circuit coupled to the plurality of buffers for successively distributing data frames to each buffer that satisfies a predetermined capacity constraint and is coupled to a functioning connection.
Claim 13
Dependent Claim
175 words
An interface for transmitting digital data across multiple connections between first and second point-to-point entities in a wide area network, comprising: a frame-based inverse multiplexer residing in the first entity for placing digital data frames traveling at a first frame rate onto the multiple connections between the first and second entities at a second frame rate, the first frame rate being greater than the second frame rate; and a receiver residing in the second entity for buffering and multiplexing to the first frame rate the digital data frames received from the multiple connections between the first and second entities, wherein the first frame rate is an effective transfer rate between the first and second entities for a given group of digital data frames; and wherein the frame-based inverse multiplexer comprises: a plurality of buffers, each buffer being coupled to a respective connection; and a frame distribution logic circuit coupled to the plurality of buffers for successively distributing data frames to each buffer that satisfies a predetermined capacity constraint and is coupled to a functioning connection.
Claim 14
Dependent Claim
15 words
The interface of claim 11, wherein the plurality of buffers comprises a plurality of FIFOs.
Claim 15
Dependent Claim
22 words
The interface of claim 11, wherein the multiple connections are standardized E1/T1 lines and the wide area network is a telecommunication system.
Claim 16
Dependent Claim
17 words
The interface of claim 11, wherein the multiple connections are standardized Internet Protocol lines for data transfer.
Claim 17
Dependent Claim
15 words
The interface of claim 11, wherein the multiple connections are standardized Asynchronous Transfer Mode lines.
Claim 18
Dependent Claim
35 words
The interface of claim 11, wherein the first entity is a base station controller, the second entity is a base station transceiver subsystem, and the wide area network is part of a wireless telecommunication system.
Claim 19
Dependent Claim
35 words
The interface of claim 11, wherein the first entity is a base station transceiver subsystem, the second entity is a base station controller, and the wide area network is part of a wireless telecommunication system.
Claim 20
Dependent Claim
21 words
The interface of claim 11, wherein the predetermined capacity constraint is satisfied if a particular buffer contains less than sixteen bytes.
Claim 21
Dependent Claim
190 words
An interface for exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the interface comprising: means for parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; means for sending the plurality of data frames to the second entity via the plurality of connections; means for receiving and buffering the plurality of data frames at the second entity; and means for multiplexing the plurality of data frames into data frames traveling at the first rate; and wherein the plurality of connections includes associated buffers at the first entity, and wherein the means for parsing comprises: means for determining for successive buffers whether a predetermined threshold storage quantity exceeds the number of data bytes stored in the buffer; means for selecting the first buffer determined to contain less data bytes than the predetermined threshold storage quantity; and means for placing a data frame into the selected buffer.
Claim 22
Dependent Claim
190 words
An interface for exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the interface comprising: means for parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; means for sending the plurality of data frames to the second entity via the plurality of connections; means for receiving and buffering the plurality of data frames at the second entity; and means for multiplexing the plurality of data frames into data frames traveling at the first rate; and wherein the plurality of connections includes associated buffers at the first entity, and wherein the means for parsing comprises: means for determining for successive buffers whether a predetermined threshold storage quantity exceeds the number of data bytes stored in the buffer; means for selecting the first buffer determined to contain less data bytes than the predetermined threshold storage quantity; and means for placing a data frame into the selected buffer.
Claim 23
Dependent Claim
19 words
The interface of claim 19, further comprising means for ascertaining whether each buffer is associated with a functioning connection.
Claim 24
Dependent Claim
10 words
The interface of claim 19, wherein the buffers are FIFOs.
Claim 25
Dependent Claim
21 words
The interface of claim 19, wherein the connections are standardized E1/T1 lines and the wide area network is a telecommunication system.
Claim 26
Dependent Claim
16 words
The interface of claim 19, wherein the connections are standardized Internet Protocol lines for data transfer.
Claim 27
Dependent Claim
14 words
The interface of claim 19, wherein the connections are standardized Asynchronous Transfer Mode lines.
Claim 28
Dependent Claim
35 words
The interface of claim 19, wherein the first entity is a base station controller, the second entity is a base station transceiver subsystem, and the wide area network is part of a wireless telecommunication system.
Claim 29
Dependent Claim
35 words
The interface of claim 19, wherein the first entity is a base station transceiver subsystem, the second entity is a base station controller, and the wide area network is part of a wireless telecommunication system.
Claim 30
Dependent Claim
55 words
The interface of claim 19, further comprising means for removing data frames from the buffers at a constant data rate for transmission on the connections, and wherein the means for placing comprises means for periodically placing data frames into buffers at a rate equal to the constant data rate multiplied by the number of buffers.
Claim 31
Dependent Claim
14 words
The method of claim 19, wherein the predetermined threshold storage quantity is sixteen bytes.
Claim 32
Independent Claim
186 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of inverse multiplexing data frames arriving sequentially at a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining for successive buffers whether a predetermined threshold storage quantity exceeds the number of data bytes stored in the buffer; selecting the first buffer determined to contain less data bytes than the predetermined threshold storage quantity; and placing the next arriving data frame into the selected buffer.
Claim 33
Independent Claim
186 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of inverse multiplexing data frames arriving sequentially at a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining for successive buffers whether a predetermined threshold storage quantity exceeds the number of data bytes stored in the buffer; selecting the first buffer determined to contain less data bytes than the predetermined threshold storage quantity; and placing the next arriving data frame into the selected buffer.
Claim 34
Dependent Claim
21 words
The method of claim 29, further comprising the step of ascertaining whether each buffer is coupled to a functioning transmission line.
Claim 35
Dependent Claim
10 words
The method of claim 29, wherein the buffers are FIFOs.
Claim 36
Dependent Claim
17 words
The method of claim 29, wherein the transmission lines are standardized E1/T1 lines in a telecommunication system.
Claim 37
Dependent Claim
17 words
The method of claim 29, wherein the transmission lines are standardized Internet Protocol lines for data transfer.
Claim 38
Dependent Claim
15 words
The method of claim 29, wherein the transmission lines are standardized Asynchronous Transfer Mode lines.
Claim 39
Dependent Claim
50 words
The method of claim 29, further comprising the step of removing data frames from the buffers at a constant data rate for transmission on the transmission lines, and wherein the placing step is performed periodically at a rate equal to the constant data rate multiplied by the number of buffers.
Claim 40
Dependent Claim
14 words
The method of claim 29, wherein the predetermined threshold storage quantity is sixteen bytes.
Claim 41
Independent Claim
178 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of inverse multiplexing data frames arriving sequentially at a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining the amount of stored frame data in each one of the plurality of buffers; selecting the buffer determined to contain the least amount of stored frame data; and placing the next arriving data frame into the selected buffer.
Claim 42
Independent Claim
178 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of inverse multiplexing data frames arriving sequentially at a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining the amount of stored frame data in each one of the plurality of buffers; selecting the buffer determined to contain the least amount of stored frame data; and placing the next arriving data frame into the selected buffer.
Claim 43
Dependent Claim
21 words
The method of claim 37, further comprising the step of ascertaining whether each buffer is coupled to a functioning transmission line.
Claim 44
Dependent Claim
10 words
The method of claim 37, wherein the buffers are FIFOs.
Claim 45
Dependent Claim
17 words
The method of claim 37, wherein the transmission lines are standardized E1/T1 lines in a telecommunication system.
Claim 46
Dependent Claim
17 words
The method of claim 37, wherein the transmission lines are standardized Internet Protocol lines for data transfer.
Claim 47
Dependent Claim
15 words
The method of claim 37, wherein the transmission lines are standardized Asynchronous Transfer Mode lines.
Claim 48
Dependent Claim
50 words
The method of claim 37, further comprising the step of removing data frames from the buffers at a constant data rate for transmission on the transmission lines, and wherein the placing step is performed periodically at a rate equal to the constant data rate multiplied by the number of buffers.
Claim 49
Independent Claim
178 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of removing data frames from a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining for each successive frame whether the number of data bytes stored in the buffer exceeds a predetermined threshold storage quantity; and removing a data frame from the first buffer determined to contain more data bytes than the predetermined threshold storage quantity.
Claim 50
Independent Claim
178 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of removing data frames from a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining for each successive frame whether the number of data bytes stored in the buffer exceeds a predetermined threshold storage quantity; and removing a data frame from the first buffer determined to contain more data bytes than the predetermined threshold storage quantity.
Claim 51
Independent Claim
170 words
A method of exchanging data at a first rate between first and second point-to point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of removing data frames from a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining the amount of stored frame data in each one of the plurality of buffers; and removing a data frame from the buffer determined to contain the greatest amount of stored frame data.
Claim 52
Independent Claim
170 words
A method of exchanging data at a first rate between first and second point-to point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of removing data frames from a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining the amount of stored frame data in each one of the plurality of buffers; and removing a data frame from the buffer determined to contain the greatest amount of stored frame data.
Claim 53
Independent Claim
180 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of removing data frames from a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining the amount of stored frame data in successive buffers until one of the buffers is determined to contain at least one frame of stored data; and removing the frame from the first buffer determined to contain at least one frame of stored data.
Claim 54
Independent Claim
180 words
A method of exchanging data at a first rate between first and second point-to-point entities coupled in a wide area network by a plurality of connections through which data travels at a second rate, the first rate being greater than the second rate, the method comprising the steps of: parsing, at the first entity, data frames traveling at the first rate into a plurality of data frames traveling at the second rate; sending the plurality of data frames to the second entity via the plurality of connections; receiving and buffering the plurality of data frames at the second entity; and multiplexing the plurality of data frames into data frames traveling at the first rate; and a method of removing data frames from a plurality of buffers coupled to transmission lines, the method comprising the steps of: determining the amount of stored frame data in successive buffers until one of the buffers is determined to contain at least one frame of stored data; and removing the frame from the first buffer determined to contain at least one frame of stored data.
References Cited (Backward Citations)
WO1990012467A1
Cited
US5608733A
Cited
US5751338A
Cited
US5854786A
Cited
WO1997023073A1
Cited
US5757804A
Cited
US5875192A
Cited
US5771229A
Cited
US6002670A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-11-14 | 2004-05-15 | 2004-11-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-11-14 | 2008-05-15 | 2008-11-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-11-14 | 2012-05-15 | 2012-11-14 | $7700.00 | Window Closed / Lapsed |