• DocumentCode
    1822265
  • Title

    TCP vs. TCP: a systematic study of adverse impact of short-lived TCP flows on long-lived TCP flows

  • Author

    Ebrahimi-Taghizadeh, Shirin ; Helmy, Ahmed ; Gupta, Sandeep

  • Author_Institution
    Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
  • Volume
    2
  • fYear
    2005
  • fDate
    13-17 March 2005
  • Firstpage
    926
  • Abstract
    This paper describes systematical development of TCP adversarial scenarios where we use short-lived TCP flows to adversely influence long-lived TCP flows. Our scenarios are interesting since, (a) they point out the increased vulnerabilities of recently proposed scheduling, AQM and routing techniques that further favor short-lived TCP flows and (b) they are more difficult to detect when intentionally found to target long-lived TCP flows. We systematically exploit the ability of TCP flows in slow-start to rapidly capture greater proportion of bandwidth compared to long-lived TCP flows in congestion avoidance phase, to a point where they drive long-lived TCP flows into timeout. We use simulations, analysis and experiments to systematically study the dependence of the severity of impact on long-lived TCP flows on key parameters of short-lived TCP flows-including their locations, durations and numbers, as well as the intervals between consecutive flows. We derive characteristics of pattern of short-lived flows that exhibit extreme adverse impact on long-lived TCP flows. Counter to common beliefs, we show that targeting bottleneck links does not always cause maximal performance degradation for the long-lived flows. In particular, our approach illustrates the interactions between TCP flows and multiple bottleneck links and their sensitivities to correlated losses in the absence of ´non-TCP friendly´ flows and paves the way for a systematic synthesis of worst-case congestion scenarios. While randomly generated sequences of short-lived TCP flows may provide some reductions (up to 10%) in the throughput of the long-lived flows, the scenarios we generate cause much greater reductions (>85%) for several TCP variants and for different packet drop policies (DropTail, RED).
  • Keywords
    correlation theory; queueing theory; random sequences; routing protocols; scheduling; telecommunication congestion control; telecommunication links; telecommunication network management; telecommunication services; transport protocols; AQM; DoS; TCP adversarial scenario; congestion avoidance; correlation; denial of service; packet drop policies; randomly generated sequence; routing technique; scheduling; short-lived TCP flows; targeting bottleneck links; vulnerability; Analytical models; Bandwidth; Counting circuits; Degradation; Internet; Mice; NASA; Performance loss; Routing; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE
  • ISSN
    0743-166X
  • Print_ISBN
    0-7803-8968-9
  • Type

    conf

  • DOI
    10.1109/INFCOM.2005.1498322
  • Filename
    1498322