INFOCOM 2003 1 A Receiver-Driven Bandwidth Sharing System (BWSS) for TCP Puneet Mehra, Avideh Zakhor UC Berkeley, USA Christophe De Vleeschouwer Université.

Slides:



Advertisements
Similar presentations
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
Advertisements

1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.
1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
Packet Video TCP Video Streaming to Bandwidth-Limited Access Links Puneet Mehra and Avideh Zakhor Video and Image Processing Lab University of California,
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.
Congestion Control: TCP & DC-TCP Swarun Kumar With Slides From: Prof. Katabi, Alizadeh et al.
CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.
1 Service Differentiation at Transport Layer via TCP Westwood Low- Priority (TCPW-LP) H. Shimonishi, M.Y. Sanadidi and M. Geria System Platforms Research.
Network Border Patrol: Preventing Congestion Collapse and Promoting Fairness in the Internet Celio Albuquerque, Brett J. Vickers, Tatsuya Suda 1.
Max Min Fairness How define fairness? “ Any session is entitled to as much network use as is any other ” ….unless some sessions can use more without hurting.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Network Congestion Gabriel Nell UC Berkeley. Outline Background: what is congestion? Congestion control – End-to-end – Router-based Economic insights.
1 USC INFORMATION SCIENCES INSTITUTE RAP: An End-to-End Congestion Control Mechanism for Realtime Streams in the Internet Reza Rejaie, Mark Handley, Deborah.
588 Section 4 Neil Spring April 27, Schedule Notes Project 2 description Fair Queueing (Demers et.al.)
Charge-Sensitive TCP and Rate Control Richard J. La Department of EECS UC Berkeley November 22, 1999.
Distributed Video Streaming Over Internet Thinh PQ Nguyen and Avideh Zakhor Berkeley, CA, USA Presented By Sam.
Bandwidth sharing: objectives and algorithms Jim Roberts France Télécom - CNET Laurent Massoulié Microsoft Research.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Packet Scheduling and QoS Computer Science Division Department of Electrical Engineering and.
Leveraging Multiple Network Interfaces for Improved TCP Throughput Sridhar Machiraju SAHARA Retreat, June 10-12, 2002.
Multiple Sender Distributed Video Streaming Thinh Nguyen, Avideh Zakhor appears on “IEEE Transactions On Multimedia, vol. 6, no. 2, April, 2004”
1 Traffic Sensitive Quality of Service Controller Masters Thesis Submitted by :Abhishek Kumar Advisors: Prof Mark Claypool Prof Robert Kinicki Reader:
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
Improving the Performance of Interactive TCP Applications using Service Differentiation W. Noureddine and F. Tobagi Department of Electrical Engineering.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
TCP Friendliness CMPT771 Spring 2008 Michael Jia.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Performance Evaluation on Buddy-TCP By Felix. Simulation Setup S C1C1 CNCN … … T_Sink1 T_SinkN … T1T1 TNTN U U_Sink 4N Mbps 50 ms L Types of traffic:
FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.
1 Manpreet Singh, Prashant Pradhan* and Paul Francis * MPAT: Aggregate TCP Congestion Management as a Building Block for Internet QoS.
The War Between Mice and Elephants By Liang Guo (Graduate Student) Ibrahim Matta (Professor) Boston University ICNP’2001 Presented By Preeti Phadnis.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Receiver-Driven Bandwidth Sharing for TCP and its Application to Video Streaming Puneet Mehra, Christophe De Vleeschouwer, and Avideh Zakhor IEEE Transactions.
All rights reserved © 2006, Alcatel Accelerating TCP Traffic on Broadband Access Networks  Ing-Jyh Tsang 
University of Nevada, Reno Virtual Direction Multicast for Overlay Networks Suat Mercan & Dr. Murat Yuksel HOTP2P’11.
1 MaxNet and TCP Reno/RED on mice traffic Khoa Truong Phan Ho Chi Minh city University of Technology (HCMUT)
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
Link Scheduling & Queuing COS 461: Computer Networks
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Worcester Polytechnic Insitute, Worcester, MA, USA1 Traffic Sensitive Active Queue Management for Improved Multimedia Streaming Authors: Vishal Phirke,
Rate Control Rate control tunes the packet sending rate. No more than one packet can be sent during each packet sending period. Additive Increase: Every.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
Analysis of QoS Arjuna Mithra Sreenivasan. Objectives Explain the different queuing techniques. Describe factors affecting network voice quality. Analyse.
Michael Schapira Yale and UC Berkeley Joint work with P. Brighten Godfrey, Aviv Zohar and Scott Shenker.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Transport Layer3-1 TCP throughput r What’s the average throughout of TCP as a function of window size and RTT? m Ignore slow start r Let W be the window.
Research Unit in Networking - University of Liège A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks Fabian Skivée
Network Simulator 2. Introduction Open source network simulator NS uses two languages: C++ and OTcl  C++ is fast to run but slower to change Kernel 
Scheduling Determines which packet gets the resource. Enforces resource allocation to each flows. To be “Fair”, scheduling must: –Keep track of how many.
Receiver Driven Bandwidth Sharing for TCP Authors: Puneet Mehra, Avideh Zakor and Christophe De Vlesschouwer University of California Berkeley. Presented.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
HP Labs 1 IEEE Infocom 2003 End-to-End Congestion Control for InfiniBand Jose Renato Santos, Yoshio Turner, John Janakiraman HP Labs.
Receiver-based Management of Low-bandwidth Access Links INFOCOM 2000 March 28, 2000 Neil Spring, Maureen Chesire, Mark Berryman, Vivek Sahasranaman, Thomas.
Univ. of TehranIntroduction to Computer Network1 An Introduction Computer Networks An Introduction to Computer Networks University of Tehran Dept. of EE.
Achievable Service Differentiation with Token Bucket Marking for TCP S. Sahu, D.Towsley University of Massachusetts P. Nain INRIA C. Diot Sprint Labs V.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
1 Three ways to (ab)use Multipath Congestion Control Costin Raiciu University Politehnica of Bucharest.
Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.
Delay-based Congestion Control for Multipath TCP Yu Cao, Mingwei Xu, Xiaoming Fu Tsinghua University University of Goettingen.
Experimental Networking (ECSE 4963)
TCP-LP Distributed Algorithm for Low-Priority Data Transfer
Columbia University in the city of New York
RAP: Rate Adaptation Protocol
TCP Congestion Control
Presentation transcript:

