All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 1 Transport-layer optimization for thin-client systems Yukio OGAWA Systems Development Laboratory,

Slides:



Advertisements
Similar presentations
EE:450 – Computer Networks
Advertisements

Deloitte Technology Fast 500 Asia Pacific Winners Accelerating Your Network WACC Technology.
MCT620 – Distributed Systems
EE384Y: Packet Switch Architectures
Computer Networks TCP/IP Protocol Suite.
Multicast congestion control on many-to- many videoconferencing Xuan Zhang Network Research Center Tsinghua University, China.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Draft-ietf-softwire-dual-stack-lite-01.txt Yiu Lee
Internet Measurement Conference 2003 Source-Level IP Packet Bursts: Causes and Effects Hao Jiang Constantinos Dovrolis (hjiang,
1 / 18 Network Characteristics of Video Streaming Traffic Ashwin Rao, Yeon-sup Lim *, Chadi Barakat, Arnaud Legout, Don Towsley *, and Walid Dabbous INRIA.
CS144 Review Session 4 April 25, 2008 Ben Nham
A Switch-Based Approach to Starvation in Data Centers Alex Shpiner and Isaac Keslassy Department of Electrical Engineering, Technion. Gabi Bracha, Eyal.
Protocol layers and Wireshark Rahul Hiran TDTS11:Computer Networks and Internet Protocols 1 Note: T he slides are adapted and modified based on slides.
Streaming Video over the Internet
1 EL736 Communications Networks II: Design and Algorithms Class1: Introduction Yong Liu 09/05/2007.
1 EE 122: Networks Performance & Modeling Ion Stoica TAs: Junda Liu, DK Moon, David Zats (Materials with thanks.
LOGO Transmission Control Protocol 12 (TCP) Data Flow.
TCP Probe: A TCP with Built-in Path Capacity Estimation Anders Persson, Cesar Marcondes, Ling-Jyh Chen, Li Lao, M. Y. Sanadidi, Mario Gerla Computer Science.
Finishing Flows Quickly with Preemptive Scheduling
1 Communicatienetwerken Oefeningenreeks 1 Hoofdstuk : Transport Laag Woensdag 10 oktober 2007.
1 The ns-2 Network Simulator H Plan: –Discuss discrete-event network simulation –Discuss ns-2 simulator in particular –Demonstration and examples: u Download,
Network Fundamentals – Chapter 4 Sandra Coleman, CCNA, CCAI
Probability Review.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Doc.: IEEE /0604r1 Submission May 2014 Slide 1 Modeling and Evaluating Variable Bit rate Video Steaming for ax Date: Authors:
Performance Improvement of TCP in Wireless Cellular Network Based on Acknowledgement Control Osaka University Masahiro Miyoshi, Masashi Sugano, Masayuki.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
Chapter 3 Transport Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 12.
Introduction1-1 Introduction to Computer Networks Our goal:  get “feel” and terminology  more depth, detail later in course  approach:  use Internet.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
Data Communication and Networks
Discriminating Congestion Losses from Wireless Losses using Inter- Arrival Times at the Receiver By Saad Biaz,Nitin H.Vaidya Texas A&M University IEEE.
All rights reserved © 2006, Alcatel Accelerating TCP Traffic on Broadband Access Networks  Ing-Jyh Tsang 
1 Performance Evaluation of Ring- based Peer-to-Peer Virtual Private Network (RING-P2P-VPN) Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
1: Introduction1 Part I: Introduction Goal: r get context, overview, “feel” of networking r more depth, detail later in course r approach: m descriptive.
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Transport Layer 4 2: Transport Layer 4.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Transport Layer3-1 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4 Principles.
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.
TCP Transport Control Protocol Information management 2 Groep T Leuven – Information department 2/35 Introduction UDP provides the connection.
UDT: UDP based Data Transfer Protocol, Results, and Implementation Experiences Yunhong Gu & Robert Grossman Laboratory for Advanced Computing / Univ. of.
1 Lecture 14 High-speed TCP connections Wraparound Keeping the pipeline full Estimating RTT Fairness of TCP congestion control Internet resource allocation.
Application Layer 2-1 Chapter 2 Application Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012.
1 End-user Protocols, Services and QoS. 2 Layering: logical communication application transport network link physical application transport network link.
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.
Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation.
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.)
Transport Layer 3- Midterm score distribution. Transport Layer 3- TCP congestion control: additive increase, multiplicative decrease Approach: increase.
August 23, 2001ITCom2001 Proxy Caching Mechanisms with Video Quality Adjustment Masahiro Sasabe Graduate School of Engineering Science Osaka University.
79 Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 8 / 3. nov 2004 Vooülekanne Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.
Transport Layer session 1 TELE3118: Network Technologies Week 11: Transport Layer TCP Some slides have been taken from: r Computer Networking:
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Computer Networks 1000-Transport layer, TCP Gergely Windisch v spring.
@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.
Accelerating Peer-to-Peer Networks for Video Streaming
Approaches towards congestion control
The Transport Layer (TCP)
Chapter 3 outline 3.1 Transport-layer services
Chapter 3 outline 3.1 Transport-layer services
Review of Internet Protocols Transport Layer
Evaluation of Objectivity/AMS on the Wide Area Network
Presentation transcript:

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 1 Transport-layer optimization for thin-client systems Yukio OGAWA Systems Development Laboratory, Hitachi, Ltd. Go HASEGAWA, Masayuki MURATA Osaka University 2007 International CQR Workshop May 15-17, 2007

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 2 Overview of thin-client systems office Internet data center thin client intranet VPN gateway server satellite office, home, desktop service without data, apps thin client user event screen updates Isolating computer resources from users resource management, user mobility System performance depends on network performance VPN: Virtual Private Network TCP proxy

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 3 Research objective and our approach System performance (usability) depends on network performance. - intranet performance – designed in advance, controllable - Internet performance – uncontrollable Improve performance of thin-client traffic - especially of flows traversing Internet - thin-client traffic = long-lived interactive TCP data flows - affected by TCP's Nagle algorithm and delayed ACK - affected by buffering of TCP segments and SSR Transport layer optimization on basis of actual traffic observations - observation of Hitachi SDL's prototype system - Dec. 20, 2006 to Jan. 25, pairs of a server and a thin-client - number of co-existing sessions during office hours: several dozen research objective drawback our approach

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 4 Characteristics of thin-client traffic - traffic patterns clientserver time request response large interval interactive data flow (character information) clientserver time bulk data flow (screen update information) request response distinguished by interarrival time of response packets size of data segment time MSS m ( n MSS + a ) MSS: Maximum Segment Size ~10 2 packets short interval

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 5 Characteristics of thin-client traffic - interarrival time distribution of request packets data segment size (log10 bytes) access from Internet interarrival time of request packets (log10 sec)

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 6 Characteristics of thin-client traffic - interarrival time distribution of response packets data segment size (log10 bytes) access from Internet interarrival time of response packets (log10 sec) m sec interactive bulk (head) bulk (inside of 'nMSS+a') bulk (head of 'nMSS+a') data segment size time MSS head inside head of 'nMSS+a'inside of 'nMSS+a' bulk interactive

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 7 Proposed methods for improving performance - interactive data flow clientserver time request response gateway (TCP proxy) × TiTi titi sending copy of data packet sending interval t i = min( RTT – RTT min, T i / 2 ) 1h1h

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 8 Proposed methods for improving performance - bulk data flow clientserver time gateway (TCP proxy) request response no SSR data segment size time MSS m ( n MSS + a ) data segment size time MSS n MSS + a MSS: Maximum Segment Size SSR: Slow-Start Restart paused for buffering resegmenting TCP data segments

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 9 Simulation model - system model R R R router 20 Mbps, 5 msec sender host (server) gateway (TCP proxy) receiver host (client) 20 Mbps, 0.1 msec 1 Mbps, 30 – 300 msec 100 Mbps, 0.1 msec intranet Internet receiver hosts sender hosts thin-client traffic background traffic (UDP: 64 bytes, 128 Kbps) x n packet drop ratio: 0, 3% tail-drop router (buffer size 50, 1024 packets) bottleneck link

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 10 Simulation model - thin-client traffic for evaluation interactive bulk (-0.6, -1.3) : -1.3 = mean - 2 std (-0.6, -0.6) access from Internet average interarrival time of response packets (log10 sec ) evaluation traffic number 30 duration 60 sec -6-5 average interarrival time of response data flows (contiguous packets) (log10 sec)

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 11 Simulation results - interactive data flow – packet drop average number of packet drops (log10) transmission delay of bottleneck link (log10 msec) (UDP 1024 Kbps)(UDP 1152 Kbps)(UDP 1280 Kbps) bottleneck link - 1 Mbps - 3% drop ratio router buffer - 50 packets send a copy with pause send a copy without pause send no copies bg: background drop from tail-drop router random drop from bottleneck link

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 12 Simulation results - bulk data flow – transfer time median transfer time (log10 sec) number of packets in bulk data flow (log10) buffer size = 1024 packets bottleneck link - 1 Mbps - 80 msec - 0% drop ratio background - 3 UDP flows (= 384 Kbps) no-SSR, resegmentation no-SSR buffer size = 50 packets SSR, resegmentation SSR

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 13 transmission delay of bottleneck link (log10 msec) Simulation results - bulk data flow – drop from tail-drop router (UDP 384 Kbps) no-SSR, resegmentation no-SSR SSR, resegmentation SSR bottleneck link - 1 Mbps - 0% drop ratio router buffer - 50 packets (UDP 768 Kbps) bg: background average number of packet drops (log10)

All Rights Reserved, Copyright(C) 2007, Hitachi, Ltd. 14 Conclusion for interactive data flows (transferring character information) - send a packet copy with pause increases tolerance for packets drops for bulk data flows (transferring screen update information) - disable TCP slow-start restart increases packet sending rate increases burstiness of traffic - resegment TCP data segments reducees burstiness of traffic TCP optimization for improving performance of thin-client traffic