COMP/ELEC 429/556 Fall 2017 Homework #2

Slides:



Advertisements
Similar presentations
Transport Layer – TCP (Part2) Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Advertisements

Transmission Control Protocol (TCP)
ECE 4450:427/527 - Computer Networks Spring 2015
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
1 Lecture 10: TCP Performance Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3 slides for.
Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Third Ed.,Peterson.
CSEE W4140 Networking Laboratory Lecture 7: TCP flow control and congestion control Jong Yul Kim
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
Computer Networks : TCP Congestion Control1 TCP Congestion Control.
Networks : TCP Congestion Control1 TCP Congestion Control.
Advanced Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Fourth.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Lect3..ppt - 09/12/04 CIS 4100 Systems Performance and Evaluation Lecture 3 by Zornitza Genova Prodanoff.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Transport Layer 4 2: Transport Layer 4.
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.
Chapter 12 Transmission Control Protocol (TCP)
1 COMP/ELEC 429/556 Fall 2015 Homework #1 Name: _________________________ _________________________ Student ID: _____________________ Assigned 9/24/2015.
Transport Layer3-1 Announcements r Collect homework r New homework: m Ch3#3,4,7,10,12,16,18-20,25,26,31,33,37 m Due Wed Sep 24 r Reminder: m Project #1.
1 TCP - Part II Relates to Lab 5. This is an extended module that covers TCP data transport, and flow control, congestion control, and error control in.
Transport Layer3-1 TCP throughput r What’s the average throughout of TCP as a function of window size and RTT? m Ignore slow start r Let W be the window.
Lecture 9 – More TCP & Congestion Control
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.
TCP. TCP ACK generation [RFC 1122, RFC 2581] Event at Receiver Arrival of in-order segment with expected seq #. All data up to expected seq # already.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
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.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
Transmission Control Protocol (TCP) Retransmission and Time-Out
CS450 – Introduction to Networking Lecture 19 – Congestion Control (2)
Topics discussed in this section:
Approaches towards congestion control
Satellite TCP Lecture 19 04/10/02.
Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Introduction to Congestion Control
Chapter 3 outline 3.1 Transport-layer services
TCP Congestion Control
Introduction of Transport Protocols
TCP, XCP and Fair Queueing
Precept 2: TCP Congestion Control Review
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
TCP.
COMP/ELEC 429/556 Introduction to Computer Networks
ECE 4450:427/527 - Computer Networks Spring 2017
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.
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.
The University of Adelaide, School of Computer Science
Congestion Control (from Chapter 05)
Computer Science Division
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
COMP/ELEC 429/556 Fall 2017 Homework #1
CS4470 Computer Networking Protocols
Congestion Control Reasons:
CSE 4213: Computer Networks II
Congestion Control in TCP
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)
Subnets in TCP/IP Networks © N. Ganesan, Ph.D.
Congestion Control (from Chapter 05)
TCP continued.
Fair Queueing.
Presentation transcript:

COMP/ELEC 429/556 Fall 2017 Homework #2 Assigned 11/16/2017 Due 11/28/2017 11:55pm Submit Electronically to Canvas (Hard deadline, no slip day may be used) This homework is worth 10% of your final grade IMPORTANT: To be completed by each student individually. See syllabus for policy details. Type set your responses either in the space provided in this document or in a separate document. No hand-written responses will be accepted. Name: _________________________ Email: _________________________ Student ID: _____________________ Notations: K=1,000, M=1,000,000, G=1,000,000,000, 1 byte (B) = 8 bits (b).

