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.

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.
TCP/IP MODEL Maninder Kaur
2: Transport Layer 31 Transport Layer 3. 2: Transport Layer 32 TCP Flow Control receiver: explicitly informs sender of (dynamically changing) amount of.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
Performance Improvement of TCP in Wireless Cellular Network Based on Acknowledgement Control Osaka University Masahiro Miyoshi, Masashi Sugano, Masayuki.
PERSISTENT DROPPING: An Efficient Control of Traffic Aggregates Hani JamjoomKang G. Shin Electrical Engineering & Computer Science UNIVERSITY OF MICHIGAN,
Measurements of Congestion Responsiveness of Windows Streaming Media (WSM) Presented By:- Ashish Gupta.
- Reliable Stream Transport Service
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #11 TCP Eiffel (RFC 3522)
1 Ossama Younis and Sonia Fahmy Department of Computer Sciences Purdue University For slides, technical report, and implementation, please see:
Distributed Video Streaming Over Internet Thinh PQ Nguyen and Avideh Zakhor Berkeley, CA, USA Presented By Sam.
Congestion Control in Distributed Media Streaming Lin Ma Wei Tsang Ooi School of Computing National University of Singapore IEEE INFOCOM 2007.
Multiple Sender Distributed Video Streaming Thinh Nguyen, Avideh Zakhor appears on “IEEE Transactions On Multimedia, vol. 6, no. 2, April, 2004”
Available bandwidth measurement as simple as running wget D. Antoniades, M. Athanatos, A. Papadogiannakis, P. Markatos Institute of Computer Science (ICS),
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
TCP connection my Computertelnet client web server remote computer 1 character per transmission Telnet uses TCP connection.
TCP connection my Computertelnet client web server remote computer 1 character per transmission * Telnet uses TCP connection * but Nagle's algorithm modifies.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
UDP© Dr. Ayman Abdel-Hamid, CS4254 Spring CS4254 Computer Network Architecture and Programming Dr. Ayman A. Abdel-Hamid Computer Science Department.
Inline Path Characteristic Estimation to Improve TCP Performance in High Bandwidth-Delay Networks HIDEyuki Shimonishi Takayuki Hama Tutomu Murase Cesar.
Computer Science 1 Characterizing Link Properties Using “Loss-pairs” Jun Liu (joint work with Prof. Mark Crovella)
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.
Alok Shriram and Jasleen Kaur Presented by Moonyoung Chung Empirical Evaluation of Techniques for Measuring Available Bandwidth.
TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Wireless TCP Prasun Dewan Department of Computer Science University of North Carolina
CS 447 Network & Data Communication QoS (Quality of Service) & DiffServ Introduction Department of Computer Science Southern Illinois University Edwardsville.
Chapter 12 Transmission Control Protocol (TCP)
指導教授:林仁勇 老師 學生:吳忠融 2015/10/24 1. Author Chan, Y.-C. Chan, C.-T. Chen, Y.-C. Source IEE Proceedings of Communications, Volume 151, Issue 1, Feb 2004 Page(s):107.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
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.
Low Latency Adaptive Streaming over TCP Authors Ashvin Goel Charles Krasic Jonathan Walpole Presented By Sudeep Rege Sachin Edlabadkar.
Winter 2008CS244a Handout 71 CS244a: An Introduction to Computer Networks Handout 7: Congestion Control Nick McKeown Professor of Electrical Engineering.
CS2910 Week 9, Class 1 Today –Quiz on SMTP –TCP: Flow control vs. Congestion Control –TCP startup, error recovery, and shut-down Before 8am Thursday: –Watch.
The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.
Computer Simulation of Networks ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
TCP as a Reliable Transport. How things can go wrong… Lost packets Corrupted packets Reordered packets …Malicious packets…
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
1 TCP ProtocolsLayer name DNSApplication TCP, UDPTransport IPInternet (Network ) WiFi, Ethernet Link (Physical)
Accelerating Peer-to-Peer Networks for Video Streaming
Transmission Control Protocol (TCP) Retransmission and Time-Out
Impact of New CC on Cross Traffic
Chapter 5 TCP Sequence Numbers & TCP Transmission Control
Internet Networking recitation #9
Vivaldi: A Decentralized Network Coordinate System
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Multipath TCP Yifan Peng Oct 11, 2012
Chapter 5 The Network Layer.
Internet Networking recitation #10
Low-Latency Adaptive Streaming Over TCP
TCP Congestion Control
Chapter 15. Satellite Services and the Internet
Designing a Relative Delay Estimator for Multipath Transport
Presentation transcript:

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 Presented by Felix Lam

