Clear Wireless LLC

Pts Corporation

Altera Corporation

Sprint Communications Comapny L.p.

Mehdi Alasti

Mohammad Hassan Partovi

Vahid Tabatabaee

Kamran Sayrafian-Pour

Behnam Neekzad

Esmael Hejazi Dinan

Subir Varma

Masoud Olfat

Roy Leo Spitzer

Feng Huang

In various embodiments, methods and systems are provided for backhaul transport recovery. In an embodiment, a method for backhaul transport recovery is provided. The method includes broadcasting a backhaul recovery request, and receiving backhaul recovery responses from at least one wireless device. The method also includes selecting at least one wireless recovery device from the at least one wireless device based upon the backhaul recovery responses, and establishing at least one backhaul recovery channel through the at least one wireless recovery device.

Method for backhaul transport recovery

A first traffic flow directed to a first wireless device is received. A second traffic flow directed to a second wireless device is received. These traffic flows comprise at least a first service flow classification and a second service flow classification. The first traffic flow and the second traffic flow are scheduled based on the first service flow classification and the second flow classification. This produces first and second device scheduled flows. The first and second device scheduled flows are classified into a plurality of flow classes. The plurality of flow classes comprises at least a first flow class and a second flow class. The first scheduled flow and the second scheduled flow are scheduled based on the first flow class and the second flow class. This produces an aggregate traffic flow.

Two stage traffic scheduling

Methods and systems are provided for overload control in a wireless communication system. An overload control mechanism identifies an instance of use to eliminate from among a plurality of instances of use in a wireless coverage area. In an overload situation, the overload control mechanism may, for each instance of use, determine a respective ratio of the value of instance of use to the quantity of resource consumed by the instance of use. The overload control mechanism may then sort the instances of use in order of determined ratios to produce a sorted order of the instances of use. The overload control mechanism may select as many instances of use as possible, such that the total amount of resources consumed by the selected instances of use is as high as possible without exceeding the threshold load, and then the overload control mechanism may eliminate the remaining instances of use.

Method and system for overload control

A data transfer system receives a first service flow, a second service flow, and a third service flow that comprise a data session for a user device. The data transfer system transfers the first service flow to a scheduler using a first data rate limit and transfers the second service flow to the scheduler using a second data rate limit. The data transfer system also transfers the third service flow to the scheduler. The scheduler schedules transfers of the first service flow and the second service flow at a higher priority than transfers of the third service flow. The data transfer system transfers the first service flow, the second service flow, and the third service based on the prioritized schedule and using a third data rate limit. Thus, the first and second service flows receive a limited amount of preferential bandwidth, and the third service flow obtains unused bandwidth from the first and second service flows, subject to the third data rate limit.

Data rate management in a communication network

A method of operating a communication system is disclosed. A first communication session between a first base station and a mobile station is established. A service session between a first access network and the mobile station is established. When the mobile station moves to the service area of a new base station, a second communication session between a second base station and the mobile station is established. A distance between the first base station and the second base station is determined. If the distance exceeds a criteria, the service session is handed off a second access network. The criteria, which must be greater than zero, corresponds to the number of base station service areas separating the first base station and the second base station.

Mobile station service session handoff

Arbitration for a switch fabric (e.g., an input-buffered switch fabric) is performed. For a first port, a link subset from a set of links associated with the first port is determined. Each link from the link subset is associated with its own candidate packet and is associated with its own weight value. A link from the link subset for the first port is selected based on the weight value associated with each link from the link subset for the first port. For a second port, a link subset from a set of links associated with the second port is determined. Each link from the link subset associated with the second port is associated with its own candidate packet and is associated with its own weight value. The determining for the second port is performed in parallel with the determining for the first port. A link from the link subset for the second port is selected based on the weight value associated with each link from the link subset of associated with the second port. The selecting for the second port is performed in parallel with the selecting for the first port.

Method and apparatus for parallel, weighted arbitration scheduling for a switch fabric

Arbitration for a switch fabric (e.g., an input-buffered switch fabric) is performed. The switch fabric has a set of ports. Each port from the set of ports is associated with its own set of links. The set of ports includes a first port and a second port. A link is selected from the set of links associated with the first port based on a weight value associated with each remaining link associated with a candidate packet and being from the set of links associated with the first port. A first penalty for a weight vector entity associated with the first port is determined by based on a weight value associated with each link from a first subset of links from the set of links for the first port. Each link from the first subset of links is not associated with a candidate packet.

Method and apparatus for arbitration scheduling with a penalty for a switch fabric

Scheduling is performed for a switch fabric (e.g., an input-buffered switch fabric). A first input port from a set of input ports is selected, for a first output port, based on a weight value uniquely associated with each link from a first set of links. Each link from the first set of links are between the first output port and a unique input port from the set of input ports. A second output port from a set of output ports is selected for a second input port.

Growing community of inventors

Rockville, MD, United States of America

Mehdi Alasti