A closed network with a discriminatory processor-sharing server
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Performance modeling of elastic traffic in overload
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Fluid approximations for a processor-sharing queue
Queueing Systems: Theory and Applications
Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Asymptotic regimes and approximations for discriminatory processor sharing
ACM SIGMETRICS Performance Evaluation Review
Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing
Performance Evaluation
Simulation Study of TCP in Overload
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
The Fluid Limit of an Overloaded Processor Sharing Queue
Mathematics of Operations Research
Processor sharing: A survey of the mathematical theory
Automation and Remote Control
| Hi-index | 0.00 |
In a recent paper, Bonald and Roberts (2001) [6] 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 discriminatory processor sharing (DPS) 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.