Distributed computational grids depend on TCP to ensure reliable end-to-end communication between nodes across the wide-area network (WAN). Unfortunately, TCP performance can be abysmal even when buffers on the end hosts are manually optimized. Recent studies blame the self-similar nature of aggregate network traffic for TCP's poor performance because such… (More)
— We consider a stochastic model of an ECN/RED gateway with competing TCP sources sharing the capacity. As the number of competing flows becomes large, the queue behavior at the gateway can be described by a two-dimensional recursion and the throughput behavior of individual TCP flows becomes asymptotically independent. The steady-state regime of the… (More)
We develop a framework for studying the interaction of a probabilistic active queue management (AQM) algorithm with a generic end-user congestion-control mechanism. We show that as the number of flows in the network increases, the queue dynamics can be accurately approximated by a simple deterministic process. In addition, we investigate the sources of… (More)
Several studies in network traffic characterization have concluded that network traffic is self-similar and therefore not readily amenable to statistical multiplexing in a distributed computing system. This paper examines the effects of the TCP protocol stack on network traffic via an experimental study on the different implementations of TCP. We show that… (More)
Via experimental study, we illustrate how TCP modulates application traffic in such a way as to adversely affect network performance in a heterogeneous computing system. Even when aggregate application traffic smooths out as more applications' traffic are multiplexed, TCP induces burstiness into the aggregate traffic load, and thus hurts network… (More)
We introduce a stochastic model of a bottleneck ECN/RED gateway under a large number of heterogeneous TCP flows, i.e., flows with diverse round-trip delays and session dynamics. We investigate the asymptotic behavior of the system and show that as the number of flows becomes large, the buffer dynamics and aggregate traffic simplify and can be accurately… (More)
We consider a stochastic model of a RED gateway under competing TCP-like sources sharing the capacity. As the number of competing flows becomes large, the queue behavior of RED can be described by a two-dimensional recursion. We confirm the result by simulations and discuss their implications for the network dimensioning problem.
— The TCP congestion-control mechanism is an algorithm designed to probe the available bandwidth of the network path that TCP packets traverse. However, it is well-known that the TCP congestion-control mechanism does not perform well on networks with a large bandwidth-delay product due to the slow dynamics in adapting its congestion window, especially for… (More)