Problem 1 (15 points) Given the following intra-domain routing table and inter-domain routing table at a router, construct the final routing table for all destination networks learned. Your final routing table should have three columns: Address Pattern, CIDR Mask, and Next Hop. Intra-domain routing table Address Pattern CIDR Mask Next Hop 128.42.222.3 255.255.255.0 R1 128.42.128.4 255.255.128.0 R2 18.0.0.0 255.0.0.0 R4 128.42.127.3 255.255.248.0 R6 128.42.216.0 R5 255.255.0.0 R3 Inter-domain routing table Address Pattern CIDR Mask BGP Next Hop 128.2.111.0 255.255.255.0 128.42.60.1 12.222.128.0 255.255.128.0 18.111.12.1 133.0.0.0 255.0.0.0 128.42.120.32 36.33.88.0 255.255.248.0 128.42.226.4 73.128.222.0 128.42.124.45 55.34.0.0 255.255.0.0 128.42.220.121

Problem 2 (15 points): Consider the following window based congestion control algorithm: When no congestion is detected, the sender’s window size cwnd is increased by 5 units every round trip time, i.e. cwnd = cwnd + 5. When congestion is detected, the sender’s window size is decreased by a third, i.e. cwnd = 2*cwnd/3. Suppose two traffic flows A and B compete for bandwidth at a bottleneck link with capacity C using the above congestion control algorithm. Assume flow A and B have the same round-trip time. Assume also that initially, B is allocated 50% of the bottleneck bandwidth (i.e. 0.5C) and A is allocated nothing. Complete the following flow bandwidth allocation diagram to show the evolution of the bandwidth allocations for A and B, and use it to argue whether flow A and B will eventually share the bottleneck bandwidth fairly. C Bandwidth of A 0.5C C Bandwidth of B

Congestion window size Problem 3 (25 points) Below is a graph showing the congestion window size of a TCP Reno connection over time. 4 points have been labeled below from A to D. Explain what happened to the TCP Reno connection at each of the labeled points in the graph to cause the abrupt transition at that labeled point, and explain the corresponding actions taken by TCP Reno. Receiver advertised window size A B D Congestion window size C Time

Problem 4 (20 points): Host A is transferring a file of size L to host B using a TCP connection. Host A sends the file data in fixed size segments (or packets) equal to the Maximum Segment Size (MSS), a predetermined value, which gives the maximum number of data bytes that can be sent in a TCP segment. Host B sends an acknowledgement immediately upon receiving a data segment. Let R be the round trip delay between A and B. The transmission delay to send a data segment is T. Assume R to be larger than 5*T. Assume the transmission delay to send an acknowledgement is negligible. The advertised receiver window size of host B is W. In this problem, we are only concerned with the data transmission phase of TCP. We assume the TCP connection is already established. TCP performs the slow start and congestion avoidance mechanisms accordingly. There is no error or packet loss during transmission. Given W = 2*MSS, L = 12*MSS, how long does it take for the file to be sent and acknowledged? (15 points) Given W = 3*MSS, L = 12*MSS, how long does it take for the file to be sent and acknowledged? (5 points)

Problem 5 (25 points): Suppose two flows A and B are arriving at a weighted fair queuing (WFQ) scheduler. For simplicity, the link capacity is 10 bits per second. The two flows have equal weight of 1. The arrival times and packet sizes are shown in the tables below. Compute the real start time and the real finish time of every packet in the fluid flow system. You may draw a fluid flow system picture to help illustrate your answers. (10 points) Write down the packet transmission order in the actual packet system. Use the notation “A.1” to denote the first packet of flow A. Explicitly indicate when multiple packets’ transmission order is interchangeable. (5 points) Flow A Flow B Packet # Arrival time (second) Pkt size (bits) 1 5 2 3 10 4 6 Packet # Arrival time (second) Pkt size (bits) 1 5 2 0.5 10 3 4

Recall that the system virtual time V(t) is the number of rounds of service the WFQ scheduler has given at time t. V(0) = 0. One round of service is provided when 1 bit of service is given to every flow that has traffic to send. When a packet of flow A arrives at the system at time t, its virtual start time is either the current system virtual time V(t) or the virtual finish time of the previous packet in flow A, whichever is larger. For this problem, the virtual finish time of a packet is its virtual start time plus the packet’s size in bits since flow weights are 1. Compute the virtual start time and the virtual finish time of every packet in the system. (10 points)