On the Use of Fixed Point Approximations to Study Reliable Protocols over Congested Links Michela Meo Michele Garetto Renato Lo Cigno Marco Ajmone Marsan.

Slides:



Advertisements
Similar presentations
Milano 25/2/20031 Bandwidth Estimation for TCP Sources and its Application Prepared for QoS IP 2003 R. G. Garroppo, S.Giordano, M. Pagano, G. Procissi,
Advertisements

Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Improving TCP over Wireless by Selectively Protecting Packet Transmissions Carla F. Chiasserini Michele Garetto Michela Meo Dipartimento di Elettronica.
1 Using Partial Differential Equations to Modek TCP Mice and Elephantsin large IP Networks M. Ajmone Marsan, M. Garetto, P. Giaccone, E. Leonardi, E.Schiattarella,
Transport Layer3-1 TCP AIMD multiplicative decrease: cut CongWin in half after loss event additive increase: increase CongWin by 1 MSS every RTT in the.
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
Modeling, Simulation and Measurements of Queuing Delay under Long-tail Internet Traffic Michele Garetto Politecnico di Torino, Italy Don Towsley University.
Winter 2008CS244a Handout #61 CS244a: An Introduction to Computer Networks Handout 6: The Transport Layer, Transmission Control Protocol (TCP), and User.
Optimizing Buffer Management for Reliable Multicast Zhen Xiao AT&T Labs – Research Joint work with Ken Birman and Robbert van Renesse.
Stability of computer network for the set delay Jolanta Tańcula.
Performance Improvement of TCP in Wireless Cellular Network Based on Acknowledgement Control Osaka University Masahiro Miyoshi, Masashi Sugano, Masayuki.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Simulation of the Slotted Aloha Protocol
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
Multimedia Streaming Gateway With Jitter Detection Siu-Ping Chan, Chi-Wah Kok Albert K. Wong IEEE TRANSACTIONS ON MULTIMEDIA, June 2005.
TDC365 Spring 2001John Kristoff - DePaul University1 Internetworking Technologies Transmission Control Protocol (TCP)
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Traffic Characterization Dr. Abdulaziz Almulhem. Almulhem©20012 Agenda Traffic characterization Switching techniques Internetworking, again.
Reduced TCP Window Size for Legacy LAN QoS Niko Färber July 26, 2000.
Multicast Congestion Control in the Internet: Fairness and Scalability
Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.
Congestion Control, the Internet Transport Protocols, and UDP By: Mike Krupinski and Jaesma Woods.
Congestion control for multimedia Henning Schulzrinne Dept. of Computer Science Columbia University Fall 2003.
TCP Throughput Collapse in Cluster-based Storage Systems
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Kamal Singh, Árpád Huszák, David Ros, César Viho and Jeney Gábor
Capacity analysis of complex materials handling systems.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Solutions for Improving TCP Performance over Emerging Networks K.R.Renjish Kumar Centre for Internet Research.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
ESRT: Event to Sink Reliable Transport in Sensor Networks Yogesh S., O. Akan, I. Akyildiz (GaTech) ECE 256 Spring 2009.
3: Transport Layer3-1 Where we are in chapter 3 Last time: r TCP m Reliable transfer m Flow control m Connection management r principles of congestion.
M/M/1 queue λn = λ, (n >=0); μn = μ (n>=1) λ μ λ: arrival rate
Interacting Network Elements: Chaos and Congestion Propagation Gábor Vattay Department of Physics of Complex Systems Eötvös University, Budapest, Hungary.
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
Acknowledgments S. Athuraliya, D. Lapsley, V. Li, Q. Yin (UMelb) S. Adlakha (UCLA), J. Doyle (Caltech), K. Kim (SNU/Caltech), F. Paganini (UCLA), J. Wang.
Presented by: Peng Wang EE Department University of Delaware A Probabilistic Approach for Achieving Fair Bandwidth Allocation in CSFQ.
1 On Scalable Edge-based Flow Control Mechanism for VPN Tunnels --- Part 2: Scalability and Implementation Issues Hiroyuki Ohsaki Graduate School of Information.
1 On Dynamic Parallelism Adjustment Mechanism for Data Transfer Protocol GridFTP Takeshi Itou, Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
1 1 July 28, Goal of this session is too have a discussion where we learn about the relevant data to help us understand the problem and design.
Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery Raja Abdelmoumen, Mohammad Malli, Chadi Barakat PLANETE group, INRIA.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
Analysis of Buffer Size in Core Routers by Arthur Dick Supervisor Anirban Mahanti.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
Session 2.
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
1 Transport Control Protocol for Wireless Connections ElAarag and Bassiouni Vehicle Technology Conference 1999.
H. OhsakiITCom A control theoretical analysis of a window-based flow control mechanism for TCP connections with different propagation delays Hiroyuki.
L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04, 2004 Presented by Alok Rakkhit, Ionut Trestian.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
Time 0 T start-up Packet generation Servers # of packets Playback rate of Receiver All packets are assumed to be of the same size. The continuous.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Tango1 Considering End-to-End QoS Constraints in IP Network Design and Planning M.Ajmone Marsan, M. Garetto, E. Leonardi. M. Mellia, E. Wille Dipartimento.
OverQos: An Overlay based Architecture for Enhancing Internet Qos L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04,
Results for p = 0.1 Graphs at different values of Call Arrival Rate for Call Blocking Probability (in %) System Utilization (Efficiency) (in %) Average.
Infocom April 26, Anchorage AK, USA
Columbia University in the city of New York
Chapter 6 The Transport Layer The Transport Service & Elements of Transport Protocols.
FAST TCP : From Theory to Experiments
ns-2 simulation of TCP + CBR traffic
Traffic analysis and optimization of a mangement network
Stability of Congestion Control Algorithms Using Control Theory with an application to XCP Ioannis Papadimitriou George Mavromatis.
Native Simulation of Round-Robin Queuing
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Review of Internet Protocols Transport Layer
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Presentation transcript:

On the Use of Fixed Point Approximations to Study Reliable Protocols over Congested Links Michela Meo Michele Garetto Renato Lo Cigno Marco Ajmone Marsan Globecom 2003

Access link scenario Q clients servers λ c conn/s Arrival process of new connections data packets

Access link scenario Ingoing traffic Outgoing traffic Uncongested link: Congested link:

Definition of “ g ”  The “normalized goodput” g (or “nominal link utilization”) on the link is defined as follows:  The actual traffic intensity  includes also retransmissions arriving at the link

 Only necessary retransmissions:

 Addition of un-necessary retransmissions:

Un-necessary retransmissions: the  parameter

Average Packet Loss Probability ( p ) Traffic Intensity (  ) M/M/1/B B = 16 B = 32 B = 64 TCP g = 0.90 g = 0.95 g = 0.98 Convergence of the FPA (unique solution)

Packet loss probability ( p ) Load (  ) TCP - Link utilization (g) = 0.95 M/M/1/B (B = 32).

Convergence of the FPA (double solution) Stable point Unstable point

flow dist ~ geom (20) Average Packet Loss Probability (p) Normalized Goodput (g) flow dist ~ geom (600) flow dist ~ geom (60) 1 stable solution 1 unstable solution 1 stable solution Stability region ns simulations: B = 128

g = 0.986

Fig. 6