How many total packets are sent with stop-and-wait

Assignment Help Computer Engineering

Reference no: EM132141245

Question :

Suppose host A has 10 packets with sequence numbers 1 to 10 to be transmitted to host B.

Now imagine that the packets numbered 2 and 7 are lost when they were sent the first time.

Assume that ACKs are never lost. How many total packets (including retransmissions) are sent with stop-and-wait.

Answer the same for go-back-n assuming windows of size 3 (at most 3 outstanding, unacknowledged packets). -justify your answer.

Reference no: EM132141245

Questions Cloud

How this special computer can be used to sort the given n : Suppose you are given n positive integers to sort on a special computer which has access to special memory containing p slots.

Create an algorithm for telling if l and m store the same : Create an algorithm for telling if L and M store the same sequence of elements (but perhaps with different starting points).

Provide again a polynomial time algorithm : Suppose we are given a directed graph G = (V, E), a set of nodes A V (denoted as people) and a set of nodes B V (denoted as exit).

What is the running time of your algorithm : Give a bottom-up dynamic programming algorithm based off your recursive definition. What is the running time of your algorithm?

How many total packets are sent with stop-and-wait : Assume that ACKs are never lost. How many total packets (including retransmissions) are sent with stop-and-wait.

Design an algorithm to update the minimum spanning tre : Design an algorithm to update the minimum spanning tree when the weight of a single edge e is increased.

What speedup is possible with pipelining : What is the maximum execution rate without pipelining? What speedup is possible with pipelining?

Would there be any advantages to using the cts and rts frame : Suppose the IEEE 802.11 RTS and CTS frames were as long as the standard DATA and ACK frames.

How does the behavior of dbscan and k-means differ on : Suppose you are given two sets of 100 points that fall within the unit square. One set of points (a) is arranged so that the points are uniformly spaced.

User Account

All Pages