Discriminatory Processor Sharing Queues With Stationary Ergodic Service Times and the Performance of TCP in Overload

Date Added: Dec 2009
Format: PDF

In a recent paper, Bonald and Roberts (2001) studied non-persistent TCP connections in transient overload conditions, under the assumption that all connections have the same round-trip times. In this paper, the authors' goal is to develop theoretical tools that will enable one 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.