The following figure shows a TCP transaction. Assume Host A always has data to send, and each packet has size 20 Bytes. Assume Host A has a sending window of 40 Bytes, that is, it can send two “in-flight” packets maximum. Answer the following questions. A. At the time marked “1”, i.e., when the first packet times out, will Host A send any packet? If your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them?B. At the time marked “2”, i.e., when the ACK of the 2ⁿᵈ packet is received by Host A, will Host A send any packet? If your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them?### Diagram DescriptionThe diagram illustrates a TCP transaction between two hosts: Host A and Host B. - Host A sends two packets to Host B: - The first packet has the sequence number 80 and contains 20 bytes of data. - The second packet has the sequence number 100 and also contains 20 bytes of data.- A timeout occurs, marked as "1" in red, which means that the first packet did not receive an acknowledgment (ACK) within the expected time.- The second packet is successfully received by Host B, and an ACK is sent back to Host A, marked as "2" in red.- The diagram includes a red "X" indicating a lost packet or communication failure for the packet with sequence number 80.Overall, the diagram is used to explain when Host A will decide to resend packets or send new packets based on the ACKs and timeouts it experiences during the TCP transaction.

According to the question , we have to answer two parts A and B which is computer networking based.…

The following figure shows a TCP transaction. Assume Host A always has data to send, and each packet has size 20 Bytes. Assume Host A has a sending window of 40 Bytes, that is, it can send two "in-flight" packets maximum. Answer the following questions. A. At the time marked "1", i.e., when the first packet times out, will Host A send any packet? if your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them? B. At the time marked "2", i.e., when the ACK of the 2nd packet is received by Host A, will Host A send any packet? if your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them? Host A Host B Seq=80, 20 bytes of data Seq=100, 20 bytes of data timeout -

The following figure shows a TCP transaction. Assume Host A always has data to send, and each packet has size 20 Bytes. Assume Host A has a sending window of 40 Bytes, that is, it can send two "in-flight" packets maximum. Answer the following questions. A. At the time marked "1", i.e., when the first packet times out, will Host A send any packet? if your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them? B. At the time marked "2", i.e., when the ACK of the 2nd packet is received by Host A, will Host A send any packet? if your answer is no, explain why not; if your answer is yes, how many packets will be sent, what are the sequence numbers of them? Host A Host B Seq=80, 20 bytes of data Seq=100, 20 bytes of data timeout -

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 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 a simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?
In a bit-oriented link-layer protocol, the start and end of a frame are each marked by a flag, which is a sequence of exactly 6 consecutive 1 bits. Bit stuffing is used during the rest of the frame: after sending 5 consecutive 1 bits, a 0 is added. The bits below contain an example frame, with the leftmost bit received first. The content of the frame is a sequence of bytes, sent most significant bit first. Put the values of the first four bytes of the frame content, in order, in the four answer boxes below. You may enter the values in either decimal (e.g. 76, 123) or hexadecimal (e.g. 2a, f7). 00101011111010001111110011100111110000111101111101010110100010010011111101101100100 57−240−123−229
In an RPC-like protocol, where numerous requests can be active at the same time and responses can be given in any sequence, the following is possible: Pretend requests are sequentially numbered, and that ACKIN] confirms the receipt of reply[N]. Should the number of ACKS be cumulative? If not, what should happen in the event that an ACK is not received?|
In TCP Vegas, the calculation of Actual Rate is done by dividing the amount of data transmitted in one RTT interval by the length of the RTT. (a) Show that for any TCP, if the window size remains constant, then the amount of data transmitted in one RTT interval is constant once a full window-full is sent. Assume that the sender transmits each segment instantly upon receiving an ACK, packets are not lost and are delivered in order, segments are all the same size, and the first link along the path is not the slowest. (b) Give a timeline sketch showing that the amount of data per RIT above can be less than Congestion Window.
Consider a long-lived TCP session with an end- to-end bandwidth of 1 Gbps (= 10⁹ bits-per- second). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is
Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NIC
A host-to-host connection may transport a large number of packets. Please provide me with a breakdown of items load processing time. Should the duration of one delay be set while the length of the other be variable?
Consider a client and a server connected through one router. Assume the router can start transmitting an incoming packet after receiving its first 0.6 Mbits instead of the whole packet. Suppose that the transmission rate of each link is 6 Mb/s and that the client transmits one packet with a size of 2 Mbits to the server. Assume the propagation, processing, and queuing delays are negligible. Answer the following questions (use up to 4 significant digits if needed; e.g., yy.xxxx): What is the end-to-end delay?3D seconds What is the end-to-end delay if there are 2 routers between the client and the server?= seconds
Let host A sends a file a size of 2200 byte to host B through routers R1, R2, R3, R4 and R5 respectively. Each packet contains 110 bytes of header information along with the user data. Assume that the bandwidth of each link is 106 B/s. File is split into 20 equal parts, and these packets are transmitted from A to B. Consider only transmission time and ignore processing, queuing and propagation delays also no error in transmission. What is the time taken by host A to send the complete file to host B?
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? (c) hops required per received packet?
Make sure to answer all parts correctly. Attached is image of the question