Fat Virtual Access Points Taken from Srikanth Kandula.

Slides:



Advertisements
Similar presentations
Architecture and Algorithms for an IEEE 802
Advertisements

Fat Virtual Access Points
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
MultiNet: Connecting to Multiple IEEE Networks Using a Single Radio Ranveer Chandra, Cornell University joint work with: Victor Bahl (MSR) and Pradeep.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Transport Layer3-1 TCP AIMD multiplicative decrease: cut CongWin in half after loss event additive increase: increase CongWin by 1 MSS every RTT in the.
WiFox: Scaling WiFi Performance for Large Audience Environments Arpit Gupta, Jeongki Min and Injong Rhee NC State University.
IEEE JSAC Special Issue Adaptive Media Streaming Submissions by April 1 Details at
1 1 July 28, Goal of this session is to have a discussion about observations paper authors have made regarding the deployment status and constraints.
CMAP: Harnessing Exposed Terminals in Wireless Networks Mythili Vutukuru Joint work with Kyle Jamieson and Hari Balakrishnan.
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Stony Brook Mesh Router: Architecting a Multi-Radio Multihop Wireless LAN Samir R. Das (Joint work with Vishnu Navda, Mahesh Marina and Anand Kashyap)
Wi-Fi Neighborcast: Enabling communication among nearby clients
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4690: Experimental Networking Informal Quiz: TCP Shiv Kalyanaraman:
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
Ashish Gupta, Marcia Zangrilli, Ananth I. Sundararaj, Peter A. Dinda, Bruce B. Lowekamp EECS, Northwestern University Computer Science, College of William.
Leveraging Multiple Network Interfaces for Improved TCP Throughput Sridhar Machiraju SAHARA Retreat, June 10-12, 2002.
A Switch-Based Approach to Starvation in Data Centers Alex Shpiner Joint work with Isaac Keslassy Faculty of Electrical Engineering Faculty of Electrical.
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
Reduced TCP Window Size for VoIP in Legacy LAN Environments Nikolaus Färber, Bernd Girod, Balaji Prabhakar.
Cabernet: Vehicular Content Delivery Using WiFi Jakob Eriksson, Hari Balakrishnan, Samuel Madden MIT CSAIL MOBICOM '08 Network Reading Group, NRL, UCLA.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Identifying High Throughput Paths in Mesh Networks : A Model-based Approach Theodoros Salonidis (Thomson) Michele Garetto (University of Torino)
Bandwidth Estimation: Metrics Mesurement Techniques and Tools By Ravi Prasad, Constantinos Dovrolis, Margaret Murray and Kc Claffy IEEE Network, Nov/Dec.
All rights reserved © 2006, Alcatel Accelerating TCP Traffic on Broadband Access Networks  Ing-Jyh Tsang 
A measurement study of vehicular internet access using in situ Wi-Fi networks Vladimir Bychkovsky, Bret Hull, Allen Miu, Hari Balakrishnan, and Samuel.
WiFiProfiler: Cooperative Diagnosis in Wireless LANs Ranveer Chandra, Venkat Padmanabhan, Ming Zhang Microsoft Research.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
INFOCOM A Receiver-Driven Bandwidth Sharing System (BWSS) for TCP Puneet Mehra, Avideh Zakhor UC Berkeley, USA Christophe De Vleeschouwer Université.
Dynamic channel allocation in wireless ad-hoc networks Anup Tapadia Liang Chen Shaan Mahbubani.
Design and Implementation of a Multi-Channel Multi-Interface Network Chandrakanth Chereddi Pradeep Kyasanur Nitin H. Vaidya University of Illinois at Urbana-Champaign.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!
Link Scheduling & Queuing COS 461: Computer Networks
Presented by Rajan Includes slides presented by Andrew Sprouse, Northeastern University CISC 856 TCP/IP and Upper Layer Protocols Date:May 03, 2011.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Opportunistic Use of Client Repeaters to Improve Performance of WLANs Victor Bahl 1, Ranveer Chandra 1, Patrick P. C. Lee 2, Vishal Misra 2, Jitendra Padhye.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Architectures and Algorithms for Future Wireless Local Area Networks  1 Chapter Architectures and Algorithms for Future Wireless Local Area.
CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.
1/26 Module C - Part 2 DOMINO Detection Of greedy behavior in MAC layer of IEEE public NetwOrks Prof. JP Hubaux Mobile Networks
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
BNL PDN Enhancements. Perimeter Load Balancers Scaleable Performance Fault Tolerance Server Maintainability User Convenience Perimeter Security.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Adaptive Inverse Multiplexing for Wide-Area Wireless Networks Alex C. Snoeren MIT Laboratory for Computer Science IEEE Globecom ’99 Rio de Janeiro, December.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Performance Limitations of ADSL Users: A Case Study Matti Siekkinen, University of Oslo Denis Collange, France Télécom R&D Guillaume Urvoy-Keller, Ernst.
TCP Traffic Characteristics—Deep buffer Switch
A Comparison of RaDiO and CoDiO over IEEE WLANs May 25 th Jeonghun Noh Deepesh Jain A Comparison of RaDiO and CoDiO over IEEE WLANs.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP Congestion Control.
Studies of LHCb Trigger Readout Network Design Karol Hennessy University College Dublin Karol Hennessy University College Dublin.
1 Three ways to (ab)use Multipath Congestion Control Costin Raiciu University Politehnica of Bucharest.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Revisiting Transport Congestion Control Jian He UT Austin 1.
Bandwidth estimation: metrics, measurement techniques, and tools Presenter: Yuhang Wang.
Architecture and Algorithms for an IEEE 802
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya Modified and Presented.
Improving Datacenter Performance and Robustness with Multipath TCP
Jiyong Park Seoul National University, Korea
TCP Congestion Control
Performance of VoIP in a b wireless mesh network
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Review of Internet Protocols Transport Layer
Presentation transcript:

