1 / 63

Bandwidth Management Architecture in IEEE 802.16 WiMAX

This study explores the bandwidth management architecture in IEEE 802.16 WiMAX, including call admission control, bandwidth borrowing, and two-stage bandwidth allocation. It also proposes a mandatory packet scheduling algorithm and evaluates its performance.

bmanley
Download Presentation

Bandwidth Management Architecture in IEEE 802.16 WiMAX

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IEEE 802.16 WiMAX中頻寬資源管理架構之研究A Study of the Bandwidth Management Architecture over IEEE 802.16 WiMAX Student : Sih-Han Chen Advisor : Ho-Ting Wu Date : 2008.5.6

  2. Outline • Introduction of IEEE802.16 and QoS • Proposed QoS System Architecture • Pairing Call Admission Control • Bandwidth Borrowing on CAC level • Two Stage Bandwidth Allocation • Mandatory Packet Scheduling Algorithm • Performance Evaluation • Conclusion and Future Work

  3. Worldwide Interoperability for Microwave Access(WiMAX) Bandwidth IEEE 802.15 IEEE 802.11 IEEE 802.16 3GPP 1 Gbps 802.15.3 High Speed Wireless PAN Wi-Fi 802.11n 100 Mbps WiMAX 802.16 (802.16-2004 & 802.16e) Wi-Fi 802.11a/b/g 10 Mbps 4G 3G 2.5G 1 Mbps 802.15.1 Bluetooth <1m 10m 100m Up to 50Km Up to 80Km PAN LAN MAN WAN PAN: Personal area networks MAN: Metropolitan area networks LAN: Local area networks Wide area networks

  4. IEEE 802.16 Operation Mode

  5. Defines multiple-access mechanism Functions ： connection establishment connection maintenance Call admission control bandwidth request bandwidth allocation Packet shceduling MAC Common Part Sublayer MAC Common Part Sublayer (MPC)

  6. IEEE 802.16 TDD frame structure

  7. DL-MAP and UL-MAP

  8. Media Acces Control (MAC) • Connection orienteded • Service Flow(SF) • Connection ID (CID) • Channel access: • UL-MAP • Defines uplink channel access • Defines uplink data burst profiles • DL-MAP • Defines downlink data burst profiles • UL-MAP and DL-MAP are both transmitted in the beginning of each downlink subframe (FDD and TDD).

  9. Bandwidth Request • SSs may request bandwidth in 3 ways: • Contention-based bandwidth requests (Broadcast Polling or Multicast Group Pollng) • Contention-free bandwidth requests (Unicast Polling) • Piggyback a BW request message on a data packet

  10. BS grants/allocates bandwidth in one of two modes Grant Per Subscriber Station (GPSS) Grant Per Connection (GPC) Decision based on requestedBW, QoS parameters and available resources Grants are realized through the UL-MAP Bandwidth Allocation

  11. Service Classes

  12. Service Flow • The central concept of the MAC protocol • A service flow is a unidirectional flow of packets that is provided a particular QoS. • SS and BS provide this QoS according to the QoS parameter set. • Existing in both uplink and downlink and may exist without being activated. • Must have a 32bit SFID, besides admitted and active status also have a 16-bit CID

  13. Attributes of a Service Flow Relationship of QoS Parameter Set • Service Flow ID • CID • ProvisionedQoSParamSet • AdmittedQoSParamSet • ActiveQoSParamSet • Authorization Module ProvisionedQoSParamSet (SFID) AdmittedQoSParamSet (SFID & CID) ActiveQoSParamSet (SFID & CID)

  14. Dynamic Service Management • Dynamic Service Add (DSA) • Add a service flow • Dynamic Service Change (DSC) • Change an existing service flow • Dynamic Service Delete (DSD) • Delete a service flow

  15. Dynamic Service Establishment

  16. Outline • Introduction of IEEE802.16 QoS • Proposed QoS System Architecture • Pairing Call Admission Control • Bandwidth Borrowing on CAC level • Two Stage Bandwidth Allocation • Mandatory Packet Scheduling Algorithm • Performance Evaluation • Conclusion and Future Work

  17. Proposed QoS Architecture BS SS Pair Call Admission Control Bandwidth Borrowing Agent Two Stage Bandwidth Allocation Downlink Packet Scheduler Connection Request Applications Core Network Connection Response Uplink Data Traffic Downlink Data Traffic Two Stage Bandwidth Allocation Down Stream (DL/UL MAP) Uplink Packet Scheduler Up Stream (Bandwidth Request)

  18. Outline • Introduction of IEEE802.16 QoS • Proposed QoS System Architecture • Pairing Call Admission Control • Bandwidth Borrowing on CAC level • Two Stage Bandwidth Allocation • Mandatory Packet Scheduling Algorithm • Performance Evaluation • Conclusion and Future Work

  19. Pairing Call Admission Control

  20. Pairing Call Admission Control Each Pair Connection Request Bavailable >= Y Y Is UGS? Is nrtPS? Is rtPS? Is BE? Reject Call Accept Pair Call N Y N Enable Bandwidth Borrowing ? N Y Y Go Bandwidth Borrowing Agent N N Y

  21. Outline • Introduction of IEEE802.16 QoS • Proposed QoS System Architecture • Pairing Call Admission Control • Bandwidth Borrowing on CAC level • Two Stage Bandwidth Allocation • Mandatory Packet Scheduling Algorithm • Performance Evaluation • Conclusion and Future Work

  22. Pair Connection Request from CAC Module Bandwidth Borrowing Flow Chart Success Fail Y Reject Borrow from existing nrtPS Cons Borrow from existing BE Cons Borrow from existing rtPS Cons Borrow from existing BE Cons Borrow from existing nrtPS Cons Borrow from existing BE Cons Is UGS? Is rtPS? Is nrtPS? Is BE? N Success Success Success Fail Fail Fail Y Accept Accept N Reject Reject Success Success Fail Fail Y N Y Reject

  23. Bandwidth Borrowing on CAC Level

  24. Range of Bandwidth Reservation Rsv-nrtPS Rsv-rtPS Rsv-UGS Rsv-BE (Average+Min) /2 (Peak+Average) /2 Min/2 Average Rate Peak Rate 0 Min Rate Rsv-nrtPS Low Bound Rsv-BE Low Bound Rsv-rtPS Low Bound

  25. Operation of Bandwidth Borrowing • Amount of bandwidth are needed to be borrowed from system • In system, the bandwidth can be borrowed from rtPS, nrtPS and BE individually

  26. Operation of Bandwidth Borrowing • If , the bandwidth borrowing from each exiting BE connection： • Else, try to borrow bandwidth from nrtPS.

  27. Operation of Bandwidth Borrowing • If , the bandwidth borrowing from each exiting nrtPS connecion, after borrow from all ： • Else, try to borrow bandwidth from rtPS.

  28. Operation of Bandwidth Borrowing • If ,the bandwidth borrowing from each exiting rtPS connecion, after borrow from all and and ： • Else, Bandwidth Borrowing Fail ! Reject the connection request.

  29. Outline • Introduction of IEEE802.16 QoS • Proposed QoS System Architecture • Pairing Call Admission Control • Bandwidth Borrowing on CAC level • Two Stage Bandwidth Allocation • Mandatory Packet Scheduling Algorithm • Performance Evaluation • Conclusion and Future Work

  30. Two Stage Bandwidth Allocation • Stage One： • Give the guarantee reserved bandwidth at most. • Obtain fairness, guarantee each connection shares the bandwidth • Stage Two ： • Allocate the remaining bandwidth. • Partial fairness. Use weighting ( i.e. rtPS:nrtPS:BE = 2:1:1 ) to share the bandwidth.

  31. Two Stage Bandwidth Allocation

  32. Outline • Introduction of IEEE802.16 QoS • Proposed QoS System Architecture • Pairing Call Admission Control • Bandwidth Borrowing on CAC level • Two Stage Bandwidth Allocation • Mandatory Packet Scheduling Algorithm • Performance Evaluatioin • Conclusion and Future Work

  33. Mandatory Packet Scheduling Algorithm

  34. Outline • Introduction of IEEE802.16 QoS • Proposed QoS System Architecture • Pairing Call Admission Control • Bandwidth Borrowing on CAC level • Two Stage Bandwidth Allocation • Mandatory Packet Scheduling Algorithm • Performance Evaluation • Conclusion and Future Work

  35. Traffic Generation and Simulation Environment

  36. System Model of Simulation Experiment Note : We assume that only SS can send the connection request to BS actively

  37. Traffic Generation and Simulation Environment

  38. Traffic Generation and Simulation Environment

  39. Performance Metric • Call Blocking Probability : • Packet Drop Rate : • Packet Delay :

  40. NonPairing CAC vs Pairing CAC

  41. Definition of Pairing CAC • Accepted : • Reject :

  42. Definition of NonPairing CAC Accept Call • Round Trip Time of Downlink Connection Request (RTT)

  43. Definition of NonPairing CAC Reject Call

  44. Definition of NonPairing CAC • Default RTT of DL connection request ： 0.5 seconds • Accepted : • First Type of Connection Fail : • Second Type of Connection Fail :

  45. Call Blocking ProbabilityNonPairing CAC vs Pairing CAC RTT = 0.5s

  46. Call Blocking Probability- Pair vs NonPair (RTT=0.5) UGS rtPS nrtPS BE

  47. Accept Calls - Pairing vs NonPairing (RTT= 5s, 10s) UGS rtPS BE nrtPS

  48. In Pairing CAC ModeNon Bandwidth Borrowing (NonBB)vsBandwidth Borrowing (BB)

  49. Bandwidth Borrowing Scheme

  50. Call Blocking ProbabilityNonBB vs BB NonBB mode BB mode

More Related