From: Scott Schremmer (scotths@cs.washington.edu)
Date: Mon Nov 01 2004 - 02:13:15 PST
This paper describes changes made to the routing protocol in
ARPANAT of a couple decades ago. Two versions of the routing are
discussed. The basic algorithm which they modify attempts to route by
considering the shortest path. The authors point out that this leads to
oscillations as the path length through the various routers is dependent on
the queue size at the routers. They explain a new way to compute these
quantities which works for both high and low network load. They show
mathematically that this is a good solution to the problem
It is hard to tell how relevant this paper is today. This paper deal with
networks in which the entire information for the network can be stored and
used at one of the nodes. Clearly our networks have become slightly more
complicated than that!
This archive was generated by hypermail 2.1.6 : Mon Nov 01 2004 - 02:13:15 PST