Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!nysernic!itsgw!batcomputer!cornell!uw-beaver!mit-eddie!ll-xn!ames!sdcsvax!ucbvax!Q2.ICS.UCI.EDU!mmolle
From: mmolle@Q2.ICS.UCI.EDU.UUCP
Newsgroups: comp.protocols.tcp-ip
Subject: Re: TCP performance limitations
Message-ID: <8709291436.aa08098@Q2.ICS.UCI.EDU>
Date: Tue, 29-Sep-87 18:18:59 EDT
Article-I.D.: Q2.8709291436.aa08098
Posted: Tue Sep 29 18:18:59 1987
Date-Received: Fri, 2-Oct-87 01:35:42 EDT
References: <8709291301.AA12666@saturn.mitre.org>
Sender: daemon@ucbvax.BERKELEY.EDU
Distribution: world
Organization: The ARPA Internet
Lines: 9

Hey, wait a minute!  Even assuming no errors, arbitrarily high data rates
and arbitarily fast processors interpretting the protocols, there is still
propagation time across the channel to contend with.  Assuming a window
size of one (a.k.a. "stop and wait") you get at most one frame per round
trip time, i.e., a finite maximum data rate.  A larger (but still finite)
window size of W outstanding and unacknowledged frames raises that bound
by a factor of W, but it certainly doesn't give you infinite throughput.

Does that clarify the situation, or am I missing something deeper?