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?

Similar documents
Computer Networks. Homework #4: No Grading

Computer Networks. Homework #3: Due 11 November 2015 (Wednesday) Just before Midterm#2!

ECE 461 Internetworking. Problem Sheet 6

23-3 TCP. Topics discussed in this section: TCP Services TCP Features Segment A TCP Connection Flow Control Error Control 23.22

Transport Layer PREPARED BY AHMED ABDEL-RAOUF

Transmission Control Protocol. ITS 413 Internet Technologies and Applications

Fast Retransmit. Problem: coarsegrain. timeouts lead to idle periods Fast retransmit: use duplicate ACKs to trigger retransmission

TCP congestion control:

Chapter 24. Transport-Layer Protocols

Fall 2012: FCM 708 Bridge Foundation I

CS 356: Introduction to Computer Networks. Lecture 16: Transmission Control Protocol (TCP) Chap. 5.2, 6.3. Xiaowei Yang

Answers to Sample Questions on Transport Layer

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

TCP over Wireless PROF. MICHAEL TSAI 2016/6/3

TCP reliable data transfer. Chapter 3 outline. TCP sender events: TCP sender (simplified) TCP: retransmission scenarios. TCP: retransmission scenarios

ECE 435 Network Engineering Lecture 10

Mid Term Exam Results

8. TCP Congestion Control

Computer Communication Networks Midterm Review

ETSF10 Internet Protocols Transport Layer Protocols

Chapter III: Transport Layer

Problem 7. Problem 8. Problem 9

Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP 23.1

Chapter 3 Review Questions

Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005

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

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

Lecture 20 Overview. Last Lecture. This Lecture. Next Lecture. Transport Control Protocol (1) Transport Control Protocol (2) Source: chapters 23, 24

Transport Protocols and TCP

TCP Congestion Control

TCP Congestion Control

PROBLEMSAND EXERCISES

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

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

a. (4pts) What general information is contained in a LSR-PDU update that A might send?

TCP based Receiver Assistant Congestion Control

Computer Networking Introduction

TCP Congestion Control

Review Questions for Midterm Exam-2 Fall 2016

Transport Protocols and TCP: Review

Reliable Transport II: TCP and Congestion Control

Chapter 6. What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control

Transport Protocols. Raj Jain. Washington University in St. Louis

COMP/ELEC 429/556 Introduction to Computer Networks

DualRTT: Enhancing TCP Performance During Delay Spikes

Exercises TCP/IP Networking With Solutions

CS321: Computer Networks Congestion Control in TCP

TCP/IP Networking. Part 4: Network and Transport Layer Protocols

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

Transport Layer. Application / Transport Interface. Transport Layer Services. Transport Layer Connections

The Transport Layer: Review

CSC 8560 Computer Networks: TCP

6.1 Internet Transport Layer Architecture 6.2 UDP (User Datagram Protocol) 6.3 TCP (Transmission Control Protocol) 6. Transport Layer 6-1

Networked Systems and Services, Fall 2018 Chapter 3

Flow and Congestion Control Marcos Vieira

cs/ee 143 Communication Networks

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

Networked Systems and Services, Fall 2017 Reliability with TCP

Lecture 3: The Transport Layer: UDP and TCP

Transport Protocols & TCP TCP

CMPE 257: Wireless and Mobile Networking

C H A P T E R 15 TRA N SM I SSI O N C O N T RO L P RO T O C O L (T C P ) SUM M A RY

Preview Test: HW3. Test Information Description Due:Nov. 3

CSC 4900 Computer Networks: TCP

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

c. If the sum contains a zero, the receiver knows there has been an error.

Chapter 3- parte B outline

CSC 4900 Computer Networks: TCP

Advanced Computer Networks

Lecture 15: Transport Layer Congestion Control

Practice Problems: P22, 23, P24, P25, P26, P27, P28, P29, P30, P32, P44 and P45. Hand-in the following: P27, P28, P32, P37, P44

There are 10 questions in total. Please write your SID on each page.

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

ECE4110, Internetwork Programming, QUIZ 2 - PRACTICE Spring 2006

TCP/IP Performance ITL

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

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

Transport Layer. -UDP (User Datagram Protocol) -TCP (Transport Control Protocol)

Computer Networking: A Top Down Approach

TCP Congestion Control 65KB W

Internet Networking recitation #10 TCP New Reno Vs. Reno

