Analysis of a tcp system under polling-type reduction-signal procedures

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- IncreaseMultiplicative-Decrease (AIMD) andMultiplicative- IncreaseMultiplicative-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. Keywords TCP, AIMD, MIMD, Cyclic Polling, Probabilistic Polling, M/G/1 Bulk Service.