An analytical evaluation of autocorrelations in TCP traffic

Authors:
Georgios Rodolakis;Philippe Jacquet
Affiliations:
INRIA and Ecole Polytechnique, France;INRIA and Ecole Polytechnique, France
Venue:
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
Year:
2005

Citing 6
Cited 0

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Mellin transforms and asymptotics: harmonic sums

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Is the internet fractal?

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the autocorrelation structure of TCP traffic

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
On the autocorrelation structure of TCP traffic

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
A mean-field model for multiple TCP connections through a buffer implementing RED

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of characterizing analytically the autocorrelation structure of TCP traffic. We show that, under simple models, a single TCP connection generates traffic with an exponentially decreasing autocorrelation function. However, several TCP connections sharing a given link can generate traffic with long term dependencies, under the condition that the distribution of their round trip delays is heavy tailed.