Professional Documents
Culture Documents
Semester 1, 2008/09
A = (X + 1)RT T Z T O ≈ TO (1 + 2p)
„ «
W
= + 1 RT T We can now approximate the throughput considering both
2 timeout and triple duplicates.
„ r «
3 2 5
= + − RT T Y + QR
2 3p 12 B=
r A + QZ T O
2 3
≈ RT T (5) Y + min(1, W )(1 + p)
3p = 3
A + min(1, W )T0 (1 + 2p)
The throughput can be computed as q q
1
p
+ 3p 8
+ min(1, 3 3p 8
)(1 + p)
Y =
B=
q q
A RT T 3p 2
+ min(1, 3 3p 8
)TO (1 + 2p)
1−p
p
+W q q
= 1 + 8p 3
+ min(1, 3 3p 8
)p(1 + p)
A = q q
q
1 8 2p 3p
p
+ 3p RT T 3
+ min(1, 3 8 )TO p(1 + 2p)
≈ q
2 1
3p
RT T ≈ q q
2p 3p
r RT T 3
+ min(1, 3 8
)TO p(1 + 2p)
1 3
≈ (6)
RT T 2p
5 Impact of Window Limitation
4 Triple Duplicate ACKs and Timeouts Suppose the receiver advertises a maximum buffer size
Wmax , then the sender’s congestion window cannot grow be-
yond Wmax . Suppose the window can grow to Wmax without
Consider the penultimate round in a triple duplicate pe-
causing any packet loss, then the throughput will simply be
riod. W packets are sent. If W > k and only k (k < 3)
Wmax /RT T .
packets are ACKed, then we have a timeout. Let A(W, k)
Putting the equations together, we have a complete
be the probability that the first k packets are ACKed given
model:
that there is a sequence of one or more losses, then,
0 1
(1 − p)k p Wmax 1
A(W, k) = B ≈ min @ , q q A
1 − (1 − p)W RT T RT T 2p + min(1, 3 3p )T p(1 + 2p)
3 8 O
(1 − kp)p (8)
≈
Wp
1 The original Padhye’s equation is
≈
W 0 1
W max 1
Other possibilities that lead to timeout exist but we as- B ≈ min @ , q q A
sume that they are rare and ignore them in this approxima- RT T RT T 2p + min(1, 3 3p )T p(1 + 32p2 )
3 8 O
tion.
We can now estimate the probability of timeout as follows. I do not know where the term (1 + 32p2 ) comes from.
1 if W ≤ 3
Q= P2
„
k=0 A(W,
«
k) otherwise References
3
= min 1, (7) Chen, Z., Bu, T., Ammar, M., and Towsley, D. 2006.
W Comments on “Modeling TCP Reno performance: a sim-
Assume that one packet is sent during one timeout se- ple model and its empirical validation”. IEEE/ACM
quence. The number of packets sent during the timeout Trans. on Networking 14, 2, 451–453.
period would be the same as the number of timeouts. If Padhye, J., Firoiu, V., Towsley, D., and Kurose, J.
the packet retransmitted after a timeout period is lost (with 1998. Modeling TCP throughput: a simple model and its
probability p), we get another timeout. The expected num- empirical validation. SIGCOMM Comput. Commun. Rev.
ber of timeout R, is 28, 4, 303–314.
R = 1 + p + p2 + ...
≈1+p