Patent Grant
9648600
1. Field of the Invention
This invention relates to wireless communication systems, and more particularly to a method and apparatus for efficiently allocating bandwidth between base stations and customer premises equipment in a broadband wireless communication system.
2. Description of Related Art
As described in U.S. Pat. No. 6,016,311, by Gilbert et al., issued Jan. 18, 2000, entitled “Adaptive Time Division Duplexing Method and Apparatus for Dynamic Bandwidth Allocation within a Wireless Communication System,” hereby incorporated by reference, a wireless communication system facilitates two-way communication between a plurality of subscriber radio stations or subscriber units (fixed and portable) and a fixed network infrastructure. Exemplary communication systems include mobile cellular telephone systems, personal communication systems (PCS), and cordless telephones. The key objective of these wireless communication systems is to provide communication channels on demand between the plurality of subscriber units and their respective base stations in order to connect a subscriber unit user with the fixed network infrastructure (usually a wire-line system). In the wireless systems having multiple access schemes a time “frame” is used as the basic information transmission unit. Each frame is sub-divided into a plurality of time slots. Some time slots are used for control purposes and some for information transfer. Subscriber units typically communicate with the base station using a “duplexing” scheme thus allowing the exchange of information in both directions of connection.
Transmissions from the base station to the subscriber unit are commonly referred to as “downlink” transmissions. Transmissions from the subscriber unit to the base station are commonly referred to as “uplink” transmissions. Depending upon the design criteria of a given system, the prior art wireless communication systems have typically used either time division duplexing (TDD) or frequency division duplexing (FDD) methods to facilitate the exchange of information between the base station and the subscriber units. Both the TDD and FDD duplexing schemes are well known in the art.
Recently, wideband or “broadband” wireless communications networks have been proposed for providing delivery of enhanced broadband services such as voice, data and video services. The broadband wireless communication system facilitates two-way communication between a plurality of base stations and a plurality of fixed subscriber stations or Customer Premises Equipment (CPE). One exemplary broadband wireless communication system is described in the co-pending application and is shown in the block diagram of
The broadband wireless communication system 100 of
Due to the wide variety of CPE service requirements, and due to the large number of CPEs serviced by any one base station, the bandwidth allocation process in a broadband wireless communication system such as that shown in
Therefore, a need exists for a method and apparatus that can dynamically and efficiently allocate bandwidth in a broadband wireless communication system. The method and apparatus should be responsive to the needs of a particular communication link. The bandwidth needs may vary due to several factors, including the type of service provided over the link and the user type. The bandwidth allocation method and apparatus should be efficient in terms of the amount of system bandwidth consumed by the actual bandwidth request and allocation process. That is, the plurality of bandwidth requests generated by the CPE should consume a minimum percentage of available uplink bandwidth. In addition, the bandwidth allocation method and apparatus should respond to bandwidth requests in a timely manner. Bandwidth should be allocated to high priority services in a sufficiently short time frame to maintain the quality of service specified by the CPE. Further, the bandwidth allocation method and apparatus should be capable of processing an arbitrarily large number of bandwidth allocation requests from a relatively large number of CPEs. For example, in the system shown in
Some prior art systems have attempted to solve bandwidth allocation requirements in a system having a shared system resource by maintaining logical queues associated with the various data sources requiring access to the shared system resource. Such a prior art system is taught by Karol et al., in U.S. Pat. No. 5,675,573, that issued on Oct. 7, 1997. More specifically, Karol et al. teach a bandwidth allocation system that allows packets or cells within traffic flows from different sources that are contending for access to a shared processing fabric to get access to that fabric in an order that is determined primarily on individual guaranteed bandwidth requirements associated with each traffic flow. In addition, the system taught by Karol et al. allow the different sources to gain access to the shared processing fabric in an order determined secondarily on overall system criteria, such as a time of arrival, or due date of packets or cells within the traffic flows. Packets or cells of data from each data source (such as a bandwidth requesting device) are queued in separate logical buffers while they await access to the processing fabric.
A need exits for a bandwidth allocation method and apparatus for efficiently processing and responding to bandwidth allocation requests. The bandwidth allocation method and apparatus should accommodate an arbitrarily large number of CPEs generating frequent and varying bandwidth allocation requests on the uplink of a wireless communication system. Such a bandwidth allocation method and apparatus should be efficient in terms of the amount of bandwidth consumed by the bandwidth request control messages exchanged between the plurality of base stations and the plurality of CPEs. In addition, the bandwidth allocation method and apparatus should respond to the bandwidth allocation requests in a timely and accurate manner. The bandwidth allocation method and apparatus should also be able to process an arbitrarily large number of bandwidth allocation requests generated by a relatively large number of CPEs. The present invention provides such a bandwidth allocation method and apparatus.
The present invention is a novel method and apparatus for requesting and allocating bandwidth in a broadband wireless communication system. The method and apparatus reduces the amount of bandwidth that must be allocated for bandwidth request and bandwidth allocation purposes. The opportunities for allowing a CPE to request bandwidth are very tightly controlled in accordance with the present invention. The present invention utilizes a combination of a number of bandwidth request and allocation techniques to control the bandwidth request process. There are a number of means by which a CPE can transmit a bandwidth request message to an associated base station.
One such means uses a “polling” technique whereby a base station polls one or more CPEs and allocates bandwidth specifically for the purpose of allowing the CPEs to respond with a bandwidth request. The polling of the CPEs by the base station may be in response to a CPE setting a “poll-me bit” or, alternatively, it may be periodic. In accordance with the present invention, periodic polls may be made to individual CPEs, to groups of CPEs, or to every CPE on a physical channel. When individually polling a CPE, the base station polls an individual CPE by allocating uplink bandwidth in an uplink sub-frame map to allow the CPE to respond with a bandwidth request. Similarly, in group polling, the base station polls several CPEs by allocating uplink bandwidth in the uplink sub-frame map to allow the CPEs to respond with a bandwidth request. The CPEs must contend for the allocated bandwidth if collisions occur. Bandwidth allocations are not in the form of an explicit message that is communicated by the base station to the CPEs, but rather the bandwidth allocations are transmitted implicitly by allocating bandwidth in the uplink sub-frame map.
Another means used by the present invention in reducing bandwidth consumed by the bandwidth request messages is the technique of “piggybacking” bandwidth requests on bandwidth already allocated to a CPE. In accordance with this technique, currently active CPEs request bandwidth using previously unused portions of uplink bandwidth that is already allocated to the CPE. Alternatively, the bandwidth requests can be piggybacked on uplink bandwidth already allocated and currently being used by a data service. In accordance with this alternative, the CPE “steals” bandwidth already allocated for a data connection by inserting bandwidth requests in time slots previously used for data.
The CPE is responsible for distributing the allocated uplink bandwidth in a manner that accommodates the services provided by the CPE. The CPE is free to use the uplink bandwidth that was allocated to it in a manner that is different than that originally requested or granted by the base station. The CPE advantageously determines which services to give bandwidth to and which services must wait for subsequent bandwidth requests. One advantage of having the CPE determine how to distribute its allocated bandwidth is that it relieves the base station from performing this task. In addition, the communication overhead that is required by having the base station instruct the CPE how to distribute its allocated bandwidth is eliminated. By using a combination of bandwidth allocation techniques, the present invention advantageously makes use of the efficiency benefits associated with each technique.
The base station media access control (“MAC”) allocates available bandwidth on a physical channel on the uplink and the downlink. Within the uplink and downlink sub-frames, the base station MAC allocates the available bandwidth between the various services depending upon the priorities and rules imposed by their quality of service (“QoS”). The base station MAC maintains a set of queues for each physical channel that it serves. Within each physical channel queue set, the base station maintains a queue for each QoS. The queues hold data that is ready to be transmitted to the CPEs present on the physical channel. The base station higher MAC control layers are free to implement any convenient fairness or traffic shaping algorithms regarding the sharing of access between connections at the same QoS, without impacting the base station lower MAC control layers. In determining the amount of bandwidth to allocate at a particular QoS for a particular CPE, the base station takes into account the QoS, modulation, and the fairness criteria used to keep an individual CPE from using up all available bandwidth. In one embodiment, the base station attempts to balance the uplink/downlink bandwidth allocations using an adaptive time-division duplexing technique (ATDD).
The uplink bandwidth allocation method is very similar to the downlink bandwidth allocation except that, rather than being maintained by the base station, the data queues are distributed across and maintained by each individual CPE. Rather than check the queue status directly, the base station preferably receives requests for bandwidth from the CPEs using the techniques described above.
Like reference numbers and designations in the various drawings indicate like elements.
Throughout this description, the preferred embodiment and examples shown should be considered as exemplars, rather than as limitations on the present invention.
The preferred embodiment of the present invention is a method and apparatus for allocating bandwidth in a broadband wireless communication system. One very important performance criterion of a broadband wireless communication system, and any communication system for that matter having a physical communication medium shared by a plurality of users, is how efficiently the system uses the physical medium. Because wireless communication systems are shared-medium communication networks, access and transmission by subscribers to the network must be controlled. In wireless communication systems a Media Access Control (“MAC”) protocol typically controls user accesses to the physical medium. The MAC determines when subscribers are allowed to transmit on the physical medium. In addition, if contentions are permitted, the MAC controls the contention process and resolves any collisions that occur.
In the system shown in
The base station MAC maps and allocates bandwidth for both the uplink and downlink communication links. These maps are developed and maintained by the base station and are referred to as the Uplink Sub-frame Maps and Downlink Sub-frame Maps. The MAC must allocate sufficient bandwidth to accommodate the bandwidth requirements imposed by high priority constant bit rate (CBR) services such as T1, E1 and similar constant bit rate services. In addition, the MAC must allocate the remaining system bandwidth across the lower priority services such as Internet Protocol (IP) data services. The MAC distributes bandwidth among these lower priority services using various QoS dependent techniques such as fair-weighted queuing and round-robin queuing.
The downlink of the communication system shown in
The CPEs 110 share the uplink on a demand basis that is controlled by the base station MAC. Depending upon the class of service utilized by a CPE, the base station may issue a selected CPE continuing rights to transmit on the uplink, or the right to transmit may be granted by a base station after receipt of a request from the CPE. In addition to individually addressed messages, messages may also be sent by the base station to multicast groups (control messages and video distribution are examples of multicast applications) as well as broadcast to all CPEs.
Within each sector, in accordance with the present invention, CPEs must adhere to a transmission protocol that minimizes contention between CPEs and enables the service to be tailored to the delay and bandwidth requirements of each user application. As described below in more detail, this transmission protocol is accomplished through the use of a polling mechanism, with contention procedures used as a backup mechanism should unusual conditions render the polling of all CPEs unfeasible in light of given delay and response-time constraints. Contention mechanisms can also be used to avoid individually polling CPEs that are inactive for long time periods. The polling techniques provided by the present inventive method and apparatus simplifies the access process and guarantees that service applications receive bandwidth allocation on a deterministic basis if required. In general, data service applications are relatively delay-tolerant. In contrast, real-time service applications such as voice and video services require that bandwidth allocations be made in a timely manner and in adherence to very tightly-controlled schedules.
Frame Maps—Uplink and Downlink Sub-Frame Mappings
In one preferred embodiment of the present invention, the base stations 106 maintain sub-frame maps of the bandwidth allocated to the uplink and downlink communication links. As described in U.S. Pat. No. 6,016,311, by Gilbert et al., issued Jan. 18, 2000, entitled “Adaptive Time Division Duplexing Method and Apparatus for Dynamic Bandwidth Allocation within a Wireless Communication System,” the uplink and downlink are preferably multiplexed in a time-division duplex (or “TDD”) manner. In one embodiment, a frame is defined as comprising N consecutive time periods or time slots (where N remains constant). In accordance with this “frame-based” approach, the communication system dynamically configures the first N.sub.1 time slots (where N is greater than or equal to N.sub.1) for downlink transmissions only. The remaining N.sub.2 time slots are dynamically configured for uplink transmissions only (where N.sub.2 equals N−N.sub.1). Under this TDD frame-based scheme, the downlink sub-frame is preferably transmitted first and is prefixed with information that is necessary for frame synchronization.
As described in U.S. Pat. No. 6,016,311, by Gilbert et al., issued Jan. 18, 2000, entitled “Adaptive Time Division Duplexing Method and Apparatus for Dynamic Bandwidth Allocation within a Wireless Communication System,” in one embodiment of the broadband wireless communication system shown in
Downlink Sub-Frame Map
The downlink data PSs are used for transmitting data and control messages to the CPEs 110. This data is preferably encoded (using a Reed-Solomon encoding scheme for example) and transmitted at the current operating modulation used by the selected CPE. Data is preferably transmitted in a pre-defined modulation sequence: such as QAM-4, followed by QAM-16, followed by QAM-64. The modulation transition gaps 306 contain preambles and are used to separate the modulations. The PHY Control portion 312 of the frame control header 302 preferably contains a broadcast message indicating the identity of the PS 304 at which the modulation scheme changes. Finally, as shown in
Uplink Sub-Frame Map
The bandwidth allocated for contention slots (i.e., the contention slots 402 and 404) is grouped together and is transmitted using a pre-determined modulation scheme. For example, in the embodiment shown in
By using the bandwidth allocation method and apparatus of the present invention, scheduled uplink traffic data is bandwidth allocated to specific CPEs 110 for the transmission of control messages and services data. The CPE scheduled data is ordered within the uplink sub-frame 400 based upon the modulation scheme used by the CPEs 110. In accordance with the present invention and in the manner described in detail below, bandwidth is requested by a CPE 110 and is subsequently granted by an associated base station 106. All of the bandwidth allocated to a selected CPE within a given TDD frame (or alternatively an adaptive TDD frame, as the case may be) is grouped into a contiguous CPE scheduled data block 406. The physical slots allocated for the CTGs 408 are included in the bandwidth allocation to a selected CPE 110 in the base station uplink sub-frame map.
In addition to the bandwidth that is allocated for the transmission of the various types of broadband services (i.e., the bandwidth allocated for the CPE scheduled data slots 406), and the bandwidth allocated for CPE registration contention slots, bandwidth must also be allocated by the base station MAC for control messages such as requests for additional bandwidth allocations. As described in more detail below, in accordance with the present invention, CPEs 110 request changes to their bandwidth allocations by making bandwidth requests of their associated base stations 106. The present inventive method and apparatus reduces the amount of bandwidth that must be set aside for these bandwidth allocation requests. In accordance with the present invention, the opportunities for requesting bandwidth are very tightly controlled. The present invention advantageously utilizes a combination of a number of techniques to tightly control the bandwidth request process. There are a number of means by which a CPE can transmit a bandwidth request message to its associated base station.
For example, one such means uses a “polling” technique whereby a base station polls one or more CPEs and allocates bandwidth specifically for the purpose of allowing the CPE(s) to transmit bandwidth requests. In accordance with this method, the polling of CPEs by the base station may be in response to a CPE setting a “poll-me bit” in an upstream direction or it may be periodic. In accordance with the present invention, periodic polls may be made to individual CPEs (referred to as “reservation-based” polling), to groups of CPEs (“multicast” polling), or to every CPE on a physical channel (“broadcast” polling). In reservation-based polling, the base station polls an individual CPE and then allocates uplink bandwidth to allow the CPE to respond with a bandwidth request. Similarly, in multicast and broadcast polling, the base station polls several CPEs and then allocates uplink bandwidth to allow the CPEs to respond with a bandwidth request. However, the CPEs must contend for the allocated bandwidth if collisions occur. Advantageously, neither the bandwidth polls nor the bandwidth allocations are in the form of explicit messages that are communicated by the base station to the CPEs. Rather, the bandwidth polls comprise unsolicited grants of bandwidth sufficient for transmitting bandwidth requests. Bandwidth allocations are implicit via bandwidth allocations occurring in the uplink sub-frame map. The polling techniques are described in more detail below with reference to
As shown in
Another means used by the present invention in reducing the bandwidth consumed by the bandwidth request messages is the technique of “piggybacking” bandwidth requests on bandwidth already allocated to a CPE. In accordance with this technique, currently active CPEs request bandwidth using previously unused portions of uplink bandwidth that is already allocated to the CPE. The necessity of polling CPEs is thereby eliminated. In an alternative embodiment of the present invention, bandwidth requests are piggybacked on uplink bandwidth allocated and actively being used by a data service. In accordance with this alternative, the CPE “steals” bandwidth already allocated for a data connection by inserting bandwidth requests in time slots previously used for data. The details of these piggybacking techniques are described in more detail below with reference to
Once a CPE is allocated bandwidth by the base station, the CPE, not the base station, is responsible for using the uplink bandwidth in a manner that can accommodate the services provided by the CPE. The CPE is free to use the uplink bandwidth that was allocated to it in a manner that is different than originally requested or granted by the base station. For example, the service requirements presented to a selected CPE can change after the selected CPE requests bandwidth from its associated base station. The CPE advantageously determines which services to give bandwidth to and which services must wait for subsequent bandwidth requests. To this end, the CPE maintains a priority list of services. Those services having higher priority (e.g., those services having high quality of service demands) will be allocated bandwidth before those services having lower priority (e.g., IP-type data services). If the CPE does not have sufficient bandwidth to meet its service requirements, the CPE will request additional bandwidth allocations by either setting its poll-me bit or by piggybacking a bandwidth allocation request.
One advantage of having the CPE determine how to distribute its allocated bandwidth is that it relieves the base station from performing this task. In addition, the communication overhead that is required by having the base station instruct the CPE how to distribute its allocated bandwidth is thereby eliminated, thus increasing usable system bandwidth. In addition, the CPE is in a much better position to respond to the varying uplink bandwidth allocation needs of high quality of service data services. Therefore, the CPE can better accommodate the needs of these types of service requirements than can the base station.
The various techniques used by the present invention to enhance the efficiency of the bandwidth allocation request process are described in more detail below in the sub-sections that follow. Although these techniques are described in separate sub-sections, the present inventive method and apparatus advantageously uses all of the techniques in combination to reduce the bandwidth consumed by the bandwidth allocation requests.
Thus, the present invention advantageously makes use of the efficiency benefits associated with each bandwidth allocation technique. For example, although an individual polling technique is beneficial with regard to the ability to provide fast response times to bandwidth allocation requests, it is relatively inefficient with regard to the amount of bandwidth consumed by the bandwidth allocation process. In contrast, the group polling method is relatively efficient with regard to the bandwidth consumed by the bandwidth allocation process, but it is less efficient with regard to the ability to respond to bandwidth allocation requests. Use of a “poll-me” bit is relatively efficient when considered from both the bandwidth consumption and response time perspectives. In addition, the piggybacking technique further enhances bandwidth consumption efficiency by using previously unused portions of the bandwidth to send the bandwidth allocation requests. In contrast to the prior art approaches, the present invention advantageously uses all of these bandwidth allocation techniques in combination to maximize efficiency.
Polling
In one embodiment of the broadband wireless system 100 of
In contrast, many of the data services facilitated by the system 100 of
As described above, in accordance with the present invention, the CPEs 110 have a number of different techniques available to them for communicating bandwidth request messages to their associated base stations. One such technique is by transmitting a bandwidth request message in response to being polled by a base station. In accordance with the polling technique taught by the present invention, the base station allocates bandwidth to selected CPEs specifically for the purpose of making bandwidth requests. The bandwidth allocations may be to individual CPEs or to groups of CPEs. As described in more detail below in the sub-section that describes the group polling technique, allocations to groups of CPEs define bandwidth request contention slots that are used in resolving bandwidth request collisions. Advantageously, the bandwidth allocations are not made in the form of explicit messages, but rather they are made in the form of bandwidth allocation increases in the transmitted map describing the uplink sub-frame 400 (
Reservation-Based Polling Technique (Individual Polling)
In accordance with the present inventive method and apparatus, when a CPE is polled individually, no explicit message is transmitted to poll the selected CPE. Rather, the CPE is allocated bandwidth in the uplink sub-frame map that is sufficient to allow the CPE to respond with the bandwidth request. Specifically, the base station allocates bandwidth in the CPE scheduled data block 406 (
In accordance with the present invention, only inactive CPEs and active CPEs that explicitly request to be polled are eligible for individual polling. Active CPEs that do not set their respective “poll-me” bits in the MAC packet header will not be polled individually. These restrictions are imposed upon the bandwidth request process by the present invention and they advantageously save bandwidth compared with polling all of the CPEs individually. In one embodiment of the present invention, active CPEs respond to polling using the modulation scheme currently in use. However, inactive CPEs may respond using a QAM-4 or similarly robust modulation scheme to ensure that their transmission is sufficiently robust to be detected by the base station even under adverse environmental conditions.
The present invention advantageously ensures timely responses to requests for more bandwidth for a constant bit rate service such as a channelized T1 service in which channels may be added or dropped dynamically. To ensure that the base station responds quickly to requests for more bandwidth for a constant bit rate service, the uplink bandwidth allocated to a constant bit rate service that is not currently operating at a maximum rate is made sufficiently large to accommodate the service's current rate and a bandwidth request.
The information exchange sequence for individual polling is shown in the flow diagram of
As shown in
The present inventive method proceeds from the control point 608 to STEP 614 to individually poll the selected CPE. Thus, the method ensures that only un-polled active CPEs requesting more bandwidth (by setting their respective “poll-me” bits) and inactive CPEs are individually polled. This reduces bandwidth as compared with a polling method that would individually poll all CPEs.
As shown in
As shown in
As shown in
Contention-Based Polling Technique (Multicast and Broadcast Polling)
As described above with reference to STEP 604 of the individual polling method of
In accordance with one embodiment of the invention, the addressing of CPEs is preferably performed as follows: each CPE is assigned a unique permanent address (e.g., in one embodiment the CPE has a 48-bit address) that is used in the registration process; and each CPE is also given a basic connection ID (e.g., in one embodiment the CPE is given a 16-bit basic connection ID and a 16-bit control connection ID during the registration process). Each service that is provisioned for a selected CPE is also assigned a connection ID. Connection IDs are generated by the base station MAC (specifically, by the base station HL-MAA) and are unique across an HL-MAA MAC domain. The basic connection ID that is assigned when the CPE is registered with a base station is used by the base station MAC and the CPE MAC to exchange MAC control messages between the CPE and the base station. The control connection ID (also assigned during registration) is used by the base station and the CPE to exchange control and configuration information between the base station and the CPE higher levels of control.
In accordance with one embodiment of the present invention, certain connection IDs are reserved for multicast groups and broadcast messages. Of all of the addresses available a portion of them are preferably reserved for multicast use. For example, in one embodiment of the present invention, if the four most-significant bits of the connection ID are set to logical ones (hex “Fxxxx”) the address is interpreted as being set aside for multicast use. In this embodiment, a total of 4K distinct multicast addresses are available. One example of such a multicast use is for the distribution of a video service. In one preferred embodiment, the connection ID used to indicate a broadcast to all stations is (0xFFFF) (i.e., all 16 bits are set to a logical one).
Similar to the individual polling technique described above with reference to
As shown in
In accordance with the present inventive method and apparatus, when a poll is directed to a multicast or broadcast connection ID, CPEs belonging to the polled group request bandwidth using the bandwidth request contention slots (either the multicast contention slots for the group specified or the broadcast bandwidth request contention slots 410) allocated in the uplink sub-frame map 400″. In order to reduce the likelihood of collisions only CPE's needing bandwidth are allowed to reply to multicast or broadcast polls. Zero-length bandwidth requests are not allowed in the bandwidth request contention slots. In one embodiment, CPEs transmit the bandwidth requests in the bandwidth request contention slots (e.g., contention slots 404) using QAM-4 modulation. In this embodiment, the contention slots are sized to hold a 1-PS preamble and a bandwidth request message. Due to physical resolution characteristics, the message requires 1 PI (or 6 PS) using QAM-4 modulation. In this embodiment, multiple bandwidth request messages from the same CPE fit in a single bandwidth request contention slot without increasing the bandwidth utilization or the likelihood of collisions occurring. This allows the same CPE to make multiple bandwidth requests in the same slot.
If an error occurs when performing either a multicast or broadcast poll (such as the detection of an invalid connection ID) the base station transmits an explicit error message to the CPE. If the base station does not respond with either an error message or a bandwidth allocation within a predefined time period, the CPE will assume that a collision occurred. In this case the CPE uses a selected pre-defined contention resolution process. For example, in one preferred embodiment, the CPE uses the well-known “slotted ALOHA” contention resolution process to back off and try at another contention opportunity.
Contention Resolution Process
Contention is necessary when there is insufficient time to poll all of the CPEs individually within a suitable interval. The base station is able to define contention periods both for multicast groups and also for all CPEs generally (i.e., broadcast). After CPE scheduled data, control messages, and polling are allowed for, the base station allocates all unused time in the upstream part of the TDD frame to contention, either for bandwidth requests or for registration purposes. Typically the bandwidth request interval will be many PIs long (e.g., 1 PI=6 PS using QAM-4 modulation). The CPEs must transmit their requests at a random time (on burst boundaries) within this interval to reduce the likelihood of collisions occurring.
In accordance with the present invention, a CPE needing to transmit in a request interval preferably randomly selects a PI within the interval, and makes a request in the associated starting PS. This randomization minimizes the probability of collisions. A collision is presumed if there is no response from the base station to the request within a pre-defined time period. If the base station does not respond within the predefined time period the collision resolution process of the present invention is initiated.
One preferred embodiment of the present invention uses the following resolution process: Assuming that the initial backoff parameter is i and that the final backoff parameter is f,
1. On the first collision, the CPE waits a random interval between zero and 2.sup.i contention opportunities and then tries again.
2. If another collision occurs, then the interval is doubled and the CPE tries again, repeating until the interval 2.sup.f is reached.
If the CPE is still unsuccessful, an error is reported to the system controller and the contention process is aborted. Other contention resolution mechanisms can be used to practice the present invention. For example, the well-known Ternary tree mechanism could be used to resolve contentions.
As shown in
At the decision STEP 812 the method determines whether a broadcast or multicast poll was initiated. If so, the method proceeds to a STEP 814 whereat the method monitors the appropriate bandwidth request contention slots (e.g., as defined by the bandwidth contention slot descriptions 404″, 404′″, and the broadcast bandwidth request contention slot descriptions 410 of
The method proceeds from the monitoring STEP 814 to a decision STEP 820 to determine whether valid (i.e., non-colliding) bandwidth requests were detected. If no valid bandwidth requests were detected at STEP 820, the method proceeds to the control point 816 and terminates at termination STEP 818. However, if the method detects valid bandwidth requests, the method proceeds from STEP 820 to STEP 822. At STEP 822 the method uses a convenient bandwidth allocation algorithm to allocate bandwidth to the CPE that requested bandwidth. The preferred bandwidth allocation algorithm is described below in more detail with reference to
Poll-Me Bit
As described above with reference to
In order to reduce the bandwidth requirements associated with individually polling every active CPE, the active CPEs are individually polled if and only if one of the poll-me bits is set by the CPE. When the base station detects a request for polling (when the CPE sets its poll-me bit), the individual polling technique shown in
“Piggybacking” Technique
As described above with reference to the present inventive method and apparatus, in order to further reduce overhead bandwidth necessary for the bandwidth allocation process, currently active CPEs may “piggyback” a bandwidth request (or any other control message) on their current transmissions. The CPEs accomplish this piggybacking of bandwidth by using unused bandwidth in TC/PHY packets of existing bandwidth allocations. The procedure for using excess bandwidth in this manner is shown in
As shown in
Bandwidth Allocation
As described above, the base station MAC is responsible for allocating the available bandwidth of a physical channel on the uplink and the downlink. Within the uplink and downlink sub-frames, the base station MAC scheduler allocates the available bandwidth between the various services depending upon the priorities and rules imposed by their quality of service (QoS). Additionally, the higher control sub-layers of the base station MAC allocate across more than one physical channel.
Down Link Bandwidth Allocation—One Embodiment
The downlink bandwidth is allocated as shown in
In one embodiment of the present invention, in determining the amount of bandwidth to allocate at a particular QoS for a particular CPE, the base station takes into account the QoS, modulation, and the fairness criteria used to keep an individual CPE from using up all available bandwidth. Bandwidth is preferably allocated in QoS order. If there is a queue that cannot be transmitted entirely within a particular TDD frame, a QoS specific fairness algorithm, such as fair-weighted queuing, is used within that queue. Each connection is given a portion of the remaining available bandwidth based upon its relative weight. The derivation of weights is QoS-dependant. For example, ATM traffic may be weighted based upon contractual bandwidth limits or guarantees, while IP connections may all receive identical weights. Once the bandwidth is allocated the data is transmitted in a manner whereby the data is sorted by modulation type.
Uplink Bandwidth Allocation—One Embodiment
The uplink bandwidth allocation method is very similar to the downlink bandwidth allocation method described above with reference to
As described above, the bandwidth allocated to any selected CPE is transmitted to the selected CPE in the form of bandwidth being allocated in the uplink sub-frame map. Starting at a point in the TDD, the uplink sub-frame map allocates a certain amount of bandwidth to the selected CPE. The selected CPE then allocates this bandwidth across its connections. This allows the CPE to use the bandwidth in a different manner than requested if it receives higher priority data while awaiting the bandwidth allocation. As described above, the bandwidth allocations are in a constant state of change owing to the dynamic nature of bandwidth requirements. Consequently, a selected CPE may receive unsolicited modifications to the bandwidth granted on a frame-by-frame basis. If the selected CPE is allocated less bandwidth for a frame than is necessary to transmit all waiting data, the CPE must use the QoSs and fairness algorithms to service its queues. The CPE may “steal” bandwidth from lower QoS connections to piggyback request for more bandwidth using the piggybacking technique described above. TDM connections not already at maximum bandwidth are allocated enough extra bandwidth in the uplink to piggyback a request for additional bandwidth.
QoS Specific Fairness Algorithms
Data for transmission on the uplink and the, downlink is preferably queued by quality of service (QoS) designations. The data is transmitted in order of a QoS queue priority as described above. As the queued data is transmitted, there may be a QoS queue for which there is insufficient bandwidth to transmit all queued data during the current TDD frame. When this situation occurs, a QoS specific fairness algorithm is initiated to ensure fair handling of the data queued at that QoS. There are 3 basic fairness algorithms that can be implemented: (1) Continuous Grant; (2) Fair-weighted queuing; and (3) Round Robin.
The MAC preferably does not police connections for bandwidth usage. Policing should be performed by higher control layers. The MAC assumes that all pending data has met contractual restrictions and can be transmitted. Continuous Grant queues have the simplest fairness algorithm. All data in these queues must be sent every TDD frame. Insufficient bandwidth indicates an error in provisioning.
Fair Weighted Queuing
Fair weighted queuing requires that all connections at a given QoS have a weight, assigned to them to determine the percentage of the available bandwidth they are eligible to receive. This weight value is preferably derived from one of three data rate parameters, depending upon the contractual parameters of the provisioned connection. These three parameters are: (1) Data Pending; (2) Guaranteed Rate; and (3) Average Rate.
Real-time VBR connections are established as DAMA connections with fair-weighted queuing based upon data pending. For a QoS queue of this type in a TDD frame having insufficient bandwidth to transmit all of the data in the queue, a weight for each connection in the queue is determined. In one embodiment, this weight is the amount of data pending for the connection expressed as a percentage of the total data pending in the queue. Because the amount of data pending is dynamic, the weights for these types of queues must be determined every TDD frame where there is insufficient bandwidth to send all data in the affected queue.
For DAMA connections contracted at a guaranteed rate the weights are calculated based on the guaranteed rate. In this case, the weight preferably is expressed as a percentage of the total guaranteed rate of all connections with data pending in the queue. Because the guaranteed rate is provisioned the weights need not be determined each TDD frame where they are used. Rather, the weights for a queue are only determined when there is a provisioning change (i.e., a new connection, a change in connection parameters, or a connection termination) for one of the connections in the queue.
For DAMA connections contracted at an average rate the weights are preferably calculated based on the average rate. The weight is the average rate expressed as a percentage of the total average rate of all connections with data pending in the queue. Because the average rate is provisioned the weights need not be determined each TDD frame where they are used. Rather, the weights for a queue are only recalculated when there is a provisioning change for one of the connections in the queue.
In all of the cases described above, the granularity of the bandwidth allocations may be too coarse to provide a perfect percentage-based weighted allocation across the connections in the queue. This may result in some queues not receiving any bandwidth in a particular TDD frame. To ensure that the occurrence of this condition is fairly distributed across the connections in the queue, the connection that did not receive bandwidth is given priority the next time the insufficient bandwidth condition exists for the queue. For queues with weights based upon guaranteed or average rates some connections may not have sufficient data pending to use all of the bandwidth that they are entitled to based upon their calculated weight. In these cases, the connection's unused bandwidth is fairly distributed across the connections having excess data pending.
Some QoSs require that data be aged. For queues at these QoSs there is an associated queue of one step higher priority. If data is not transmitted by the provisioned aging parameter, the data is moved to the higher QoS queue and given priority over newer data in the original queue regardless of the relative weights of the connections.
Round Robin
The Round Robin fairness algorithm is used for best effort connections where all connections have equal weight. When insufficient bandwidth exists to transmit all data in the queue in a particular TDD frame connections are allocated bandwidth in a round-robin fashion with each connection receiving a block of bandwidth up to a queue-specific maximum. Connections that did not receive bandwidth are given priority he next time the insufficient bandwidth condition exists.
Bandwidth Allocation Algorithm
For each TDD frame, the base station allocates the downlink portion of the TDD frame and it performs an estimate of the uplink traffic to allocate uplink bandwidth to the CPEs. The CPEs individually allocate their allotted bandwidth across their pending data connections.
Base Station Downlink
As shown in
First, the base station allocates PSs to the PI for PHY Control and enough PSs for at least 1 PI for the MAC Control. The base station preferably performs uplink bandwidth allocation before downlink bandwidth allocation in order to determine the number of PIs to allocate for the MAC Control. In one preferred embodiment, the PHY Control and MAC Control are always sent using QAM-4 modulation.
For connections with downlink continuous grant data pending, the base station determines the number of PIs required to transmit the data. This number is then converted to PSs as a function of the modulation used for the CPE associated with each connection. For each remaining QoS or until available bandwidth is entirely allocated, the base station determines if there is enough bandwidth to satisfy the entire need of the QoS queue. If so, the base station allocates the required bandwidth. Otherwise, if there is not enough bandwidth to satisfy the queue, the base station implements the queue-specific fairness algorithm described above.
Base Station Uplink
In one preferred embodiment, based upon the ATDD split described above with reference to
For connections with uplink continuous grant data pending, the base station preferably determines the number of PIs required to transmit the data. This number is then converted to a number of PSs as determined by the modulation used for the CPE associated with each connection. Continuous grant connections having a current bandwidth that is less than the maximum bandwidth are always allocated uplink bandwidth that is the smaller of: 1) their maximum bandwidth or 2) their current bandwidth plus the bandwidth necessary to send a CG bandwidth change message.
For each remaining QoS, or until available bandwidth is entirely allocated, the base station determines if there is bandwidth sufficient to satisfy the entire need of the QoS queue and it then allocates the required bandwidth. Otherwise, if there is not bandwidth sufficient to satisfy the queue, the base station implements the queue-specific fairness algorithm described above.
CPE Uplink
As described above, for each TDD frame, the CPEs are allocated a portion of the uplink sub-frame in which to transmit their respective data. Because the bandwidth requirements of the CPE may have changed since the base station received the bandwidth request information that it used to allocate the uplink bandwidth, the CPEs themselves are responsible for allocating their allotted bandwidth based upon their current bandwidth requirements. That is, the CPEs are not constrained to distribute allocated bandwidth to their data connections in the same manner that the CPE used in requesting the bandwidth from the base station. The CPE's uplink bandwidth allocation algorithm preferably proceeds as follows.
For connections having uplink continuous grant data pending, the CPE determines the number of PIs that are required to transmit the data. This number is then converted to a PS number based upon the modulation scheme used by the CPE. For each remaining QoS, or until available bandwidth is entirely allocated, the CPE determines if there is bandwidth sufficient to satisfy the entire need of the QoS queue. If so, the CPE allocates the required bandwidth. Otherwise, if there is not bandwidth sufficient to satisfy the queue, the CPE implements the queue-specific fairness algorithm described above.
In summary, the bandwidth allocation method and apparatus of the present invention includes a powerful, highly efficient means for allocating bandwidth in a broadband wireless communication system. The present bandwidth allocation method and apparatus uses a combination of individual and group polling techniques, contention-based polling, piggybacking, and CPE-initiated techniques to efficiently allocate bandwidth in a communication system. Advantageously, only those currently active CPEs (CPEs that currently have bandwidth allocations associated thereto) are permitted to request more bandwidth using either the piggybacking or poll-me bit methods. In addition, the present invention saves bandwidth by implicitly informing the CPE of additional bandwidth allocation. The base station implicitly informs the CPE of additional bandwidth allocation by allocating additional bandwidth to the CPE in the uplink sub-frame map. Similarly, the base stations implicitly poll the CPEs by allocating bandwidth in the uplink to enable the CPEs to respond to the poll with a bandwidth request.
In honoring the bandwidth requests, the base station builds and maintains a logical queue of the data to be transmitted. The queues are developed by the base stations based upon the QoS. In addition, the base station allocates bandwidth based on a combination of QoS and a QoS unique fairness algorithm. The CPE itself, rather than the base station, distributes the allocated bandwidth to its services in any manner the CPE determines to be appropriate. Thus, the CPE can use its allocated bandwidth in a manner that differs from the originally intended (and requested) purpose.
A number of embodiments of the present invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. For example, the present inventive method and apparatus can be used in any type of communication, its use is not limited to a wireless communication system. One such example is use of the invention in a satellite communication system. In such a communication system, satellites replace the base stations described above. In addition, the CPEs are not longer at fixed distances from the satellites. Therefore, it will be more difficult to schedule DAMA services for the CPEs. Alternatively, the present invention can be used in a wired communication system. The only difference between the wired system and the wireless system described above is that the channel characteristics vary between the two. However, the bandwidth allocations do not change as between the two types of systems. Accordingly, it is to be understood that the invention is not to be limited by the specific illustrated embodiment, but only by the scope of the appended claims.
This application is a continuation of U.S. patent application Ser. No. 14/523,573, filed on Oct. 24, 2014, and U.S. patent application Ser. No. 14/523,755, filed on Oct. 24, 2014, which are a continuation of U.S. patent application Ser. No. 14/338,103, filed on Jul. 22, 2014, which is a continuation of U.S. patent application Ser. No. 14/170,271, filed on Jan. 31, 2014, which is a divisional of U.S. patent application Ser. No. 14/139,159, filed Dec. 23, 2013, which is a divisional of U.S. patent application Ser. No. 13/089,075, filed Apr. 18, 2011, now U.S. Pat. No. 8,654,664, which is a divisional of U.S. patent application Ser. No. 12/645,937, filed Dec. 23, 2009, now U.S. Pat. No. 8,315,640, which is a continuation of U.S. patent application Ser. No. 11/170,392, filed Jun. 29, 2005, now U.S. Pat. No. 8,189,514, which is a continuation of U.S. patent application Ser. No. 09/859,561, filed May 16, 2001, now U.S. Pat. No. 6,956,834, which is a continuation of U.S. patent application Ser. No. 09/316,518, filed May 21, 1999, now U.S. Pat. No. 6,925,068, the disclosures of which are all incorporated herein by reference in their entirety. U.S. patent application Ser. No. 14/338,103, filed on Jul. 22, 2014, is also a continuation of U.S. patent application Ser. No. 13/649,986, filed Oct. 11, 2012, now U.S. Pat. No. 8,787,924, which is a continuation of U.S. patent application Ser. No. 12/645,937, filed Dec. 23, 2009, now U.S. Pat. No. 8,315,640, which is a continuation of U.S. patent application Ser. No. 11/170,392, filed Jun. 29, 2005, now U.S. Pat. No. 8,189,514, which is a continuation of U.S. patent application Ser. No. 09/859,561, filed May 16, 2001, now U.S. Pat. No. 6,956,834, which is a continuation of U.S. patent application Ser. No. 09/316,518, filed May 21, 1999, now U.S. Pat. No. 6,925,068, the disclosures of which are incorporated herein by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3949404 | Fletcher | Apr 1976 | A |
| 4464767 | Bremer | Aug 1984 | A |
| 4495619 | Acampora | Jan 1985 | A |
| 4907224 | Scoles | Mar 1990 | A |
| 4924461 | Amemiya et al. | May 1990 | A |
| 5130983 | Heffner et al. | Jul 1992 | A |
| 5297144 | Gilbert et al. | Mar 1994 | A |
| 5349342 | Nilles et al. | Sep 1994 | A |
| 5349580 | Hester et al. | Sep 1994 | A |
| 5371734 | Fischer | Dec 1994 | A |
| 5404374 | Mullins et al. | Apr 1995 | A |
| 5412651 | Gorshe | May 1995 | A |
| 5420851 | Seshadri et al. | May 1995 | A |
| 5444696 | Petranovich et al. | Aug 1995 | A |
| 5444698 | Kito | Aug 1995 | A |
| 5465253 | Rahnema | Nov 1995 | A |
| 5479447 | Chow et al. | Dec 1995 | A |
| 5499243 | Hall | Mar 1996 | A |
| 5506848 | Drakopoulos et al. | Apr 1996 | A |
| 5511082 | How et al. | Apr 1996 | A |
| 5517503 | Hess et al. | May 1996 | A |
| 5541924 | Tran | Jul 1996 | A |
| 5570355 | Dail et al. | Oct 1996 | A |
| 5592470 | Rudrapatna et al. | Jan 1997 | A |
| 5594720 | Papadopoulos et al. | Jan 1997 | A |
| 5594738 | Crisler et al. | Jan 1997 | A |
| 5596576 | Milito et al. | Jan 1997 | A |
| 5596577 | Perreault et al. | Jan 1997 | A |
| 5615212 | Ruszczyk et al. | Mar 1997 | A |
| 5634006 | Baugher et al. | May 1997 | A |
| 5638371 | Raychaudhuri et al. | Jun 1997 | A |
| 5638374 | Heath | Jun 1997 | A |
| 5640395 | Hamalainen et al. | Jun 1997 | A |
| 5644576 | Bauchot et al. | Jul 1997 | A |
| 5673031 | Meier | Sep 1997 | A |
| 5675573 | Karol et al. | Oct 1997 | A |
| 5677909 | Heide et al. | Oct 1997 | A |
| 5710762 | Petranovich et al. | Jan 1998 | A |
| 5717830 | Sigler | Feb 1998 | A |
| 5729531 | Raith et al. | Mar 1998 | A |
| 5732078 | Arango et al. | Mar 1998 | A |
| 5742594 | Natarajan | Apr 1998 | A |
| 5751708 | Eng et al. | May 1998 | A |
| 5757771 | Li et al. | May 1998 | A |
| 5757784 | Liebowitz | May 1998 | A |
| 5768254 | Papadopoulos et al. | Jun 1998 | A |
| 5787080 | Hulyalkar et al. | Jul 1998 | A |
| 5818820 | Anderson et al. | Oct 1998 | A |
| 5818828 | Packer et al. | Oct 1998 | A |
| 5818845 | Moura et al. | Oct 1998 | A |
| 5826189 | Thapa et al. | Oct 1998 | A |
| 5828695 | Webb | Oct 1998 | A |
| 5859619 | Wu et al. | Jan 1999 | A |
| 5866989 | Hendrix | Feb 1999 | A |
| 5867764 | Williams | Feb 1999 | A |
| 5886989 | Evans et al. | Mar 1999 | A |
| 5886995 | Arsenault et al. | Mar 1999 | A |
| 5889765 | Gibbs | Mar 1999 | A |
| 5889963 | Gopal et al. | Mar 1999 | A |
| 5890055 | Chu et al. | Mar 1999 | A |
| 5896561 | Schrader et al. | Apr 1999 | A |
| 5898925 | Honkasalo et al. | Apr 1999 | A |
| 5917822 | Lyles et al. | Jun 1999 | A |
| 5926476 | Ghaibeh et al. | Jul 1999 | A |
| 5946322 | Moura et al. | Aug 1999 | A |
| 5953344 | Dail et al. | Sep 1999 | A |
| 5956330 | Kerns | Sep 1999 | A |
| 5956338 | Ghaibeh | Sep 1999 | A |
| 5956642 | Larsson et al. | Sep 1999 | A |
| 5966163 | Lin et al. | Oct 1999 | A |
| 5991287 | Diepstraten et al. | Nov 1999 | A |
| 6005853 | Wang et al. | Dec 1999 | A |
| 6005857 | Honkasalo et al. | Dec 1999 | A |
| 6006069 | Langston | Dec 1999 | A |
| 6016311 | Gilbert et al. | Jan 2000 | A |
| 6016313 | Foster et al. | Jan 2000 | A |
| 6023458 | Tweedy et al. | Feb 2000 | A |
| 6031827 | Rikkinen et al. | Feb 2000 | A |
| 6031845 | Walding | Feb 2000 | A |
| 6038223 | Hansson et al. | Mar 2000 | A |
| 6038455 | Gardner et al. | Mar 2000 | A |
| 6047189 | Yun et al. | Apr 2000 | A |
| 6049549 | Ganz et al. | Apr 2000 | A |
| 6049551 | Hinderks et al. | Apr 2000 | A |
| 6052594 | Chuang et al. | Apr 2000 | A |
| 6061330 | Johansson | May 2000 | A |
| 6075787 | Bobeck et al. | Jun 2000 | A |
| 6094421 | Scott | Jul 2000 | A |
| 6097733 | Basu et al. | Aug 2000 | A |
| 6104700 | Haddock et al. | Aug 2000 | A |
| 6108316 | Agrawal et al. | Aug 2000 | A |
| 6112080 | Anderson et al. | Aug 2000 | A |
| 6114968 | Ramakrishnan et al. | Sep 2000 | A |
| 6115390 | Chuah | Sep 2000 | A |
| 6137787 | Chawla et al. | Oct 2000 | A |
| 6138037 | Jaamies | Oct 2000 | A |
| 6141336 | Bauchot et al. | Oct 2000 | A |
| 6141534 | Snell et al. | Oct 2000 | A |
| 6151312 | Evans et al. | Nov 2000 | A |
| 6192026 | Pollack | Feb 2001 | B1 |
| 6198728 | Hulyalkar et al. | Mar 2001 | B1 |
| 6205119 | Kaczynski | Mar 2001 | B1 |
| 6212196 | Momona | Apr 2001 | B1 |
| 6212200 | Iizuka et al. | Apr 2001 | B1 |
| 6216006 | Scholefield et al. | Apr 2001 | B1 |
| 6222832 | Proctor | Apr 2001 | B1 |
| 6240083 | Wright | May 2001 | B1 |
| 6243365 | Mansfield | Jun 2001 | B1 |
| 6249526 | Loukianov | Jun 2001 | B1 |
| 6262980 | Leung et al. | Jul 2001 | B1 |
| 6275497 | Varma et al. | Aug 2001 | B1 |
| 6282187 | Evans et al. | Aug 2001 | B1 |
| 6295285 | Whitehead | Sep 2001 | B1 |
| 6298049 | Vanhoof et al. | Oct 2001 | B1 |
| 6314110 | Chin et al. | Nov 2001 | B1 |
| 6324184 | Hou et al. | Nov 2001 | B1 |
| 6337849 | Smith et al. | Jan 2002 | B1 |
| 6359863 | Varma et al. | Mar 2002 | B1 |
| 6366761 | Montpetit et al. | Apr 2002 | B1 |
| 6370153 | Eng | Apr 2002 | B1 |
| 6373830 | Ozluturk | Apr 2002 | B1 |
| 6374112 | Widegren et al. | Apr 2002 | B1 |
| 6377589 | Knight | Apr 2002 | B1 |
| 6381228 | Prieto, Jr. et al. | Apr 2002 | B1 |
| 6388999 | Gorsuch et al. | May 2002 | B1 |
| 6400684 | Benmohamed et al. | Jun 2002 | B1 |
| 6408005 | Fan et al. | Jun 2002 | B1 |
| 6424656 | Hoebeke | Jul 2002 | B1 |
| 6434164 | Matsunaga et al. | Aug 2002 | B1 |
| 6438141 | Hanko et al. | Aug 2002 | B1 |
| 6452933 | Duffield et al. | Sep 2002 | B1 |
| 6466554 | Okada | Oct 2002 | B2 |
| 6469991 | Chuah | Oct 2002 | B1 |
| 6470016 | Kalkunte et al. | Oct 2002 | B1 |
| 6501745 | Turina et al. | Dec 2002 | B1 |
| 6546017 | Khaunte | Apr 2003 | B1 |
| 6553237 | Cantwell et al. | Apr 2003 | B1 |
| 6567386 | Sugaya et al. | May 2003 | B1 |
| 6567416 | Chuah | May 2003 | B1 |
| 6571101 | Schulz et al. | May 2003 | B1 |
| 6594246 | Jorgensen | Jul 2003 | B1 |
| 6603738 | Kari et al. | Aug 2003 | B1 |
| 6615039 | Eldering | Sep 2003 | B1 |
| 6621812 | Chapman et al. | Sep 2003 | B1 |
| 6625129 | Olds | Sep 2003 | B1 |
| 6628668 | Hutzli et al. | Sep 2003 | B1 |
| 6636485 | Fijolek et al. | Oct 2003 | B1 |
| 6650624 | Quigley et al. | Nov 2003 | B1 |
| 6658010 | Enns et al. | Dec 2003 | B1 |
| 6665264 | Davison et al. | Dec 2003 | B1 |
| 6678282 | Sharper et al. | Jan 2004 | B2 |
| 6683866 | Stanwood et al. | Jan 2004 | B1 |
| 6693891 | Sugita et al. | Feb 2004 | B1 |
| 6693892 | Rinne et al. | Feb 2004 | B1 |
| 6704932 | Matsunaga et al. | Mar 2004 | B1 |
| 6731600 | Patel et al. | May 2004 | B1 |
| 6741614 | Porter et al. | May 2004 | B1 |
| 6754196 | Daane et al. | Jun 2004 | B1 |
| 6771648 | Kim et al. | Aug 2004 | B1 |
| 6771962 | Saifullah et al. | Aug 2004 | B2 |
| 6785252 | Zimmerman et al. | Aug 2004 | B1 |
| 6791998 | Yoshihara et al. | Sep 2004 | B1 |
| 6795409 | Youssefmir et al. | Sep 2004 | B1 |
| 6819661 | Okajima | Nov 2004 | B2 |
| 6829482 | Rune et al. | Dec 2004 | B2 |
| 6842437 | Heath | Jan 2005 | B1 |
| 6862622 | Jorgensen | Mar 2005 | B2 |
| 6895248 | Akyol et al. | May 2005 | B1 |
| 6914890 | Tobita et al. | Jul 2005 | B1 |
| 6925068 | Stanwood et al. | Aug 2005 | B1 |
| 6937566 | Forslöw et al. | Aug 2005 | B1 |
| 6940874 | Ruszczyk et al. | Sep 2005 | B2 |
| 6944148 | Gehring et al. | Sep 2005 | B1 |
| 6956834 | Stanwood et al. | Oct 2005 | B2 |
| 6970422 | Ho et al. | Nov 2005 | B1 |
| 7006530 | Spinar et al. | Feb 2006 | B2 |
| 7047009 | Laroia et al. | May 2006 | B2 |
| 7050407 | Frazer et al. | May 2006 | B1 |
| 7103065 | Quigley et al. | Sep 2006 | B1 |
| 7110466 | Gopalakrishnan et al. | Sep 2006 | B1 |
| 7116682 | Waclawsky et al. | Oct 2006 | B1 |
| 7177323 | Yavatkar et al. | Feb 2007 | B2 |
| 7333495 | Sala et al. | Feb 2008 | B2 |
| 7356339 | Nam | Apr 2008 | B2 |
| 7408901 | Narayanabhatla | Aug 2008 | B1 |
| 7418007 | Liu et al. | Aug 2008 | B1 |
| 7486639 | Stanwood et al. | Feb 2009 | B2 |
| 7512154 | Quigley et al. | Mar 2009 | B2 |
| 7548534 | Zimmerman et al. | Jun 2009 | B2 |
| 7562130 | Dillon et al. | Jul 2009 | B2 |
| 7636571 | Lee et al. | Dec 2009 | B2 |
| 7693093 | Riedel et al. | Apr 2010 | B2 |
| 7751437 | Spinar et al. | Jul 2010 | B2 |
| 7783311 | Takiishi et al. | Aug 2010 | B2 |
| 7809373 | Park et al. | Oct 2010 | B2 |
| 7817666 | Spinar et al. | Oct 2010 | B2 |
| 7822037 | Denney | Oct 2010 | B2 |
| 7962139 | Kangude et al. | Jun 2011 | B2 |
| 8027298 | Stanwood et al. | Sep 2011 | B2 |
| 8085891 | Owen | Dec 2011 | B2 |
| 8131295 | Wang et al. | Mar 2012 | B2 |
| 8189514 | Stanwood et al. | May 2012 | B2 |
| 8243663 | Spinar et al. | Aug 2012 | B2 |
| 8249014 | Stanwood et al. | Aug 2012 | B2 |
| 8249051 | Spinar et al. | Aug 2012 | B2 |
| 20010038620 | Stanwood et al. | Nov 2001 | A1 |
| 20020080816 | Spinar et al. | Jun 2002 | A1 |
| 20040213197 | Zimmerman et al. | Oct 2004 | A1 |
| 20050047368 | Kotzin et al. | Mar 2005 | A1 |
| 20050089064 | Zimmerman et al. | Apr 2005 | A1 |
| 20050111409 | Spear et al. | May 2005 | A1 |
| 20060002336 | Stanwood et al. | Jan 2006 | A1 |
| 20080049678 | Chindapol et al. | Feb 2008 | A1 |
| 20080232342 | Spinar et al. | Sep 2008 | A1 |
| 20080232391 | Spinar et al. | Sep 2008 | A1 |
| 20080253394 | Spinar et al. | Oct 2008 | A1 |
| 20080268844 | Ma et al. | Oct 2008 | A1 |
| 20090168802 | Spinar et al. | Jul 2009 | A1 |
| 20090175235 | Spinar et al. | Jul 2009 | A1 |
| 20090207795 | Spinar et al. | Aug 2009 | A1 |
| 20100150093 | Stanwood et al. | Jun 2010 | A1 |
| 20100150094 | Stanwood et al. | Jun 2010 | A1 |
| 20100157928 | Spinar et al. | Jun 2010 | A1 |
| 20110249585 | Stanwood et al. | Oct 2011 | A1 |
| 20110249586 | Stanwood et al. | Oct 2011 | A1 |
| 20110249645 | Spinar et al. | Oct 2011 | A1 |
| 20110292904 | Stanwood et al. | Dec 2011 | A1 |
| 20120033634 | Spinar et al. | Feb 2012 | A1 |
| Number | Date | Country |
|---|---|---|
| 0353759 | Feb 1992 | EP |
| 0507384 | Oct 1992 | EP |
| 0622924 | Apr 1994 | EP |
| 0720405 | Jul 1996 | EP |
| 0845916 | Jun 1998 | EP |
| 0891060 | Jan 1999 | EP |
| 1045559 | Oct 2000 | EP |
| 2320162 | Dec 1996 | GB |
| 11122289 | Apr 1999 | JP |
| 9222162 | Dec 1992 | WO |
| 9810568 | Mar 1998 | WO |
| 9837706 | Aug 1998 | WO |
| 9907170 | Feb 1999 | WO |
| 9938343 | Jul 1999 | WO |
| 9939532 | Aug 1999 | WO |
| 0001188 | Jan 2000 | WO |
| 0072626 | Nov 2000 | WO |
| 0133772 | May 2001 | WO |
| Entry |
|---|
| 3GPP TS 44.060. |
| 3GPP TS 45.002. |
| 3rd Generation Partnership Project (3GPP), R2-061135, “Intra-LTE Handover Operation,” Nokia, NTT DoCoMo, 3GPP TSG-RAN WG2 Meeting #53, R2-061135, Shanghai, PRC, May 8-13, 2006, 3 pp. |
| Andersen, et al., Prediction of Future Fading Based on Past Measurements, Vehicular Technology Conference, VTC 99, vol. 1, p. 151-155. |
| Balachandran et al. “Medium access control feedback mechanism for uplink resource management in wireless TDMA packet data systems.” 1999 IEEE 49th Vehicular Technology Conference (Cat. No. 99CH36363), 145-50 vol. 1, 1999 (Jul. 1999). |
| Bauchot et al. “Mascara, a MAC Protocol for Wireless ATM.” Nov. 1996. |
| Bender et al., CDMA/HDR: A Bandwidth Efficient High Speed Wireless Data Service for Nomadic Users, Communications Magazine, IEEE, vol. 38, No. 7, Jul. 2000, pp. 70-77. |
| Conti et al., E-DCP, an eXtension of the distributed-control polling MAC protocol (DCP) for integrated services, published 1994, pp. 711-719. |
| Draft EN 301 349 V6.1.0 Aug. 1998, European Standard (Telecommunications Series). Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Mobile Station (MS)—Base Station System (BSS) interface; Radio Link Control / Medium Access Control (RLC/MAC) protocol (GSM 04.60 version 6.1.0 Release 1997). ETSI. |
| Draft TS 03 64 V2.1.1 May 1997 Technical Specification. “Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Overall description of the GPRS Radio Interface; Stage 2 (GSM 03.64 version 2.1.1).” European Telecommunications Standards Institute (ETSI). |
| Draft TS 04.64 V1.0.1 May 1997. “Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Mobile Station (MS)—Serving GPRS Support Node (SGSN); Logical Link Control (LLC) Layer (GSM 04.64 version 1.0.1).” European Telecommunications Standards Institute (ETSI). |
| Droubi et al. “Dynamic bandwidth allocation for the HFC DOCSIS MAC protocol.” Computer Communications and Networks, 2000. Proceedings. Ninth International Conference on pp. 54-60 ; Date of Conference: 2000. |
| Dutton et al. “Asynchronous Transfer Mode (ATM) Technical Overview.” 2.sup.nd Edition, Prentice Hall Oct. 1995, Chap. 3, pp. 21-25. |
| Elfeitori et al., A MAC Protocol for supporting real-time VBR traffic over IEEE 802.14 based HFC access networks, Published May 9-12, 1999, pp. 197-201. |
| Gandhi. “Multiservices over broadband cable.” Electronic Engineering Times 1108 (Apr. 10, 2000): 94. |
| GSM 03.60 v2.0.0 May 1997. Digital cellular telecommunication system (Phase 2+); General Packet Radio Service (GPRS); Service Description; Stage 2 (GSM 03.60 version 2.0.0), European Telecommunications Standards Institute (ETSI). |
| Hoebeke et al. “Dynamic bandwidth allocation on SuperPON.” Proceedings of the SPIE—The International Society for Optical Engineering, v 3843, 207-15, 1999 919-21 Sep. 1999, Boston, MA). |
| Huang. “MAC protocol with priority splitting algorithm for wireless ATM networks.” X.1; Tellambura, C.1, IEEE Vehicular Technology Conference, v 2, p. 982-986, 2000. |
| IEEE 802.16 Broadband Wireless Access Working Group, Jay Klein, Ensemble Communications, Inc. Date submitted Dec. 24, 1999. |
| IEEE Proposed Standard 802.14. |
| Iera et al. “A MAC protocol for wireless access to ATM networks.” Vehicular Technology Conference, 1999. VTC 1999—Fall. IEEE v-rs 50th, vol. 2 , Publication Year: 1999 , pp. 1058-1062 vol. 2. |
| Iera et al. “Analysis of MAC protocols for wireless-ATM networks.” Personal, Indoor and Mobile Radio Communications, 2000. PIMRC 2000. The 11th IEEE International Symposium on vol. 2 , Publication Year: 2000 , pp. 1170-1174 vol. 2. |
| Jagannath. “An Adaptive Data Link Layer Protocol for Wireless ATM Networks.” University of Mysore, India, 1994. |
| Jain, on the Impact of Channel and Channel Quality Estimation on Adaptive Modulation, Dec. 2002, 92 pages. |
| Johnsson. ““HiperLAN/2—The Broadband Radio Transmission Technology Operating in the 5 GHz Frequency Band.””HiperLAN/2 Global Forum, 1999. |
| Kempainen. “Chips and high-speed cable modems enable two-way communications.” EDN43. 11 (May 21, 1998): 56-71. |
| Kim et al. “Channel allocation problem in VoD system using both batching and adaptive piggybacking.” Consumer Electronics, IEEE Transactions on, vol. 44 , Issue: 3 , Publication Year: 1998 , pp. 969-976. |
| Kim, et al., PRMA/DA: A New Media Access Control Protocol for Wireless ATM, IEEE, Jun. 23, 1996, pp. 240-244. |
| Kishore et al. “MAC layer scheduling strategies during handoff for wireless mobile multimedia networks.” Publication date: Dec. 17-19, 1997. |
| Kong et al. “Multi-Code DSSS MAC Protocol for Integrated Services Wireless Home Networks.” IEEE Global Telecommunications Conference—Globecom'99, p. 266-270, Dec. 5-9, 1999. |
| Lee, “Convolutional Coding, Fundamentals and Applications”, Artech House, Inc., 1997, p. 11-51. |
| Lin et al., “Error Control Coding, Fundamentals and Applications”, Prentice-Hall Computer Applications in Electrical Engineering Series., 1993, pp. 315-349. |
| Lin, Ying-Dar, On IEEE 802.14 Medium Access Control Protocol, IEEE Communications Surveys, http://www.comsoc.org/pubs/surveys, Fourth Quarter 1998, vol. 1 No. 1, pp. 1-10. |
| Mollenauer, James F. et al., “An Efficient Media Access Control Protocol for Broadband Wireless Access Systems”, Submission to IEEE 802.16 Broadband Wireless Access Working Group, Oct. 28, 1999, pp. 1-18. |
| Mollenauer, James F., et al., “MAC Proposal for IEEE 802.16.1”, Submission to IEEE 802.16 Broadband Wireless Access Working Group, Dec. 24, 1999, pp. 1-84. |
| Narlikar, et al., Designing Multihop Wireless Backhand Networks with Delay Guarantees, Bell Labs, 2005, 1-4244-0222-0/06/$20.00 2006 IEEE, 12 pages. |
| Papadopoulos et al., “Reduction of MiXed Co-channel Interference in Microcellular STDD Systems”, Vehicular Technology Conference, 1995 IEEE 45.sup.th, vol. 2, pp. 759-763. |
| Passas et al. “MAC protocol and traffic scheduling for wireless ATM networks.” Mobile Networks and Applications. 3:275-292. Sep. 1, 1998. |
| Pons et al. “Bit Error Rate Characterisation and Modelling for GSM.” IEEE 1998, pp. 3722-3727. |
| Qiu et al., Dynamic Reservation Multiple Access (DRMA): A New Multiple Access Scheme for Personal Communication System (PCS), Wireless Networks 2 (1996), pp. 117-128, J.C. Baltzer AG, Science Publishers. |
| Redl, et al., “An Introduction to GSM”, Artech House, Inc., 1995, pp. 84-85 and 95. |
| Sampei et al., Adaptive Modulation/TDMA Scheme for Personal Multi-Media Communication System, Proceedings of the Global Telecommunications Conference, U.S., New York, IEEE, Nov. 28, 1994, pp. 989-993. |
| Sau et al. ““Scheduling and Quality of Service in the General Packet Radio Service.”” IEEE 1998 International Conference on Universal Personal Communications. p. 1067-1071. Oct. 5-8, 1998, Florence, IT. |
| Shannon, “A Mathematical Theory of Communication”, Bell System Technical Journal, pp. 379-423 (Part 1), 623-656 (Part 2), Jul. 1948. |
| Superseded Data-Over-Cable Service Interface Specifications, Radio Frequency Interface Specification, SP-RFIv1.1-I01-990311 (DOCSIS1.1), dated Mar. 11, 1999, http://www.cablelabs.com/specifications/SP-RFIv.1.1-101-990311.pdf, pp. i310, 320 pages. |
| Torrance, et al., Upper Bound Performance of Adaptive Modulation in a Slow Rayleigh Fading Channel, 2 pages. |
| Ue et al., Symbol Rate and Modulation Level Controlled Adaptive Modulation/TDMA/TDD for Personal Communication Systems, Proceedings of the Vehicular Technology Conference, U.S., New York, IEEE, vol. Conf. 45, Jul. 25, 1995, pp. 306-310. |
| Ulm et al, “Data-Over-Cable Interface Specifications, Radio Frequency Interface Specification”, Hewlett Packard Interim Specification Doc. Control No. SP-RFI101-970321, published Mar. 21, 1997 by MCNS Holdings, L.P., Section 6, pp. 43-85. |
| United States District Court, Northern District of California, “Amended Complaint for Declaratory Judgment Demand for Jury Trial” filed Sep. 30, 2008 in Case No. 5:08-cv-4555, 20 pages. |
| United States District Court, Southern District of Florida. Wi-LAN USA, Inc. and Wi-LAN, Inc., Plaintiffs, v. ALCATEL-LUCENT USA INC., Defendant. “Complaint.” Entered Oct. 1, 2012. Case No. 1:12-cv-23568-CMA. 7 pages. |
| United States District Court, Southern District of Florida. Wi-LAN USA, Inc. and Wi-LAN, Inc., Plaintiffs, v. Apple Inc., Defendant. “Complaint.” Entered Dec. 6, 2012. Case No. 1:12-cv-24318-KMM. 6 pages. |
| United States District Court, Southern District of Florida. Wi-LAN USA, Inc. and Wi-LAN, Inc., Plaintiffs, v. HTC Corporation, and HTC America, Inc., Defendants. “Complaint.” Entered Dec. 6, 2012. Case No. 1:12-cv-24319- KMM. 6 pages. |
| United States District Court, Southern District of Florida. Wi-LAN USA, Inc. and Wi-LAN, Inc., Plaintiffs, v. Sierra Wireless America, Inc., Defendant. “Complaint.” Entered Dec. 6, 2012. Case No. 1:12-cv-24320-KMM. 6 pages. |
| United States District Court, Southern District of Florida. Wi-LAN USA, Inc. and Wi-LAN, Inc., Plaintiffs, v Telefonaktiebolaget LM Ericsson, and Ericsson Inc., Defendants. “Complaint.” Entered Oct. 1, 2012. Case No. 1:12-cv-23569-DMM. 7 pages. |
| Wolf et al., “On the Weight Distribution of Linear Block Codes Formed From Convolutional Codes”, IEEE, IEEE Transactions on Communications, vol. 44:9, Sep. 9, 1996, pp. 1049-1051. |
| Zhang et al. “A Predictive Handoff Approach for Mobile IP.” Publication date: Source: Wireless and Mobile Communications, 2006. ICWMC'06. International Conference on Jul. 29-31, 2006, pp. 78. |
| Passas et al. “Quality-of-Service Oriented Medium Access Control for Wireless ATM Networks.” Communication Networks Laboratory, Department of Informatics, University of Athens. 1997. 23 pages. |
| United States District Court, Southern District of Florida. Wi-LAN USA, Inc. and Wi-LAN, Inc., Plaintiffs, v Telefonaktiebolaget TM Ericsson, and Ericsson Inc., Defendants. “Markman Order.” Entered Jan. 13, 2015. Case No. 1:12-cv-23569-DMM. 26 pages. |
| 3GPP TS 03.64, “Digital Cellular Telecommunications System (Phase 2+); General Packet Radio Service (GPRS); Overall Description of the GPRS Radio Interface; Stage 2” (GSM 03.64)European Telecommunications Standards Institute (ETSI) 1998. |
| 3GPP TS 04.08, “Digital cellular telecommunications system (Phase2+), Mobile radio interface layer 3 specification” (GSM 04.08) European Telecommunications Standards Institute (ETSI)1998. |
| '3GPP TS 04.64, “Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Mobile Station—Serving GPRS Support Node (MS-SGSN) Logical Link Control (LLC) layer specification” (GSM 04.64). European Telecommunications Standards Institute (ETSI) 2000. |
| Ala-Laurila, Juha, and Geert Awater, The magic WAND—wireless ATM network demonstrator system, Proceeding of ACTS Mobile Communication Summit '97 (1997) at 356-362 (“Magic WAND”). |
| GSM 01.02, “Digital cellular telecommunications system (Phase 2+); General description of a GSM Public Land Mobile Network (PLMN),” Mar. 1996. |
| GSM 03.60 version 6.0.0 dated Mar. 1998. Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Service description; Stage 2. |
| GSM 03.64 version 6.0.0 dated Apr. 1998. Digital cellular telecommunications system (Phase 2-+); General Packet Radio Service (GPRS); Overall description of the GPRS radio interface; Stage 2. |
| GSM 04.08 version 6.0.0 Release 1997. Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification. |
| GSM 04.60 version 6.0.0 dated Mar. 1998. Digital cellular telecommunication system (Phase 2+); GPRS; Mobile Station (MS)—Base Station System (BSS) Interface; Radio Link Control/Medium Access Control (RLC/MAC) Protocol. |
| GSM 04.64 version 6.0.0 dated Mar. 1998. General Packet Radio Service (GPRS); Mobile Station—Serving GPRS Support Node (MS-SGSN) Logical Link Control (LLC) Layer Specification. |
| GSM 05.05 version 6.1.0 (Apr. 1998), “Technical Specification; Digital cellular telecommunications system (Phase 2+); Radio transmission and reception,” Apr. 1998. |
| GSM 05.10 version 6.1.0 dated Jan. 1998. Digital cellular telecommunications system (Phase 2+); Radio subsystem synchronization. |
| N. Passas and L. Merakos and D. Skyrianoglou, Traffic Scheduling in Wireless ATM Networks, Proceedings, IEEE ATM Workshop, Lisbon, Portugal, May 1997, at 391-400 (“Passas”). |
| Performance Evaluation of MAC Schemes for Wireless ATM Systems with Centralised Control Considering Processing Delays, Kramling K; Seidel, G.; Radimirsch, M. and Delefsen, M., Department of Communication Networks, Faculty 6, RWTH Aachen University, Bonn, Germany, 1997. (35 U.S.C. §§ 102 & 103). |
| Number | Date | Country | |
|---|---|---|---|
| 20150312898 A1 | Oct 2015 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14139159 | Dec 2013 | US |
| Child | 14170271 | US | |
| Parent | 13089075 | Apr 2011 | US |
| Child | 14139159 | US | |
| Parent | 12645937 | Dec 2009 | US |
| Child | 13089075 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14523573 | Oct 2014 | US |
| Child | 14738754 | US | |
| Parent | 14523755 | Oct 2014 | US |
| Child | 14523573 | US | |
| Parent | 14338103 | Jul 2014 | US |
| Child | 14523755 | US | |
| Parent | 14170271 | Jan 2014 | US |
| Child | 14338103 | US | |
| Parent | 11170392 | Jun 2005 | US |
| Child | 12645937 | US | |
| Parent | 09859561 | May 2001 | US |
| Child | 11170392 | US | |
| Parent | 09316518 | May 1999 | US |
| Child | 09859561 | US | |
| Parent | 13649986 | Oct 2012 | US |
| Child | 14338103 | US | |
| Parent | 12645937 | Dec 2009 | US |
| Child | 13649986 | US | |
| Parent | 11170392 | Jun 2005 | US |
| Child | 12645937 | US | |
| Parent | 09859561 | May 2001 | US |
| Child | 11170392 | US | |
| Parent | 09316518 | May 1999 | US |
| Child | 09859561 | US |
