Escolar Documentos
Profissional Documentos
Cultura Documentos
©Copyright 2005-2006
All Rights Reserved
Motivation
©Copyright 2005-2006 2
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Motivation (cont’d)
Polling mode
Poll each SS in every frame or in every k frames
©Copyright 2005-2006 3
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Uplink Scheduling Scheme
R
eq
ue
st s
SS4 st SS1
s
ue
G
nt s
Req
ra
n
Gra
ts
Requests Requests
Grants Grants
SS3 SS2
BS
©Copyright 2005-2006 4
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Optimum Polling Interval k
Polling mode
BS polls each SS every k frames
Worst case fairness is better if polled in every frame
Normalized delay is better if polled in some k frames
©Copyright 2005-2006 5
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Opportunistic Scheduling
SINR1 q1(t)
SS1
SINR2 d1(t)
BS q2(t)
SS2
SINRk d2(t)
Scheduler
qk(t)
SSk
BS takes into account dk(t)
Channel characteristics [ SINR1 , SINR2 , SINRk ]
Queue lengths [q1 (t ), q2 (t ), qk (t )]
Delay counters [d1 (t ), d 2 (t ), d k (t )] at scheduling instant, based on COS
©Copyright 2005-2006 6
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Opportunistic Deficit Round Robin
(O-DRR)
©Copyright 2005-2006 7
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
O-DRR Uplink Scheduling
SS6 SS1
SS2
SS5
Tf
kTf
Scheduling Scheduling Scheduling
Epoch Epoch Epoch
©Copyright 2005-2006 8
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Scheduling Multiclass Traffic
d i Td ( i ) nT f
Deficit counter
• Weight is more if the deficit counter is high
Weights w
1/delay counter
deficit counter
©Copyright 2005-2006 9
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
O-DRR Uplink Scheduling
Tf
kTf
Scheduling
Epoch
Eligible Set
{SS1, SS2, SS4, SS6}
SINRi > SINRth & Backlogged
©Copyright 2005-2006 10
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
O-DRR Uplink Scheduling
Tf
kTf
Scheduling
Epoch
Eligible Set
{SS1, SS2, SS4, SS6}
SINRi > SINRth
& Backlogged
©Copyright 2005-2006 11
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
O-DRR Uplink Scheduling
SS6 SS1
SS2
Sch Set
{SS1,SS2, Sch Set Sch Set SS5
Tf
kTf
Scheduling
Epoch
Eligible Set
{SS1, SS2, SS4 , SS6}
SINRi > SINRth
& Backlogged
©Copyright 2005-2006 12
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
O-DRR Uplink Scheduling
SS1
SS6 SS2
SS5
SS3
SS4
Tf
kTf
Scheduling Scheduling
Epoch Epoch
Eligible Set Eligible Set
{SS1, SS2, SS4, SS6} {SS2, SS3, SS4, SS6}
SINRi > SINRth
& Backlogged
©Copyright 2005-2006 13
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Simulation Setup
©Copyright 2005-2006 14
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Fairness and Throughput
O-DRR is fair
Fair among users
• Max. difference in allocated bandwidth < 10 % of average
Fair among traffic classes
• Both class1 and class2 traffic get almost equal number of slots
As k increases, fairness decreases (intuitively expected)
©Copyright 2005-2006 15
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Delay Performance
©Copyright 2005-2006 16
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Choosing Polling Interval k
Appropriate k to satisfy
• Fairness & bandwidth
requirements
©Copyright 2005-2006 17
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Discussion
©Copyright 2005-2006 18
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
Future Work
©Copyright 2005-2006 19
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved
©Copyright 2005-2006
All Rights Reserved
Example of O-DRR Scheme
Assumptions
Total no of slots = 60
Number of users = 6
Per user (quantum) = 10
Tf= 5, K = 3
1 1 31 1 1 30 10 0.46 28 12
2 2 30 1 1 20 30 0.10 6 24
3 1 20 1 0 -35 20 0.0 0 -25
4 2 35 1 1 40 25 0.25 15 35
5 1 23 1 0 15 18 0.0 0 25
6 2 32 1 1 23 20 0.18 11 22
24
2 2 30 34 1 1 1 10 25 0.23 14 20
-25
3 1 20 22 1 0 0 10 15 0 0 -15
35
4 2 35 25 1 1 0 10 20 0 0 45
25
5 1 23 24 1 0 0 10 13 0 0 35
22
6 2 32 21 1 1 0 20 15 0 0 32
©Copyright 2005-2006 22
IEEE Globecom-2006, NXG-02: Broadband Access
All Rights Reserved