Lecture 4: Congestion Control

Advanced Computer Networks

Overview. TCP congestion control Computer Networking. TCP modern loss recovery. TCP modeling. TCP Congestion Control AIMD

Outline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste

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

CMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. October 25, 2018

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

Transport Layer Review

CMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. October 30, 2018

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

TCP Congestion Control in Wired and Wireless networks

CSCD 330 Network Programming

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

ETSF05/ETSF10 Internet Protocols Transport Layer Protocols

EE122 MIDTERM EXAM: Scott Shenker, Ion Stoica

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

CSCD 330 Network Programming Winter 2015

CS519: Computer Networks. Lecture 5, Part 1: Mar 3, 2004 Transport: UDP/TCP demux and flow control / sequencing

Communication Networks

Transcription:

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. In a network, the size of the send window is 20 packets. Which of the following protocols is being used by the network? a) Stop_and_Wait b) Go-Back-N c) Selective-Repeat Q23-7. In a network with fixed value for m > 1, we can either use the Go- Back- N or the Selective- Repeat protocol. Describe the advantage and the disadvantage of using each. What other network criteria should be considered to select either of these protocols? Q23-10 Can you explain why some transport- layer packets may be received out of order in the Internet? Q23-11 Can you explain why some transport- layer packets may be lost in the Internet? Q23-12. Can you explain why some transport- layer packets may be duplicated in the Internet? P23-3 A sender sends a series of packets to the same destination using 5- bit sequence numbers. If the sequence numbers start with 0, what is the sequence number of the 100th packet? P23-4 In each of the following protocols, how many packets can have independent sequence numbers before wraparound occurs ( see the previous problems). a. Stop- and- Wait b. Go- Back- N with m = 8 c. Select- Repeat with m = 8 P23-5

Using 5- bit sequence numbers, what is the maximum size of the send and receive windows for each of the following protocols? a. Stop- and- Wait b. Go- Back- N c. Selective- Repeat P23-9 In the Stop- and- Wait protocol, show the case in which the receiver receives a duplicate packet ( which is also out of order). Hint: Think about a delayed ACK. What is the reaction of the receiver to this event? P23-12. Create a scenario similar to Figure 23.22 in which the sender sends three packets. The first and second packets arrive and are acknowledged. The third packet is delayed and resent. The duplicate packet is received after the acknowledgment for the original is sent. P23-14. Redraw Figure 23.29 when the sender sends 5 packets ( 0, 1, 2, 3, and 4). Packets 0, 1, and 2 are sent and acknowledged in a single ACK, which arrives at the sender site after all packets have been sent. Packet 3 is received and acknowl-edged in a single ACK. Packet 4 is lost and resent. P23-16. Answer the following questions related to the FSMs for the Stop- and- Wait protocol ( Figure 23.21): a. The sending machine is in the ready state and S = 0. What is the sequence number of the next packet to send? b. The sending machine is in the blocking state and S = 1. What is the sequence number of the next packet to send if a time- out occurs? c. The receiving machine is in the ready state and R = 1. A packet with the sequence number 1 arrives. What is the action in response to this event? d. The receiving machine is in the ready state and R = 1. A packet with the sequence number 0 arrives. What is the action in response to this event? P23-17. Answer the following questions related to the FSMs for the Go- back- N protocol with m = 6 bits. Assume the window size is 63. ( Figure 23.27): a. The sending machine is in the ready state with Sf = 10 and Sn = 15. What is the sequence number of the next packet to send? b. The sending machine is in the ready state with Sf = 10 and Sn = 15. A time- out occurs. How many packets are to be resent? What are their sequence numbers? c. The sending machine is in the ready state with Sf = 10 and Sn = 15. An ACK with ackno = 13 arrives. What are the next values of Sf and Sn? d. The sending machine is in the blocking state with Sf = 14 and Sn = 21. What is the size of the window? e. The sending machine is in the blocking state with Sf = 14 and Sn = 21. An ACK with ackno = 18 arrives. What are the next values of Sf and Sn? What is the state of the sending machine? f. The receiving machine is in the ready state with Rn = 16. A packet with sequence number 16 arrives. What is the next value of Rn? What is the response of the machine to this event?

