Architectures and Algorithms for Future Wireless Local Area Networks  1 Chapter Architectures and Algorithms for Future Wireless Local Area Networks Architectures and Algorithms for Future Wireless Local Area Networks PhD Defense Peter Dely

Architectures and Algorithms for Future Wireless Local Area Networks  2 Chapter High speeds require small distances 2 Mbit/s 7000 Mbit/s 2 Carrier: 2.4 GHz Modulation: BPSK Channel: 20 MHz Carrier: 2.4 GHz Modulation: BPSK Channel: 20 MHz Carrier: 60 GHz Modulation: QAM256 Channel: 1800 MHz Carrier: 60 GHz Modulation: QAM256 Channel: 1800 MHz

Architectures and Algorithms for Future Wireless Local Area Networks  3 Chapter AP selection with small WLAN “cells” Case 1: AP selection for mobility management 2

Architectures and Algorithms for Future Wireless Local Area Networks  4 Chapter AP selection with small WLAN “cells” Case 2: AP selection for load balancing 2

Architectures and Algorithms for Future Wireless Local Area Networks  5 Chapter Research questions 1.Which AP should a station select at a given time? 2.How to design and implement an architecture that enables fair resource distribution and mobility management? 3.How to estimate the quality of an AP?

Architectures and Algorithms for Future Wireless Local Area Networks  6 Chapter Greedy is not always best Handover 6 Mbit/s 54 Mbit/s Given a certain “cost” for a handover, when is it beneficial to perform that handover? 4

Architectures and Algorithms for Future Wireless Local Area Networks  7 Chapter Dynamic model finds best AP for the known future Mixed Integer Linear Program Solver 1. Which station uses which AP at what point in time 2. Which rate it can use for downloading Compute Describe system state Describe system characteristics Important constraints 1. Capacity of the wireless channel 2. Data transfer only after a station has been connected to an AP for a certain time Important parameters 1. Cost of a handover 2. Link rates between APs and stations 3. Interference Maximize minimum average throughput Objective 4

Architectures and Algorithms for Future Wireless Local Area Networks  8 Chapter Evaluation scenario  Comparison of –Greedy –Hysteresis –k-Handover  Mobile stations “walk” on the corridors  Random waypoint with fixed waypoints  Comparison metric: –Normalized throughput –Relative to optimal solution with dynamic model –1 = Optimum 4

Architectures and Algorithms for Future Wireless Local Area Networks  9 Chapter Mobility and handover costs reduce performance Impact of mobilityImpact of handover cost More mobility = Less performance Higher handover costs ~ Less performance 4

Architectures and Algorithms for Future Wireless Local Area Networks  10 Chapter Internet AP selection in wireless mesh networks 5

Architectures and Algorithms for Future Wireless Local Area Networks  11 Chapter Max-min fair rate allocations and single path routing cannot be found through a simple MILP Solution algorithm 1. Which traffic is sent via which route 2. Rates between the stations and the Internet 3. Which station uses which AP Compute Describe system state Describe system characteristics Important constraints 1. As in the pure AP scenario 2. Flow conservation constraints 3. Single-path routing constraints Important parameters 1. Network graph 2. Interference set 3. Association opportunities Max-min fair rate allocation Objective Mixed Integer Linear Program Solver Solve partial problem Reformulate Model 5 Max-min fair optimization is multi-objective optimization Standard algorithms are very slow  Design of heuristic MESHMAX-FAST(*)

Architectures and Algorithms for Future Wireless Local Area Networks  12 Chapter MESHMAX-FAST* is better than a straight forward linear relaxation In 50% of cases, the performance is greater than 95% of the optimum 5 Better

Architectures and Algorithms for Future Wireless Local Area Networks  13 Chapter MESHMAX-FAST is suitable for online optimization 5 Optimal solution: > 1000 seconds Optimal solution: > 1000 seconds MESHMAX-FAST*: < 10 seconds with comparable results MESHMAX-FAST*: < 10 seconds with comparable results

Architectures and Algorithms for Future Wireless Local Area Networks  14 Chapter Research questions 1.Which AP should a station select at a given time? 2.How to design and implement an architecture that enables fair resource distribution and mobility management? 3.How to estimate the quality of an AP? 67

Architectures and Algorithms for Future Wireless Local Area Networks  15 Chapter Internet A software defined mesh network OpenFlow Control Server Monitoring and Control Server  Build network graph  Run MESHMAX-FAST  Trigger actions at the OpenFlow control server  Build network graph  Run MESHMAX-FAST  Trigger actions at the OpenFlow control server  Configure routes  Configure rate shapers  Trigger handovers  Configure routes  Configure rate shapers  Trigger handovers  Programmable forwarding unit (OpenFlow)  Legacy routing protocol in a virtual network  Programmable forwarding unit (OpenFlow)  Legacy routing protocol in a virtual network 6

