|
|
1.1 ! root 1: .TH PATHS 8 ! 2: .tr ~ ! 3: .SH NAME ! 4: paths \- smail routing database ! 5: .SH DESCRIPTION ! 6: The ! 7: .I paths ! 8: file is the routing database for ! 9: .IR smail . ! 10: Each line of the file provides routing information ! 11: to either a host or to a domain. Each line should ! 12: have either two or three tab (ascii~0x9) separated fields. ! 13: The format of each line in the paths file is: ! 14: .tr ~ ! 15: .sp ! 16: .ce ! 17: \fIkey~~route~~~[cost]\fP ! 18: .sp ! 19: The ! 20: .I key ! 21: field is the key on which searches are performed. ! 22: Typically this is either a UUCP host name or a domain name. ! 23: .I smail ! 24: uses a binary search algorithm when searching the database, ! 25: so the keys must be sorted in ascending order. ! 26: Case is ignored when searching, so the keys should be converted ! 27: to lower case before sorting (see ! 28: .IR lcase (8) ! 29: and ! 30: .IR pathproc (8)). ! 31: .B Warning: ! 32: There is a bug in ! 33: .I sort -f, ! 34: so don't use it. Convert the keys to lower case, and then sort. ! 35: .PP ! 36: The ! 37: .I route ! 38: field is a "printf" string that details the route that mail to the ! 39: .I key ! 40: should take. ! 41: See ! 42: .I pathalias ! 43: documentation for details. ! 44: .PP ! 45: The optional ! 46: .I cost ! 47: field is used by ! 48: .I smail ! 49: to determine whether to simply queue outbound ! 50: UUCP mail, or to attempt immediate delivery ! 51: (usually by invoking ! 52: .IR uucico ). ! 53: If the cost field is present, and the value is at or below ! 54: .IR smail "'s" ! 55: .I queueing threshold ! 56: then the mail will be queued and an attempt at immediate delivery ! 57: will be made. This will speed mail delivery between hosts who ! 58: enjoy a cheap uucp link, like a hardwired line or some other ! 59: low cost transport medium, while allowing mail sent over more ! 60: expensive media to accumulate before transmission. ! 61: If the field is absent, the cost defaults to a value ! 62: above the ! 63: .I queueing threshold. ! 64: The default value for the queueing threshold is equal to the pathalias ! 65: cost DEDICATED+LOW. Thus, direct links with cost DEDICATED+LOW or less ! 66: will see immediate delivery, while the others are queued for later delivery. ! 67: .SH EXAMPLE ! 68: Here's a sample paths file for a small host, like a pc, that doesn't ! 69: want to maintain complete routing information. It illustrates ! 70: most of the aspect of the ! 71: .I paths ! 72: file. Assme that the pc's name is ! 73: .I mypc, ! 74: and that it's in domain ! 75: .I .mydomain. ! 76: Also, assume that it has a dedicated link to ! 77: a smart host named ! 78: .I bighub, ! 79: and that ! 80: .IR bighub 's ! 81: administrator has given ! 82: .I mypc ! 83: .B permission ! 84: to use ! 85: .I bighub ! 86: as a mail relay. ! 87: Lastly, assume that ! 88: .I mypc ! 89: has a dialed on demand link to another computer named ! 90: .I friend. ! 91: .nf ! 92: .sp ! 93: .in +5 ! 94: \fIpathalias\fP input ! 95: .sp ! 96: mypc = .mypc.mydomain ! 97: mypc friend(DEMAND), bighub(DEDICATED) ! 98: smart-host = bighub ! 99: .sp ! 100: \fIpaths\fP file produced by \fIpathalias -f inputfile|pathproc\fP ! 101: .sp ! 102: .mypc.mydomain %s 0 ! 103: bighub bighub!%s 95 ! 104: friend friend!%s 300 ! 105: mypc %s 0 ! 106: smart-host bighub!%s 95 ! 107: .in ! 108: .sp ! 109: .fi ! 110: .SH SEE ALSO ! 111: pathalias - by Peter Honeyman ! 112: .br ! 113: smail(8), lcasep(8), pathproc(8) ! 114: .SH VERSION ! 115: @(#)paths.8 2.5 (smail) 9/15/87
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.