Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Predicting Short-Transfer Latency from TCP Arcana: A Trace-based Validation

In some contexts it may be useful to predict the latency for short TCP transfers. For example, a Web server could automatically tailor its content depending on the network path to each client, or an ``opportunistic networking'' application could improve its scheduling of data transfers.

Several techniques have been proposed to predict the latency of short TCP transfers based on online measurements of characteristics of the current TCP connection, or of recent connections from the same client. We analyze the predictive abilities of these techniques using traces from a variety of Web servers, and show that they can achieve useful accuracy in many, but not all, cases. We also show that a previously-described model for predicting short-transfer TCP latency can be improved with a simple modification. Ours is the first trace-based analysis that evaluates these prediction techniques across diverse user communities.

Martin Arlitt, HP Labs/University of Calgary

Balachander Krishnamurthy, AT&T Labs—Research

Jeffrey C. Mogul, HP Labs

BibTeX
@inproceedings {269201,
author = {Martin Arlitt and Balachander Krishnamurthy and Jeffrey C. Mogul},
title = {Predicting {Short-Transfer} Latency from {TCP} Arcana: A Trace-based Validation},
booktitle = {Internet Measurement Conference 2005 (IMC 05)},
year = {2005},
address = {Berkeley, CA},
url = {https://www.usenix.org/conference/imc-05/predicting-short-transfer-latency-tcp-arcana-trace-based-validation},
publisher = {USENIX Association},
month = oct
}
Download

Links

Paper: 
http://usenix.org/events/imc05/tech/full_papers/arlitt/arlitt.pdf
Paper (HTML): 
http://usenix.org/events/imc05/tech/full_papers/arlitt/arlitt_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us