INFOCOM A Receiver-Driven Bandwidth Sharing System (BWSS) for TCP Puneet Mehra, Avideh Zakhor UC Berkeley, USA Christophe De Vleeschouwer Université Catholique de Louvain, Belgium

INFOCOM Talk Outline Motivation & Goals BWSS Overview NS-2 Simulations Internet Experiments Related Work Conclusion

INFOCOM Motivation Most traffic on Internet is TCP HTTP, FTP, P2P,… In many cases access links are bottleneck Limited Bandwidth (B/W) eg: DSL/Cable < 1.5Mbps User run many apps that compete for B/W Problem: TCP shares bottleneck B/W according to RTT Not fair to flows w/ large RTT Doesn’t consider application needs or user prefs!

INFOCOM Example Situation High RTT Med. RTT Low RTT Congestion

INFOCOM Goal & Approach Goal: Let user control application B/W allocations User preferences dictate bandwidth allocation Approach: limit throughput of low-priority flows to provide additional B/W for high-priority ones Ensure full utilization of access link Don’t change TCP/senders or routers  easily deployable!

INFOCOM Talk Outline Motivation & Goals BWSS Overview NS-2 Simulations Internet Experiments Related Work Conclusion

INFOCOM BWSS Overview

INFOCOM Target Rate Allocation Subsystem Some apps need minimum guaranteed rate(video), others don’t (ftp) User assigns each flow: Priority, minimum rate and weight Bandwidth allocation algorithm: Satisfy minimum rate in decreasing order of priority Remaining B/W shared according to weight T1T1 User Prefs. σ TnTn

INFOCOM BWSS Overview

INFOCOM Flow Control System (FCS) w – TCP window d – delay in ACKs RTT – Flow RTT MSS – TCP MSS

INFOCOM BWSS Overview

INFOCOM σ – Calculation Subsystem Goal: Choose σ to maximize link utilization. U = Σ i R i (σ) Approach: Iteratively increase/decrease σ and measure the impact on utilization R1R1 RNRN σ T 1 = R 1 σ U W2W2 W1W1 Link Capacity T 2 = R 2 T 1 = R 1 T 2 != R 2 T 2 = R 2

INFOCOM BWSS Overview

INFOCOM Talk Outline Motivation & Goals BWSS Overview NS-2 Simulations Internet Experiments Related Work Conclusion

INFOCOM Example of User Preferences Time 0: Min. Rate = 0 Kb/s weights = 1,2,3 for S0-S2 Priority -> S0 (max), S2(min) Time 300: Min Rate = 600 Kb/s TCP BWSS

INFOCOM Network-Congestion Example Priorities: increasing from S0-S2 Min Rate: S0,S2 – 600Kb/s S1 – 100 Kb/s Time 400s to 1200s 700Kb/s Interfering TCP traffic S2 limited to 300Kb/s

INFOCOM Multimedia Streaming Example S0 – Ftp traffic. Low Priority Min Rate = 700Kb/s S1 – Streaming at 450Kb/s High Priority 300Kb/s UDP flow (400s-1000s)

INFOCOM Talk Outline Motivation & Goals BWSS Overview NS-2 Simulations Internet Experiments Related Work Conclusion

INFOCOM BWSS Implementation ETH0 BWSS User-space shared library setsockopt() No Kernel Mods! APP_1APP_nAPP_2 Invisible to Apps

INFOCOM Experimental Setup Host PC running Linux kernel AT&T Cable modem connection

INFOCOM Experiment 1 – User Preferences BWSS allows flexible allocation of B/W Standard TCP Weighted Fair Sharing Ratios: 3,2,1 Minimum Rate of 100Kb/s Priorities: Blue, green, red

INFOCOM Related Work Network-Modifying Solutions Router Scheduling Policies WFQ, W2FQ: allow B/W allocation Require infrastructure changes  little deployment Network Appliances – PacketShaper Placed at network ingress  does traffic management Not easy to manage individual preferences End-Host solution Modify receiver’s window [Spring et al, 2000] Prioritize short-lived flows over longer ones Focus: reduce queuing delay for interactive apps (telnet)

INFOCOM Conclusions BWSS allows user to allocate link B/W Flexible B/W allocation model Adapts to changing network conditions No changes to TCP/senders/routers Implemented as shared library  easily deployable Enables efficient video streaming over TCP Simulations show better performance than standard TCP Additional Internet experiments validate [TCP Based Video Streaming using Receiver-Driven Bandwidth Sharing, Packet Video 2003, To appear]