P23-18. Answer the following questions related to the FSMs for the Selective- Repeat protocol with m = 7 bits. Assume the window size is 64. ( Figure 23.34): a. The sending machine is in the ready state with Sf = 10 and Sn = 15. What is the sequence number of the next packet to send? b. The sending machine is in the ready state with Sf = 10 and Sn = 15. The timer for packet 10 times out. How many packets are to be resent? What are their sequence numbers? c. The sending machine is in the ready state with Sf = 10 and Sn = 15. An ACK with ackno = 13 arrives. What are the next values of Sf and Sn? What is the action in response to this event? d. The sending machine is in the blocking state with Sf = 14 and Sn = 21. What is the size of the window? e. The sending machine is in the blocking state with Sf = 14 and Sn = 21. An ACK with ackno = 14 arrives. Packets 15 and 16 have already been acknowledged. What are the next values of Sf and Sn? What is the state of the sending machine? f. The receiving machine is in the ready state with Rn = 16. The size of the window is 8. A packet with sequence number 16 arrives. What is the next value of Rn? What is the response of the machine to this event? P23-19. We can define the bandwidth- delay product in a network as the number of packets that can be in the pipe during the round- trip time ( RTT). What is the bandwidthdelay product in each of the following situations? a. Bandwidth: 1 Mbps, RTT: 20 ms, packet size: 1000 bits b. Bandwidth: 10 Mbps, RTT: 20 ms, packet size: 2000 bits c. Bandwidth: 1 Gbps, RTT: 4 ms, packet size: 10,000 bits. P23-20. Assume we need to design a Go- Back- N sliding- window protocol for a network in which the bandwidth is 100 Mbps and the average distance between the sender and receiver is 10,000 km. Assume the average packet size is 100,000 bits and the propagation speed in the media is 2 108 m/ s. Find the maximum size of the send and receive windows, the number of bits in the sequence number field ( m), and an appropriate time- out value for the timer. P23-21. Assume we need to design a Selective- Repeat sliding- window protocol for a network in which the bandwidth is 1 Gbps and the average distance between the sender and receiver is 5,000 km. Assume the average packet size is 50,000 bits and the propagation speed in the media is 2 108 m. Find the maximum size of the send and receive windows, the number of bits in the sequence number field ( m), and an appropriate time- out value for the timer. P23-22. An acknowledgment number in the Go- Back- N protocol defines the next packet expected, but an acknowledgment number in the Selective- Repeat pro-tocol defines the sequence number of the packet to be acknowledged. Can you explain the reason?

Q24-10. In TCP, how many sequence numbers are consumed by each of the following segments? P24-10. To make the initial sequence number a random number, most systems start the counter at 1 during bootstrap and increment the counter by 64,000 every half second. How long does it take for the counter to wrap around? Q24-14. What is the maximum size of the TCP header? What is the minimum size of the TCP header? Q24-15. In TCP, does a SYN segment open a connection in only one direction or in both directions? Q24-16. In TCP, does a FIN segment close a connection in only one direction or in both directions? P24-2. A client uses UDP to send data to a server. The data length is 16 bytes. Calculate the efficiency of this transmission at the UDP level ( ratio of useful bytes to total bytes). P24-11. In a TCP connection, the initial sequence number at the client site is 2171. The client opens the connection, sends three segments, the second of which carries 1000 bytes of data, and closes the connection. What is the value of the sequence number in each of the following segments sent by the client? a. The SYN segment b. The data segment c. The FIN segment P24-12. In a connection, the value of cwnd is 3000 and the value of rwnd is 5000. The host has sent 2000 bytes, which have not been acknowledged. How many more bytes can be sent? P24-13. A client uses TCP to send data to a server. The data consist of 16 bytes. Calculate the efficiency of this transmission at the TCP level ( ratio of useful bytes to total bytes). P24-32. The ssthresh value for a Taho TCP station is set to 6 MSS. The station now is in the slow- start state with cwnd = 4 MSS. Show the values of cwnd, sstresh, and the state of the station before and after each of following events: four con-secutive nonduplicate ACKs arrived followed by a time- out, and followed by three nonduplicate ACKs.

P24-33. The ssthresh value for a Reno TCP station is set to 8 MSS. The station is now in the slow- start state with cwnd = 5 MSS and ssthresh = 8 MSS. Show the values of cwnd, ssthresh, and the current and the next state of the station after the following events: three consecutive nonduplicate ACKs arrived, followed by five duplicate ACKs, followed by two nonduplicate ACKs, and followed by a time- out.