From: utzoo!decvax!duke!harpo!floyd!vax135!ariel!houti!lime!burdvax!puder
Newsgroups: net.news,net.wanted,net.followup
Title: Re: looking for the program that optimizes net paths
Article-I.D.: burdvax.492
Posted: Thu Jan 20 03:15:56 1983
Received: Fri Jan 21 08:30:58 1983
References: csu-cs.1988
I have set up a program (upath-to) on our system that will grep a path from
a prepared list of paths, and another program (umail) that preprocesses args
that contain '!' and then calls mail. The list of paths is generated by a
program (in lisp, of course) that finds a shortest path to a site from a
typical uucp map (lines of the form: siteneighbor1 neighbor2 ... ).
Note that this is not necessarily the most efficient path. The information
needed to find that (such as call frequency, polling direction(s)) is not
readily available to me.
I would have posted it to the net when I wrote it, but I was expecting it to
be obsoleted by the optimal path finder, so I have waited. Has anyone
really written an optimal path finder that uses more information than number
of sites in the path?
Karl Puder burdvax!puder SDC-aBC, R & D Paoli, Pa. (215)648-7555