A mean-field analysis of short lived interacting TCP flows

Author:

Baccelli François1,Chaintreau Augustin1,De Vleeschauwer Danny2,McDonald David3

Affiliation:

1. INRIA & ENS, Paris, France

2. Alcatel NSG, Antwerpen, Belgium

3. University of Ottawa, Ottawa, Ontario, Canada

Abstract

In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before requesting the download of another file, whose size is also random. When a flow is active its throughput is increasing with time according to the additive increase rule, but if it suffers losses created when the total transmission rate of the flows exceeds the link rate, its transmission rate is decreased. The throughput obtained by a flow, and the consecutive time to download one file are then given as the consequence of the interaction of all the flows through their total transmission rate and the link's behavior.We study the mean-field model obtained by letting the number of flows go to infinity. This mean-field limit may have two stable regimes : one without congestion in the link, in which the density of transmission rate can be explicitly described, the other one with periodic congestion epochs, where the inter-congestion time can be characterized as the solution of a fixed point equation, that we compute numerically, leading to a density of transmission rate given by as the solution of a Fredholm equation. It is shown that for certain values of the parameters (more precisely when the link capacity per user is not significantly larger than the load per user), each of these two stable regimes can be reached depending on the initial condition. This phenomenon can be seen as an analogue of turbulence in fluid dynamics: for some initial conditions, the transfers progress in a fluid and interaction-less way; for others, the connections interact and slow down because of the resulting fluctuations, which in turn perpetuates interaction forever, in spite of the fact that the load per user is less than the capacity per user. We prove that this phenomenon is present in the Tahoe case and both the numerical method that we develop and simulations suggest that it is present in the Reno case too. It translates into a bi-stability phenomenon for the finite population model within this range of parameters.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Software

Reference18 articles.

1. http://lists.w3.org/Archives/Public/ietf-http-wg-old/2000SepDec/0078.html http://lists.w3.org/Archives/Public/ietf-http-wg-old/2000SepDec/0078.html

2. http://www.n2nsoft.com http://www.n2nsoft.com

3. http://www.faqs.org/rfcs/rfc2581.html http://www.faqs.org/rfcs/rfc2581.html

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Scheduling Announced Requests for Streamed Information;2015 27th International Teletraffic Congress;2015-09

2. Physics-inspired methods for networking and communications;IEEE Communications Magazine;2014-11

3. Mean-field framework for performance evaluation of push–pull gossip protocols;Performance Evaluation;2011-02

4. Steady state and scaling limit for a traffic congestion model;ESAIM: Probability and Statistics;2010

5. MeanField analysis for the evaluation of gossip protocols;ACM SIGMETRICS Performance Evaluation Review;2008-11-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3