Project-2 (20%) – DiffServ and TCP Congestion Control

Slides:

Advertisements

Similar presentations

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.

Advertisements

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.

By Arjuna Sathiaseelan Tomasz Radzik Department of Computer Science King’s College London EPDN: Explicit Packet Drop Notification and its uses.

Practice Questions: Congestion Control and Queuing

Leon-Garcia & Widjaja: Communication Networks Copyright ©2000 The McGraw Hill Companies A Little More on Chapter 7 And Start Chapter 8 TCP/IP.

XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.

School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.

“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.

Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.

Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.

Networks: Congestion Control1 Congestion Control.

Improving Adaptability and Fairness in Internet Congestion Control May 30, 2001 Seungwan Ryu PhD Student of IE Department University at Buffalo.

High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.

1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.

1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)

1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #8 Explicit Congestion Notification (RFC 3168) Limited Transmit.

Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Rigorous fair Queueing requires per flow state: too costly in high speed core routers.

Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin

Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Fair Queueing requires per flow state: too costly in high speed core routers Yet, some.

TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.

A Simulation of Adaptive Packet Size in TCP Congestion Control Zohreh Jabbari.

Network Technologies essentials Week 8: TCP congestion control Compilation made by Tim Moors, UNSW Australia Original slides by David Wetherall, University.

Queuing and Queue Management Reading: Sections 6.2, 6.4, 6.5 COS 461: Computer Networks Spring 2011 Mike Freedman

Link Scheduling & Queuing COS 461: Computer Networks

Distance-Dependent RED Policy (DDRED)‏ Sébastien LINCK, Eugen Dedu and François Spies LIFC Montbéliard - France ICN07.

Congestion Control - Supplementary Slides are adapted on Jean Walrand’s Slides.

27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.

CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.

1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:

1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.

Internet Networking recitation #11

1 CSE 5346 Spring Network Simulator Project.

TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.

Queue Management Mike Freedman COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101

DMET 602: Networks and Media Lab Amr El Mougy Yasmeen EssamAlaa Tarek.

Streaming Video over TCP with Receiver-based Delay Control

Low-Latency Software Rate Limiters for Cloud Networks

Window Control Adjust transmission rate by changing Window Size

TCP Selective Acknowledgement Options

DMET 602: Networks and Media Lab

Internet Networking recitation #9

Topics discussed in this section:

Chapter 3 outline 3.1 transport-layer services

Introduction to Congestion Control

Congestion Control and AQM

Chapter 6 Congestion Avoidance

Introduction to ns-2: “The” Network Simulator

Generalizing The Network Performance Interference Problem

Experimental Networking (ECSE 4963)

Net 221D : Computer Networks Fundamentals

Understanding Throughput & TCP Windows

Queuing and Queue Management

PUSH Flag A notification from the sender to the receiver to pass all the data the receiver has to the receiving application. Some implementations of TCP.

Other Methods of Dealing with Congestion

Title: An Adaptive Queue Management Method for Congestion Avoidance in TCP/IP Networks Presented By: Frank Posluszny Vishal Phirke Matt Hartling 12/31/2018.

COS 461: Computer Networks

EE 122: Lecture 18 (Differentiated Services)

Internet Networking recitation #10

If both sources send full windows, we may get congestion collapse

COMP/ELEC 429/556 Fall 2017 Homework #2

Congestion Control Reasons:

EE 122: Differentiated Services

Congestion Control in TCP

Transport Layer: Congestion Control

Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented by:

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.

Designing a Relative Delay Estimator for Multipath Transport

Presentation transcript:

Project-2 (20%) – DiffServ and TCP Congestion Control Computer Networks Project-2 (20%) – DiffServ and TCP Congestion Control Use NS-3 Simulator to setup five TCP flows (A to A, B to B, etc.) in the above parking-lot configuration. Each physical link is assumed to have data rate of 10 Mbps, and each link has propagation delay 100 us. Assume A, B, C, D, and E generate Poisson traffic, respectively. Each TCP flow has (1) Mean packet generation rate = 2 Mbps. (2) Max IP packet length = 1400 bytes. (3) Queuing discipline in routers: FIFO with Drop Tail. (4) Buffer size = adjustable up to 5 packets. ECN: Once congestion occurs in a router, the ECN field in IP header is set. The ECE (ECN Echo) bit in TCP header is set by the receiver on every ACK packet until the CWR flag is received. A A A B R1 R2 R3 R4 R5 C B D C D E E

TCP Parameters: (1) TCP-Reno is employed. (2) Max. Segment Size (MSS) = 1000 bytes. (3) Segment Processing Time = 1 msec. (4) Receiver’s Window Size = 20 Segments. (5) Enable Slow Start: Initial cwnd = 1 Segment. In the Simulation: (1) (10%) Show the buffer occupancy (i.e., queue length) for every router vs simulation time. (2) (10%) Show the throughput (Mbps) for every TCP flow vs router buffer size. (3) (10%) Show the variations of cwnd for every TCP flow vs simulation time. (4) (10%) Show packet loss rate in every router by assuming router’s buffer size = 1 packet. (5) (10%) Assume RED is enabled. Discuss on the improvements with and without enabling RED. Assume buffer size = 4 packets. Set up THmin = 1 packet and TH max = 3 packets. Due Day: Demo (50%) on Dec. 26-29, 2018. Report (50%) due by 9:00pm on Jan. 2, 2019. Deliverable Results: (1) Demo at Lab. (2) A 15-page report including discussions and all the figures. Where to download NS-3 Simulator: 140.117.164.20/pub/CN/proj (User ID: anonymous)