Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!swrinde!gem.mps.ohio-state.edu!sunybcs!sbcs!stealth!brnstnd
From: brnstnd@stealth.acf.nyu.edu (Dan Bernstein)
Newsgroups: comp.protocols.tcp-ip
Subject: Re: MXing the world
Message-ID: <3925@sbcs.sunysb.edu>
Date: 13 Nov 89 16:51:37 GMT
References: <2029@cmx.npac.syr.edu> <16300008@uxh.cso.uiuc.edu>
Sender: news@sbcs.sunysb.edu
Reply-To: brnstnd@stealth.acf.nyu.edu (Dan Bernstein)
Distribution: usa
Lines: 13

In article <16300008@uxh.cso.uiuc.edu> carlson@uxh.cso.uiuc.edu writes:
> IP routine minimizes travel time
> (and travail) for IP packets.

Ummm, no. It ``minimizes'' travel time based on an always out-of-date
picture of network load. The routing algorithms used by the Internet
transmit and use routing information as quickly and as often as data;
this leads to route flapping, completely lost routes, and other forms
of instability.

There is no way to minimize correctly, dynamically, and in real time.

---Dan