Beruflich Dokumente
Kultur Dokumente
1.5
Fairness
1
0.5
0
11
13
15
17
19
1
9
K
1
0.8
Fairness
0.6
0.4
0.2
0
1 2 3 4 5 6 7 8 9 10 11
K
Retransmission Scheme
Current timeout set to:
1
M
1500
# Packets
1000
500
0
1 2 3 4 5 6 7 8 9 10 11 12 13 14
M
Jitter Study
Any network has considerable random
delays.
The time between when the packet is
transmitted to when it reaches the receiver
varies a great deal - this phenomenon is
called jitter.
Simulated jitter by introducing random
delay to each packet on the sender side.
WebTP with no jitter
15000
Sent Packets
10000
5000
0
1 2 3 4
M
15000
Sent Packets
10000
5000
0
1 2 3 4 5 6
M
WebTP with no jitter
Duplicate Packets
2000
1500
1000
500
0
1 2 3 4
M
2000
1500
1000
500
0
1 2 3 4 5 6
M
Conclusion
Congestion Window Scheme: Optimal K
depends on network topology.
Retransmission Scheme: Dropped packets
increase with M whereas the number of
duplicate packets goes down at higher M.
Network Jitter: Higher jitter implies that a
higher M is required to handle the delays
that are introduced.