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:

Slides:



Advertisements
Similar presentations
RED Enhancement Algorithms By Alina Naimark. Presented Approaches Flow Random Early Drop - FRED By Dong Lin and Robert Morris Sabilized Random Early Drop.
Advertisements

WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs.
Packet Video TCP Video Streaming to Bandwidth-Limited Access Links Puneet Mehra and Avideh Zakhor Video and Image Processing Lab University of California,
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
1 End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey.
1 Service Differentiation at Transport Layer via TCP Westwood Low- Priority (TCPW-LP) H. Shimonishi, M.Y. Sanadidi and M. Geria System Platforms Research.
Simulating Large Networks using Fluid Flow Model Yong Liu Joint work with Francesco LoPresti, Vishal Misra Don Towsley, Yu Gu.
IETF87 Berlin DCTCP implementation in FreeBSD
Prentice HallHigh Performance TCP/IP Networking, Hassan-Jain Chapter 10 TCP/IP Performance over Asymmetric Networks.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4690: Experimental Networking Informal Quiz: TCP Shiv Kalyanaraman:
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
Multirate Congestion Control Using TCP Vegas Throughput Equations Anirban Mahanti Department of Computer Science University of Calgary Calgary, Alberta.
1 USC INFORMATION SCIENCES INSTITUTE RAP: An End-to-End Congestion Control Mechanism for Realtime Streams in the Internet Reza Rejaie, Mark Handley, Deborah.
Evaluate IEEE e EDCA Performance Tyler Ngo CMPE 257.
CS215 TCP Westwood Control Model Development and Stability Analysis Hu, Kunzhong Dong, Haibo Mentor: Wang, Ren Professor:
A simulation-based comparative evaluation of transport protocols for SIP Authors: M.Lulling*, J.Vaughan Department of Computer science, University college.
Questions  RED vs. DropTail  What’s the key difference?  Why RED drops packet randomly?  What’s the major effect if using RED.
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.
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.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
1 ATP: A Reliable Transport Protocol for Ad-hoc Networks Sundaresan, Anantharam, Hseih, Sivakumar.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
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.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA.
Discriminating Congestion Losses from Wireless Losses using Inter- Arrival Times at the Receiver By Saad Biaz,Nitin H.Vaidya Texas A&M University IEEE.
Junxian Huang 1 Feng Qian 2 Yihua Guo 1 Yuanyuan Zhou 1 Qiang Xu 1 Z. Morley Mao 1 Subhabrata Sen 2 Oliver Spatscheck 2 1 University of Michigan 2 AT&T.
TCP Behavior across Multihop Wireless Networks and the Wired Internet Kaixin Xu, Sang Bae, Mario Gerla, Sungwook Lee Computer Science Department University.
1 Performance Evaluation of Ring- based Peer-to-Peer Virtual Private Network (RING-P2P-VPN) Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks João P. Hespanha University of Calif. Santa Barbara.
Multicast Congestion Control in the Internet: Fairness and Scalability
Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Transport Layer 4 2: Transport Layer 4.
1 Enabling Large Scale Network Simulation with 100 Million Nodes using Grid Infrastructure Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
INFOCOM A Receiver-Driven Bandwidth Sharing System (BWSS) for TCP Puneet Mehra, Avideh Zakhor UC Berkeley, USA Christophe De Vleeschouwer Université.
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Link Scheduling & Queuing COS 461: Computer Networks
CING-YU CHU INFOCOM Outline  Introduction  Measurement  Measurement Results  Modeling Skype Behaviors  Analysis on TCP-friendly.
CA-RTO: A Contention- Adaptive Retransmission Timeout I. Psaras, V. Tsaoussidis, L. Mamatas Demokritos University of Thrace, Xanthi, Greece This study.
1 TCP-BFA: Buffer Fill Avoidance September 1998 Amr A. Awadallah Chetan Rai Computer Systems.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
1 On Scalable Edge-based Flow Control Mechanism for VPN Tunnels --- Part 2: Scalability and Implementation Issues Hiroyuki Ohsaki Graduate School of Information.
15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
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 
1 SIGCOMM ’ 03 Low-Rate TCP-Targeted Denial of Service Attacks A. Kuzmanovic and E. W. Knightly Rice University Reviewed by Haoyu Song 9/25/2003.
1 Transport Control Protocol for Wireless Connections ElAarag and Bassiouni Vehicle Technology Conference 1999.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.
Receiver Driven Bandwidth Sharing for TCP Authors: Puneet Mehra, Avideh Zakor and Christophe De Vlesschouwer University of California Berkeley. Presented.
Performance Evaluation of L3 Transport Protocols for IEEE (2 nd round) Richard Rouil, Nada Golmie, and David Griffith National Institute of Standards.
Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.
OverQos: An Overlay based Architecture for Enhancing Internet Qos L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04,
Khiem Lam Jimmy Vuong Andrew Yang
Open Issues in Router Buffer Sizing
RAP: Rate Adaptation Protocol
Project-2 (20%) – DiffServ and TCP Congestion Control
Presentation transcript:

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: S -> C i  {1..N} : Joint-TCP flows T i  {1..N} ->T_Sink i  {1..N} : Ordinary TCP Reno flows U -> U_Sink : Background Poison UDP traffic at the rate of 40x2xN kbps Others: TCP MSS: 1460bytes TCP advertised window: 64Kbytes UDP Pkt Size: 500 bytes Queuing Decipline: DropTail N : # of Joint-TCP flows Links: All links except link L have bandwidth of 100Mbps and propagation delay of 10ms

