Question

Consider a scenario where two hosts use a sliding window protocol, either Go-Back-N or Selective Repeat,...

Consider a scenario where two hosts use a sliding window protocol, either Go-Back-N or Selective Repeat, to exchange data packets. Assume that the RTT is 30 milliseconds and the sending rate is R = 1Gbps, and the size of every packet is L = 2,000 bytes, including both header fields and data. (a). How big would the window size have to be for the channel utilization to be greater than 98%? (b). Assume that we use the window size calculated in (a). How many different sequence numbers do we need to guarantee that Selective Repeat can operate correctly (that is, the receiver will not be confused by whether a packet is a new packet or a retransmitted packet)? (c). Assume that we use the minimum number of sequence numbers, as indicated by (b). How many bits do we need to use (in the packet header) to represent the sequence numbers.

Homework Answers

Answer #1

HERE IS THE SOLUTION...PLEASE GIVE AN UPVOTE

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the Go-back-N protocol with a sender window of size 4 and, for simplicity, assume infinite...
Consider the Go-back-N protocol with a sender window of size 4 and, for simplicity, assume infinite sequence numbers that never wrap. Suppose that at time T the next in-order packet that the receiver is expecting has a sequence number of K. Assume that the underlying channel may lose or corrupt packets but does not reorder them. (a)What are the possible sets of sequence numbers inside the sender’s window at time T? Justify your answer. (b) What are all possible values...
A network transport protocol uses Selective-Reject ARQ. The network data rate is 100 Mbps and the...
A network transport protocol uses Selective-Reject ARQ. The network data rate is 100 Mbps and the distance between the sender and the receiver is 36,000 km. Assuming an average packet size of 100,000 bits and a media propagation velocity of 3 x 108 m/s, find the window size required for maximum network utilization and the number of bits needed for the sequence numbers.
Can someone please explain this to me? Suppose that the Go-Back-N protocol with ? = 3...
Can someone please explain this to me? Suppose that the Go-Back-N protocol with ? = 3 and the sending window of size 7 is used to send packets. Let ?f = 31 modulo 2m, ?n = 35 modulo 2m, and ?n= 33 modulo 2m. What are the sequence numbers of data packets in transit? What are the acknowledgement numbers of ACK packets in transmit? If the sender’s process sends two more data packets to the sender’s transport layer and one...
Let host A send a large file to host B over a pipelined transport protocol with...
Let host A send a large file to host B over a pipelined transport protocol with a fixed sliding window (e.g., GBN or SR). How big does the sender’s window need to be to ensure maximum use of the network path capacity between A and B if the path has the following idealistic characteristics: (i) the round-trip delay between the end hosts (measured for a very small packet so that it is not affected by the transmission delay) is 10...