Lottery Meets Wireless

Slides:



Advertisements
Similar presentations
IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
Advertisements

Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
SCTP v/s TCP – A Comparison of Transport Protocols for Web Traffic CS740 Project Presentation by N. Gupta, S. Kumar, R. Rajamani.
Chapter 7: Transport Layer
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 25 Multimedia.
Quality of Service Issues in Multi-Service Wireless Internet Links George Xylomenos and George C. Polyzos Department of Informatics Athens University of.
Application, Network and Link Layer Measurements of Streaming Video over a Wireless Campus Network Passive & Active Measurement Workshop 05 Boston, MA,
Media Streaming Performance in a Portable Wireless Classroom Network Presenter: Jean Cao Supervisor: Carey Williamson TRLabs & Dept. of Computer Science.
Diagnosing Wireless TCP Performance Problems: A Case Study Tianbo Kuang, Fang Xiao, and Carey Williamson University of Calgary.
Scheduling CS 215 W Keshav Chpt 9 Problem: given N packet streams contending for the same channel, how to schedule pkt transmissions?
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
1 Solutions to Performance Problems in VOIP over Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi.
1 Traffic Sensitive Quality of Service Controller Masters Thesis Submitted by :Abhishek Kumar Advisors: Prof Mark Claypool Prof Robert Kinicki Reader:
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
WBest: a Bandwidth Estimation Tool for IEEE Wireless Networks Presented by Feng Li Mingzhe Li, Mark Claypool, and.
Reduced TCP Window Size for Legacy LAN QoS Niko Färber July 26, 2000.
Selected Data Rate Packet Loss Channel-error Loss Collision Loss Reduced Packet Probing (RPP) Multirate Adaptation For Multihop Ad Hoc Wireless Networks.
Lecture 1, 1Spring 2003, COM1337/3501Computer Communication Networks Rajmohan Rajaraman COM1337/3501 Textbook: Computer Networks: A Systems Approach, L.
End-to-end resource management in DiffServ Networks –DiffServ focuses on singal domain –Users want end-to-end services –No consensus at this time –Two.
© 2006 Cisco Systems, Inc. All rights reserved. 3.3: Selecting an Appropriate QoS Policy Model.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS.
Managing Client Bandwidth in the Presence of Both Real-Time and non Real-Time Network Traffic Maarten Wijnants Wim Lamotte.
Link Scheduling & Queuing COS 461: Computer Networks
Doc.: IEEE /137r2 Submission June 2000 Tim Godfrey, IntersilSlide 1 TGe Requirements Version r2 8 June 2000.
Pushing the Limits of Wireless Networks Prof. Dina Katabi Jan 9, 2006.
Packet Dispersion in IEEE Wireless Networks Mingzhe Li, Mark Claypool and Bob Kinicki WPI Computer Science Department Worcester, MA 01609
Hybrid OFDMA/CSMA Based Medium Access Control for Next- Generation Wireless LANs Yaser Pourmohammadi Fallah, Salman Khan, Panos Nasiopoulos, Hussein Alnuweiri.
POSTECH DP&NM Lab. Internet Traffic Monitoring and Analysis: Methods and Applications (1) 1.Introduction.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
A Theory of QoS for Wireless I-Hong Hou Vivek Borkar P.R. Kumar University of Illinois, Urbana-Champaign.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
-1- Georgia State UniversitySensorweb Research Laboratory CSC4220/6220 Computer Networks Dr. WenZhan Song Professor, Computer Science.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
BDTS and Its Evaluation on IGTMD link C. Chen, S. Soudan, M. Pasin, B. Chen, D. Divakaran, P. Primet CC-IN2P3, LIP ENS-Lyon
Time-based Fairness Improves Performance in Multi-rate WLANs Godfrey Tan and John Guttag MIT C omputer Science & Artificial Intelligence L aboratory.
iperf a gnu tool for IP networks
Next Generation (NextG) Wireless Networks
Instructor Materials Chapter 6: Quality of Service
University of Maryland College Park
Team: Aaron Sproul Patrick Hamilton
QoS & Queuing Theory CS352.
IEEE e Performance Evaluation
Different Traffic Management Techniques for Mobile Broadband Networks
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Performance Architecture
SCTP v/s TCP – A Comparison of Transport Protocols for Web Traffic
Chapter 2 Introduction Application Requirements VS. Transport Services
Chapter 25 Multimedia TCP/IP Protocol Suite
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Lottery Scheduling Ish Baid.
ECF: an MPTCP Scheduler to Manage Heterogeneous Paths
CSE679: Multimedia and Networking
Computer Network Performance Measures
Provision of Multimedia Services in based Networks
Review: Network link technologies
If You Can’t Beat Them, Augment Them
Performance Issues & Improvement on MAC
ns-2 simulation of TCP + CBR traffic
Computer Network Performance Measures
Congestion Control in SDN-Enabled Networks
“Promoting the Use of End-to-End Congestion Control in the Internet”
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
Subject Name: Adhoc Networks Subject Code: 10CS841
Introduction to Packet Scheduling
Performance of VoIP in a b wireless mesh network
Congestion Control in SDN-Enabled Networks
A Simple QoS Packet Scheduler for Network Routers
Introduction to Packet Scheduling
Wireless MAC Multimedia Extensions Albert Banchs, Witold Pokorski
Presentation transcript:

