Analysis of polling systems
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
TCP in presence of bursty losses
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis and Control of Poling Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Journal of Network and Computer Applications
Queueing Systems: Theory and Applications
Orchestrating parallel TCP connections: Cyclic and probabilistic polling policies
Performance Evaluation
Hi-index | 0.00 |
The performance of a Transmission Control Protocol (TCP) for a system with N connections sharing a common Active Queue Management (AQM) is analyzed for both Additive-Increase Multiplicative-Decrease (AIMD) and Multiplicative-Increase Multiplicative-Decrease (MIMD) control mechanisms, where reduction signals follow either a cyclic or a probabilistic polling-type procedure. The Laplace-Stieltjes Transforms (LST) of the transmission rate of each connection at a polling instant, as well as at an arbitrary moment, are derived. Explicit results are calculated for the mean rate and (in contrast to most polling models) for its second moment. The analysis of the probabilistic MIMD models uses transformations yielding a system's law of motion equivalent to that of an M/G/1 queue with bulk service.