Host A is sending an enormous file to Host B over a TCP connection. Over this connection there is never anypacket loss and the timers never expire. Denote the transmission rate of the link connecting Host A to theInternet by R bps. Suppose that the process in Host A is capable of sending data into its TCP socket at a rate Sbps, where S=10•R. Further suppose that the TCP receive buffer is large enough to hold the entire file, and thesend buffer can hold only one percent of the file. What would prevent the process in Host A from continuouslypassing data to its TCP socket at rate S bps? TCP flow control? TCP congestion control? Or something else?Elaborate.

Answered: bps, where S=10-R. Further suppose that…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider a client connecting to a web server via a router as shown in Fig.Q2. Client A sends a request to the server to retrieve a 7.5 Mbytes file. Given that the segment size is 50 Kbytes, the round trip time (RTT) between the server and client is 10 ms, the initial slow-start threshold is 16 and the client's buffer always has a storage space of 1 Mbytes. Assume that TCP Reno is used, there is no loss during transmission and the headers of protocols are ignored. 400 Mbps 200 Mbps 400 Mbps Link a Link b Link c Client Web Server Fig.Q2 (a) Describe how the value of sending window changes as a function of time (in units of RTT) during the whole connection time. 2.
Through a TCP link Host A transmitting a big file to host B. There is never any packet loss over this link, and timers never expire. R bps denotes the bit rate of the connection connecting Host A to the Internet. Assume that the process running on Host A is capable of transmitting data into its TCP socket at a rate of S bytes per second, where S equals 10 - R. Additionally, suppose the TCP receive buffer is wide enough to contain the whole file and the transmit buffer may only hold 1% of it. What will prohibit the mechanism in Host A from sending data to its TCP socket at a pace of S bps indefinitely? What is TCP flow control? Regulation of TCP congestion? Or is there another possibility? Articulate.
Host A and B are communicating over a TCP connection. Host B has already received from Host A all bytes up through byte 23. Suppose Host A then sends two segments to Host B back-to-back. The first and the second segments contain 30 and 50 bytes of data, respectively. In the first segment, the sequence number is 24, the source port number is 3000, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. A. In the second segment sent from Host A to B, what arethe sequence number_________,source port number __________,and destination port number__________?B. If the second segment arrives after the first segment, in the acknowledgment of the second segment, what arethe acknowledgment number___________,the source port number__________,and the destination port number __________?C. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment,what is the acknowledgment number ___________?D.…
Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 126. Suppose Host A then sends two segments to Host B backto-back. The first and second segments contain 80 and 40 bytes of data, respectively. In the first segment, the sequence number is 127, the source port number is 302, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. d. Suppose the two segments sent by A arrive in order at B. The first acknowledgment is lost and the second acknowledgment arrives after the first timeout interval. Draw a timing diagram, showing these segments and all other segments and acknowledgments sent. (Assume there is no additional packet loss.) For each segment in your figure, provide the sequence number and the number of bytes of data; for each acknowledgment that you add, provide the acknowledgment number.
QUESTION 19 Suppose a process in Host C has a UDP socket with port number 4320. Suppose both Host A and Host B each send a UDP segment to Host C with destination port number 4320. Then both of these segments will be directed to the same socket with port number 4320 at Host C True False QUESTION 20 With TCP’s flow control mechanism, where the receiver tells the sender how much free buffer space it has (and the sender always limits the amount of outstanding, unACKed, in-flight data to less than this amount), it is not possible for the sender to send more data than the receiver has room to buffer. True False
Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 126. Suppose Host A then sends two segments to Host B backto-back. The first and second segments contain 80 and 40 bytes of data, respectively. In the first segment, the sequence number is 127, the source port number is 302, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A.a. In the second segment sent from Host A to B, what are the sequence number, source port number, and destination port number?b. If the first segment arrives before the second segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number, the source port number, and the destination port number?c. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number?d. Suppose the two segments sent by A arrive in order at B. The…
Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 126. Suppose Host A then sends two segments to Host B back-to-back. The first and second segments contain 80 and 40 bytes of data, respectively. In the first segment, the sequence number is 127, the source port number is 302, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. a. In the second segment sent from Host A to B, what are the sequence number, source port number, and destination port number? b. If the first segment arrives before the second segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number, the source port number, and the destination port number? c. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number? d. Suppose the two segments sent by A arrive in order at B. The…
Consider a TCP connection betweek two hosts between A and B. The first data byte sent by A is numbered 1. The LastByteRcvd at B is 500. Then, the range of values SendBase at A may take is from to 500
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 to Host B an enormous file over this connection. Host A can send its application data into its TCP socket at a rate as high as 120 Mbps but Host B can read out of its TCP receive buffer at a maximum rate of 50 Mbps. Describe the effect of TCP flow control.
Consider the following scenario in which host A is sending a file to host B over a TCP connection. Assuming that the sequence number of the first data byte sent by A is 0 and every segment always includes 1000 bytes of data, excluding the TCP header. At some point of time, bytes up to 6400 have been written into the sender’s buffer. Bytes up to 4999 have been sent out but the segment which contains bytes 2000~2999 has not arrived at host B yet. At the receiver’s side, all bytes up to 3999 have been received except for bytes 2000~2999. Bytes up to 499 have been read from the buffer by the application. Assume that the maximum size of the sender’s buffer is large enough. Consider the sliding window algorithm in TCP and answer the following questions. 1) What are the values for LastByteAcked, LastByteSent, and LastByteWritten? 2) What are the values for LastByteRead, NextByteExpected, and LastByteRcvd? 3) Assuming that the maximum size of the receiver’s buffer is 4000 byte, what would…
Consider that only a single TCP (Reno) connection uses one 10Mbps link which does not buffer any data. Suppose that this link is the only congested link between the sending and receiving hosts. Assume that the TCP sender has a huge file to send to the receiver, and the receiver's receive buffer is much larger than the congestion window. We also make the following assumptions: each TCP segment size is 1,500 bytes; the two-way propagation delay of this connection is 150 msec; and this TCP connection is always in congestion avoidance phase, that is, ignore slow start. A. What is the maximum window size (in segments) that this TCP connection can achieve? B. What is the average window size (in segments) and average throughput (in bps) Of this TCP connection? C. How long would it take for this TCP connection to reach its maximum window again after recovering from a packet loss?
Consider one TCP connection on a path with a bottleneck link with capacity L. We have a file of size F(assume F is a very large file size). If TCP segment size is B bytes, the two-way propagation delay is tp and connection is always in congestion avoidance phase, find the following: A. Maximum window size that TCP can achieve B. Average window size and average throughput in this TCP connection C. Time it will take from connection establishment to reaching the maximum window size.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS