Professional Documents
Culture Documents
Wimax
Wimax
WIMAX
• Goal of WIMAX:
Provide high-speed Internet access to home and
business subscribers, without wires.
• Frequency range:
10-66 GHz and sub 11 GHz
• Supports:
– Legacy voice systems
– Voice over IP
– TCP/IP
– Applications with different QoS requirements.
Introduction
•All data traffic goes through the BS, and the BS control
the allocation of bandwidth on the radio channel.
Introduction
Infrastructure of WIMAX
2 ARQ
3 Scheduling
I Transmission of the data
• Other protocols map the higher layer PDU directly to the MAC SDU. A
value of zero in the PHSI indicates no payload header suppression has
been applied to the PDU.
I Transmission of the data
• Packing:
Several small MSDUs addressed to the same CID may
be concatenated by the transmitter to form a single
MPDU. At the reception, the SDU is reassembled by
the MAC layer.
• Fragmentation:
MSDU might be fragmented by the transmitter to
form several MPDUs. At the reception the SDUs are
separated by the MAC layer.
4 Fragmentation and packing
Reasons:
NO fragmentation
& NO packing Packing Fragmentation
TC
PDUs P PDU which has started in the First PDU which starts in this Second PDU which starts in
previous TC packet TC packet this TC packet
FEC encoding
B FEC
C H-ARQ
B FEC
C H-ARQ
– Feedback ( go back-N)
– Selective repeat
B FEC
C H-ARQ
retransmission
Transmitting 1 2 3 3
Time
Data
NAK
ACK
ACK
Received Data 1 2 3
Time
Error
Output Data 1 2 3
Time
ACK: Acknowledge
NAK: Negative ACK
Stop and Wait
B FEC
C H-ARQ
Transmitter
Transmitter
Receptor
Receptor
II ARQ
A ARQ
• Stop and Wait
• Sliding window technique
• Feedback ( go back-N)
• Selective repeat
B FEC
C H-ARQ
Go-back 3 Go-back 5
1 2 3 4 5 3 4 5 6 7 5
Time
K
K
NA
NA
1 2 3 4 5
Error Error
1 2 3 4 5
Time
II ARQ
A ARQ
• Stop and Wait
• Sliding window technique
• Feedback ( go back-N)
• Selective repeat
B FEC
C H-ARQ
1 2 3 4 5 3 6 7 8 9 7
Time
K
NA
NA
1 2 4 5 3 6 8 9 7
Time
Error Error
1 2 4 5 3 6 8 9 7
Time
1 2 3 4 5 6 7 8 9
Time
II ARQ
A ARQ
1. Stop and Wait
2. Sliding window technique
3. Feedback ( go back-N)
4. Selective repeat
B FEC
C H-ARQ
• Receiver
– Separates incoming frame into data bits and check bits
– Calculates check bits from received data bits
– Compares calculated check bits against received check
bits
– Detected error occurs if mismatch
FEC
• Transmitter
– Forward error correction (FEC) encoder maps
each k-bit block into an n-bit block codeword.
– Codeword is transmitted.
• Receiver
– Incoming signal is demodulated
– Block passed through an FEC decoder
FEC
FEC
• No errors present
– Codeword produced by decoder matches original
codeword.
B FEC
C H-ARQ
– H-ARQ= FEC+ARQ
B FEC
C H-ARQ
• More details:
3 H-ARQ :
• A Downlink Scheduling
• B Uplink Scheduling
III Downlink/Uplink Scheduling
Plan
• A Downlink Scheduling
• B Uplink Scheduling
A Downlink Scheduling
Plan
3. RR
4. WRR
5. VT
6. WFQ
7. WFFQ
8. DRR
9. DDRR
A Downlink Scheduling
Plan
• RR
• WRR
• VT
• WFQ
• WFFQ
• DRR
• DDRR
•
RR
• Round-Robin algorithm equitably distributes
the load between each waiter whatever the
current number of connections or the response
times
Counter
1 1 1 Reset
VCC 1 (Source 1)
Cycle
2 2 12 31 231 231 23 ….
VCC 2 (Source 2)
WRR
3 3 3 3 3
VCC 3 (Source 3) scheduler
RR
Plan
• RR
• WRR
• VT
• WFQ
• WFFQ
• DRR
• DDRR
WRR
• The WRR algorithm is based on the Round Robin
algorithm but it takes into account the processing
capacity of each waiter.
3 3 1 3 2 1 3 3 1 3 2 1
VCC 2 (Source 2) 2 2 1 ….
3 WRR
3 3 3 3 3
VCC 3 (Source 3) scheduler
Coefficients of performance
WRR
• A sequence of scheduling is generated automatically
according to this value.
• The requests are then assigned to the various
waiters according to a sequence of alternate
repetition
Counter
Reset
1 1 1
VCC 1 (Source 1) Cycle
2
3 3 1 3 2 1 3 3 1 3 2 1
VCC 2 (Source 2) 2 2 1 …….
Sequence of scheduling
3 WRR
3 3 3 3 3
VCC 3 (Source 3) scheduler
A Downlink Scheduling
Plan
• RR
• WRR
• VT
• WFQ
• WFFQ
• DRR
• DDRR
VT
VT
• VT : aims to emulate the TDM (Time Division
Multiplexing)
Connection 1
Average inter-arrival : 2 units
Connection 2
Average inter-arrival : 5 units
Connection 3
Average inter-arrival : 5 units
First-Come-First-Served
service order
Virtual times
Plan
• RR
• WRR
• VT
• WFQ
• WFFQ
• DRR
• DDRR
WFQ
flow 1
flow n
Buffer
management
WFQ
WFQ
Packet queues
w1
w2
R
wn WRR algorithm
w1
water pipes
w2
w3
water buckets
t2
t1
w1 w2 w3
WFQ
• If flows can be served one bit at a time
Plan
• RR
• WRR
• VT
• WFQ
• WFFQ
• DRR
• DDRR
WFFQ
Connection 1
Connection 2
…… …………
Connection 11
Plan
• RR
• WRR
• VT
• WFQ
• WFFQ
• DRR
• DDRR
DRR
Plan
• RR
• WRR
• VT
• WFQ
• WFFQ
• DRR
• DDRR
DDRR
• Each connection is assigned a state variable
called the DC (Deficit Counter)
Qi DCi
3500 initializing
3500 (1st round)
2800 7800 2000
-2000 Serviced
2800 7800 2000 1500 (2nd round)
+3500 -7800 Serviced
-6300 (3 round)
rd
2800 7800 2000
+3500 Not serviced
• A Downlink Scheduling
• B Uplink Scheduling
B Uplink Scheduling
Uplink scheduling:
– Responsible for the efficient and fair
allocation of the resources (time slots) in
the uplink direction
– Uplink carrier :
• Reserved slots
• contention slots (random access slots)