1. Congestion Management
1.1. FiFo
1.2. Priority Queuing
1.2.1. Guarantees strict service of a queue (servicing this queue in priority, regardless of the number of packets in the other queues), which is good for the prioritized queue but may starve the other queues.
1.3. Custom Queuing
1.3.1. Custom queuing (CQ) allocates a percentage of the bandwidth to each queue, ensuring good load balancing to each queue, but no real prioritization
1.4. Class-Based Weighted Fair Queuing
1.4.1. Sends in priority smaller packets (low-bandwidth consumption) and packets with a higher ToS value, using an automatic classification algorithm. Allows you to define classes and the amount of bandwidth each should get
1.5. Low Latency Queuing
1.5.1. Commonly used for VoIP, is a variation from CBWFQ where one queue is serviced in priority (in a PQ logic), but only up to a certain amount of bandwidth (so as not to starve the other queues)
2. Congestion Avoidance
2.1. CAC
2.1.1. Allows only a certain number of concurrent calls, avoiding oversubscription of the queue allocated for this traffic. CAC is usually implemented on the platform managing the calls.
2.2. WRED
2.2.1. Drops additional TCP packets as the link becomes more congested (before link saturation), recognizing that TCP windowing will resend the lost packets and reduce the TCP window (thus slowing down the flow). This mechanism avoids link oversubscription, but is adapted only for TCP
2.3. Policing
2.3.1. Drops or Marks Packets when they reach predefined limits.
2.3.1.1. Used on input & output interface
2.4. Sahpping
2.4.1. Buffer Packets, Later if the bandwidth gets lower, these buffered packets can be sent.
2.5. Header Compression
2.5.1. Enables you to drop packet header size from 40 bytes (Layer 4 to Layer 2) to 2 bytes or 4 bytes, by simply indexing each packet. This technique works only on point-to-point links.
3. Distributed Coordinated Function
3.1. Sending a Frame
3.1.1. The DCF coordination is distributed which allows each device to take care of itself. When a device needs to send a data frame, it starts picking a random number. It will then count down from that number.
3.1.1.1. While counting down the station listen the media. Every time it detects a signal, it stops the countdown. The total amount of time waited is: back off time + Time waited during the transmission = Contention Windows
3.1.2. Two ways of determining if the media is free
3.1.2.1. Logical based on Nav
3.1.2.2. Physical through Clear Channel Assessment
3.2. Interframe Spaces
3.2.1. 802.11b
3.2.1.1. SIF = 10
3.2.1.1.1. Slot Time = 20
3.2.2. 802.11g
3.2.2.1. SIF = 10
3.2.2.1.1. Slot Time = 9
3.2.3. 802.11a
3.2.3.1. SIF = 16
3.2.3.1.1. Slot Time = 9
3.3. After a Frame is Sent
3.3.1. Wireless network rely on a system of acknowledgment confirming that the frame was received.
3.3.1.1. The receiving station sends its acknowledge after a short amount of time called SIF
3.3.1.1.1. When a station sends, it actually reserves the medium for: The duration of its frame + SIF + The duration of the expected ACK
4. Point Coordination Function
4.1. The AP Usually take the Control sending a beacon with the duration field set to 32768.
4.1.1. During the CFP the AP Polls the stations, asking each of them to send. If the polled stations don't have any packet to send the AP can release the cell sending another special beacon with duration field set to 0.
5. 802.11E
5.1. Access Category
5.1.1. AC_VO
5.1.1.1. Network Control (NC)
5.1.1.1.1. 7
5.1.1.2. Voice (VO)
5.1.1.2.1. 6
5.1.2. A_VI
5.1.2.1. Video (VI)
5.1.2.1.1. 5
5.1.2.2. Controller Load (CL)
5.1.2.2.1. 4
5.1.3. AC_BE
5.1.3.1. Excellent Effort (EE)
5.1.3.1.1. 3
5.1.3.2. Best Effort (BE)
5.1.3.2.1. 0
5.1.4. AC_BK
5.1.4.1. Background (BK)
5.2. HCCA
5.2.1. A random access protocol allows fast collision resolution
5.2.1.1. The AP requieres information that hats be update but he stations, information like:
5.2.1.1.1. Identity of stations that need to be polled.
5.2.1.1.2. At which times.
5.2.1.1.3. For Which Duration.
5.2.2. Close to PCF
6. 802.11e Designation
7. 802.11P Priority
8. WMM
8.1. Is a Partial implementation Of 802.11e & Ensure the compatibility between vendors.
8.2. WMM EDCA Queues
8.2.1. When a station needs to send it starts classifying the packet into one of four Categories. (Queues)
8.2.2. Then a backoff timer is picked up, it will depend on Traffic Categories, instead of being the Default aCWIn
8.2.3. All stations run their back off timer in Parallel. If two or more stations reach zero at the same time an internal scheduler avoids the virtual collision by giving priority to the queue with higher QoS.
8.3. WMM Interframe Space
8.3.1. In DCF, after a back off timer reaches 0, the station listens the media,and, if the media is free Waits a DIF before sending.
8.3.1.1. In EDCA, the station waits what is called Arbitrated Interframe Space (AIFS)
8.3.1.1.1. AIFS can be Fixed or Variable, its variation can depend upon TC.
8.4. TXOP
8.4.1. Enables a station to transmit multiple frames consecutively within a burst after it gains the channel.
8.5. QBSS Information Element
8.5.1. Helps clients to decide which AP to Associate or Roam to.
8.5.1.1. How
8.5.1.1.1. Chenking Station Count.
8.5.1.1.2. Checking Channel Utilization.
8.5.1.1.3. Chenking Available Admission Capacity.
8.5.2. No real Interaction between client an AP.
8.6. Traffic Specification
8.6.1. Allows a WMM station to signal its traffic requirements toe the AP.
8.6.1.1. TSpec in include in ADDTS Action Frame
8.6.1.2. TSpec include in Association & Re-associated messages.
8.7. Power Save Features
8.7.1. PS-POLL
8.7.1.1. With standard 802.11, a station saves battery power by sending a null (empty) frame to the AP with the Power Management bit in the header set to 1. The AP then buffers subsequent traffic for that station. The station wakes up at regular intervals to listen to the AP beacon, which contains a field called the Traffic Indication Map (TIM), indicating the list of stations for which some traffic is buffered. Some beacons also contain a Delivery Traffic Indication Message (DTIM), indicating that the AP has broadcast or multicast traffic that is going to be sent just after the beacon
8.7.1.1.1. If the station sees its number in the TIM, it sends a special frame (PS-Poll) to the AP to ask for the first buffered packet. The AP contends for medium access and sends the frame, indicating with the More Data bit in the frame header if more packets are buffered. The process is repeated until the More Data bit is set to 0, showing that no more traffic is buffered. This process consumes a lot of frames
8.7.2. Scheduled APSD (S-APSD)
8.7.2.1. The station and the AP negotiate a wakeup time
8.7.2.1.1. The AP recognizes when the station is going to wake up, and simply sends the buffered traffic in due time
8.7.3. Unscheduled APSD (U-APSD)
8.7.3.1. The station can inform the AP about its awaken state at any time, with any frame where the Power Management bit is set to 0
8.7.3.1.1. The AP then empties its buffer in a burst
8.8. Blocks Acknowledgment
8.8.1. The BA Mechanism aggregates several acknowledgments into one Frame.
8.8.1.1. To send several frames,a station first check the TXOP to determine how many frames it can send within the TXOP, It then send an Add Block Acknowledgments
8.8.1.1.1. After the Block is sent the emitter sends a last frame that contains a BA Request. The receiving station then just need to send an acknowledgment frame to validate the entire Block.
9. Typical traffic Classes
9.1. Voice
9.2. Mission Critical
9.3. Transactional
9.4. Best Effort
9.5. Scaveger
10. Classification & Marking
10.1. Layer 2
10.1.1. Class Of Service (CoS)
10.1.1.1. Uses only 3 Bits
10.1.1.1.1. Only Present in Trunk Links
10.2. Layer 3
10.2.1. IP Precedence
10.2.1.1. Uses only 3 Bits
10.2.1.1.1. Present in Access Links
10.2.2. DSCP
10.2.2.1. Uses 6 Bits
10.2.2.1.1. The First 3 Create Classes
10.2.2.1.2. The Second Used for Drop Probability
10.2.2.1.3. Th last one would be 0
10.2.2.2. Present in Access Links