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
The End-to-End Performance Effects of Parallel TCP Sockets on a Lossy Wide-Area Network
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Analysis and Control of Poling Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Journal of Network and Computer Applications
Queueing Systems: Theory and Applications
Analysis of a TCP system under polling-type reduction-signal procedures
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
| Hi-index | 0.00 |
The standard Transmission Control Protocol (TCP) is based on an additive rate increase in the absence of congestion, and on multiplicative decrease triggered by congestion signals. However, it does not scale well as the distances, or as the speed of the network, increase. Thus, we study some of the solutions that have been proposed to encounter this problem. These solutions include (i) splitting the transmission from a source to its destination into several parallel connections, and (ii) using Scalable TCP, which is a more aggressive version of TCP. The connection whose rate decreases when a signal arrives is chosen either at random or according to a round robin policy. Our analysis concentrates on a centrally controlled TCP system having N connections. We consider both Additive Increase Multiplicative Decrease (AIMD) and Multiplicative Increase Multiplicative Decrease (MIMD) control mechanisms. 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 obtained for the mean transmission rate and (in contrast to most polling models) for its second moment. For the AIMD procedure under the cyclic visit policy we show that, for both dynamic (Hamiltonian-type) and static visit orders in each cycle, the connections should be visited following a simple index rule in order to achieve maximum throughput. For the probabilistic visit policy we obtain the set of optimal probabilities that maximizes mean throughput. 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 batch service. The MIMD control mechanism with probabilistic strategy is further analyzed for the case where the transmission rate is bounded above.