1. And now … Graphs simulation input file parameters 10,000 requests 4 categories of file sizes 1K- 80% frequency 4K – 15% 16K – 4% 64K –1% poisson arrival rate λ =200, i.e. average of 12 requests per second

2. Zero Packet Loss

3. .5% Packet Loss

4. 5% Packet Loss

5. 15% Packet Loss

6. Zero Packet Loss

7. .5% Packet Loss

8. 5% Packet Loss

9. 15% Packet Loss

10. Conclusions - number of connections influence zero packet loss –average delay is not effected by number of connections. –additional connections cause performance degradation as a result of TCP overhead. non zero packet loss –all algorithms benefit from additional connections. Categories algorithm effected the most –additional connections minimize channel stalls (which are a result of TCP error recovery). average delay improvement better total throughput

11. Conclusions – algorithm influence zero packet loss –average delay is similar for all algorithms possibly effected by low request arrival rate non zero packet loss –Single Queue algorithm provides the best results for average delay and total throughput. –Categories algorithm is the worst option. Although the categories algorithm doesn’t achieve any improvement in terms of average delay and total performance,it could improve a “punishment rate” significantly.

12. Final Conclusions: SQ CAT RR

13. The end