Review Questions for Midterm Exam-2 Fall 2016

Similar documents
Transport Layer PREPARED BY AHMED ABDEL-RAOUF

Homework 3 50 points. 1. Computing TCP's RTT and timeout values (10 points)

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class

Flow and Congestion Control (Hosts)

ECE 610: Homework 4 Problems are taken from Kurose and Ross.

a) Adding the two bytes gives Taking the one s complement gives

Mid Term Exam Results

Transport Protocols and TCP

Chapter 3 Review Questions

Fall 2012: FCM 708 Bridge Foundation I

(ii). o IP datagram packet is payload of a TCP segment o TCP segment is payload of an IP datagram. (iii).

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class

Chapter 3 outline. 3.5 Connection-oriented transport: TCP. 3.6 Principles of congestion control 3.7 TCP congestion control

TCP Congestion Control

Lecture 8. TCP/IP Transport Layer (2)

Outline. TCP: Overview RFCs: 793, 1122, 1323, 2018, Development of reliable protocol Sliding window protocols

CS 43: Computer Networks. 19: TCP Flow and Congestion Control October 31, Nov 2, 2018

Computer Communication Networks Midterm Review

Flow and Congestion Control Marcos Vieira

Outline. TCP: Overview RFCs: 793, 1122, 1323, 2018, steam: r Development of reliable protocol r Sliding window protocols

Chapter 3- parte B outline

CSCI Topics: Internet Programming Fall 2008

ECE 461 Internetworking. Problem Sheet 6

c) 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.

CS Lecture 1 Review of Basic Protocols

Correcting mistakes. TCP: Overview RFCs: 793, 1122, 1323, 2018, TCP seq. # s and ACKs. GBN in action. TCP segment structure

Transport Layer Congestion Control

Computer Networks. Homework #4: No Grading

Department of Computer and IT Engineering University of Kurdistan. Transport Layer. By: Dr. Alireza Abdollahpouri

CSC 8560 Computer Networks: TCP

CS321: Computer Networks Error and Flow Control in TCP

11/24/2009. Fundamentals of Computer Networks ECE 478/578. Flow Control in TCP

End-to-End Protocols. Transport Protocols. User Datagram Protocol (UDP) Application Layer Expectations

CSC 4900 Computer Networks: TCP

Transmission Control Protocol. ITS 413 Internet Technologies and Applications

CSCI Topics: Internet Programming Fall 2008

CC451 Computer Networks

CS 421: COMPUTER NETWORKS SPRING FINAL May 24, minutes. Name: Student No: TOT

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012

Computer Networks Spring 2017 Homework 2 Due by 3/2/2017, 10:30am

TCP. Second phase of the project. Connection management. Flow control and congestion. Emphasizing on the followings: Three parameters: At any time

CS321: Computer Networks Congestion Control in TCP

TCP congestion control:

Topics. TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput

TCP Congestion Control

TCP Congestion Control

Lecture 08: The Transport Layer (Part 2) The Transport Layer Protocol (TCP) Dr. Anis Koubaa

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?

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes

Student ID: CS457: Computer Networking Date: 3/20/2007 Name:

Transport layer. UDP: User Datagram Protocol [RFC 768] Review principles: Instantiation in the Internet UDP TCP

TCP Review. CS144 Review Session 4 April 25, 2008 Ben Nham

Transport layer. Review principles: Instantiation in the Internet UDP TCP. Reliable data transfer Flow control Congestion control

Lecture 15: Transport Layer Congestion Control

32 bits. source port # dest port # sequence number acknowledgement number not used. checksum. Options (variable length)

TCP. 1 Administrivia. Tom Kelliher, CS 325. Apr. 2, Announcements. Assignment. Read From Last Time

Chapter 3: Transport Layer

CS3600 SYSTEMS AND NETWORKS

CS450 Introduc0on to Networking Lecture 14 TCP. Phu Phung Feb 13, 2015

TCP: Transmission Control Protocol UDP: User Datagram Protocol TCP - 1

CS 421: COMPUTER NETWORKS FALL FINAL January 10, minutes

Review problems (for no credit): Transport and Network Layer

CSCD 330 Network Programming Winter 2015

CS4700/CS5700 Fundamentals of Computer Networks

Chapter III: Transport Layer

FINAL May 21, minutes

CS 421: COMPUTER NETWORKS FALL FINAL January 12, minutes

Chapter 3 Transport Layer

The Transport Layer: TCP & Congestion Control

CSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012

LECTURE 3 - TRANSPORT LAYER

Congestion Control. Principles of Congestion Control. Network-assisted Congestion Control: ATM. Congestion Control. Computer Networks 10/21/2009

CSCI-1680 Transport Layer II Data over TCP Rodrigo Fonseca

Computer Networking Introduction

cs/ee 143 Communication Networks

Answers to Sample Questions on Transport Layer

Routers. Session 12 INST 346 Technologies, Infrastructure and Architecture

Congestion Control in TCP

15-441: Computer Networks Homework 3

The aim of this unit is to review the main concepts related to TCP and UDP transport protocols, as well as application protocols. These concepts are

CSCD 330 Network Programming

TCP: Overview RFCs: 793,1122,1323, 2018, 2581

ECE 333: Introduction to Communication Networks Fall 2001

Congestion Control. Principles of Congestion Control. Network assisted congestion. Asynchronous Transfer Mode. Computer Networks 10/23/2013

