UCB Review for M2 Jean Walrand U.C. Berkeley www.eecs.berkeley.edu/~wlr.

Slides:



Advertisements
Similar presentations
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
Advertisements

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
TCP Vegas: New Techniques for Congestion Detection and Control.
Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
CS 408 Computer Networks Congestion Control (from Chapter 05)
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
Chapter 3 Transport Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 12.
Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.
UCB Review – EECS228a Jean Walrand U.C. Berkeley
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
CS215 TCP Westwood Control Model Development and Stability Analysis Hu, Kunzhong Dong, Haibo Mentor: Wang, Ren Professor:
Lecture 8 Congestion Control EECS 122 University of California Berkeley.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
Week 9 TCP9-1 Week 9 TCP 3 outline r 3.5 Connection-oriented transport: TCP m segment structure m reliable data transfer m flow control m connection management.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
UCB Error Control in TCP Jean Walrand U.C. Berkeley
UCB Sharing a Channel Jean Walrand U.C. Berkeley
Computer Networks : TCP Congestion Control1 TCP Congestion Control.
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.
UCB Review - EECS122 Jean Walrand U.C. Berkeley
Data Communication and Networks
Congestion Avoidance and Control CSCI 780, Fall 2005.
Networks : TCP Congestion Control1 TCP Congestion Control.
Networks : TCP Congestion Control1 TCP Congestion Control Presented by Bob Kinicki.
TCP in Heterogeneous Network Md. Ehtesamul Haque # P.
UCB TCP Jean Walrand U.C. Berkeley
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
Transport Layer 4 2: Transport Layer 4.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!
B 李奕德.  Abstract  Intro  ECN in DCTCP  TDCTCP  Performance evaluation  conclusion.
EE 122: Congestion Control and Avoidance Kevin Lai October 23, 2002.
Transmission Control Protocol TCP Part 2 University of Glamorgan Networked & Distributed Systems.
An introduction to TCP and its modeling By: Amin PourRostami.
What is TCP? Connection-oriented reliable transfer Stream paradigm
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
Computer Networking Lecture 18 – More TCP & Congestion Control.
TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.
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.
Spring 2009CSE Congestion Control Outline Resource Allocation Queuing TCP Congestion Control.
 Last Class  This Class  Chapter 6.3. ~ 6.4.  TCP congestion control.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
Advance Computer Networks Lecture#09 & 10 Instructor: Engr. Muhammad Mateen Yaqoob.
1 Advanced Transport Protocol Design Nguyen Multimedia Communications Laboratory March 23, 2005.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Topics discussed in this section:
Chapter 3 outline 3.1 transport-layer services
The Transport Layer (TCP)
Chapter 6 TCP Congestion Control
COMP 431 Internet Services & Protocols
Congestion Control.
Chapter 3 outline 3.1 Transport-layer services
So far, On the networking side, we looked at mechanisms to links hosts using direct linked networks and then forming a network of these networks. We introduced.
The University of Adelaide, School of Computer Science
Congestion Control (from Chapter 05)
Chapter 6 TCP Congestion Control
Congestion Control (from Chapter 05)
TCP Throughput Modeling
CS4470 Computer Networking Protocols
Congestion Control Reasons:
TCP Congestion Control
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Transport Layer: Congestion Control
Chapter 3 outline 3.1 Transport-layer services
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Presentation transcript:

UCB Review for M2 Jean Walrand U.C. Berkeley

UCB Outline TCP Multiple Access Switches Performance Models

UCB TCP Go Back N Numbering of ACKs Flow Control: Receiver-Advertised Window Slow Start – Congestion Avoidance RTT and timeout estimation Additive Increase – Multiplicative Decrease Justification: Try to be fair and efficient Improvements Fast Retransmit Fast Recovery

UCB Multiple Access TDM, FDM, CDMA Understand pros and cons Aloha Throughput, Delay Calculations Reservation Aloha Throughput, Delay Calculations

UCB Switches Input, Output, VOB, Shared, Modular Understand Operations Pros and Cons

UCB Performance Models Basic Queuing Model: M/M/1 Poisson arrivals, Exponential lengths P(X = n), E(X), E(T) Network of M/M/1 Queues Each queue has same occupancy distribution as if it were M/M/1 with arrival rate given by flow conservation equations E(X k ) E(T)