Architectures and Algorithms for Future Wireless Local Area Networks  16 Chapter MESHMAX performance in real networks Testbed setup  IEEE a links, fixed PHY  Download from “Internet”  Gateways are connected via “DSL” Results with 6 Mbit/s GW links  SNR = Use AP with best signal  Hop-count = Use AP closest to GW  MESHMAX = Use optimal AP

Architectures and Algorithms for Future Wireless Local Area Networks  17 Chapter Internet CloudMAC distributes MAC processing OpenFlow Controller Policy Application Virtual AP Virtual WLAN NIC Virtual AP Virtual WLAN NIC Virtual AP Virtual WLAN NIC Program switch 7

Architectures and Algorithms for Future Wireless Local Area Networks  18 Chapter Internet CloudMAC enables simple handovers OpenFlow Controller Policy Application Virtual AP Virtual WLAN NIC Virtual AP Virtual WLAN NIC Virtual AP Virtual WLAN NIC Program switch Change flow table 7

Architectures and Algorithms for Future Wireless Local Area Networks  19 Chapter CloudMAC reduces data loss during handovers Median reduction in packet loss from approx to 3.5  Standard IEEE : scan and re-association  CloudMAC: Association state in Virtual AP  no reassociation 7

Architectures and Algorithms for Future Wireless Local Area Networks  20 Chapter Research questions 1.Which AP should a station select at a given time? 2.How to design and implement an architecture that enables fair resource distribution and mobility management? 3.How to estimate the quality of an AP? 98

Architectures and Algorithms for Future Wireless Local Area Networks  21 Chapter Finding the AP with the best link is hard 8 Interference Cross traffic

Architectures and Algorithms for Future Wireless Local Area Networks  22 Chapter RSSI is not a good indicator for throughput 100% loss 0% loss 8

Architectures and Algorithms for Future Wireless Local Area Networks  23 Chapter BEST-AP uses regular traffic for performance estimation BEST-AP Server Internet BW Estimation Handover BW Estimation 8

Architectures and Algorithms for Future Wireless Local Area Networks  24 Chapter Dynamic AP selection with stationary users 8 Testbed setup  Two APs  Interference according to real traces Interference Results

Architectures and Algorithms for Future Wireless Local Area Networks  25 Chapter Time Buffer Level Quality for current AP starts to decrease Connection completely breaks Video playout freezes Scan for new APs Connect to new AP Video playout resumes Evaluation with mobile users 9 Video freeze duration

Architectures and Algorithms for Future Wireless Local Area Networks  26 Chapter BEST-AP reduces video freezes Testbed setup 9 Results  BEST-AP has fewer and shorter freezes than Linux  A dedicated scan card is not necessary

Architectures and Algorithms for Future Wireless Local Area Networks  27 Chapter Summary of contributions 1.Theoretical study of AP selection problem –Considering handover costs –Wireless mesh backhauls 2.Architecture proposals and their implementation –For the centralized management of wireless mesh networks –For distributing MAC layer processing 3.Quality estimation of APs –Bandwidth estimation method –Improved video streaming 10

Architectures and Algorithms for Future Wireless Local Area Networks  28 Chapter Future directions  Use other modeling frameworks –Convex optimization –Robust optimization  Unify architectures –Use CloudMAC in mesh networks –Integrate bandwidth estimation in system  Comprehensive tests in large networks –More realistic traffic loads –Scalability tests 10

Architectures and Algorithms for Future Wireless Local Area Networks  29 Chapter Thank you! Watch this talk on youtube.com/kaumesh

Architectures and Algorithms for Future Wireless Local Area Networks  30 Chapter Backup slides

Architectures and Algorithms for Future Wireless Local Area Networks  31 Chapter … but this comes at a cost  From 2.4 GHz to 60 GHz  Higher path loss  Higher attenuation by walls etc.  From BSPK to QAM256  More constellations  More susceptible to noise  From 20 MHz to 160 MHz channels  Less spatial reuse  Higher energy use 2.4 GHz 60 GHz BSPKQAM To achieve high speeds short distances between the AP and the stations are necessary. 2

Architectures and Algorithms for Future Wireless Local Area Networks  32 Chapter  Main idea: use predictions of the future for optimization  Optimize each time slot using the estimate of the future Using predictions to improve performance More estimation errors 4

Architectures and Algorithms for Future Wireless Local Area Networks  33 Chapter MESHMAX-FAST improves performance 5

Architectures and Algorithms for Future Wireless Local Area Networks  34 Chapter Key ideas of MESHMAX-FAST  Observation: APs are traffic aggregation points for many stations  Algorithm sketch: 1.Compute a multi-path solution between the APs and the stations 2.Assign stations to APs according to the capacity of the APs 3.Re-compute the multi-path solution and give priority to APs with many stations 4.Move stations to other APs if it increases the minimum rate 5.Repeat steps 3-4 until the minimum rate cannot be increased anymore 6.Finally, find a single-path for each station 5