Fat Virtual Access Points Taken from Srikanth Kandula

Connect to the AP with the highest RSSI State-of-the-art (802.11):

Wireless Link ~ 54Mbps (Theoretical Max) AP Uplink ~ 2Mbps (DSL/Cable Modems) Can Aggregate Bandwidth from nearby APs! Problem 1: In Homes, Hotspots… … Uplink Bottleneck

Load Imbalance Unnecessary congestion; nearby APs are idle Spread load Individual changes help globally Problem 2: Divide Total Bandwidth Among Users 20Mbps 15Mbps At Work … 4Mbps 7Mbps

Join closest APJoin a Virtual AP, that is the sum of nearby APs State-of-the-art:Abstraction: 1.User can aggregate bandwidth from all APs 2.Compete for total  balance load across APs 1.User can aggregate bandwidth from all APs 2.Compete for total  balance load across APs 2 Problems, 1 Solution

Realize a “fat virtual AP” with only client-side changes

Basic Operation 2Mbps 20Mbps But, what about receive? 2Mbps

Basic Operation Drop Power-Save Q Pretend in power-save, so AP buffers when disconnected (similar to Chandra et. al. VirtualWiFi) Divide Time and Data Across APs to get “Fat Virtual AP” 2Mbps 20Mbps 2Mbps

Realizing a Fat Virtual AP is Hard Sustain TCP flows through each AP –Cannot lose packets yet Switch quickly Which APs to connect to and for how long? –Some APs are more valuable than others How to divide traffic across the APs? FatVAP, an driver design 1.divides time across APs to maximize throughput 2.is transparent to APs and remote ends FatVAP, an driver design 1.divides time across APs to maximize throughput 2.is transparent to APs and remote ends

FatVAP Overview 1.Scan for available APs 2.Compute a schedule to divide time across APs 3.Switch APs as per schedule 4.Spread traffic by pinning flows to APs Channel 1 Channel 6 Channel 36

