 |
 |

Modeling TCP
Throughput: A Simple Model and its Empirical Validation
Jitendra Padhye, Victor Firoiu, Don
Towsley, and Jim Kurose (U. Mass)
In this paper we develop a simple analytic characterization of the
steady state throughput, as a function of loss rate and round trip
time for a bulk transfer TCP ow, i.e., a ow with an unlimited amount
of data to send. Unlike the models in [6, 7, 10], our model captures
not only the behavior of TCP's fast retransmit mechanism (which is
also considered in [6, 7, 10]) but also the effect of TCP's timeout
mechanism on throughput. Our measurements suggest that this latter
behavior is important from a modeling perspective, as almost all of
our TCP traces contained more timeout events than fast retransmit
events. Our measurements demonstrate that our model is able to more
accurately predict TCP throughput and is accurate over a wider range
of loss rates.
[6] J. Mahdavi and S. Floyd. TCP-friendly unicast rate-based
ow control. Note sent to end2end-interest mailing list, Jan
1997.
[7] M. Mathis, J. Semske, J. Mahdavi, and T. Ott. The macro-
scopic behavior of the TCP congestion avoidance algorithm.
Computer Communication Review, 27(3), July 1997.
[10] T. Ott, J. Kemperman, and M. Mathis. The stationary be-
havior of ideal TCP congestion avoidance. in preprint.
ACM Copyright Notice: Copyright (c) 1998 by Association
for Computing Machinery, Inc. (ACM) Permission to make digital or
hard copies of all or part of this work for personal or classroom use
is granted without fee provided that the copies are not made or
distributed for profit or commercial advantage and that the copies
bear this notice and full citation on the first page. Copyright for
components of this work owned by others than ACM must be
honored. Abstracting with credit is permitted. To copy otherwise, to
republish, to post on servers, or to redistribute to lists, requires
prior specific permission and/or a fee. Request permission to publish
from: Publications Dept. ACM, Inc. Fax +1 212 869 0481 or email
<permissions@acm.org>.
The referenced paper is in Computer Communication
Review, a publication of ACM SIGCOMM, volume 28, number 4, October
1998. ISSN # 0146-4833.
This electronic facsimile may differ slighty from the printed
version. It has may have been reformated to better support electronic
viewing. Therefore, please use the printed version when referencing
layout details, such as page numbers.
This paper is available in
Postscript and
Adobe Portable Document Format (PDF)
Get Microsoft Powerpoint Viewer,
Ghostview
|