TY - GEN
T1 - DPS queues with stationary ergodic service times and the performance of TCP in overload
AU - Altman, Eitan
AU - Jiménez, Tania
AU - Kofman, Daniel
PY - 2004/11/22
Y1 - 2004/11/22
N2 - In a recent paper, Bonald and Roberts [1] studied non-persistent TCP connections in transient overload conditions, under the assumption that all connections have the same round-trip times. In this paper our goal is to develop theoretical tools that will enable us to relax this assumption and obtain explicit expressions for the rate of growth of the number of connections at the system, the rate at which TCP connections leave the system, as well as the time needed for the completion of a connection. To that end, we model the system as a DPS (Discriminatory Processor Sharing) system which we analyze under very mild assumptions on the probability distributions related to different classes of arrivals: we only assume that the arrival rates of connections exist, and that the amount of information transmitted during a connection of a given type forms a stationary ergodic sequence. We then proceed to obtain explicit expressions for the growth rate of the number of connections at the DPS system for several specific probability distributions. We check through simulations the applicability of our queueing results for modeling TCP connections sharing a bottleneck.
AB - In a recent paper, Bonald and Roberts [1] studied non-persistent TCP connections in transient overload conditions, under the assumption that all connections have the same round-trip times. In this paper our goal is to develop theoretical tools that will enable us to relax this assumption and obtain explicit expressions for the rate of growth of the number of connections at the system, the rate at which TCP connections leave the system, as well as the time needed for the completion of a connection. To that end, we model the system as a DPS (Discriminatory Processor Sharing) system which we analyze under very mild assumptions on the probability distributions related to different classes of arrivals: we only assume that the arrival rates of connections exist, and that the amount of information transmitted during a connection of a given type forms a stationary ergodic sequence. We then proceed to obtain explicit expressions for the growth rate of the number of connections at the DPS system for several specific probability distributions. We check through simulations the applicability of our queueing results for modeling TCP connections sharing a bottleneck.
KW - Stochastic processes/Queueing theory
U2 - 10.1109/INFCOM.2004.1356984
DO - 10.1109/INFCOM.2004.1356984
M3 - Conference contribution
AN - SCOPUS:8344248704
SN - 0780383559
T3 - Proceedings - IEEE INFOCOM
SP - 975
EP - 983
BT - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Y2 - 7 March 2004 through 11 March 2004
ER -