In a protocol that uses 5 bits for the sequence-number field, if a packet has the sequence number x, how many packets need to be sent to see a packet with the same sequence number x, assuming that each packet is assigned one sequence number?

Consider the GBN protocol with a sender window size of 4 and a sequence number range of 1,024. Suppose that at time t, the next in-order packet that the receiver is expecting has a sequence number of k. Assume that the medium does not reorder messages. Answer the following questions: a. What are the possible sets of sequence numbers inside the sender's window at time !? Justify your answer. b. What are all possible values of the ACK field in all possible messages currently propagating back to the sender at time? Justify your answer.

While developing a reliable transport protocol, early versions of the protocol discussed in class used a NAK message, sent by the receiver to the sender to indicate a packet was not correctly received. This kind of message, however, is not found in further protocols, like GBN, SR or even TCP. Why not? In other words, why don't these protocols provide a way to signal to the sender that the received message was received with an error

All packets are treated equally in Priority Queuing. Select one: O True O False

What relationship is needed between sequence number size and window size to avoid problem in recognizing between new transmission and re-transmission in the SR protocol?

TCP is a sliding window protocol. This means... а. the TCP retransmission timer slides up as ACKS are received. O b. there can be more than one segment "in flight" (sent but no ACK has been received) at a time. с. there can only be one segment outstanding (sent but no ACK has been received) at at time.

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.

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

It is possible for a series of packets to be sent from one host to another over the same route. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last a certain period of time and the other delay's length will be more variable?

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?