Presentation is loading. Please wait.

Presentation is loading. Please wait.

Error/Flow Control Modeling (ARQ Modeling). Modeling of Go Back N.

Published byJonas Wilson Modified over 9 years ago

Similar presentations

Presentation on theme: "Error/Flow Control Modeling (ARQ Modeling). Modeling of Go Back N."— Presentation transcript:

1 Error/Flow Control Modeling (ARQ Modeling)

2 Modeling of Go Back N

3 © Tallal Elshabrawy 3 Limitation of Stop & Wait Protocol Inefficiency of Stop-and-Wait because the channel is left idle without use until an acknowledgement is received Potential Solution: Allowing the transmitter to continue sending enough frames so that the channel is kept busy while the transmitter is waiting for an acknowledgement Machine A Machine B Physical Channel First Frame-Bit enters Channel Last Frame-Bit enters Channel First Frame-Bit arrives at B Last Frame-Bit arrives at B Last ACK-Bit Arrives at A Processing Time Channel is Idle

4 © Tallal Elshabrawy 4 Go-Back-N ARQ Protocol Sender Receiver An outstanding frame: It is a frame that has been transmitted and is yet to be acknowledged Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Fr_3 Fr_4 Fr_5 Fr_6 Fr_7 Fr_8 ACK_4 ACK_5 ACK_6 ACK_7 ACK_8 Example Go Back 4 At this Point there are W S =4 Outstanding Frames. So, GO-BACK-4 Out of Sequence Frames. So, do not accept them

5 © Tallal Elshabrawy 5 Go-Back-N Basics Transmit without waiting for ACK Each frame received correctly is acknowledged with a sequence number corresponding to the NEXT frame expected The receiver discards all out of sequence packets If number of outstanding frames is W S : Go-Back-N

6 © Tallal Elshabrawy 6 What does W S Represent? W S is called the sending window size Each frame must be buffered (stored) until a valid ACK arrives (in case retransmission is needed) W S represents the maximum number of frames that may be outstanding (i.e., stored) simultaneously

7 © Tallal Elshabrawy 7 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_0 Fr_1 Fr_2 Fr_3 Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

8 © Tallal Elshabrawy 8 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_0 Fr_1 Fr_2 Fr_3 Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

9 © Tallal Elshabrawy 9 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_0 Fr_1 Fr_2 Fr_3 Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

10 © Tallal Elshabrawy 10 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_0 Fr_1 Fr_2 Fr_3 Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

11 © Tallal Elshabrawy 11 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_1 Fr_2 Fr_3 Fr_4 Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

12 © Tallal Elshabrawy 12 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_2 Fr_3 Fr_4 Fr_5 Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

13 © Tallal Elshabrawy 13 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_3 Fr_4 Fr_5 Fr_6 Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

14 © Tallal Elshabrawy 14 Sliding Window Concept Sender Receiver Fr_0 Fr_1 Fr_2 Fr_3 Fr_4 Fr_5 Fr_6 ACK_1 ACK_2 ACK_3 Example Go Back 4 Sending Window Frame Sequences that are allowed to be sent Outstanding Frame Sequences Fr_4 Fr_5 Fr_6 Fr_7 ACK_4 Transmitter has nothing to send Go Back N is an example of what is called a sliding window protocol An ACK received means that all previous frames have been received correctly (previous ACKs were lost or receiver chose not to send them)

15 © Tallal Elshabrawy Go-Back-N ARQ Modeling 15 Machine A Machine B Physical Channel

16 © Tallal Elshabrawy Go-Back-N ARQ Markov Model 16

17 © Tallal Elshabrawy Go-Back-N ARQ Markov Model 17

18 © Tallal Elshabrawy Go-Back-N ARQ Throughput 18

19 © Tallal Elshabrawy S/W and GBN Comparison 19

Download ppt "Error/Flow Control Modeling (ARQ Modeling). Modeling of Go Back N."

Similar presentations

Data Link Layer (cont’d)

Data Link Layer (cont’d)
Network Operations & administration CS 4592 Lecture 15 Instructor: Ibrahim Tariq.

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 (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,

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 We want to minimize the amount of error correcting and detecting we need to do.
Go-Back-N Improve Stop-and-Wait by not waiting!

Go-Back-N Improve Stop-and-Wait by not waiting!
Chapter 11 Data Link Control

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.

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.

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.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control and Protocols.
ELEN 602 Lecture 5 Review of last lecture –Error Detection -- parity/CRC etc. Automatic Retransmission Request (ARQ) Reading: Chap 5.1-5.2.

ELEN 602 Lecture 5 Review of last lecture –Error Detection -- parity/CRC etc. Automatic Retransmission Request (ARQ) Reading: Chap
Data Link Layer Review Advanced Computer Networks.

Data Link Layer Review Advanced Computer Networks.
Networks: Data Link Layer1 Data Link Layer. Networks: Data Link Layer2 Data Link Layer Provides a well-defined service interface to the network layer.

Networks: Data Link Layer1 Data Link Layer. Networks: Data Link Layer2 Data Link Layer Provides a well-defined service interface to the network layer.
Networks: Data Link Layer1 Data Link Layer. Networks: Data Link Layer2 Data Link Layer Provides a well-defined service interface to the network layer.

Networks: Data Link Layer1 Data Link Layer. Networks: Data Link Layer2 Data Link Layer Provides a well-defined service interface to the network layer.
Computer Networks: Data Link Layer 1 Data Link Layer.

Computer Networks: Data Link Layer 1 Data Link Layer.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.
20101 The Data Link Layer Chapter 3. 20102 Design Issues Controls communication between 2 machines directly connected by “wire”-like link Services Provided.

20101 The Data Link Layer Chapter Design Issues Controls communication between 2 machines directly connected by “wire”-like link Services Provided.
Go-Back-N (GBN) Yan Gao Feb. 17, 2006. Go-Back-N protocol  Concept Introduce a window of size n Can inject n packets into net before hearing an ACK 

Go-Back-N (GBN) Yan Gao Feb. 17, Go-Back-N protocol  Concept Introduce a window of size n Can inject n packets into net before hearing an ACK 
1 Reliable Data Transfer. 2 r Problem: Reliability  Want an abstraction of a reliable link even though packets can be corrupted or get lost r Solution:

1 Reliable Data Transfer. 2 r Problem: Reliability  Want an abstraction of a reliable link even though packets can be corrupted or get lost r Solution:
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.

Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.

Similar presentations

Ads by Google