Lottery Meets Wireless Sharad Saha Shravan Rayanchu Dec 14, 2007

The Problem Flexible, fine-grained bandwidth allocation in enterprise wireless LANs Motivation Wireless bandwidth is a scarce resource Emerging applications require QoS guarantees Voice-over-IP, Streaming Multimedia Dec 14, 2007

Use case Enterprise WLAN Dec 14, 2007

Use case Enterprise WLAN Media contention Dec 14, 2007

Current Practice IEEE 802.11e provides service differentiation Four classes: Data, Voice, Video, Best Effort Not fine grained, (IP, port, protocol), Time Not dynamic, no proportion Dec 14, 2007

Current Practice IEEE 802.11e provides service differentiation Four classes: Data, Voice, Video, Best Effort Limitations Coarse granularity Not fine grained, (IP, port, protocol), Time Not dynamic, no proportion Dec 14, 2007

Current Practice IEEE 802.11e provides service differentiation Four classes: Data, Voice, Video, Best Effort Limitations Coarse granularity Inflexible Not fine grained, (IP, port, protocol), Time Not dynamic, no proportion Dec 14, 2007

Current Practice IEEE 802.11e provides service differentiation Four classes: Data, Voice, Video, Best Effort Limitations Coarse granularity Inflexible No concept of proportions Not fine grained, (IP, port, protocol), Time Not dynamic, no proportion Dec 14, 2007

Current Practice IEEE 802.11e provides service differentiation Four classes: Data, Voice, Video, Best Effort Limitations Coarse granularity Inflexible No concept of proportions Ignorant of traffic characteristics Not fine grained, (IP, port, protocol), Time Not dynamic, no proportion Dec 14, 2007

Our Approach Lottery Scheduling at the Access Point Policy file defines flows (similar to ACLs) and proportions Contending flows participate in lottery with tickets given in proportion Lucky winner gets to send the packet Dec 14, 2007

Does it work ? Fine grained allocation : Flows Flexibility : Dynamic policies Proportions : Tickets Traffic characteristics : Ticket inflation Scalability : Stateless, Simple Dec 14, 2007

Outline Introduction Lottery : Design and Implementation Evaluation Conclusions Dec 14, 2007

Lottery Implementation Define flow:ticket pairs (Port 5001 : 100) (IP 128.105.102.20 : 60) (TCP, Port 80 : 200) On a TX opportunity, draw a lottery and send packet Linux 2.6.17.13 Kernel, Madwifi wireless driver, Proc FS for policy inputs Dec 14, 2007

Transmit Path Dec 14, 2007

Transmit Path Dec 14, 2007

Transmit Path Dec 14, 2007

Transmit Path Currently queuing happens in the firmware Dec 14, 2007

Transmit Path Currently queuing happens in the firmware A callback function is invoked after every packet transmission Dec 14, 2007

Lottery Implementation Dec 14, 2007

Lottery Implementation Dec 14, 2007

Lottery Implementation Dec 14, 2007

Lottery Implementation Dec 14, 2007

Lottery Implementation Dec 14, 2007

