Solution

The solution to this problem is to therefore ensure that this may never happen

This can only be done by limiting the maximum size of the window to

(maximum sequence number + 1) / 2

For example if the sequence ranges from 0 to 7, then the window size must never exceed 4 (i.e. (7+1)/2 )

So if the window stretches from 0 to 3 in one instance it will move to 4 to 7 in the next,and hence any duplicates will be outside the new window

Previous slide

Next slide

Back to first slide

View graphic version