US2010165941A1PendingUtilityA1
Method and system for peak scheduling in a wireless network
Est. expiryJun 28, 2026(expired)· nominal 20-yr term from priority
H04W 72/566H04L 47/2433H04W 8/04H04L 47/6215H04L 47/50
53
PatentIndex Score
0
Cited by
0
References
0
Claims
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
exact text as granted — not AI-modified1 - 20 . (canceled)
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.
22 . 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.
23 . 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.
24 . The method as set forth in claim 23 , the long-term channel history comprising one of a total throughput and an average past throughput.
25 . 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
.
26 . 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.
27 . 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.
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.
29 . 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.
30 . The method as set forth in claim 29 , the long-term channel history comprising one of a total throughput and an average past throughput.
31 . 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
.
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.
33 . 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.
34 . 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.
35 . 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.
36 . 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.
37 . 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
.
38 . 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.
39 . 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.
40 . 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.Join the waitlist — get patent alerts
Track US2010165941A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.