Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation.

Slides:



Advertisements
Similar presentations
The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.
Advertisements

Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Scheduling in Web Server Clusters CS 260 LECTURE 3 From: IBM Technical Report.
1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.
The Effects of Wide-Area Conditions on WWW Server Performance Erich Nahum, Marcel Rosu, Srini Seshan, Jussara Almeida IBM T.J. Watson Research Center,
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
Confused, Timid, and Unstable: Picking a Video Streaming Rate is Hard Published in 2012 ACM’s Internet Measurement Conference (IMC) Five students from.
Doc.: IEEE /0604r1 Submission May 2014 Slide 1 Modeling and Evaluating Variable Bit rate Video Steaming for ax Date: Authors:
CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
Performance Improvement of TCP in Wireless Cellular Network Based on Acknowledgement Control Osaka University Masahiro Miyoshi, Masashi Sugano, Masayuki.
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
CUBIC : A New TCP-Friendly High-Speed TCP Variant Injong Rhee, Lisong Xu Member, IEEE v 0.2.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Scalable and Crash-Tolerant Load Balancing based on Switch Migration
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
18 Nov 2009 TCP VEGAS Mohammad AlKurbi CMPT – 771: Internet Architecture and Protocols.
1 Lecture 10: TCP Performance Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3 slides for.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
TCP Friendliness CMPT771 Spring 2008 Michael Jia.
Internet and Intranet Protocols and Applications Section V: Network Application Performance Lecture 11: Why the World Wide Wait? 4/11/2000 Arthur P. Goldberg.
On Efficient On-line Grouping of Flows with Shared Bottlenecks at Loaded Servers by O. Younis and S. Fahmy Department of Computer Sciences, Purdue University.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Efficient Internet Traffic Delivery over Wireless Networks Sandhya Sumathy.
Optical Ring Networks Research over MAC protocols for optical ring networks with packet switching. MAC protocols divide the ring bandwidth according to.
FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.
The War Between Mice and Elephants By Liang Guo (Graduate Student) Ibrahim Matta (Professor) Boston University ICNP’2001 Presented By Preeti Phadnis.
Performance and Robustness Testing of Explicit-Rate ABR Flow Control Schemes Milan Zoranovic Carey Williamson October 26, 1999.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
All rights reserved © 2006, Alcatel Accelerating TCP Traffic on Broadband Access Networks  Ing-Jyh Tsang 
Department of Computer Science Southern Illinois University Edwardsville Dr. Hiroshi Fujinoki and Kiran Gollamudi {hfujino,
Multicast Congestion Control in the Internet: Fairness and Scalability
1 Proceeding the Second Exercises on Computer and Systems Engineering Professor OKAMURA Laboratory. Othman Othman M.M.
Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.
TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.
Experiences in Design and Implementation of a High Performance Transport Protocol Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
The effect of router buffer size on the TCP performance K.E. Avrachenkov*, U.Ayesta**, E.Altman*, P.Nain*,C.Barakat* *INRIA - Sophia Antipolis, France.
June 11, 2001ICC20011 Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University, Japan Masaki Miyabayashi.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
Transport Layer3-1 Announcements r Collect homework r New homework: m Ch3#3,4,7,10,12,16,18-20,25,26,31,33,37 m Due Wed Sep 24 r Reminder: m Project #1.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
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.
1 On Scalable Edge-based Flow Control Mechanism for VPN Tunnels --- Part 2: Scalability and Implementation Issues Hiroyuki Ohsaki Graduate School of Information.
Data Transport Challenges for e-VLBI Julianne S.O. Sansa* * With Arpad Szomoru, Thijs van der Hulst & Mike Garret.
1 On Dynamic Parallelism Adjustment Mechanism for Data Transfer Protocol GridFTP Takeshi Itou, Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
Empirical Quantification of Opportunities for Content Adaptation in Web Servers Michael Gopshtein and Dror Feitelson School of Engineering and Computer.
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.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
1. Introduction REU 2006-Packet Loss Distributions of TCP using Web100 Zoriel M. Salado, Mentors: Dr. Miguel A. Labrador and Cesar D. Guerrero 2. Methodology.
1 Evaluating NGI performance Matt Mathis
Doc.: IEEE /1317r0 Submission December 2009 Vinko Erceg, BroadcomSlide 1 Internet Traffic Modeling Date: Authors: NameAffiliationsAddressPhone .
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
August 23, 2001ITCom2001 Proxy Caching Mechanisms with Video Quality Adjustment Masahiro Sasabe Graduate School of Engineering Science Osaka University.
The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
1 COMP 431 Internet Services & Protocols HTTP Persistence & Web Caching Jasleen Kaur February 11, 2016.
79 Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 8 / 3. nov 2004 Vooülekanne Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Agenda Background Project goals Project description –General –Implementation –Algorithms Simulation results –Charts –Conclusions.
Accelerating Peer-to-Peer Networks for Video Streaming
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Automatic TCP Buffer Tuning
Modeling and Evaluating Variable Bit rate Video Steaming for ax
Presentation transcript:

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation Experiments of Scalable Socket Buffer Tuning Tatsuhiko Terai Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Background  Explosive increase of network traffic due to rapid increase of Internet users  Many improvements on network to accommodate increasing traffic  Link Bandwidth  TCP congestion control algorithm  Few discussions on endhost improvement  Ex. Busy WWW Server receives hundreds of request for document transfer per second. The bottleneck of the data transfer processing is shifted from network to endhosts

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Objective  Effective allocation of endhosts resources becomes more important  Propose a novel architecture, SSBT (Scalable Socket Buffer Tuning)  High-performance and fair service for many TCP connections at the sender host  E-ATBT (Equation-based Automatic TCP Buffer Tuning)  SMR (Simple Memory-copy Reduction)

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Send Socket Buffer Assignment  Busy Internet servers (WWW, Proxy,…) handle many TCP connections which have different characteristics  RTT, packet loss rate, bandwidth, …  In original method, sender host assigns fixed size of buffer to each TCP connection  Fixed size assignment may cause unfair and ineffective usage of send socket buffer  Different connections require different size of send buffer according to network conditions Fair and effective buffer assignment considering network condition is needed for improving endhost performance

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies E-ATBT (Equation-based Automatic TCP Buffer Tuning)  Provide fair and effective send socket buffer assignment  Estimate an ‘expected’ throughput of each TCP connection by monitoring three network  p (packet loss rate), rtt (Round Trip Time), rto (Retransmission Time Out)  Determine assigned buffer size from the estimated throughput  Max-Min fairness policy for re-assigning the excess buffer  Re-assigned to the connections need more buffer the required buffer size of those connection

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies E-ATBT Method for assigning the send socket buffer Internet Web Server Host In E-ATBT, assigned buffer size is determined from the estimated throughput based on the mathematical analysis method

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies E-ATBT Method for assigning the send socket buffer In E-ATBT, assigned buffer size is determined from the estimated throughput based on the mathematical analysis method Internet Web Server Host TCP Connections Send Socket Buffer Assign the required buffer size only Assign the large socket buffer for large bandwidth

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies SMR (Simple Memory-copy Reduction)  Original mechanism needs two memory copy operations. Memory copy is large overhead on endhost processing File System Main Memory Data File Socket Buffer Memory Copy Application Buffer

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies SMR (Simple Memory-copy Reduction) File SystemMain Memory Data File Socket Buffer Memory Copy SMR scheme reduces the data transfer overhead at the sender host by reducing the redundant memory copy operation

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Implementation Experiments  Fair buffer assignment among different connections  Time-dependent behavior of the assigned buffer size  Web server performance evaluation  Average performance gain of the SSBT scheme  Considering realistic web access traffic [1]  Document size distribution  Idle time distribution of requests  Embedded documents distribution [1] P.Barford and M.Crovella, “Generating Representative Web Workloads for Network and Server Performance Evaluation”, in Proceedings of ACM SIGMETRICS ’98, 1998

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Network topology Server Host Client Host 1 Client Host 2 Router 1 Router [Mbps] 100 [Mbps] SSBT-enabled Web server Document transfer request generated by httperf Each client generate the requests for document transfer to Web server and measure the data transfer time

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Buffer assignment result E-ATBT can provide the stable and fair buffer assignment

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Web server performance Average Performance Gain [%] Document Size [KBytes] Performance improvement by SSBT 600Clients, HTTP/1.1

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Conclusion Remarks and Future Works  Proposed SSBT for utilizing the send socket buffer effectively and fairly  Confirmed the effectiveness of the SSBT algorithm through implementation experiments and shown SSBT can improve the overall performance of a server  New resource management scheme for Internet busy server (Ex. HTTP Proxy server)  Enhanced E-ATBT for proxy servers  Manage the persistent TCP connections

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies