Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Critical path analysis of TCP transactions

Published: 01 April 2001 Publication History

Abstract

Improving the performance of data transfers in the Internet (such as Web transfers) requires a detailed understanding of when and how delays are introduced. Unfortunately, the complexity of data transfers like those using HTTP is great enough that identifying the precise causes of delays is difficult. In this paper we describe a method for pinpointing where delays are introduced into applications like HTTP by using critical path analysis. By constructing and profiling the critical path, it is possible to determine what fraction of total transfer latency is due to packet propagation, network variation (e.g., queuing at touters or route fluctuation), packet losses, and delays at the server and at the client. We have implemented our technique in a tool called tcpeval that automates critical path analysis for Web transactions. We show that our analysis method is robust enough to analyze traces taken for two different TCP implementations (Linux and FreeBSD). To demonstrate the utility of our approach, we present the results of critical path analysis for a set of Web transactions taken over 14 days under a variety of server and network conditions. The results show that critical path analysis can shed considerable light on the causes of delays in Web transfers, and can expose subtleties in the behavior of the entire end-to-end system.

References

[1]
M. Allman, S. Floyd, and C. Partridge. Increasing TCP's initial window. IETF RFC 2414, September 1998.]]
[2]
J. Almeida, V. Almeida, and D. Yates. Measuring the behavior of a world wide web server. In Proceedings of the Seventh IFIP Conference on High Performance Networking (HPN), White Plains, NY, April 1997.]]
[3]
M. Arlitt and C. Williamson. Internet web servers: workload characterization and performance implications. IEEE/ACM Transactions on Networking, 5(5):631--645, October 1997.]]
[4]
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable content-aware request distribution in cluster-based network servers. In Proceedings of the USENIX 2000 Conference, San Diego, CA, June 2000.]]
[5]
H. Balakrishnan, V. Padmanabhan, S. Seshan, M. Stemm, and R. Katz. Tcp behavior of a busy internet server: Analysis and improvements. In Proceedings of IEEE INFOCOM '98, San Francisco, CA, March 1998.]]
[6]
G. Banga and J. Mogul. Scalable kernel performance for internet servers under realistic loads. In Proceedings of the USENIX Annual Technical Conference, New Orleans, LA, June 1998.]]
[7]
P. Barford and M. Crovella. Generating representative workloads for network and server performance evaluation. In Proceedings of ACM SIGMETRICS '98, pages 151--160, Madison, WI, June 1998.]]
[8]
P. Barford and M. Crovella. A performance evaluation of hyper text transfer protocols. In Proceedings of ACM SIGMETRICS '99, Atlanta, GA, May 1999.]]
[9]
A. Bestavros, M. Crovella, J. Liu, and D. Martin. Distributed packet rewriting and its application to scalable server architectures. In Proceedings of the 1998 International Conference on Network Protocols (ICNP '98), October 1998.]]
[10]
J. Bolot. End-to-end packet delay and loss behavior in the Internet. In Proceedings of ACM SIGCOMM '93, San Francisco, September 1993.]]
[11]
L. Brakmo, S. O'Malley, and L. Peterson. TCP Vegas: New techniques for congestion detection and avoidance. In Proceedings of ACM SIGMETRICS '96, Philadelphia, PA, May 1996.]]
[12]
N. Cardwell, S. Savage, and T. Anderson. Modeling TCP latency. In Proceedings of the 2000 IEEE Infocom Conference, Tel-Aviv, Israel, March 2000.]]
[13]
Mark E. Crovella and Azer Bestavros. Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Transactions on Networking, 5(6):835--846, December 1997.]]
[14]
P. Druschel, V. Pai, and W. Zwaenepoel. Flash: An efficient and portable web server. In Proceedings of the USENIX 1999 Annual Technical Conference, Monterey, CA, June 1999.]]
[15]
R. Fielding, J. Gettys, J. Mogul, H, Frystyk, and T. Berners-Lee. Hypertext transfer protocol -- HTTP/1.1. IETF RFC 2068, January 1997.]]
[16]
H. Frystyk-Nielsen, J. Gettys, A. Baird-Smith, E. Prud'hommeaux, H. Wium-Lie, and C. Lilley. Network performance effects of HTTP/1.1, CSS1 and PNG. In Proceedings of ACM SIGCOMM '97, Cannes, France, September 1997.]]
[17]
J. K. Hollingsworth and B. P. Miller. Parallel program performance metrics: A comparison and validation. In Proceedings of Supercomputing '92, November 1992.]]
[18]
C. Huitema. Internet quality of service assessment. ftp.telcordia.com/pub/huitema/stats/quality_today.html, 2000.]]
[19]
Keynote Systems Inc. http://www.keynote.com, 1998.]]
[20]
Lucent NetCare Inc. net.medic. http://www.ins.com/software/medic/datasheet/index.asp, 1997.]]
[21]
V. Jacobson. Congestion avoidance and control. In In Proceedings of ACM SIGCOMM '88, pages 314--332, August 1988.]]
[22]
B. Krishnamurthy and C. Willis. Analyzing factors that influence end-to-end web performance. In Proceedings of the Ninth International World Wide Web Conference, Amsterdam, Netherlands, May 2000.]]
[23]
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558--565, July 1978.]]
[24]
D. Lin and H. T. Kung. TCP fast recovery strategies: Analysis and improvements. In Proceedings of IEEE INFOCOM '98, San Francisco, CA, March 1998.]]
[25]
K. G. Lockyer. Introduction to Critical Path Analysis. Pitman Publishing Co., New York, N.Y., 1964.]]
[26]
M. Mathis, J. Semke, J. Mahdavi, and T. Ott. The macroscopic behavior of the TCP congestion avoidance algorithm. Computer Communications Review, 27(3), July 1997.]]
[27]
B. P. Miller, M. Clark, J. Hollingsworth, S. Kierstead, S. Lim, and T. Torzewski. IPS-2: The second generation of a parallel program measurement system. IEEE Transactions on Parallel and Distributed Systems, 1(2):206--217, April 1990.]]
[28]
D. Mills. Network time protocol (version 3): Specification, implementation and analysis. Technical Report RFC 1305, Network Information Center, SRI International, Menlo Park, CA, 1992.]]
[29]
J. Mogul. The case for persistent-connection HTTP. Technical Report WRL 95/4, DEC Western Research Laboratory, Palo Alto, CA, 1995.]]
[30]
J. Mogul, F. Douglis, A. Feldmann, and B. Krishnamurthy. Potential benefits of delta encoding and data compression for HTTP. In Proceedings of ACM SIGCOMM '97, Cannes, France, Setpember 1997.]]
[31]
J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP throughput: A simple model and its empirical validation. In Proceedings of ACM SIGCOMM '98, Vancouver, Canada, September 1998.]]
[32]
V. Padmanabhan and R. Katz. TCP fast start: A technique for speeding up web transfers. In Proceedings of the IEEE GLOBECOM '98, November 1998.]]
[33]
V. Paxson. Automated packet trace analysis of TCP implementations. In Proceedings of ACM SIGCOMM '97, Cannes, France, September 1997.]]
[34]
V. Paxson. End-to-end internet packet dynamics. In Proceedings of ACM SIGCOMM '97, Cannes, France, September 1997.]]
[35]
V. Paxson. Measurements and Analysis of End-to-End Internet Dynamics. PhD thesis, University of California Berkeley, 1997.]]
[36]
Apache HTTP Server Project. http://www.apache.org, 1998.]]
[37]
M. Schroeder and M. Burrows. Performance of firefly rpc. In Proceedings of the Twelfth ACM Symposium on Operating System Principles, Litchfield Park, AZ, December 1989.]]
[38]
T. Shepard. TCP packet trace analysis. Master's thesis, Massachusetts Institute of Technology, 1990.]]
[39]
W. Stevens. TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms. RFC 2001, January 1997.]]
[40]
W. R. Stevens. TCP/IP Illustrated, Volume 1: The Protocols. Addison-Wesley, 1994.]]
[41]
C.-Q. Yang and B. Miller. Critical path analysis for the execution of parallel and distributed programs. In Proceedings of 8th International Conference on Distributed Computing Systems, San Jose, CA, June 1997.]]

Cited By

View all
  • (2023)Distributed computation of the critical path from execution tracesSoftware: Practice and Experience10.1002/spe.321053:8(1722-1737)Online publication date: 3-May-2023
  • (2019)A machine learning approach for packet loss prediction in science flowsFuture Generation Computer Systems10.1016/j.future.2019.07.053Online publication date: Aug-2019
  • (2012)Scalable Critical-Path Based Performance AnalysisProceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium10.1109/IPDPS.2012.120(1330-1340)Online publication date: 21-May-2012
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review  Volume 31, Issue 2 supplement
Workshop on data communication in Latin America and the Caribbean
April 2001
248 pages
ISSN:0146-4833
DOI:10.1145/844193
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 2001
Published in SIGCOMM-CCR Volume 31, Issue 2 supplement

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Distributed computation of the critical path from execution tracesSoftware: Practice and Experience10.1002/spe.321053:8(1722-1737)Online publication date: 3-May-2023
  • (2019)A machine learning approach for packet loss prediction in science flowsFuture Generation Computer Systems10.1016/j.future.2019.07.053Online publication date: Aug-2019
  • (2012)Scalable Critical-Path Based Performance AnalysisProceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium10.1109/IPDPS.2012.120(1330-1340)Online publication date: 21-May-2012
  • (2007)Statistical performance critical path analysis for service-oriented systemsProceedings of the 45th annual ACM Southeast Conference10.1145/1233341.1233447(527-528)Online publication date: 23-Mar-2007
  • (2007)Identifying Performance-Critical Components in Transaction-Oriented Distributed SystemsProceedings of the Fourth International Conference on Autonomic Computing10.1109/ICAC.2007.24Online publication date: 11-Jun-2007
  • (2005)Extracting Critical Path Graphs from MPI Applications2005 IEEE International Conference on Cluster Computing10.1109/CLUSTR.2005.347035(1-10)Online publication date: Sep-2005

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media