Chapter 3 Transport Layer

Our goals: understand d principles. behind transport layer protocols in the. Internet: layer services:

CSE 422 Jeopardy. Sockets TCP/UDP IP Routing Link $100 $200 $300 $400. Sockets - $100

Congestion Control in TCP

Congestion Control 3/16/09

CS Transport. Outline. Window Flow Control. Window Flow Control

CMPSCI 453 Fall Midterm 10/26/2008

Section #6 Handout. B has processed this packet and updated its position of its sliding window. Everything is in terms of bytes.

Chapter III: Transport Layer

Computer Communication Networks Midterm Review

TCP Congestion Control. Lecture 16. Outline. TCP Congestion Control. Additive Increase / Multiplicative Decrease (AIMD)

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 10

Transport Layer: outline

Computer Networking: A Top Down Approach

Transport Over IP. CSCI 690 Michael Hutt New York Institute of Technology

Problem Set 7 Due: Start of Class, November 2

Transcription:

Review Questions for Midterm Exam-2 Fall 2016 1. (Reference Page 340 of textbook) Which of the following statement is true? a. All hosts on the same subnet are configured with the same subnet mask. b. Each host has its own distinct mask 2. (Reference page 345-348 of textbook) Which of the following is true for a DHCP discover message sent to the DHCP server? The source IP is set to: a. 0.0.0.0 b. 255.255.255.255 3. (Reference Page 349 of textbook) NAT enabled routers are used for a. Ethernet connection within a small Network b. Masquerading multiple devices behind a single IP address c. Routing IP datagrams in internet 4. (Reference Page 269-270 of textbook) To control Congestion in TCP two variables cwnd, rwnd and are used by sender. The variable cwnd refers to the size of congestion window, and rwnd is the size of receiver window, then which of the following inequality is true. LastByteSent LastByteAcked <= min{cwnd, rwnd} LastByteSent LastByteAcked <= max{cwnd, rwnd} LastByteSent LastByteReceived <= min{cwnd, rwnd} LastByteSent LastByteReceived <= max{cwnd, rwnd} 5. Consider an IP subnet with prefix 129.17.129.97/27. Provide the range of IP addresses (of the form xxx.xxx.xxx.xxx to yyy.yyy.yyy.yyy) that can be assigned to hosts in the subnet.

6. (Reference page 338 of textbook ) Assign network addresses for the subnets A, B, C in the following diagram so that only a single aggregate address needs to be advertised byr1 to the public Internet. 7. (Checksum in TCP/UDP, Reference page 202 of textbook) UDP and TCP use 1 s complement for their checksum. Suppose you have the following three 8-bit bytes: 01010011, 01100110, 01110100. What is the 1s complement of the sum of these three 8-bit bytes? (Note that although UDP and TCP use 16-bit words in computing the checksum, for this problem you are being asked to consider 8-bit sums.).

(Sec. 3.5.3 Page238- RTT estimation in TCP) Let α = 0.2. Suppose for a given TCP connection three acknowledgements have been returned with RTTs: a. RTT for first ACK = 40 msec; b. RTT for second ACK = 30 msec; and c. RTT for third ACK = 50 msec. Determine the value of Estimated RTT after each of the three acknowledgements Helpful formulae are given below EstimatesRTT = (1 ). Estimated RTT+. SampleRTT DevRTT = (1 β). DevRTT + β. SampleRTT EstimatedRTT TimeoutInterval = EstimatedRTT + 4. DevRTT 9. Flow control in TCP- Problem P28 page 294 of textbook Host A and B are directly connected with a 100 Mbps link. There is one TCP connection between the two hosts, and Host A is sending an enormous file to Host B over this connection. Host A can send application data into the link at 50 Mbps but Host B can read out of its TCP receive buffer at a maximum rate of 10 Mbps. The TCP receive buffer is of size 100 MB (note the size is in bytes). Considering how TCP flow control regulates the data sent by A and no loss or transmission delay. a. Assuming that the receive buffer is empty, what is the size of RcvWindow? b. How long does it take before the RcvWindow = 50 MB (is half full)? c. How long does it take before the RcvWindow == 0 (is full)?

10. TCP congestion control (Reference Page 277 of textbook) Consider sending a large file from one host to another over a TCP connection that has no loss. a. Suppose TCP uses AIMD (additive increase multiplicative decrease for its congestion control without slow start. Assuming CongWin increases by 1 MSS every time an ACK is received and assuming approximately constant round-trip times, how long does it take for CongWin to increase from 1 MSS to 5 MSS (assuming no loss events and constant RTT)? b. What is the average throughput (in terms of MSS and RTT) for this onnection up through time = 4 RTT? 11. (Reference Page 272 of textbook) For each of the TCP Tahoe and TCP Reno protocols experiencing the behavior shown, answer the following questions. Give one line justifying your answer. a. Identify the intervals of time when TCP slow start is operating. b. Identify the intervals of time when TCP congestion avoidance is operating. c. Identify the Transmission round when triple duplicate ACK event occurs. d. What is the initial value of ssthresh at the first transmission round? e. What is the initial value of ssthresh at the 10th transmission round?

12. (Reference Sec4.5.1 page 366 of textbook) Complete the routing table for the network in the following figure using Link State algorithm. (See for example homework problem on routing).