jim (11/12/82)
Sorry this took so long. The responses are still trickling in. My original request was for a program that would read a uucp map, such as those sent out once a month or so on net.news.map, and given two uucp sites, would generate a list of possible shortest routes between those two sites. My apologies for not answering everyone individually. The most widely used route generator seems to be the one written by Steve Bellovin at UNC. It expects to use a map containing not just a list of sites and who they are connected to, but also "quality of connection" information. It will route you through six machines that poll each other once an hour rather than through one that only polls once a week. The drawback is that it is hard to keep the database up to date. I have a copy of the program now, but I haven't used it enough to evaluate it yet. Steve Bellovin is apparently leaving UNC, and I don't know who will be taking responsibility for the program. Here are some of the responses I got back: >From cornell!cbosgd!mark Wed Nov 3 03:20:49 1982 Date: 2-Nov-82 12:03:45-EST (Tue) Full-Name: Mark Horton Subject: Uucp route generator To: jim@uw-beaver.uucp Steve Bellovin is in limbo right now between Ph.D. thesis and starting work at Bell Labs. I have a fairly recent (1 month old database, 2 or 3 month old routing program) which I can send you if you'll send me your UUCP info, or you can get it over the arpanet from Raleigh Romine (romine@seismo). Mark >From microsof!decvax!harpo!duke!unc!wm Tue Nov 2 06:33:10 1982 Date: 1 Nov 82 22:42:40 EST (Mon) Original-From: Wm Leler <wm@unc> To: harpo!decvax!microsof!uw-beave!jim@duke.uucp You asked about the program that does automatic routing? I use it all the time. Send mail to unc!smb (we just call him smb@unc) for more information. Wm Leler - UNC Chapel Hill >From microsof!hp-pcd!tw Thu Nov 4 00:28:57 1982 Date: 3 Nov 1982 23:35-PST (Wednesday) Full-Name: Tw Cook - Hewlett-Packard PCD - Corvallis, Oregon Subject: mailer programs To: microsoft^uw-beaver^jim The UNC project got done, more or less. The software distributed with it expects hooks to be put into delivermail, which I wasn't interested in doing; so I use it to generate the database but use the mail front end From 'notesfiles' in conjunction with that. It is a GROSS kludge, but works pretty well. You'd be much better off with almost anything else, but if no-one else comes through, let me know and I'll try to put together something for you. Tw [microsoft!hp-pcd!tw or twc.hplabs@Udel-relay] >From lbl-unix!ucbvax!pur-ee!uiucdcs!donnelly Fri Nov 5 21:31:34 1982 Date: 4-Nov-82 01:19:54-PST (Thu) From: ucbvax!ucbvax!pur-ee!uiucdcs!donnelly Subject: uucp route generator Message-Id: <8210040919.11212@UCBVAX.BERKELEY.ARPA> Received: by UCBVAX.BERKELEY.ARPA (3.227 [10/22/82]) id A11206; 4-Nov-82 01:19:57-PST (Thu) To: pur-ee!ucbvax!lbl-unix!uw-beaver!jim I've got one if you want it. Its fairly fast. Let me know Jeff Donnelly (217) 333-6106 University of Illinois pur-ee!uiucdcs!donnelly >From microsof!decvax!harpo!druxv!cdash Tue Nov 2 16:27:42 1982 Date: Tue Nov 2 10:02:24 1982 From: c.m.shub TO: harpo!decvax!microsof!uw-beave!jim DATE: 11/2/82, 7:57 AM SUBJECT: routing sendmail `shortcut $1` saveIFS=$IFS; IFS=! l= for i in $1 do l="$i $l" done IFS=$saveIFS # $NEAL/misc/uuname.out is a list of direct access sites n= for i in $l do #avoid a trailing '!': if n is null, set it to $i, else $i!$n n=$i${n:+!$n} if fgrep -x $i $NEAL/misc/uuname.out >/dev/null then break fi done echo $n This guy shortens the route for replying to news articles is that what you wanted? ...druxv!cdash {charlie shub}