Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 alpha 4/15/85; site ucbvax.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!cbosgd!ucbvax!tcp-ip
From: tcp-ip@ucbvax.ARPA
Newsgroups: fa.tcp-ip
Subject: Re: Tinygrams on 4.2BSD
Message-ID: <7921@ucbvax.ARPA>
Date: Fri, 7-Jun-85 13:58:07 EDT
Article-I.D.: ucbvax.7921
Posted: Fri Jun  7 13:58:07 1985
Date-Received: Sat, 8-Jun-85 03:33:49 EDT
Sender: daemon@ucbvax.ARPA
Organization: University of California at Berkeley
Lines: 19

From: MILLS@USC-ISID.ARPA

In response to the message sent  Fri, 7 Jun 85 01:36:52 edt from bellcore!karn@Berkeley 

Phill,

Please understand the "John Nagle algorithm" does not in itself represent
a panacea, but only one of many detail-engineering issues involved in making
TCP work well over widely ranging scenarios. That algorithm must be addressed
in the context of a good ack policy. Experiments done here reveal the algorithm
can result in very poor performance with some ack policies and can adversely
affect performance in scenarios in the middle, so to speak, of the TELNET
character-at-a-time and FTP spectrum. Simply stuffing the algorithm in the
system blindly may exchange better performance at these extremes, which
we ordinarily see first-hand, for poorer performance in the middle (e.g. mail),
which chugs in the background slurping up resources we may not notice.

Dave
-------