Presentation is loading. Please wait.

Presentation is loading. Please wait.

Modeling and Simulation NETW 707

Similar presentations


Presentation on theme: "Modeling and Simulation NETW 707"โ€” Presentation transcript:

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


Download ppt "Modeling and Simulation NETW 707"

Similar presentations


Ads by Google