Go Back N ARQ The transmitter has a window" of n packets that can be sent without acknowledgements This window ranges from the last value of rn obtained from the receiver(denoted Snmin)to SNmin +N-1 When the transmitter reaches the end of its window or times out it goes back and retransmits packet SN Let snmin be the smallest number packet not yet ACKed Let snmay be the number of the next packet to be accepted from the higher layer(I.e, the next new packet to be transmittedGo Back N ARQ • The transmitter has a "window" of N packets that can be sent without acknowledgements • This window ranges from the last value of RN obtained from the receiver (denoted SNmin) to SNmin+N-1 • When the transmitter reaches the end of its window, or times out, it goes back and retransmits packet SNmin Let SNmin be the smallest number packet not yet ACKed Let SNmax be the number of the next packet to be accepted from the higher layer (I.e., the next new packet to be transmitted)