Formation of self-similar traffic at bottleneck buffers of computer networks

Gábor Vattay, Attila Fekete

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This paper analyzes how self-similarity is created in bottleneck buffers of computer networks. We argue that, in absence of heavy tailed section length or file size distributions, the sources which create self similarity in the network are certain buffers which are either too short or shared by too many TCP sessions. We analyse how congestion and long-range dependent traffic is generated in such a buffer shared by parallel TCP flows. We find that a single parameter, the ratio, determines the nature of the traffic leaving the buffer. If this ratio is above ≈ 3.0, TCPs stay in the congestion avoidance phase, if it is below then the congestion window dynamics becomes chaotic or stochastic. We show that in this phase the main properties of the traffic are determined by the exponential backoff mechanism. Emergence of chaotic TCP dynamics and long range dependence seem to be intimately related.

Original languageEnglish
Title of host publicationIntelligent Computing Based on Chaos
EditorsLjupco Kocarev, Zbigniew Galias, Shiguo Lian
Pages251-268
Number of pages18
DOIs
Publication statusPublished - Feb 16 2009

Publication series

NameStudies in Computational Intelligence
Volume184
ISSN (Print)1860-949X

    Fingerprint

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Vattay, G., & Fekete, A. (2009). Formation of self-similar traffic at bottleneck buffers of computer networks. In L. Kocarev, Z. Galias, & S. Lian (Eds.), Intelligent Computing Based on Chaos (pp. 251-268). (Studies in Computational Intelligence; Vol. 184). https://doi.org/10.1007/978-3-540-95972-4_12