# US 2010/0165941 A1 · Method and system for peak scheduling in a wireless network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0165941 A1
- Document ID: US20100165941A1
- Status: Published application
- Kind: A1
- Application number: 12/653,614
- Filed: 2009-12-16
- Published: 2010-07-01
- Earliest claimed: 2006-06-28
- Assignees: Samsung Electronics Co., Ltd.
- Inventors: Baowei Ji; Cornelius van Rensburg
- Web page: https://patentgrep.com/patent/US20100165941A1

## CPC

- H04W 72/566: of the information or information source or recipient
- H04L 47/2433: {Allocation of priorities to traffic types}
- H04L 47/50: Queue scheduling
- H04L 47/6215: {Individual queue per QOS, rate or priority}
- H04W 8/04: Registration at HLR or HSS [Home Subscriber Server]
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method of providing peak scheduling in a wireless network is provided. The method includes determining a priority for each of a plurality of users in the network based on a throughput window of a finite length and scheduling the users based on the priority.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A method of providing peak scheduling in a wireless network, comprising:
determining a priority for a plurality of users in the network based, wherein the priority is determined by a finite length throughput window of a finite length; and
scheduling the users based on the priority.

### Claim 22 (depends on 21)

The method as set forth in claim 21, determining the priority for each of the users based on the throughput window comprising determining the priority for each of the users based on a scheduling ratio, the scheduling ratio based on the throughput window.

### Claim 23 (depends on 22)

The method as set forth in claim 22, the scheduling ratio comprising an instantaneous channel state versus a long-term channel history for each of the users.

### Claim 24 (depends on 23)

The method as set forth in claim 23, the long-term channel history comprising one of a total throughput and an average past throughput.

### Claim 25 (depends on 22)

The method as set forth in claim 22, the scheduling ratio comprising the following equation:
k
^
=
arg


max
i

DRC
i

(
t
)
R
i

(
t
-
Δ


T
)
,

where
R
i

(
t
)
=
R
i

(
t
-
Δ


T
)
+
δ
i

k
^

(
t
)

DRC
i

(
t
)

Δ


T
.

### Claim 26 (depends on 21)

The method as set forth in claim 21, further comprising adjusting a balance between responsiveness and fairness in scheduling the users by modifying the length of throughput window.

### Claim 27 (depends on 21)

The method as set forth in claim 21, further comprising:
determining whether a change in conditions for the network has surpassed a predetermined threshold; and
when the change in conditions for the network has surpassed the predetermined threshold, adjusting a balance between responsiveness and fairness in scheduling the users based on the change in conditions by modifying the length of the throughput window.

### Claim 28

A method of providing peak scheduling in a wireless network, comprising:
defining a finite length for a throughput window;
determining a scheduling ratio for each of a plurality of users in the network based on the throughput window;
prioritizing the users based on the scheduling ratios;
scheduling the users based on the prioritization of the users;
determining whether a change in conditions for the network has surpassed a predetermined threshold; and
when the change in conditions for the network has surpassed the predetermined threshold, modifying the length of the throughput window.

### Claim 29 (depends on 28)

The method as set forth in claim 28, the scheduling ratio comprising an instantaneous channel state versus a long-term channel history for each of the users.

### Claim 30 (depends on 29)

The method as set forth in claim 29, the long-term channel history comprising one of a total throughput and an average past throughput.

### Claim 31 (depends on 28)

The method as set forth in claim 28, the scheduling ratio comprising the following equation:
k
^
=
arg


max
i

DRC
i

(
t
)
R
i

(
t
-
Δ


T
)
,

where
R
i

(
t
)
=
R
i

(
t
-
Δ


T
)
+
δ
i

k
^

(
t
)

DRC
i

(
t
)

Δ


T
.

### Claim 32

A base station capable of providing peak scheduling in a wireless network, comprising a packet scheduler operable to provide double-sided scheduling for each of a plurality of users in the network by scheduling each of the users both at a substantial portion of an ascending slope of a channel fading curve for the user and at a substantial portion of a descending slope of the channel fading curve for the user.

### Claim 33 (depends on 32)

The base station as set forth in claim 32, the packet scheduler comprising a finite impulse response (FIR) filter operable to determine a priority for each of the users based on a throughput window of a finite length, the packet scheduler further operable to provide scheduling for each of the users based on the priority for the user.

### Claim 34 (depends on 33)

The base station as set forth in claim 33, the FIR filter operable to determine the priority for each of the users based on the throughput window by determining the priority for each of the users based on a scheduling ratio, the scheduling ratio based on the throughput window.

### Claim 35 (depends on 34)

The base station as set forth in claim 34, the scheduling ratio comprising an instantaneous channel state versus a long-term channel history for each of the users.

### Claim 36 (depends on 35)

The base station as set forth in claim 35, the long-term channel history comprising one of a total throughput and an average past throughput.

### Claim 37 (depends on 34)

The base station as set forth in claim 34, the scheduling ratio comprising the following equation:
k
^
=
arg


max
i

DRC
i

(
t
)
R
i

(
t
-
Δ


T
)
,

where
R
i

(
t
)
=
R
i

(
t
-
Δ


T
)
+
δ
i

k
^

(
t
)

DRC
i

(
t
)

Δ


T
.

### Claim 38 (depends on 33)

The base station as set forth in claim 33, the packet scheduler further comprising a filter controller coupled to the FIR filter, the filter controller operable to define a length for the throughput window.

### Claim 39 (depends on 38)

The base station as set forth in claim 38, the filter controller further operable to adjust a balance between responsiveness and fairness in scheduling the users by modifying the length of the throughput window.

### Claim 40 (depends on 33)

The base station as set forth in claim 33, the packet scheduler further comprising a filter controller coupled to the FIR filter, the filter controller operable to define a length for the throughput window, to determine whether a change in conditions for the network has surpassed a predetermined threshold and, when the change in conditions for the network has surpassed the predetermined threshold, to modify the length of the throughput window.
