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

IEEE/ACM Transactions on Networking

Volumn 12, Issue 5, 2004, Pages 952-962

  Chang, Cheng Shang ^a   Liu, Zhen ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; MATHEMATICAL MODELS; OPTIMIZATION; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

BANDWIDTH SHARING; FIXED POINT LIMIT; UTILITY FUNCTIONS;

HTTP;

EID: 7244262069     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.836118     Document Type: Article

References (28)

1. M. Avriel, Nonlinear Programming: Analysis and Methods. Englewood Cliffs, NJ: Prentice-Hall, 1976.
2. F. Baccelli, D. Hong, and Z. Liu, "Fixed point methods for the simulation of the sharing of a local loop by a large number of interacting TCP connections," in Proc. ITC Specialist Conf. Local Loop, Barcelona, Spain, Apr. 2001 .
3. P. Barford and M. E. Crovella, "Generating representative web workloads for network and server performance evaluation," in Proc. ACM Sigmetrics, 1998.
4. P. Barford, and M. E. Crovella, "A performance evaluation of hyper text transfer protocols," in Proc. ACM Sigmetrics, 1999.
5. A. Berger, L. Bregman, and Y. Kogan, "Bottleneck analysis in multiclass closed queueing networks and its application," Queueing Syst., vol. 10, 1998.
6. A. Berger and Y. Kogan, "Dimensioning bandwidth for elastic traffic in high-speed data networks," IEEE/ACM Trans. Networking, vol. 8, pp. 643-654, June 2000.
7. T. Bonald and L. Massoulié, "Impact of fairness of internet performance," in Proc. ACM Sigmetrics, Cambridge, MA, 2001, pp. 82-91.
8. L. S. Brakmo and L. L. Peterson, "TCP Vegas: End-to-end congestion avoidance on a global internet," IEEE J. Select. Areas Commun., vol. 1480, pp. 82-1465, Oct. 1995.
9. C.-S. Chang and H.-J. Wang, "Large deviations for large capacity loss networks with fixed routing and polyhedral admission sets," Discrete Event Dynamic Syst., vol. 7, pp. 391-418, 1997.
10. Y. S. Chow and H. Teicher, Probability Theory: Independence, Interchangeability, Martingales. New York: Springer-Verlag, 1988.
11. A. Das and R. Srikant, "Diffusion approximations for a single node accessed by congestion-controlled sources," IEEE Trans. Automat. Contr., vol. 45, pp. 1783-1799, Oct. 2000.
12. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
13. S. B. Fredj, T. Bonald, A. Proutiere, G. Régnié, and J. W. Roberts, "Statistical bandwidth sharing: A study of congestion at flow level," in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001.
14. D. P. Heyman, T. V. Lakshman, and A. Neidhardt, "A new method for analysing feedback-based protocols with applications to engineering web traffic over the internet," in Proc. ACM Sigmetrics, 1997, pp. 24-38.
15. T. Ibaraki and N. Katoh, Resource Allocation Problems: Algorithmic Approaches. Cambridge, MA: MIT Press, 1988.
16. V. Jacobson, "Congestion avoidance and control," in Proc. ACM SIGCOMM, Aug. 1988.
17. Z. Liu, N. Niclausse, and C. Jalpa-Villanueva, "Traffic model and performance evaluation of web servers," Performance Eval., vol. 46/2-3, pp. 77-100, 2001.
18. F. P. Kelly, Reversibility and Stochastic Networks. New York: Wiley, 1979.
19. F. P. Kelly, "Loss networks," Ann. Appl. Probab., vol. 1, pp. 319-378, 1991.
20. F. P. Kelly, "Charging and rate control for elastic traffic," Eur. Trans. Telecommun., vol. 8, pp. 33-37, 1997.
21. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
22. S. Kunniyur and R. Srikant, "End-to-end congestion control: Utility functions, random losses and ECN marks," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 26-30.
23. S. H. Low, "A duality model of TCP flow control," in Proc. ITC Specialist Seminar IP Traffic Measurement, Modeling, and Management, Sept. 2000. [Online]. Available: http://netlab.caltech.edu.
24. L. Massoulié and J. Roberts, "Bandwidth sharing: Objectives and algorithms," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 21-25.
25. J. Mo and J. Walrand, "Fair end-to-end window based congestion control," IEEE/ACM Trans. Networking, vol. 8, pp. 556-567, June 2000.
26. R. Nelson, Probability, Stochastic Processes, and Queueing Theory: The Mathematics of Computer Performance Modeling. New York: Springer-Verlag, 1995.
27. J. E. Pitkow, "Summary of WWW characterizations," Proc. WWW7, Computer Networks, vol. 30, no. 1-7, pp. 551-558, 1998.
28. B. Pittel, "Closed exponential networks of queues with saturation: The Jackson-type stationary distribution and its asymptotic analysis," Math. Oper. Res., vol. 4, pp. 357-378, 1979.