Go-Back-N ARQ (Sliding Window Protocol) Go-Back-N is an instance of the Automatic Repeat-request (ARQ) Protocol, in which the sending process continues.

Slides:

Advertisements

Similar presentations

Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.

Advertisements

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,

High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.

Chapter 11 Data Link Control

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.

Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,

SDS-PAGE gel analysis SDS-PAGE analysis is done to study the expression of a protein from the control and the sample, to detect the molecular weight of.

Syndrome Decoding of Linear Block Code

Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.

Document that explains the chosen concept to the animator.

Data Link Control Protocols

ARQ Mechanisms Rudra Dutta ECE/CSC Fall 2010, Section 001, 601.

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.

CSC 311 Chapter Eight FLOW CONTROL TECHNIQUES. CSC 311 Chapter Eight How do we manage the large amount of data on the network? How do we react to a damaged.

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.

Data Link and Flow Control Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Chapter 3: Channel Coding (part 3). Automatic repeat request (ARQ) protocols ▫Used in combination with error detection/correction ▫Block of data with.

Chapter Two Fundamentals of Data and Signals Data Communications and Computer Networks: A Business User's Approach Eighth Edition.

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.

Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.

Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.

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.

© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Principles of reliable data transfer 0.

Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.

CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.

Gaussian Smoothing Gaussian Smoothing is the result of blurring an image by a Gaussian function. It is also known as Gaussian blur.  Course Name: Digital.

CSMA/CD Simulation Carrier Sense Multiple Access (CSMA), although more efficient than ALOHA or slotted ALOHA, still has one glaring inefficiency: When.

Linear Search Linear Search is a fundamental search algorithm. Linear search, also known as sequential search, is a process that checks every element in.

Data Link Layer. Data link layer The communication between two machines that can directly communicate with each other. Basic property – If bit A is sent.

CSCI 465 D ata Communications and Networks Lecture 11 Martin van Bommel CSCI 465 Data Communications & Networks 1.

Median Filtering In signal processing, it is often desirable to be able to perform some kind of noise reduction on an image or signal. The median filter.

Electrical Resistivity in Superconductors The electrical resistivity of many metals and alloys drops suddenly to zero when the specimen is cooled to a.

Document that explains the chosen concept to the animator 1.

TCP-IP: Sliding Window protocol Sameer --- Brief description about the concept (1-2 lines)‏

DATA LINK CONTROL. DATA LINK LAYER RESPONSIBILTIES  FRAMING  ERROR CONTROL  FLOW CONTROL.

NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS ( NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS (PRACTICAL PART) Tutorial 4 : Chapter 7 Data & computer.

Data Link Layer.

Process Scheduling In multiprogramming systems, when there is more than one ready process, the operating system must decide which one to activate. The.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Document that explains the chosen concept to the animator

Computer Communication & Networks

Reliable Transmission

Data Link Layer - 3 Dr. Sanjay P. Ahuja, Ph.D.

Sliding Window Protocol | Go-Back-N

Chapter Two Fundamentals of Data and Signals

Instructor Mazhar Hussain

Flow and Error Control.

Overview Jaringan Komputer (2)

Learning Objectives After interacting with this Learning Object, the learner will be able to: Explain the process of collision detection in CSMA/CD.

Document that explains the chosen concept to the animator

Prof. Saravanan Vijayakumaran

Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Dilation The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.

Closing One of the important morphological operations applied to either grayscale or binary images is Closing. It is derived from the fundamental operations.

Erosion The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.

Virtual Memory Virtual memory is a technique which gives an application program the impression that it has contiguous working memory, while in fact it.

Binary Search A binary search algorithm finds the position of a specified value within a sorted array. Binary search is a technique for searching an ordered.

Sorted Linked List A linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains.

DATA COMMUNICATION Lecture-38.

Discrete Convolution of Two Signals

Continuous Time Convolution

Party Problem The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the.

Opening One of the important morphological operations applied to either grayscale or binary images is Opening. It is derived from the fundamental operations.

Image Sharpening using Laplacian

Presentation transcript:

Go-Back-N ARQ (Sliding Window Protocol) Go-Back-N is an instance of the Automatic Repeat-request (ARQ) Protocol, in which the sending process continues to send a number of frames specified by a window size even without receiving an ACK packet from the receiver. The receiver process keeps track of the sequence number of the next frame it expects, and sends it with every ACK it sends. If a frame from the sender does not reach the receiver, the receiver will stop acknowledging received frames. The sender after sending all of the frames will detect that all of the frames since the first lost frame are outstanding, and will go back to sequence number of the last ACK it received and fill its window starting with that frame and continue the process over again.  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt are licensed under Creative Commons Attribution-NonCommercial-ShareAlike 2.5 India license

Learning Objectives After interacting with this Learning Object, the learner will be able to explain how Go-Back-N ARQ works.

Understanding Go-Back-N ARQ: Go-Back-N ARQ is a specific instance of automatic repeat request(ARQ) protocol which is an error recovery mechanism to provide reliability. objects with a span smaller than the structuring element. It is a special type of sliding window protocol. In this 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. removes perimeter pixels from larger image objects. In Go-Back-N ARQ, the size of the sender window must be less than N and the size of the receiver window is always 1. When the frame is damaged the sender goes back and sends a set of frames starting from the last one ACKn‘d. The number of retransmitted frames is N.

Constraints taken while using Go-Back-N ARQ: 1. Sequence Number 2. Sender and Receiver Sliding Window 3. Acknowledgment 4. Resending Frames Sender's Action: Once the sender has sent all of the frames in its window, it will detect that all of the frames since the first lost frame are outstanding, and will go back to sequence number of the last ACK it received from the receiver process and fill its window starting with that frame and continue the process over again. Receiver's Action: 1.The receiver process keeps track of the sequence number of the next frame it expects to receive, and sends that number with every ACK it sends. 2.The receiver will ignore any frame that does not have the exact sequence number it expects – whether that frame is a 'past' duplicate of a frame it has already ACK'ed or whether that frame is a 'future' frame past the last packet it is waiting for. Choosing a Window size (N): There are a few things to keep in mind when choosing a value for N. 1. The sender must not transmit too fast. N should be bounded by the receiver’s ability to process packets. 2. N must be smaller than the number of sequence numbers (if they are numbered from zero to N) to verify transmission in cases of any packet (any data or ACK packet) being dropped. 3. Given the bounds presented in (1) and (2), choose N to be the largest number possible

Master Layout *Click on 'Start' to initiate animation *Click on 'Change Settings' to animation settings *Click on 'Help' for more information

Step 1: I nstruction for the animator T ext to be displayed in the working area (DT) When the user clicks start, the sender starts transmitting the data. And the receiver starts giving acknowledgment to the sender. * Click on 'Stop' to stop animation * Click on 'Pause' to pause animation Case: Ideal - Frames Sent:10 - Frame Lost: 0 When user clicks “start” button

Step 2: I nstruction for the animator T ext to be displayed in the working area (DT) When the user selects ‘Change Settings’, show a square box at that particular position. The text in DT of previous slide should be shown * Click on 'Start' to initiate animation * Click on 'Change Settings' to animation settings * Click on 'Help' for more information To change settings

Step 3: To Stop the demo. I nstruction for the animator T ext to be displayed in the working area (DT) When the user clicks start button, there is a option to click “stop” button to stop the demo. The text in DT should appear in parallel to the figures * Click on 'Stop' to stop animation * Click on 'Pause' to pause animation Case: Lost Frames - Frames Sent:10 - Frames Lost: Every 3 frame

Step 4: When user clicks “Help” button I nstruction for the animator T ext to be displayed in the working area (DT) When the user clicks “Help” button show a window shown above. The text in DT should appear in parallel to the figures * Click on 'Start' to initiate animation * Click on 'Change Settings' to animation settings * Click on 'Help' for more information

Step 5: To Resume the Demo I nstruction for the animator T ext to be displayed in the working area (DT) When the user clicks “Pause” there is an option for resuming the demo. The text in DT should appear in parallel to the figures * Click on 'Stop' to stop animation * Click on 'Resume' to resume animation Case: Lost Frames - Frames Sent:10 - Frames Lost: Every 2 frame

Introduction Credits 11 Definitions Test your understanding (questionnaire) ‏ Lets Sum up (summary) ‏ Want to know more… (Further Reading) ‏ Try it yourself Interactivity: Analogy Slide 1 Slide 3 Slide Slide 17 Electrical Engineering In this LO demo itself is interactive session.

Questionnaire 1.What is the size of the receiver window in Go-Back-N ARQ? Answers: a)6 b) Changes Dynamically c) 1 d) Same as that of the sender's window

Questionnaire 2. From the given scenario which Frame is lost and from which frame the outstanding frames has to be retransmitted? Answers: a) Frame 0 b) Frame 1 c) Frame 2 d) Frame

Questionnaire 3. In a Go-Back-N ARQ, if the window size is 63, what is the range of sequence numbers? Answers: a) 0 to 63 b) 0 to 64 c) 1 to 63 d) 1 to

Links for further reading Reference websites: Books: 1. Communication Systems by Simon Haykin, fourth Edition. 2. Data and Computer Communications by William Stallings, eighth Edition.