Claims
- 1. A method for multiplexing a plurality of data streams onto one data stream, comprising:
creating a list of queues, each queue representing a data stream and having a length inversely proportional to a proportion value of the data stream, wherein each data stream comprises at least one packet; incrementing each queue by the inverse of the proportion value for each frame; scheduling a packet from the data stream corresponding to a filled queue; and emptying the filled queue.
- 2. A method for multiplexing a plurality of data streams onto one data stream, comprising:
creating a list of queues, each queue representing a data stream and having a length inversely proportional to a proportion value of the data stream, wherein each data stream comprises at least one frame; incrementing each queue by the inverse of the proportion value for each frame; scheduling a frame from the data stream corresponding to a filled queue; and emptying the filled queue.
- 3. A method for multiplexing a plurality of data streams onto one data stream comprising:
creating a list of queues, each queue representing a data stream and having a length inversely proportional to a proportion value of the data stream, wherein each data stream comprises at least one frame; incrementing each queue by the inverse of the proportion value for each frame; distributing frames from the plurality of data streams onto a single data stream based primarily on whether a queue representing a data stream is full and secondarily on a priority value of the data stream; and emptying queue when the queue is filled.
- 4. A method for multiplexing a plurality of data streams onto one data stream, comprising:
creating a plurality of data streams by a plurality of applications wherein each data stream comprises at least one frame; and uniformly distributing the plurality of data streams onto a single data stream.
- 5. The method of claim 4, wherein distributing uniformly the plurality of data streams onto a single data stream is based on the proportion value of each data stream.
- 6. The method of claim 4, wherein distributing uniformly the plurality of data streams onto a single data stream is based primarily on the data streams' proportion value and secondarily on the data streams' priorities.
- 7. A method for multiplexing a plurality of data streams onto one data stream comprising:
producing a plurality of data streams by a subscriber unit plurality of applications, wherein each data stream comprises at least one frame; receiving by a multiplexer, the plurality of data streams; and distributing uniformly by the multiplexer, a plurality of data streams onto a single data stream; and receiving by a base station, the single data stream.
- 8. A subscriber unit, comprising:
a memory; a plurality of applications residing in the memory, each application producing a data stream wherein each data stream comprises at least one frame; and a multiplexer configured to receive each data stream and uniformly distributing frames from the plurality of data streams onto a single data stream.
- 9. The subscriber unit of claim 8, wherein the multiplexer is configured to receive each data stream and uniformly distribute frames from the plurality of data streams onto a single data stream based on the proportion value.
- 10. The subscriber unit of claim 8, wherein the multiplexer is configured to receive each data stream and uniformly distribute frames from the plurality of data streams onto a single data stream based primarily on the data streams' proportion value and secondarily on the data streams' priority.
- 11. A method for multiplexing a plurality of data streams onto one data stream, comprising:
means for creating a list of queues, each queue representing a data stream and having a length inversely related to a proportion value of the data stream, wherein each data stream comprises at least one packet; means for incrementing at each frame each queue by the inverse of the proportion value; means for scheduling a packet from the data stream corresponding to a filled queue; and means for emptying the filled queue.
- 12. A method for multiplexing a plurality of data streams onto one data stream, comprising:
means for creating a list of queues, each queue representing a data stream and having a length inversely related to a proportion value of the data stream, wherein each data stream comprises at least one frame; means for incrementing at each frame each queue by the inverse of the proportion value; means for scheduling a frame from the data stream corresponding to a filled queue; and means for emptying the filled queue.
- 13. A method for multiplexing a plurality of data streams onto one data stream comprising:
means for creating a list of queues, each queue representing a data stream and having a length inversely related to a proportion value of the data stream, wherein each data stream comprises at least one frame; incrementing at each frame each queue by the inverse of the proportion value; means for distributing frames from the plurality of data streams onto a single data stream based primarily on whether a queue representing a data stream is full and secondarily on a priority value of the data stream; and means for emptying queue when the queue is filled.
- 14. A method for multiplexing a plurality of data streams onto one data stream, comprising:
means for creating a plurality of data streams by a plurality of applications wherein each data stream comprises at least one frame; and means for uniformly distributing the plurality of data streams onto a single data stream.
- 15. A method for multiplexing a plurality of data streams onto one data stream comprising:
means for producing a plurality of data streams by a subscriber unit's plurality of applications, wherein each data stream comprises at least one frame; means for receiving by a multiplexer, the plurality of data streams; and means for distributing uniformly by the multiplexer, a plurality of data streams onto a single data stream; and means for receiving by a base station, the single data stream.
Claim of Priority Under 35 U.S.C. §120
[0001] The present application for patent is a Continuation and claims priority to patent application Ser. No. 09/612,825 entitled “Method and Apparatus for Proportionately Multiplexing Data Streams Onto One Data Stream” filed Jul. 7, 2000, now allowed, and assigned to the assignee hereof and hereby expressly incorporated by reference herein.
Continuations (1)
|
Number |
Date |
Country |
Parent |
09612825 |
Jul 2000 |
US |
Child |
10859695 |
Jun 2004 |
US |