Differentiation between short and long TCP flows: Predictability of the response time

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2004, Pages 762-773

  Avrachenkov, Konstantin ^a   Ayesta, Urtzi ^a,b   Brown, Patrick ^b   Nyberg, Eeva ^c  

^a INRIA   (France)

^b ORANGE LABS   (France)

^c AALTO UNIVERSITY   (Finland)

Author keywords

LAS; M G 1; Processor sharing; Queueing theory; Response time; Simulations; TCP IP

Indexed keywords

LAS; PROCESSOR SHARING; RESPONSE TIME; TCP/IP;

ALGORITHMS; COMPUTER SIMULATION; INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; PROGRAM PROCESSORS; QUEUEING THEORY; SCHEDULING;

DATA TRANSFER;

EID: 8344266045     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2004.1356965     Document Type: Conference Paper

References (27)

1. U. Ayesta and K.E. Avrachenkov, "The effect of the initial window-size and limited transmit algorithm on the transient behavior of TCP transfers," in 15th ITC Specialist Seminar on Internet Traffic Engineering and Traffic Management, Wurzburg, Germany, July 2002.
2. N. Bhatti, A. Bouch, and A.J. Kuchinsky, "Integrating user-perceived quality into web server design," in Proceedings of WWW'00, Amsterdam. The Netherlands, 2000.
3. Leonard Kleinrock, Queueing Systems, vol. 2, John Wiley and Sons, 1976.
4. S.F. Yashkov, "On feedback sharing a processor among jobs with minimal serviced length (in russian)," Technika Sredstv Svyazi. Ser. ASU, vol. 2, pp. 51-62, 1978.
5. S.F. Yashkov, "Processor-sharing queues: Some progress in analysis," Queueing Systems, vol. 2, pp. 1-17, 1987.
6. R. Righter and J.G. Shanthikumar, "Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures," Probability in the Engineering and Informational Sciences, vol. 3, pp. 323-333, 1989.
7. A. Wierman, N. Bansal, and M. Harchol-Balter, "A note on comparing response times in the M/G/1/FB and M/G/1/PS queues," Operations Research Letters, vol. 32, no. 1, pp. 73-76, 2004.
8. S. Ben Fredj, T.Bonald, A.Proutiere, G.Regnie, and J.Roberts, "Statistical bandwidth sharing: A study of congestion at flow level," in Proceedings of ACM SIGCOMM, Pitsburgh, PA, 2002.
9. Kevin Thompson, Gregory J. Miller, and Rick Wilder, "Wide-area internet traffic patterns and characteristics," IEEE Network, vol. 11, no. 6, 1997.
10. C. Fraleigh, S. Moon B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, and C. Diot, "Packet-level traffic measurement from the Sprint IP backbone," IEEE Network Magazine, no. to appear, 2003.
11. Vern Paxson and Mark Allman, "Computing TCP's retransmission timer." RFC2988, Nov. 2000.
12. Wael Noureddine and Fouad Tobagi, "Improving the performance of interactive TCP applications using service differentiation," in Proceedings of IEEE INFOCOM, New York, NY, 2002.
13. Lian Guo and Ibrahim Matta, "The war between mice and elephants," in Proceedings of the 9th IEEE International Conference on Network Protocols ICNP'01, 2001.
14. Liang Guo and Ibrahim Malta, "Differentiated control of web traffic: A numerical analysis," in Proceedings of SPIE ITCOM'2002: Scalability and Traffic Control in IP Networks, Boston, MA, 2002.
15. Liang Guo and Ibrahim Malta, "Scheduling flows with unknown sizes: Approximate analysis," Tech. Rep. BU-CS-2002-009, Boston Universily, Mar. 2002.
16. I. Rai, G. Urvoy-Keller, and E. Biersack, "Size-based scheduling wilh differentiated services to improve response time of highly varying flows," in Proceedings of the 15th ITC Specialist Seminar, Internet Traffic Engineering and Traffic Management, Wurzburg, Germany, 2002.
17. I. Rai, G. Urvoy-Keller, and E. Biersack, "Analysis of LAS scheduling for job size distributions with high variance," in Proceedings of ACM Sigmetrics 2003, International Conference on Measurement and Modeling of Computer Systems, 2003.
18. L. Massoulié and J. Roberts, "Bandwidth sharing and admission control for elastic traffic," Telecommunication Systems, no. 15, pp. 185-201, 2000.
19. E.G. Coffman, "Stochastic models of multiple and time-shared computer operation," Tech. Rep. 66-38, Department of Engineering, University of California al Los Angeles, June 1966.
20. E.G. Coffman and L. Kleinrock, "Feedback queueing models for time-shared systems," Journal of the Association for Computing Machinery, no. 15,. pp. 549-576, 1968.
21. L.E. Schage, "The queue M/G/1 with feedback to lower priority queues," Management Science, no. 13, pp. 466-471, 1967.
22. M. Harchol-Balter, K. Sigman, and A. Wierman, "Asymptotic convergence of scheduling policies with respect lo slowdown," Performance Evaluation, no. 49, pp. 241-256, 2002.
23. K. Avrachenkokv, U. Ayesta, and P. Brown, "Batch arrival M/G/1 processor sharing with application to size-based scheduling," Tech. Rep., INRIA Technical Report RR-5043, 2003.
24. S. Aalto, U. Ayesta, and E. Nyberg, "Multilevel processor-sharing scheduling disciplines: mean delay analysis," Tech. Rep., Helsinki University of Technology, 2003.
25. S. Bellovin, "Defending against sequence number attacks," RFC 1948, May 1996.
26. Hari Balakrishnan, Venkata Padmanabhan, Srinivasan Seshan, Mark Stemm, and Randy Katz, "TCP behavior of a busy web server: analysis and improvements," in Proceedings of IEEE INFOCOM, San Francisco, CA, 1998.
27. "Network simulator, ver.2, (ns-2)," available at http://www-mash.cs.berkeley.edu/ns.