Abstract: The invention includes an apparatus and method for wirelessly transmitting data between a plurality of subscriber units and a base transceiver station. The method includes at least one subscriber unit transmitting a request to send data blocks to the base transceiver station. The request includes a data transmission queue size value. A base user queue size estimate is updated at the base transceiver station. The base user queue size estimate corresponds to the one subscriber unit that transmitted the request to send data. The base user queue size estimate is based upon the data transmission queue size value. The base transceiver station generates a schedule that includes time slots and frequency blocks in which the requested data blocks are to be transmitted from the one subscriber unit to the base transceiver station. The subscriber unit transmits the data blocks the subscriber requested to be sent, according to the schedule.

Abstract: A method for improving TCP throughput over lossy communication links without affecting performance over non-lossy links comprises determining lookahead-loss which is the number of lost packets in a given loss-window; using the loss-window and lookahead-loss to detect congestion in the communication links; and controlling transmission under congestion conditions and under normal conditions, wherein the controlling transmission comprises controlling a size of the loss-window by beginning in a slow-start phase; advancing to a congestion avoidance phase when a slow-start threshold is reached; entering a halt growth phase when the first level of packet loss has been recovered; returning to the congestion avoidance phase when a first level of packet recovery occurs; entering a k-recovery phase when a second level of packet loss occurs. The loss window and slow-start threshold are reduced in half and returned to the congestion avoidance phase when the second level of packet loss has been recovered.

Abstract: The present invention relates to a computer implemented system for transferring data over a master driven TDD/TDMA based wireless network operating with minimum delay in end-to-end transmission by achieving optimum time slot utilization by minimizing the number of baseband packets created for each Link layer packet, where each baseband packet of is a size corresponding to one of a permitted set of capacities ‘C1, C2, . . . Cn’. The system also optimizes sharing of bandwidth, higher link utilization and low baseband packet transmission queue occupancy by adaptive scheduling of the transmission of the baseband packets in the queues. The invention also provides a method and computer program product for the above system.

Abstract: A method, a system and a computer program product are disclosed for allocating bandwidth of a limited bandwidth link to dataflows containing packets. In the method, the number of buckets is adaptively adjusted dependent upon the number of active dataflows. Each bucket has a number of tokens allocated to the bucket for use by the corresponding dataflow. The number of tokens is dependent upon a weighted value for the corresponding dataflow. Queueing of the packets for utilization of the limited bandwidth link is dependent upon the tokens. Tokens are then adaptively-reallocated to one or more buckets in accordance with a weighted value for each of the dataflows.

Abstract: A system, method, and computer program product for carrying out the method for managing power consumption in a master driven time division duplex wireless network comprising optimizing power consumption while maintaining quality of service requirements for end-to-end packet delay by adjusting the polling interval for each slave in low power mode based on the incoming traffic at the slave.

Abstract: A method for managing a buffer pool containing a plurality of queues is based on consideration of both (a) when to drop a packet and (b) from which queue the packet should be dropped. According to the method a packet drop is signaled with the global average queue occupancy exceeds a maximum threshold and is signaled on a probabilistic basis when the global occupancy is between a minimum threshold and the maximum threshold. Each queue has a particular local threshold value associated with it and is considered to be “offending” when its buffer occupancy exceeds its local threshold. When a packet drop is signaled, one of the offending queues is selected using a hierarchical, unweighted round robin selection scheme which ensures that offending queues are selected in a fair manner. A packet is then dropped from the selected offending queue.

Abstract: The invention includes an apparatus and a method for wirelessly transmitting and re-transmitting sub-protocol data units between a transceiver and a subscriber unit. The method includes the transceiver receiving standard data units and forming sub-protocol data units. The transceiver transmits a plurality of sub-protocol data units to the subscriber unit. A subset of the plurality of sub-protocol data units includes an acknowledge request indicator. The subscriber unit receives the sub-protocol data units. The subscriber unit transmits back to the transceiver a response to the acknowledge request indicator, indicating which sub-protocol data units were successfully received by the subscriber unit.

Abstract: The present invention includes a method and system for wirelessly transmitting data between a plurality of subscriber units and a base transceiver station. The method comprises at least one subscriber unit transmitting a service flow request to the base transceiver station, determining if the service flow request was received by the base transceiver station, utilizing a back-off algorithm to re-transmit the service flow request if the service flow request was not received by the base transceiver station and transmitting data blocks to the base transceiver station based on the service flow request.

Abstract: A first embodiment of the invention includes a method for scheduling information in a multiple antenna wireless cellular network. The wireless cellular network includes a base transceiver station and a plurality of subscriber units wherein each of the plurality of subscriber units belongs to a service class. The method includes receiving a service flow request from a subscriber unit, determining the service class of the subscriber unit and scheduling time slots and frequency blocks for the service flow request based on the service class of the subscriber unit. A second embodiment of the present invention includes a system for scheduling the transmission of data in a multiple antenna wireless network. The system comprises means for receiving a service flow request from a subscriber unit, means for determining the service class of the subscriber unit and means for scheduling time slots and frequency blocks for the service flow request based on the service class of the subscriber unit.

Abstract: The invention includes an apparatus and method for wirelessly transmitting data between a plurality of subscriber units and a base transceiver station. The method includes at least one subscriber unit transmitting a request to send data blocks to the base transceiver station. The request includes a data transmission queue size value. A base user queue size estimate is updated at the base transceiver station. The base user queue size estimate corresponds to the one subscriber unit that transmitted the request to send data. The base user queue size estimate is based upon the data transmission queue size value. The base transceiver station generates a schedule that includes time slots and frequency blocks in which the requested data blocks are to be transmitted from the one subscriber unit to the base transceiver station. The subscriber unit transmits the data blocks the subscriber requested to be sent, according to the schedule.