Last update: Wed Jul 13 02:04:01 2016
@Article{Davids:2001:TEF,
author = "Noah Davids",
title = "{TCP} --- Either Fast or Efficient",
journal = j-SYS-ADMIN,
volume = "10",
number = "5",
pages = "53--57",
month = may,
year = "2001",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Mon Apr 16 18:53:13 MDT 2001",
URL = "http://www.samag.com/",
abstract = "TCP uses two strategies to reduce overhead -- the
Nagle algorithm and delayed acknowledgment. Davids
describes these two strategies, explains how they
impact performance, and shows how performance can be
improved.",
bibsource = "http://www.math.utah.edu/pub/tex/bib/sysadmin.bib",
acknowledgement = ack-nhfb,
}