Performance Metrics Allocation Accuracy w i  {1..N} : weights ; r i  {1..N} : Average throughputs AR i = NR i / NW i Allocation Accuracy = where

Performance Metrics Impact Ratio –Measure the impact to other TCP Reno traffic –Repeat each simulation with those Joint-TCP streams running Ordinary TCP Reno. Impact Ratio = Ravg_new / Ravg_ord where Ravg_new : average throughput of all interfering TCP flows when Coordinated Congestion Control is adopted on the Joint-TCP flows Ravg_ord : average throughput of all the interfering TCP flows when TCP Reno is adopted on the Joint-TCP flows

Allocation Accuracy Allocation Accuracy when allocation ratio is (1:2:3)

Allocation Accuracy (Cont’) Allocation Accuracy when allocation ratio is (1:4:8)

Allocation Accuracy (Con’t) Summary: –The allocation accuracy of MulTCP (with or without SACK) degrades when the allocation ratio increases (e.g. from 1:2:3 to 1:4:8). –Buddy-TCP maintains high allocation accuracy (>0.98) regardless of the number of Joint-TCP streams and the allocation ratio –The performance difference when RED is adopted is negligible.

Impact Ratio Impact Ratio for Droptail

Impact Ratio (Cont’) Impact Ratio for RED

Impact Ratio (Cont’) Summary: –MulTCP (with and without SACK) causes an decrease in the average throughput of the competing ordinary TCP traffic. The decrease can be upto 70% when SACK is used. –Buddy-TCP causes an increase (10 – 20%) in the average throughput of the competing ordinary TCP traffic. –RED has negligible effect on the Impact Ratio

Effect of Random Packet Loss S C1C1 CNCN … … T_Sink1 T_SinkN … T1T1 TNTN U U_Sink 4N Mbps 50 ms L -Random packet loss is introduced in the bottleneck link L -N = 3

Effect of Random Packet Loss (Cont’) Allocation Accuracy for the allocation ratio (1:2:3)

Effect of Random Packet Loss (Cont’) Allocation Accuracy for the allocation ratio (1:4:8)

Effect of Random Packet Loss (Cont’) Impact Ratio for different loss probability

Effect of Random Packet Loss (Cont’) Summary –When random packet loss probability is increased at the bottleneck link, the allocation accuracy will be increased, and the impact ratio will approach to 1. The effect is more apparent for MulTCP (with and without SACK) –Reason: When random packet loss probability increase to certain level, the total throughput is NOT limited by the bottleneck bandwidth anymore. Probability of TCP Timeout due to burst of packet losses at the bottleneck node is reduced.

What’s Next? Convergence of bandwidth allocation –Vs RTT Application on adaptive video streaming (some preliminary results)