How much time to spend at an AP? Useful fraction of time Achievable Bandwidths– end-to-end e, wireless w Subsumes Wireless Link Quality, Contention at AP, APs uplink capacity

How to Divide Time Across APs? AP Bandwidth (Mbps)AP1AP2AP3 End-to-end Achievable543 Wireless Achievable588 Usable Fraction100%50%38% Optimal = 7 Mbps Pick APs Greedily, on End-to-end rate 5 Mbps, 100% busy ! more bang for the buck if wireless b/w is large

Pick APs Greedily, on End-to-end rate Pick APs Greedily, on Wireless rate AP Bandwidth (Mbps)AP1AP2AP3AP4AP5AP6 End-to-end Available Wireless Available Usable Fraction20% 100% 5 Mbps, 100% busy ! cost to switch is ≈ 5 ms ! can’t linger too long (100ms period) No Greedy Solution! How to Divide Time Across APs? Only 75% usable

Say, f i is fraction of time at AP i Usefulness Constraint Value (Bandwidth) Cost (Time) Let s be switching time and D be the period (pseudo)-polynomial solution Like Bin Packing, maximize value with bounded cost!

But, How to Estimate Bandwidths? Wireless Achievable Client TX Queue Time from head of tx queue to end of transmission (ack) Naively– send-rate of probe burst, APs report load AP Buffers Idea: Use synchronous acks

But, How to Estimate Bandwidths? Wireless AchievableEnd-to-end Client TX Queue Time from head of tx queue to end of transmission (ack) Naively, send-rate of probe burst or APs report load AP Buffers Idea: Use synchronous acks t Count bytes rcvd in a window

But, How to Estimate Bandwidths? Wireless AchievableEnd-to-end Client TX Queue Time from head of tx queue to end of transmission (ack) Naively, send-rate of probe burst or APs report load AP Buffers Idea: Use synchronous acks t Count bytes rcvd in a window May not receive data always Idea: only count back-to- back large packets!

How to Spread Traffic Across APs?

Put flows through all APs virtualize state an IP for each interface toggle APs (and channels) By default, kernel sends all traffic to one AP T-Mobile /24 MIT /24 Hardware (Wireless Card) State AP1AP2 AP1 StateAP2 State Two Interfaces Toggler

How to Spread Traffic Across APs? Put flows through all APs virtualize state an IP for each interface toggle APs (and channels) By default, kernel sends all traffic to one AP Spread flows to APs Fast header re-writing Hardware (Wireless Card) AP1AP2 AP1 StateAP2 State Two Interfaces Toggler Spreader Distribute load w/o changing APs and applications

FatVAP Realizes a Fat Virtual AP Which APs to connect to and for how long? –Estimate Bandwidths, Solve Optimization How to divide traffic across the APs? –Virtualize, Pin Flows to APs, rewrite headers Switch quickly but without losing packets –In-driver, Private Queues, Isolation And, with only client-side changes

Related Work VirtualWiFi (Microsoft Research) AP Selection (Intel Research, U Michigan) SyncScan (UCSD) MadWifi (open-source) oDivide Time across APs to maximize throughput oSustain TCP flows through multiple APs oTransparently spread traffic across APs

Results

Experimental Setup Compare FatVAP driver with unmodified MadWifi Scenarios –Testbed built from Cisco, NetGear and MadWifi APs –Residential deployments –Commercial hotspots Traffic –Long-lived TCP flows –BitTorrent (Azureus client, Planetlab peers) –Mimic Web Browsing (modified WebStone)

Can FatVAP Aggregate Bandwidth? 6Mbps Throughput (Mb/s) Number of APs Aggregates end-to-end up to the wireless bottleneck ~22 Mbps

Can FatVAP Balance Load? 12Mbps2Mbps C1C2C3C4C5

Can FatVAP Balance Load? 12Mbps2Mbps Throughput (Mb/s) FatVAP Unmodified MadWifi Simplifies Network Deployment! C1C2C3C4C5 C1 C2 C3 C4 C5