This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 1 I I t E k p t λ = ∴ = = − = Purdue University Compare the schemes Compare the schemes ¾ Let ¾ Throughput comparison( normalized by t I ) Stop and wait 1-p a Go back n 1-p 1+(a-1)p Selective repeat (1-p) 1 > ∴ + = = a t t t t t a I I out I T 3 Purdue University Compare the schemes Compare the schemes ¾ Note: 1. If a is small (ie. a ~ 1), all schemes are basically the same. This means transmission time dominates propagation delay. 2. If a is large but p is very small such that ap << 1 i. Stop and wait is bad but, ii. Go back n and selective repeat have comparable performance 3. If ap ~ 1 or ap > 1, then selective repeat is much better than go back n ¾ Identify regimes in which each scheme is the best ¾ Selective repeat is best in terms of throughput ¾ Selective repeat is most complex to implement...
View Full Document
This note was uploaded on 01/06/2010 for the course ECE 547 taught by Professor Xiaojunlin during the Spring '09 term at Purdue University.
- Spring '09