Sliding Window Protocol - Examples - Go-Back-N - Ambiguity Example

Ambiguity Example

Suppose that we are using a 3-bit sequence number, such as is typical for HDLC. This gives N=2³=8. Since wr=1, we must limit wt≤7. This is because, after transmitting 7 packets, there are 8 possible results: Anywhere from 0 to 7 packets could have been received successfully. This is 8 possibilities, and the transmitter needs enough information in the acknowledgment to distinguish them all.

If the transmitter sent 8 packets without waiting for acknowledgment, it could find itself in a quandary similar to the stop-and-wait case: does the acknowledgment mean that all 8 packets were received successfully, or none of them?

Read more about this topic:  Sliding Window Protocol, Examples, Go-Back-N

Famous quotes containing the word ambiguity:

    There is no greater impediment to the advancement of knowledge than the ambiguity of words.
    Thomas Reid (1710–1769)

    Unlike the ambiguity of life, the ambiguity of language does reach a limit.
    Mason Cooley (b. 1927)