It is common for simulation and analytical studies to model Internet traffic as an aggregation of mostly persistent TCP flows. In practice, however, flows follow a heavytailed size distribution and their number fluctuates significantly with time. One important issue that has been largely ignored is whether such non-persistent flows arrive in the network in an open-loop (say Poisson) or closed-loop (interactive) manner. This paper focuses on the differences that the TCP flow arrival process introduces in the generated aggregate traffic. We first review the Processor Sharing models for such flow arrival processes as well as the corresponding TCP packet-level models. Then, we focus on the queueing performance that results from each model, and show that the closed-loop model produces lower loss rate and queueing delays than the open-loop model. We explain this difference in terms of the increased traffic variability that the open-loop model produces. The cause of the latter is ...
Ravi S. Prasad, Constantine Dovrolis