Characteristics of TCP Connection Arrivals
Anja Feldmann · 2000
In the Internet more and more network resource allocation problem arise at the connection level. Therefore it is essential to understand the nature of traffic at the connection level. This paper shows that the TCP connection arrival process shows self-similar behavior and that TCP connection interarrival times are statistically better modeled by distributions with heavy tails, especially the Weibull distribution, than traditional models. This implies that the connection arrival process is bursty. Given that a bursty arrival process can substantially degrade the performance of resource allocation algorithms we suggest the Weibull distribution as an alternative model for the analysis and simulations of such algorithms. 1 Introduction While packets are the basic unit of the Internet most operations by users involve more than one packet. The user experience dependents on the performance of the network on a set of packets. Sets of packets are starting to be used as basis for network...