Lottery Implementation Generic Framework Lottery Scheduling Stride Scheduling Dec 14, 2007

Ticket Inflation Packet size affects the throughput Flow 1 : Flow 2 = 100 : 100 Flow 1 (100 bytes) , Flow (200 bytes) Effective ratio = 1 : 2 Per-packet Ticket Inflation Actual Ticket = Ticket * (Base Size) / (Pkt Size) Flow 1 = 100 * 200/100 = 200 Flow 2 = 200 * 200/200 = 200 Effective ratio = 1 : 1 Dec 14, 2007

Outline Introduction Lottery : Design and Implementation Evaluation Conclusions Dec 14, 2007

Exp #1 : Does it work ? Setup One AP, One client UDP Flows from AP to client Flow 1 : Flow 2 = 1 : 2 Dec 14, 2007

Exp #1 : Does it work ? OFF Dec 14, 2007

Exp #1 : Does it work ? OFF ON (Desired ratio 2 : 1) Dec 14, 2007

Exp #1 : Does it work ? ON (Desired ratio 2: 1) OFF OFF Dec 14, 2007

Exp #1 : Does it work ? Yes, it works! ON (Desired ratio 2: 1) OFF OFF Dec 14, 2007

Exp #2 : How well does it work ? ON (Desired ratio 2: 1) Dec 14, 2007

Exp #2 : How well does it work ? Received Proportion 2.018 : 1 It works pretty well ! ON (Desired ratio 2: 1) Dec 14, 2007

Exp #3 : Multiple clients Setup One AP, two clients UDP Flows from AP to clients Client 1 : Flow 1, Flow 2 Client 2 : Flow 3 Flow 1: Flow 2: Flow3 = 1 : 2 : 4 Dec 14, 2007

Exp #3 : Multiple clients F1 Dec 14, 2007

Exp #3 : Multiple clients F1 F1, F2 Dec 14, 2007

Exp #3 : Multiple clients F1 F1, F2 F1, F2, F3 Dec 14, 2007

Exp #3 : Multiple clients F1 F1, F2 F1, F2, F3 Received Proportion 1 : 2.01 : 3.98 Works well across clients Dec 14, 2007

Exp #4 : Different protocols ? OFF Dec 14, 2007

Exp #4 : Different protocols ? OFF ON Dec 14, 2007

Exp #4 : Different protocols ? Received proportion 1 : 1.93 Works well across protocols F1, F2 F1, F2, F3 OFF ON Dec 14, 2007

Exp #4 : Effect of packet size OFF Dec 14, 2007

Exp #4 : Effect of packet size ON (NO Inflation) OFF Dec 14, 2007

Exp #4 : Effect of packet size ON (NO Inflation) ON (with Inflation) OFF Dec 14, 2007

Exp #4 : Effect of packet size Agg. Throughput 6.94 Mbps Agg. Throughput 5.83 Mbps ON (NO Inflation) ON (with Inflation) OFF Dec 14, 2007

Exp #4 : Effect of packet size F1, F2, F3 Ticket Inflation makes packet size irrelevant Tradeoff: Efficiency Vs Fairness ON (NO Inflation) ON (with Inflation) OFF Dec 14, 2007

Exp #5 : Effect of Bursty Traffic Dec 14, 2007

Exp #5 : Effect of Bursty Traffic No Contention Contention Dec 14, 2007

Exp #5 : Effect of Bursty Traffic No Contention Contention Lottery makes sense when there is contention Dec 14, 2007

Exp #6 : Is it Scalable ? Dec 14, 2007

Lottery is scalable, does fine-grained allocation! Exp #6 : Is it Scalable ? Contention Lottery is scalable, does fine-grained allocation! Dec 14, 2007

Exp #7 : Lottery Vs Stride Dec 14, 2007

Exp #7 : Lottery Vs Stride Stride is more accurate than Lottery But needs more state, processing Dec 14, 2007

Exp #8 : TCP and Lossy Links Bad Links Good Links Dec 14, 2007

Conclusions Lottery Scheduling Flexible, Fine-grained bandwidth allocation Works across different clients, packet sizes, traffic types, protocols Interaction with TCP in presence of lossy links Simple and a powerful concept Dec 14, 2007