Download presentation
Presentation is loading. Please wait.
1
Modeling and Simulation NETW 707
Lecture 7 ARQ Modeling: Modeling Error/Flow Control (2) Course Instructor: Dr.-Ing. Maggie Mashaly C3.220
2
Modeling of Go Back N Protocol
3
Limitation of Stop-andโWait Protocol
Machine A Machine B Physical Channel First Frame - Bit enters Channel Last Frame arrives at B Last ACK Arrives at A Processing Time Channel is Idle 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
4
Go-Back-N ARQ Protocol Example Go Back 4 An outstanding frame:
Sender Receiver Fr_0 Fr_1 ACK_1 Fr_2 ACK_2 Fr_3 ACK_3 An outstanding frame: It is a frame that has been transmitted and is yet to be acknowledged Fr_4 Fr_5 Out of Sequence Frames. So, do not accept them At this Point there are WS=4 Outstanding Frames. So, GO-BACK-4 Fr_6 Fr_3 Fr_4 Fr_5 Fr_6 Fr_7 Fr_8 ACK_4 ACK_5 ACK_6 ACK_7 ACK_8
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 WS: Go-Back-N
6
What does ๐พ ๐ Represent? WS is called the sending window size
Each frame must be buffered (stored) until a valid ACK arrives (in case retransmission is needed) WS represents the maximum number of frames that may be outstanding (i.e., stored) simultaneously
7
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_0 Fr_0 Fr_1 ACK_1 Fr_1 Fr_2 ACK_2 Fr_2 Fr_3 ACK_3 Fr_3 Fr_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences
8
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_0 Fr_0 Fr_1 ACK_1 Fr_1 Fr_2 ACK_2 Fr_2 Fr_3 ACK_3 Fr_3 Fr_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences
9
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_0 Fr_0 Fr_1 ACK_1 Fr_1 Fr_2 ACK_2 Fr_2 Fr_3 ACK_3 Fr_3 Fr_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences
10
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_0 Fr_0 Fr_1 ACK_1 Fr_1 Fr_2 ACK_2 Fr_2 Fr_3 ACK_3 Fr_3 Fr_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences
11
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_1 Fr_0 Fr_1 ACK_1 Fr_2 Fr_2 ACK_2 Fr_3 Fr_3 ACK_3 Fr_4 Fr_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences
12
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_2 Fr_0 Fr_1 ACK_1 Fr_3 Fr_2 ACK_2 Fr_4 Fr_3 ACK_3 Fr_5 Fr_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences
13
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_3 Fr_0 Fr_1 ACK_1 Fr_4 Fr_2 ACK_2 Fr_5 Fr_3 ACK_3 Fr_6 Fr_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences
14
Sliding Window Concept
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) Example Go Back 4 Sending Window Sender Receiver Fr_4 Fr_0 Fr_1 ACK_1 Fr_5 Fr_2 ACK_2 Fr_6 Fr_3 ACK_3 Fr_7 Fr_4 ACK_4 Frame Sequences that are allowed to be sent Fr_5 Fr_6 Outstanding Frame Sequences Transmitter has nothing to send
15
Go-Back-N ARQ Modeling
Assumptions ๐ณ ๐ โช ๐ณ ๐๐ , ๐ ๐ โช ๐ ๐๐ โ ๐ ๐ โ๐ ๐ ๐๐๐๐ โโ โ ๐ ๐๐๐๐ โ๐ Forward Channel BER ๐ Backward Channel (i.e., ACK/NAK) is Error Free Infinite number of retransmissions Machine A Machine B Physical Channel
16
Go-Back-N ARQ Markov Model
Model Details The time step is equal to ๐ ๐๐ Probability of packet error ๐ ๐ ๐ ๐ =๐โ ๐โ๐ ๐ณ ๐๐ For ๐ ๐ณ ๐๐ โช๐โ ๐ ๐ โ๐ ๐ณ ๐๐ Define ๐
๐ as the probability of ๐ ๐ Define ๐น ๐๐ as the transition probability from ๐ ๐ to ๐ ๐ ๐โ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ตโ๐ ๐ ๐ต ๐ ๐ ๐ท= ๐
๐ ๐
๐ ๐
๐ โฆ ๐
๐ต ๐ซ= ๐น ๐,๐ ๐น ๐,๐ โฆ ๐น ๐,๐ตโ๐ ๐น ๐,๐ต ๐น ๐,๐ ๐น ๐,๐ โฆ ๐น ๐,๐ตโ๐ ๐น ๐, ๐ต โฎ โฎ โฎ โฎ โฎ ๐น ๐ตโ๐,๐ ๐น ๐ตโ๐,๐ โฆ ๐น ๐ตโ๐,๐ตโ๐ ๐น ๐ตโ๐,๐ต ๐น ๐ต,๐ ๐น ๐ต,๐ โฆ ๐น ๐ต,๐ตโ๐ ๐น ๐ต,๐ต
17
Go-Back-N ARQ Markov Model
๐ท= ๐
๐ ๐
๐ ๐
๐ โฆ ๐
๐ต ๐โ ๐ ๐ ๐ซ= ๐ ๐ ๐ โฆ ๐ ๐ ๐ ๐ ๐ โฆ ๐ ๐ โฎ โฎ โฎ โฎ โฎ โฎ ๐ ๐ ๐ โฆ ๐ ๐ ๐ ๐ ๐ ๐ โฆ ๐ ๐โ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ตโ๐ ๐ ๐ต ๐ ๐ At steady State ๐ทร๐ซ=๐ท With boundary condition ๐=๐ ๐ต ๐
๐ =๐ Solving: ๐
๐ต = ๐ ๐+ ๐ ๐ ๐ตโ๐ ๐
๐ = ๐
๐ =โฆ= ๐
๐ตโ๐ = ๐ ๐ ๐+ ๐ ๐ ๐ตโ๐ ๐
๐ = ๐
๐ ๐
๐ = ๐
๐ โฎ ๐
๐ตโ๐ = ๐
๐ตโ๐ ๐
๐ต = ๐
๐ตโ๐ + ๐โ ๐ ๐ ๐
๐ต ๐
๐ = ๐ ๐ ๐
๐ต ๐=๐ ๐ต ๐
๐ =๐ ๐ตโ๐ ๐
๐ + ๐
๐ต =๐ ๐ตโ๐ ๐
๐ + ๐
๐ ๐ ๐ =๐ ๐ ๐ ๐ตโ๐ ๐
๐ + ๐
๐ = ๐ ๐ ๐
๐ = ๐ ๐ ๐+ ๐ ๐ ๐ตโ๐ ๐
๐ต = ๐ ๐+ ๐ ๐ ๐ตโ๐
18
Go-Back-N ARQ Throughput
Throughput measures the percentage of time slots that are utilized for successful transmissions ๐ป๐= ๐=๐ โ ๐
๐ ร๐ท๐ ๐บ๐๐๐. ๐ป๐ ๐๐ ๐ ๐ ๐ป๐= ๐โ ๐ ๐ ๐
๐ต ๐ป๐= ๐โ ๐ ๐ ๐+ ๐ ๐ ๐ตโ๐ ๐โ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ ๐ตโ๐ ๐ ๐ต ๐ ๐
19
S/W and GBN Comparison
20
References NETW 707 Lectures slides by A. Prof. Tallal El-Shabrawy, 2016 & 2017 โSimulation Modeling and Analysisโ by Averill M. Law, 5th Edition, 2015
Similar presentations
© 2024 SlidePlayer.com Inc.
All rights reserved.