A bandwidth sharing theory for a large number of HTTP-like connections

There has been tremendous progress in understanding how bandwidth is shared by TCP-like connections. By associating each TCP-like connection with a utility function, the bandwidth sharing problem of TCP-like connections can be modeled as a distributed optimization problem for utility functions. However, little is known on how bandwidth is shared by HTTP-like connections through their utility functions at the TCP level. One of the main objectives of this paper is to provide a theory for bandwidth sharing of a large number of HTTP-like connections. Based on certain technical assumptions, we show that there is a utility function at the HTTP level for an HTTP-like connection and such a utility function can be derived from the utility function at the TCP level. The bandwidth is then shared by HTTP-like connections through utility functions at the HTTP level. We also address two possible extensions of the theory: the case with impatient TCP connections and the case with multiple types of requests. With appropriate modification of the utility functions at the HTTP level, we show that the bandwidth is still shared by optimizing their utility functions at the HTTP level for the case with impatient TCP connections. For the case with multiple types of requests, the bandwidth shared at the HTTP level can still be found by solving a unique fixed point limit.

[1]  Randolph Nelson,et al.  Probability, Stochastic Processes, and Queueing Theory , 1995 .

[2]  T. V. Lakshman,et al.  A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet , 1997, SIGMETRICS '97.

[3]  Zhen Liu,et al.  Traffic model and performance evaluation of Web servers , 2001, Perform. Evaluation.

[4]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[5]  H. Teicher,et al.  Probability theory: Independence, interchangeability, martingales , 1978 .

[6]  R. Srikant,et al.  Diffusion approximations for a single node accessed by congestion-controlled sources , 2000, IEEE Trans. Autom. Control..

[7]  Randolph D. Nelson,et al.  Probability, stochastic processes, and queueing theory - the mathematics of computer performance modeling , 1995 .

[8]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[9]  Cheng-Shang Chang,et al.  Large Deviations for Large Capacity Loss Networks with Fixed Routing and Polyhedral Admission Sets , 1997, Discret. Event Dyn. Syst..

[10]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[11]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[12]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[13]  James E. Pitkow,et al.  Summary of WWW characterizations , 1998, World Wide Web.

[14]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[15]  Alexandre Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[16]  Boris G. Pittel,et al.  Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis , 1979, Math. Oper. Res..

[17]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[18]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[19]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[20]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[21]  Zhen Liu,et al.  Fixed Point Methods for the Simulation of the Sharing of a Local Loop by a Large Number of Interacting TCP Connections , 2001 .

[22]  Alan Weiss,et al.  Large Deviations For Performance Analysis: Queues, Communication and Computing , 1995 .

[23]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[24]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[25]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[26]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[27]  Yaakov Kogan,et al.  Bottleneck analysis in multiclass closed queueing networks and its application , 1999, Queueing Syst. Theory Appl..

[28]  Yaakov Kogan,et al.  Dimensioning bandwidth for elastic traffic in high-speed data networks , 2000, TNET.

[29]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[30]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[31]  LiuZhen,et al.  Traffic model and performance evaluation of Web servers , 2001 .

[32]  Paul Barford,et al.  A performance evaluation of hyper text transfer protocols , 1999, SIGMETRICS '99.

[33]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[34]  Ward Whitt,et al.  Large deviations behavior of counting processes and their inverses , 1994, Queueing Syst. Theory Appl..

[35]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.