Sliding Window Protocol | Go-Back-N

Slides:



Advertisements
Similar presentations
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 14 Introduction to Computer Networks.
Advertisements

Network Operations & administration CS 4592 Lecture 15 Instructor: Ibrahim Tariq.
Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames (denoted as f0, f1, f2, f3, f4). Show the flow of.
Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames. Frame 0 is corrupted, the ACK of frame 1 is corrupted,
Data Link Control We want to minimize the amount of error correcting and detecting we need to do.
Data link control. Data Link Control –Flow Control how much data may sent –Error Control How can error be detected and corrected.
Flow and Error Control. Flow Control Flow control coordinates the amount of data that can be sent before receiving acknowledgement It is one of the most.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control and Protocols.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
WXES2106 Network Technology Semester /2005 Chapter 8 Intermediate TCP CCNA2: Module 10.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
15 - Winter 2006 ECE ECE 766 Computer Interfacing and Protocols 1 Data Link Control Physical layer is only responsible for data transmission Data link.
Data Link Control Protocols
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Data Link Layer We have now discussed the prevalent shared channel technologies  Ethernet/IEEE  Wireless LANs (802.11) We have now covered chapters.
TCP : Transmission Control Protocol Computer Network System Sirak Kaewjamnong.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART I: Peer-to-Peer Protocols ARQ Protocols and Reliable Data Transfer Flow Control.
1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.
Chapter 3: Channel Coding (part 3). Automatic repeat request (ARQ) protocols ▫Used in combination with error detection/correction ▫Block of data with.
Transport Layer: Sliding Window Reliability
Lecture Focus: Data Communications and Networking  Data Link Layer  Data Link Control Lecture 22 CSCS 311.
11.1 Flow and Error Control Flow Control Error Control.
Data Link Layer Flow and Error Control. Flow Control Flow Control Flow Control Specifies the amount of data can be transmitted by sender before receiving.
1 Flow&Error Control R. Supakorn. 2 Flow Control Flow control refers to a set of procedure used to restrict the amount of data that the sender can send.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Data Link Layer Part II – Sliding Window Protocols.
Computer Networks 1000-Transport layer, TCP Gergely Windisch v spring.
DATA LINK CONTROL. DATA LINK LAYER RESPONSIBILTIES  FRAMING  ERROR CONTROL  FLOW CONTROL.
Computer Networking Lecture 16 – Reliable Transport.
NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS ( NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS (PRACTICAL PART) Tutorial 4 : Chapter 7 Data & computer.
Chapter 3: The Data Link Layer –to achieve reliable, efficient communication between two physically connected machines. –Design issues: services interface.
Computer Communication & Networks
2.10 Flow and Error Control Before that ...
Fast Retransmit For sliding windows flow control we waited for a timer to expire before beginning retransmission of a packet TCP uses an additional mechanism.
MODULE I NETWORKING CONCEPTS.
Chapter 9: Data Link Control
Data Link Layer Flow Control.
Data Link Layer - 3 Dr. Sanjay P. Ahuja, Ph.D.
March 21, 2001 Recall we have talked about the Sliding Window Protocol for Flow Control Review this protocol A window of size I can contain at most I.
Part III Datalink Layer 10.
Chapter 11 Data Link Control
Ch 16 Protocols and Layering
Data link layer (LLC).
Chap. 4 Data link layer 2.
Instructor Mazhar Hussain
CIS 321 Data Communications & Networking
Flow Control.
Data Link Layer: Data Link Control
Flow and Error Control.
Overview Jaringan Komputer (2)
CS412 Introduction to Computer Networking & Telecommunication
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Data Link Layer (cont’d)
Dr. John P. Abraham Professor UTPA
CS4470 Computer Networking Protocols
Dr. John P. Abraham Professor UTPA
Advanced Computer Networks
DATA COMMUNICATION Lecture-38.
Chapter 11 Data Link Control
Getting Connected (Chapter 2 Part 3)
Data Link Layer (cont’d)
Assume that a file is transferred from a node A to a node B
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Lecture 4 Peer-to-Peer Protocols and Data Link Layer
Computer Networks Protocols
Chapter 9: Data Link Control
Error Checking continued
Presentation transcript:

Sliding Window Protocol | Go-Back-N ITCS 3166

Definition Definition Goals Sliding window is a technique for controlling transmitted data packets between two network devices where reliable and sequential delivery of data packets is required. Go-Back-N is a specific instance of the automatic repeat request (ARQ) protocol of Layer 2 in which the sending process continues to send a number of frames specified by a window size even without receiving an acknowledgement (ACK) packet from the receiver. Maximize throughput using sliding window protocol Error recovery, retransmitting damaged or lost frames Flow control, limiting the number of acknowledged frames by receptor

Determining Window Size Window Size = 16 Bits At the beginning of a transmission, the sender's window contains n-1 frames (i.e. a window size of 7 would equal frames 0-6) which is contained in the TCP header The number of data octets, beginning with the ACK field, which the sender of the segment is willing to accept Question: Does the sender and receiver have to have the same Window size? Answer: No

Sender Window After the window size is determined, all frames in the window are sent sequentially When an ACK is received, the frame in the window shifts one frame to the right After the shift, the newest (rightmost) frame is sent Kevin Meyer

Receiver Window When a frame is successfully transmitted by the sender, it is accepted by the receiver and the left window wall is moved The receiver then sends an ACK back to the sender along with the number of the next expected frame When the ACK is sent, the receiver window is shifted over to the right Question: Which window sends the ACK? Answer: Reciever

Piggybacking The receiver waits and does not send the control frame (ACK) back to the sender immediately. The receiver waits until its network layer passes in the next data packet. The delayed ACK is then attached to this outgoing data frame (piggybacking) The major advantage of piggybacking is better use of available channel bandwidth

Flow Control One of the functions of this layer is to prevent congestion which is called flow control. The way this is achieved is by limiting the number of frames sent at one time using a window size that is shared by both the sender and receiver. After the receiver receives a frame it sends back an ACK requesting the next frame. Question: Does every frame require an ACK?

Missing Frame A frame goes missing by being lost during transmission to the receiver When the receiver is given a frame out of sequence, it sends back a response containing the number of the next frame it was expecting Even if additional frames are sent that The sender shifts its window so that the expected frame is first and then sends the whole window back to the receiver again

Time-out of Frame When the ACK gets lots when transmitted back to the receiver. The Sender is waiting on an ACK but when it does not receive one within a specified amount of time, it resends the frames again to the receiver. Question: What it is called when the sender doesn’t receive an ACK in a specified amount of time? Answer: Time-out

Go-Back-N | In Action N = window size Rn = request number Sn = sequence number Sb = sequence base Sm = sequence max Sender: Sb = 0 Sm = N − 1 Repeat the following steps forever: 1. If you receive a request number where Rn > Sb Sm = (Sm - Sb) + Rn Sb = Rn 2. If no packet is in transmission, Transmit a packet where Sb <= Sn <= Sm. Packets are transmitted in order. Receiver: Rn = 0 Do the following forever: If the packet received = Rn and the packet is error free Accept the packet and send it to a higher layer Rn = Rn + 1 Else Refuse packet Send a Request for Rn

Video | Go-Back-N Question: In the video, when a packet is “killed”, what does this represent? Answer: A lost packet.

JAVA Animation Show Demonstration - Question: What is a sliding protocol? Answer: A technique for controlling transmitted data packets between two network computers where reliable and sequential delivery of data packets is required.

Conclusion Real-World Uses In summary, Go-Back-N is beneficial because: The size of the sender window can be altered The sender can send many frames at a time A timer can be set for a group of frames One ACK can acknowledge multiple frames More efficient Wait time is minimal Layer 2 Mobile Radios 802.11/802.16 LLC/HDLC Question: Answer:

Sources http://deeprajbhujel.blogspot.com/2014/05/sliding-window-protocol.html https://en.wikipedia.org/wiki/Go-Back-N_ARQ https://www.youtube.com/watch?v=raZYelgmyb0 https://www.youtube.com/watch?v=9BuaeEjIeQI