Content Introduction System Design Performance Evaluation Conclusions Comments and Discussions

Introduction Bottleneck Sharing is common among different connections Ordinary TCP is simple but NOT efficient. Internet FTP/ Web/ Streaming Server Clients

Introduction Coordinated Congestion Management  Flows sharing the same bottleneck(s) are grouped together for congestion control  Each flow in a group is given different quality of service by the server (e.g. different sending rates, different error protection… etc.)  Collective performance improved

Introduction How to group flows that share the same bottleneck(s) ? FlowMate  Make use of packet delay information to group flows sharing the same bottleneck(s)

Basic Architecture The FlowMate module is embedded into the TCP implementation of the sender to collect delay samples for correlation test.

Delay Computation Packet delay information can be collected in two ways  Timestamping ACKs Option fields supported in TCP implementations in most operating systems. TS Value – time at which the data packet / ACK is sent TS Echo Reply – the previously received TS Value, only present in ACK. TS Recv. Time – extension proposed by the paper Clock-skewness does not affect the correlation values as long as it is constant. Delay = TS Value (Sender) – TS Recv. Time (Receiver)

Delay Computation  Round Trip Time (RTT) samples For each ACK received, TCP sender get a RTT sample. However, using RTT samples instead of forward delay may degrade grouping accuracy because:  Bottlenecks of reverse path and forward path may be different  Delayed acknowledgement affect RTT The reduction in grouping accuracy < 5%

Correlation Test Correlation test is performed after each flow has got N (e.g. N=6) delay samples Apply Pearson’s correlation function on the delay samples Packet Sent Time 1s2s3s4s5s6s8s11s12s15s x1x1 x2x2 x3x3 x5x5 x6x6 y1y1 y2y2 y3y3 y4y4 y5y5 x4x4 y6y6 7s14s

Correlation Test Cross-measure M x  Select delay samples from the two flows that a packet of flow x must precede a packet of flow y immediately  The correlation of the 3 consecutive pairs of delay samples is computed Packet Sent Time 1s2s8s12s x1x1 x5x5 y1y1 y4y4 x4x4 y6y6 7s14s

Correlation Test Auto-measure M a  Select pairs of delay samples from one of the two flows that the spacing between each pair is larger than the average spacing between the pairs used to compute M x (e.g. 1.33) Packet Sent Time 1s5s6s12s x1x1 x2x2 x3x3 x5x5

Correlation Test If Mx > Ma Then the two flows are grouped together (i.e. they share the same bottleneck(s))

Partitioning If more than one groups succeed in the test, join the one with highest M x Each flow will be repartitioned after it gets enough new delay samples G1G1 G2G2 Representative Flow A new flow Correlation tests G3G3 form a new group if fail

Performance Evaluation k j is the number of splits of the correct group j. correct: {1,2,3},{4,5,6} result: {1,2},{3,4,5},{6} Accuracy Index =0.67                    flowsTotal k flowsTotal flowssharedfalse IndexAccuracy Groups j j # )1( # # 1 # 1     

Performance Evaluation

Accuracy Index

Performance Evaluation Effect of Buffer Size

Performance Evaluation Effect of packet drop policy

Performance Evaluation Effect of background traffic load

Performance Evaluation Performance degradation with bursty Telnet traffic

Conclusions FlowMate is an on-line partitioning algorithm, requires no active-probing Robust under heavy background traffic, and different router buffer sizes High burstiness degrades the performance Useful for many applications that require inter-flow coordination

Comments and Discussions The high accuracy, robustness under high background traffic load makes FlowMate quite useful in practical network environments. Although burstiness degrades performance, it does not affect its usefulness in the scenario of TCP video streaming.

Comments and Discussions Wonder if varying background traffic load will affect the performance Any better way to choose the representative flow in each group?