Performance Modeling
|
|
- Homer Morgan
- 5 years ago
- Views:
Transcription
1 Performance Modeling EECS 489 Computer Networks Z. Morley Mao Tuesday Sept 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1
2 Administrivia First programming assignment will be available Thursday Due date 9/28 Late days: 5 days for everyone Discussion section time GSI Office hours: - Monday from 12:00-1:00, Wednesday 4:30-5:30, and Friday 2:00-3:00. Due dates of assignments and schedule posted 2
3 Outline Motivations Timing diagrams Metrics Evaluation techniques 3
4 Motivations Understanding network behavior Improving protocols Verifying correctness of implementation Detecting faults Monitor service level agreements Choosing providers Billing 4
5 Outline Motivations Timing diagrams Metrics Evaluation techniques 5
6 Timing Diagrams Sending one packet Queueing Switching - Store and forward - Cut-through Fluid view 6
7 Definitions Link bandwidth (capacity): maximum rate (in bps) at which the sender can send data along the link Propagation delay: time it takes the signal to travel from source to destination Packet transmission time: time it takes the sender to transmit all bits of the packet Queuing delay: time the packet need to wait before being transmitted because the queue was not empty when it arrived Processing Time: time it takes a router/switch to process the packet header, manage memory, etc 7
8 Sending One Packet Bandwidth: R bps Propagation delay: T sec R bits per second (bps) T seconds P bits Transmission time = P/R T time Propagation delay =T = Length/speed For 1Km 1/speed = 3.3 usec in free space 4 usec in copper 5 usec in fiber 8
9 Sending one Packet: Examples P = 1 Kbyte R = 1 Gbps 100 Km, fiber => T = 500 usec P/R = 8 usec T >> P/R T time P/R P = 1 Kbyte R = 100 Mbps 1 Km, fiber => T = 5 usec P/R = 80 usec T << P/R T P/R time 9
10 Queueing The queue has Q bits when packet arrives packet has to wait for the queue to drain before being transmitted P bits Q bits Capacity = R bps Propagation delay = T sec Queueing delay = Q/R P/R T time 10
11 Queueing Example P bits Q bits Packet arrival P = 1 Kbit; R = 1 Mbps P/R = 1 ms Time (ms) Q(t) 2 Kb 1.5 Kb 1 Kb 0.5 Kb Delay for packet that arrives at at time t, t, d(t) = Q(t)/R + P/R Time packet 1, d(0) = 1ms packet 2, d(0.5) = 1.5ms packet 3, d(1) = 2ms 11
12 Switching: Store and Forward A packet is stored (enqueued) before being forwarded (sent) 10 Mbps 5 Mbps 100 Mbps 10 Mbps Sender Receiver time 12
13 Store and Forward: Multiple Packet Example 10 Mbps 5 Mbps 100 Mbps 10 Mbps Sender Receiver time 13
14 Switching: Cut-Through A packet starts being forwarded (sent) as soon as its header is received R1 = 10 Mbps R2 = 10 Mbps Sender Receiver Header time What happens if R2 > R1? 14
15 Fluid Flow System Packets are serviced bit-by-bit as they arrive Q(t) = queueing size at time t a(t) arrival rate e(t) departure rate Q(t) Rate or Queue size a(t) e(t) Q(t) t 15
16 Outline Motivations Timing diagrams Metrics Throughput Delay Evaluation techniques 16
17 Throughput Throughput of a connection or link = total number of bits successfully transmitted during some period [t, t + T) divided by T Link utilization = throughput of the link / link rate Bit rate units: 1Kbps = 10 3 bps, 1Mbps = 10 6 bps, 1 Gbps = 10 9 bps [For memory: 1 Kbyte = 2 10 bytes = 1024 bytes] - Some rates are expressed in packets per second (pps) relevant for routers/switches where the bottleneck is the header processing 17
18 Example: Windows Based Flow Control Connection: - Send W bits (window size) - Wait for ACKs - Repeat Assume the round-triptime is RTT seconds Throughput = W/RTT bps RTT RTT Source Destination Numerical example: - W = 64 Kbytes - RTT = 200 ms RTT - Throughput = W/T = 2.6 Mbps time 18
19 Throughput: Fluctuations Throughput may vary over time Throughput max mean min Time 19
20 Delay Delay (Latency) of bit (packet, file) from A to B - The time required for bit (packet, file) to go from A to B Jitter - Variability in delay Round-Trip Time (RTT) - Two-way delay from sender to receiver and back Bandwidth-Delay product - Product of bandwidth and delay storage capacity of network 20
21 Delay: Illustration Latest bit seen by time t Sender Receiver at point 1 at point 2 Delay time 21
22 Delay: Illustration Sender Receiver 1 Packet arrival times at 1 2 Delay Packet arrival times at 2 22
23 Little s Theorem Assume a system (e.g., a queue) at which packets arrive at rate a(t) Let d(i) be the delay of packet i, i.e., time packet i spends in the system What is the average number of packets in the system? a(t) arrival rate Intuition: d(i) = delay of packet i system Assume arrival rate is a = 1 packet per second and the delay of each packet is s = 5 seconds What is the average number of packets in the system? 23
24 Little s Theorem Latest bit seen by time t d(i) = delay of packet i x(t) = number of packets in transit (in the system) at time t Sender 1 2 Receiver x(t) T time What is the system occupancy, i.e., average number of packets in transit between 1 and 2? 24
25 Little s Theorem Latest bit seen by time t d(i) = delay of packet i x(t) = number of packets in transit (in the system) at time t Sender 1 2 Receiver S= area x(t) T time Average occupancy = S/T 25
26 Little s Theorem Latest bit seen by time t 1 2 d(i) = delay of packet i x(t) = number of packets in transit (in the system) at time t Sender P S(N) S(N-1) d(n-1) Receiver x(t) S= area time T S = S(1) + S(2) + + S(N) = P*(d(1) + d(2) + + d(n)) 26
27 Little s Theorem Latest bit seen by time t 1 2 d(i) = delay of packet i x(t) = number of packets in transit (in the system) at time t Sender P S(N) S(N-1) d(n-1) Receiver x(t) S= area time Average occupancy T S/T = (P*(d(1) + d(2) + + d(n)))/t = ((P*N)/T) * ((d(1) + d(2) + + d(n))/n) Average arrival time Average delay 27
28 Little s Theorem 1 2 Latest bit seen by time t d(i) = delay of packet i x(t) = number of packets in transit (in the system) at time t Sender a(i) S(N) S(N-1) d(n-1) Receiver x(t) S= area time T Average occupancy = (average arrival rate) x (average delay) 28
29 Little s Theorem Summary The avg number of customers in a stable system over some time interval is equal to their average arrival rate multiplied by their average time in the system Independent of detailed probability distributions Applies to any system, regardless of the arrival time process or what the "system" looks like inside. No assumptions about the schedule of service - (in order or out of order) Applies to systems within systems Requirement: the system needs to be stable - Not in transition state, e.g., starting up or shutting down 29
30 Outline Motivations Timing diagrams Metrics Evaluation techniques 30
31 Evaluation Techniques Measurements - gather data from a real network - e.g., ping - realistic, specific Simulations: run a program that pretends to be a real network - e.g., NS network simulator, Nachos OS simulator Models, analysis - write some equations from which we can derive conclusions - general, may not be realistic Usually use combination of methods 31
32 Analysis Example: M/M/1 Queue: exponential inter-arrival and service time and a single server a s Arrivals are Poisson with rate a Service times are exponentially distributed with mean 1/s - s - rate at which packets depart from a full queue Average delay per packet: T = 1/(s a) = (1/a)/(1 u), where u = a/s = utilization Numerical example, 1/a = 1ms; u = 80% Q = 5ms 32
33 Simulation Model of traffic Model of routers, links Simulation: - Time driven: X(t) = state at time t X(t+1) = f(x(t), event at time t) - Event driven: E(n) = n-th event Y(n) = state after event n T(n) = time when even n occurs [Y(n+1), T(n+1)] = g(y(n), T(n), E(n)) Output analysis: estimates, confidence intervals 33
34 Evaluation: Putting Everything Together Reality Abstraction Plausibility Model Derivation Tractability Conclusion Prediction Realism Hypothesis Usually favor plausibility, tractability over realism - Better to have a few realistic conclusions than none (could not derive) or many conclusions that no one believes (not plausible) 34
Outline. EE 122: Networks Performance & Modeling. Outline. Motivations. Definitions. Timing Diagrams. Ion Stoica TAs: Junda Liu, DK Moon, David Zats
EE 122: Networks Performance & Modeling Ion Stoica As: Junda Liu, DK Moon, David Zats http://inst.eecs.berkeley.edu/~ee122/fa09 (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues at
More informationModels. Motivation Timing Diagrams Metrics Evaluation Techniques. TOC Models
Models Motivation Timing Diagrams Metrics Evaluation Techniques TOC Models Motivation Understanding Network Behavior Improving Protocols Verifying Correctness of Implementation Detecting Faults Choosing
More informationModels. One Packet. Timing. Illustration. Examples UCB. Models EECS 122. P bits. Motivation Timing Diagrams Metrics Evaluation Techniques
Motivation iming iagrams Metrics Evaluation echniques Motivation Understanding Network Behavior Improving Protocols Verifying Correctness of Implementation etecting Faults Choosing Provider Feasibility
More informationNetwork Performance: Queuing
Network Performance: Queuing EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson TAs: Dilip Antony Joseph and Sukun Kim http://inst.eecs.berkeley.edu/~ee122/ Materials
More informationNetwork Performance: Queuing
Network Performance: Queuing EE 122: Intro to Communication Networks Fall 2007 (WF 4-5:30 in Cory 277) Vern Paxson TAs: Lisa Fowler, Daniel Killebrew & Jorge Ortiz http://inst.eecs.berkeley.edu/~ee122/
More informationPage 1. Goals for Today" Discussion" Example: Reliable File Transfer" CS162 Operating Systems and Systems Programming Lecture 11
Goals for Today" CS162 Operating Systems and Systems Programming Lecture 11 Reliability, Transport Protocols" Finish e2e argument & fate sharing Transport: TCP/UDP Reliability Flow control October 5, 2011
More informationPacket Scheduling and QoS
Packet Scheduling and QoS EECS 489 Computer Networks http://www.eecs.umich.edu/~zmao/eecs489 Z. Morley Mao Thursday Oct 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1 Packet
More informationMidterm Review EECS 122. University of California Berkeley
Midterm Review EECS 122 University of California Berkeley Topics Network Architecture Network hierarchy Layering Performance Link Layer Ethernet Wi-Fi 2 Review: Network WAN MAN 3 Review: Network WAN MAN
More informationNetwork Management & Monitoring Network Delay
Network Management & Monitoring Network Delay These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/) End-to-end
More informationProblem-1: Solution-1:
Problem-1: olution-1: Tollbooths are 75 km apart, and the cars propagate at 100km/hr. A tollbooth services a car at a rate of one car every 12 seconds. a) There are ten cars. It takes seconds, or 2 minutes,
More informationHybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks
Hybrid Control and Switched Systems Lecture #17 Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Motivation Why model network traffic? to validate
More informationLecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren
Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren Lecture 21 Overview" How fast should a sending host transmit data? Not to fast, not to slow, just right Should not be faster than
More informationCS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: Answers SUNet ID: root @stanford.edu Check if you would like exam routed
More informationNetwork Management & Monitoring
Network Management & Monitoring Network Delay These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/) End-to-end
More informationLecture 5: Performance Analysis I
CS 6323 : Modeling and Inference Lecture 5: Performance Analysis I Prof. Gregory Provan Department of Computer Science University College Cork Slides: Based on M. Yin (Performability Analysis) Overview
More informationCongestion Control In the Network
Congestion Control In the Network Brighten Godfrey cs598pbg September 9 2010 Slides courtesy Ion Stoica with adaptation by Brighten Today Fair queueing XCP Announcements Problem: no isolation between flows
More informationL2: Bandwidth and Latency. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806
L2: Bandwidth and Latency Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 1 Acknowledgements Some pictures used in this presentation were obtained
More informationEnd-to-End Mechanisms for QoS Support in Wireless Networks
End-to-End Mechanisms for QoS Support in Wireless Networks R VS Torsten Braun joint work with Matthias Scheidegger, Marco Studer, Ruy de Oliveira Computer Networks and Distributed Systems Institute of
More informationTopics. TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput
Topics TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput 2 Introduction In this chapter we will discuss TCP s form of flow control called a sliding window protocol It allows
More informationA Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks. Motivation
A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks Stephan Bohacek João P. Hespanha Junsoo Lee Katia Obraczka University of Delaware University of Calif.
More informationInvestigating the Use of Synchronized Clocks in TCP Congestion Control
Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle (UNC-CH) November 16-17, 2001 Univ. of Maryland Symposium The Problem TCP Reno congestion control reacts only to packet
More informationMidterm Review. Topics. Review: Network. Review: Network. Layers & Protocols. Review: Network WAN. Midterm Review EECS 122 EECS 122
Topics Midterm Review EECS University of California Berkeley Network Architecture Network hierarchy Layering Performance Link Layer Ethernet Wi-Fi Network Layer Addressing Routing EECS Midterm Review Review:
More informationMidterm Review EECS 122. University of California Berkeley
Midterm Review EECS University of California Berkeley Topics Network Architecture Network hierarchy Layering Performance Link Layer Ethernet Wi-Fi Network Layer Addressing Routing EECS Midterm Review Review:
More informationComputer Networking
15-441 Computer Networking Lecture 17 TCP Performance & Future Eric Anderson Fall 2013 www.cs.cmu.edu/~prs/15-441-f13 Outline TCP modeling TCP details 2 TCP Performance Can TCP saturate a link? Congestion
More informationCS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007
CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 Question 344 Points 444 Points Score 1 10 10 2 10 10 3 20 20 4 20 10 5 20 20 6 20 10 7-20 Total: 100 100 Instructions: 1. Question
More informationTransport Layer PREPARED BY AHMED ABDEL-RAOUF
Transport Layer PREPARED BY AHMED ABDEL-RAOUF TCP Flow Control TCP Flow Control 32 bits source port # dest port # head len sequence number acknowledgement number not used U A P R S F checksum Receive window
More informationCS 3640: Introduction to Networks and Their Applications
CS 3640: Introduction to Networks and Their Applications Fall 2018, Lecture 5: The Link Layer I Errors and medium access Instructor: Rishab Nithyanand Teaching Assistant: Md. Kowsar Hossain 1 You should
More informationAnnouncements. Network Performance: Queuing. Goals of Today s Lecture. Window Scaling. Window Scaling, con t. Window Scaling, con t
Announcements Network Performance: Queuing Additional reading for today s lecture: Peterson & Davie 3.4 EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson As: Dilip
More informationETSF10 Internet Protocols Transport Layer Protocols
ETSF10 Internet Protocols Transport Layer Protocols 2012, Part 2, Lecture 2.1 Kaan Bür, Jens Andersson Transport Layer Protocols Process-to-process delivery [ed.4 ch.23.1] [ed.5 ch.24.1] Transmission Control
More informationcs/ee 143 Fall
cs/ee 143 Fall 2018 13 4 Internetworking 4.1 W&P, P6.1 (a) 2 points. How many IP addresses need to be leased from an ISP to support a DHCP server (with L ports) that uses NAT to service N clients at the
More informationWhy Your Application only Uses 10Mbps Even the Link is 1Gbps?
Why Your Application only Uses 10Mbps Even the Link is 1Gbps? Contents Introduction Background Information Overview of the Issue Bandwidth-Delay Product Verify Solution How to Tell Round Trip Time (RTT)
More informationCS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online
1 CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online Solutions 1. General Networking a. In traditional client-server communication using TCP, a new socket is created.
More informationECE 697J Advanced Topics in Computer Networks
ECE 697J Advanced Topics in Computer Networks Network Measurement 12/02/03 Tilman Wolf 1 Overview Lab 3 requires performance measurement Throughput Collecting of packet headers Network Measurement Active
More informationECE 610: Homework 4 Problems are taken from Kurose and Ross.
ECE 610: Homework 4 Problems are taken from Kurose and Ross. Problem 1: Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 248. Suppose
More informationc) With the selective repeat protocol, it is possible for the sender to receive an ACK for a packet that falls outside of its current window.
Part 1 Question 1 [0.5 Marks] Suppose an application generates chunks of 40 bytes of data every 20 msec, and each chunk gets encapsulated by a TCP segment and then an IP datagram. What percentage of each
More informationECEN Final Exam Fall Instructor: Srinivas Shakkottai
ECEN 424 - Final Exam Fall 2013 Instructor: Srinivas Shakkottai NAME: Problem maximum points your points Problem 1 10 Problem 2 10 Problem 3 20 Problem 4 20 Problem 5 20 Problem 6 20 total 100 1 2 Midterm
More informationComputer Networks - Midterm
Computer Networks - Midterm October 30, 2015 Duration: 2h15m This is a closed-book exam Please write your answers on these sheets in a readable way, in English or in French You can use extra sheets if
More informationCPSC 441 Tutorial-1. Department of Computer Science University of Calgary
CPSC 441 Tutorial-1 Department of Computer Science University of Calgary Question-1 A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the
More informationTCP so far Computer Networking Outline. How Was TCP Able to Evolve
TCP so far 15-441 15-441 Computer Networking 15-641 Lecture 14: TCP Performance & Future Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 Reliable byte stream protocol Connection establishments
More informationCS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: SUNet ID: @stanford.edu Check if you would like exam routed back via SCPD:
More informationCongestion Control in TCP
Congestion Control in TCP Antonio Carzaniga Faculty of Informatics University of Lugano May 6, 2005 Outline Intro to congestion control Input rate vs. output throughput Congestion window Congestion avoidance
More informationCongestion / Flow Control in TCP
Congestion and Flow Control in 1 Flow Control and Congestion Control Flow control Sender avoids overflow of receiver buffer Congestion control All senders avoid overflow of intermediate network buffers
More informationQ23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network?
CS368: Exercise 5 Q23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network? a) Stop_and_Wait b) Go-Back-N c) Selective-Repeat Q23-6.
More informationChapter III. congestion situation in Highspeed Networks
Chapter III Proposed model for improving the congestion situation in Highspeed Networks TCP has been the most used transport protocol for the Internet for over two decades. The scale of the Internet and
More informationBAMA Simulator. (Bandwidth Measurement Algorithms)
BAMA Simulator (Bandwidth Measurement Algorithms) By A.K.Aggarwal Jun Wei University of Windsor School of Computer Science Technical Report # 04-003 University of Windsor Windsor, Ontario Canada 2003 Abstract
More informationReliable Transport I: Concepts and TCP Protocol
Reliable Transport I: Concepts and TCP Protocol Brad Karp UCL Computer Science CS 3035/GZ01 29 th October 2013 Part I: Transport Concepts Layering context Transport goals Transport mechanisms 2 Context:
More informationLecture 6. TCP services. Internet Transport Layer: introduction to the Transport Control Protocol (TCP) A MUCH more complex transport
Lecture 6. Internet Transport Layer: introduction to the Transport ontrol Protocol (TP) RF 793 (estensioni RF 1122,1323,2018,2581,working group tsvwg) A MUH more complex transport for three main reasons
More informationPLEASE READ CAREFULLY BEFORE YOU START
MIDTERM EXAMINATION #2 NETWORKING CONCEPTS 03-60-367-01 U N I V E R S I T Y O F W I N D S O R - S c h o o l o f C o m p u t e r S c i e n c e Fall 2011 Question Paper NOTE: Students may take this question
More informationComputer Networks. Homework #4: No Grading
Computer Networks Homework #4: No Grading Problem #1. Assume you need to write and test a client-server application program on two hosts you have at home. a. What is the range of port numbers you would
More informationETSN01 Exam Solutions
ETSN01 Exam Solutions March 014 Question 1 (a) See p17 of the cellular systems slides for a diagram and the full procedure. The main points here were that the HLR needs to be queried to determine the location
More informationCover sheet for Assignment 3
Faculty of Arts and Science University of Toronto CSC 358 - Introduction to Computer Networks, Winter 2018, LEC0101 Cover sheet for Assignment 3 Due Monday March 5, 10:00am. Complete this page and attach
More informationOne More Bit Is Enough
One More Bit Is Enough Yong Xia, RPI Lakshmi Subramanian, UCB Ion Stoica, UCB Shiv Kalyanaraman, RPI SIGCOMM 05, Philadelphia, PA 08 / 23 / 2005 Motivation #1: TCP doesn t work well in high b/w or delay
More informationThere are 10 questions in total. Please write your SID on each page.
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 to the Final: 5/20/2005 There are 10 questions in total. Please write
More informationHomework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca
CSCI 1680 Computer Networks Fonseca Homework 1 Due: 27 September 2012, 4pm Question 1 - Layering a. Why are networked systems layered? What are the advantages of layering? Are there any disadvantages?
More informationAnnouncements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani:
Announcements TAs office hours: Mohamed Grissa: grissam@oregonstate.edu Tuesday: 4-5 Friday: 11-12 Mohamed Alkalbani: alkalbmo@oregonstate.edu Wednesday: 11-12 Thursday: 11-12 Lecture slides: Will be posted
More informationThe Effects of Asymmetry on TCP Performance
The Effects of Asymmetry on TCP Performance Hari Balakrishnan Venkata N. Padmanabhan Randy H. Katz University of California at Berkeley Daedalus/BARWAN Retreat June 1997 Outline Overview Bandwidth asymmetry
More informationHandles all kinds of traffic on a single network with one class
Handles all kinds of traffic on a single network with one class No priorities, no reservations required Quality? Throw bandwidth at the problem, hope for the best 1000x increase in bandwidth over 2 decades
More informationADVANCED TOPICS FOR CONGESTION CONTROL
ADVANCED TOPICS FOR CONGESTION CONTROL Congestion Control The Internet only functions because TCP s congestion control does an effective job of matching traffic demand to available capacity. TCP s Window
More informationCS 268: Lecture 7 (Beyond TCP Congestion Control)
Outline CS 68: Lecture 7 (Beyond TCP Congestion Control) TCP-Friendly Rate Control (TFRC) explicit Control Protocol Ion Stoica Computer Science Division Department of Electrical Engineering and Computer
More informationTCP Congestion Control : Computer Networking. Introduction to TCP. Key Things You Should Know Already. Congestion Control RED
TCP Congestion Control 15-744: Computer Networking L-4 TCP Congestion Control RED Assigned Reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [TFRC] Equation-Based Congestion Control
More informationMidterm Review. EECS 489 Computer Networks Z. Morley Mao Monday Feb 19, 2007
Midterm Review EECS 489 Computer Networks http://www.eecs.umich.edu/courses/eecs489/w07 Z. Morley Mao Monday Feb 19, 2007 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1 Adminstrivia
More informationOutline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste
Outline 15-441 Computer Networking Lecture 18 TCP Performance Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 TCP congestion avoidance TCP slow start TCP modeling TCP details 2 AIMD Distributed,
More informationProblem Set Name the 7 OSI layers and give the corresponding functionalities for each layer.
Problem Set 1 1. Why do we use layering in computer networks? 2. Name the 7 OSI layers and give the corresponding functionalities for each layer. 3. Compare the network performance of the 3 Multiple Access
More informationOverview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers
Overview 15-441 Computer Networking TCP & router queuing Lecture 10 TCP & Routers TCP details Workloads Lecture 10: 09-30-2002 2 TCP Performance TCP Performance Can TCP saturate a link? Congestion control
More informationLecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren
Lecture 22: Buffering & Scheduling CSE 123: Computer Networks Alex C. Snoeren Lecture 23 Overview Buffer Management FIFO RED Traffic Policing/Scheduling 2 Key Router Challenges Buffer management: which
More information! Network bandwidth shared by all users! Given routing, how to allocate bandwidth. " efficiency " fairness " stability. !
Motivation Network Congestion Control EL 933, Class10 Yong Liu 11/22/2005! Network bandwidth shared by all users! Given routing, how to allocate bandwidth efficiency fairness stability! Challenges distributed/selfish/uncooperative
More informationBandwidth Allocation & TCP
Bandwidth Allocation & TCP The Transport Layer Focus Application Presentation How do we share bandwidth? Session Topics Transport Network Congestion control & fairness Data Link TCP Additive Increase/Multiplicative
More informationETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control
ETSF05/ETSF10 Internet Protocols Performance & QoS Congestion Control Quality of Service (QoS) Maintaining a functioning network Meeting applications demands User s demands = QoE (Quality of Experience)
More informationCS519: Computer Networks. Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control
: Computer Networks Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control TCP performance We ve seen how TCP the protocol works Sequencing, receive window, connection setup and teardown And
More informationOutline. Computer Communication and Networks. The Network Core. Components of the Internet. The Network Core Packet Switching Circuit Switching
Outline Computer Communication and Networks 1 Department of Computer Science & Information Technology University of Balochistan Lecture 03 1/26 2/26 Two major components The mesh of packet switches and
More informationImplementing stable TCP variants
Implementing stable TCP variants IPAM Workshop on Large Scale Communications Networks April 2002 Tom Kelly ctk21@cam.ac.uk Laboratory for Communication Engineering University of Cambridge Implementing
More informationChapter I: Introduction
Chapter I: Introduction UG3 Computer Communications & Networks (COMN) Myungjin Lee myungjin.lee@ed.ac.uk Slides copyright of Kurose and Ross The work core mesh of interconnected routers packet-switching:
More informationTop-Down Network Design
Top-Down Network Design Chapter Two Analyzing Technical Goals and Tradeoffs Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Technical Goals Scalability Availability Performance Security Manageability
More informationCS 3640: Introduction to Networks and Their Applications
CS 3640: Introduction to Networks and Their Applications Fall 2018, Lecture 4: Packet switching performance metrics Instructor: Rishab Nithyanand Teaching Assistant: Md. Kowsar Hossain 1 You should Be
More informationDepartment of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005 There are 10 questions in total. Please write your SID
More informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 14 Congestion Control Some images courtesy David Wetherall Animations by Nick McKeown and Guido Appenzeller The bad news and the good news The bad news: new
More information2.993: Principles of Internet Computing Quiz 1. Network
2.993: Principles of Internet Computing Quiz 1 2 3:30 pm, March 18 Spring 1999 Host A Host B Network 1. TCP Flow Control Hosts A, at MIT, and B, at Stanford are communicating to each other via links connected
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks George Porter Thanks: Amin Vahdat, Dina Katabi and Alex C. Snoeren Lecture 14 Overview" TCP congestion control review Dukkipati
More informationCommunication Networks
Communication Networks Spring 2018 Laurent Vanbever nsg.ee.ethz.ch ETH Zürich (D-ITET) April 30 2018 Materials inspired from Scott Shenker & Jennifer Rexford Last week on Communication Networks We started
More informationNET ID. CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17
CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17 Q1. 2 points Write your NET ID at the top of every page of this test. Q2. X points Name 3 advantages of a circuit network
More informationestadium Project Lab 2: Iperf Command
estadium Project Lab 2: Iperf Command Objectives Being familiar with the command iperf. In this Lab, we will set up two computers (PC1 and PC2) as an ad-hoc network and use the command iperf to measure
More informationFirst Exam for ECE671 Spring /22/18
ECE67: First Exam First Exam for ECE67 Spring 208 02/22/8 Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 75 minutes to complete the exam. Be a
More informationInternetwork. recursive definition point-to-point and multi-access: internetwork. composition of one or more internetworks
Internetwork A B E C D recursive definition point-to-point and multi-access: internetwork composition of one or more internetworks Additional complications to deal with: addressing necessary LAN addresses
More informationTS Open Day Data Center Fibre Channel over IP
TS Open Day Data Center Fibre Channel over IP Presented by: Rong Cheng- TAC LAN & DCN China Jan 30 th, 2015 2013 Cisco and/or its affiliates. All rights reserved. 1 FCIP Introduction FCIP Configuration
More informationCSCI-1680 Transport Layer III Congestion Control Strikes Back Rodrigo Fonseca
CSCI-1680 Transport Layer III Congestion Control Strikes Back Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti, Ion Stoica Last Time Flow Control Congestion Control
More informationWireless Internet Routing. Learning from Deployments Link Metrics
Wireless Internet Routing Learning from Deployments Link Metrics 1 Learning From Deployments Early worked focused traditional routing issues o Control plane: topology management, neighbor discovery o Data
More informationCOM-208: Computer Networks - Homework 1
COM-208: Computer Networks - Homework 1 1. Design an application-level protocol to be used between an TM (automatic teller machine) and a bank s centralized server. The protocol should allow: verifying
More informationPLEASE READ CAREFULLY BEFORE YOU START
Page 1 of 20 MIDTERM EXAMINATION #1 - B COMPUTER NETWORKS : 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Fall 2008-75 minutes This examination document
More informationPLEASE READ CAREFULLY BEFORE YOU START
Page 1 of 20 MIDTERM EXAMINATION #1 - A COMPUTER NETWORKS : 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Fall 2008-75 minutes This examination document
More informationAdvanced Computer Networks
Advanced Computer Networks Congestion control in TCP Contents Principles TCP congestion control states Congestion Fast Recovery TCP friendly applications Prof. Andrzej Duda duda@imag.fr http://duda.imag.fr
More informationCSE 123b Communications Software
CSE 123b Communications Software Spring 2002 Lecture 10: Quality of Service Stefan Savage Today s class: Quality of Service What s wrong with Best Effort service? What kinds of service do applications
More informationNetwork Layer Enhancements
Network Layer Enhancements EECS 122: Lecture 14 Department of Electrical Engineering and Computer Sciences University of California Berkeley Today We have studied the network layer mechanisms that enable
More informationLecture 24: Scheduling and QoS
Lecture 24: Scheduling and QoS CSE 123: Computer Networks Alex C. Snoeren HW 4 due Wednesday Lecture 24 Overview Scheduling (Weighted) Fair Queuing Quality of Service basics Integrated Services Differentiated
More informationEpisode 5. Scheduling and Traffic Management
Episode 5. Scheduling and Traffic Management Part 3 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Amin Vahdat, Dina Katabi Lecture 14 Overview" TCP congestion control review XCP Overview 2 Congestion Control
More informationDirect Link Communication I: Basic Techniques. Data Transmission. ignore carrier frequency, coding etc.
Direct Link Communication I: Basic Techniques Link speed unit: bps abstraction Data Transmission ignore carrier frequency, coding etc. Point-to-point link: wired or wireless includes broadcast case Interested
More informationThe War Between Mice and Elephants
The War Between Mice and Elephants Liang Guo and Ibrahim Matta Computer Science Department Boston University 9th IEEE International Conference on Network Protocols (ICNP),, Riverside, CA, November 2001.
More informationAn Approach to Flexible QoS Routing with Active Networks
U Innsbruck Informatik - 1 An Approach to Flexible QoS Routing with Active Networks Michael Welzl Alfred Cihal Max Mühlhäuser Leopold Franzens University Innsbruck Johannes Kepler University Linz TU Darmstadt
More informationAppendix B. Standards-Track TCP Evaluation
215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More information