Scribd Logo
Upload

Welcome to Scribd!

  • Sliding Window Protocol

    Uploaded by

    Hameed Lebbai
    13 views2 pages
    The document describes sliding window protocols for transmitting frames over networks. It discusses how frames are numbered and retransmitted if lost, and duplicates deleted. The sender and receiver each maintain variables to track the oldest and newest frames sent/received. The algorithm involves transmitting frames within the sender's window, acknowledging received frames to advance the window, and retransmitting frames if timers expire. It also describes the relationships between sequence numbers and window sizes.

    Original Description:

    COMPUTER NETWORKS-ANNA UNIVERSITY

    Original Title

    SLIDING WINDOW PROTOCOL

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes sliding window protocols for transmitting frames over networks. It discusses how frames are numbered and retransmitted if lost, and duplicates deleted. The sender and receiver each maintain variables to track the oldest and newest frames sent/received. The algorithm involves transmitting frames within the sender's window, acknowledging received frames to advance the window, and retransmitting frames if timers expire. It also describes the relationships between sequence numbers and window sizes.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    13 views2 pages

    Sliding Window Protocol

    Uploaded by

    Hameed Lebbai
    The document describes sliding window protocols for transmitting frames over networks. It discusses how frames are numbered and retransmitted if lost, and duplicates deleted. The sender and receiver each maintain variables to track the oldest and newest frames sent/received. The algorithm involves transmitting frames within the sender's window, acknowledging received frames to advance the window, and retransmitting frames if timers expire. It also describes the relationships between sequence numbers and window sizes.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    CS513/EE506 Intro to Local and Wide Area Networks Craig E.

    Wills

    WPI, Spring 2007 Sliding Window Protocols

    Sliding Window Protocols


    Frames are numbered. Lost frames can be retransmitted. Duplicate frames can be deleted. Out of order frames can be reordered. The sender maintains two variables: SL = the number of the oldest frame sent, but not ACKed. SU = the number of the next frame to send that has not ever been sent. SU SL = the size of the senders window (the number of sending buers needed) The receiver maintains two variables: RL = lowest numbered frame the receiver is willing to accept RU = one more than the highest numbered frame the receiver is willing to accept. RU RL = size of receivers window.

    Algorithm
    Rough algorithm of the sliding window protocols: 1. Transmit all frames in the senders window (no more than from SL to SU 1 ) 2. Whenever the receiver gets a frame in its window: (a) it generates an ACK for the highest frame correctly received (same as the frame for protocol 5). (b) if the frame RL has been received it passes RL to the host and bumps RL and RU (advances the window). 3. Whenever the receiver gets a damaged frame or a frame not within its window it generates a NAK for one less than the frame expected (RL 1) (only for protocol 6).

    4. Whenever the sender receives an ACK for a frame within its window, it marks that frame as having been correctly sent and received. If SL is ACKed then increment SL and SU (advance the senders window) and transmit SU 1 (last previously unsent frame). 5. Whenever a timer goes o, retransmit the corresponding frame.

    Relationships
    Sequence numbers: 0..(2n 1) SL < S U , R L < R U Steady state condition: RL SU Interval of active frames: [SL , RU ) So RU SL 2n and (RU RL ) + (SU SL ) 2n where n is the number of bits in the sequence number Two cases: 1. Receiver window size of one (protocol 5): RU R L = 1 (SU SL ) + 1 2n (SU SL ) 2n 1 2. Receiver and sender have equal window sizes (protocol 6): RU R L = S U S L = W 2W 2n W 2n1

    Protocol 6 Example
    Situation: 1. Sender sends sequence numbers 0-3. 2. Receiver has ACKed 0-3 (advancing window), but sender has not received the ACKs.
    SL SU

    RU 0 1 2 3

    RL 4 5 6 7

    You might also like