Recent from talks
Nothing was collected or created yet.
| UUCP | |
|---|---|
| Original author | Mike Lesk |
| Developer | AT&T Bell Laboratories |
| Initial release | 1979 |
| Operating system | Unix and Unix-like, DOS, OS/2, OpenVMS, AmigaOS, classic Mac OS, CP/M |
| Type | Command |
| Internet history timeline |
|
Early research and development:
Merging the networks and creating the Internet:
Commercialization, privatization, broader access leads to the modern Internet:
Examples of Internet services:
|
UUCP (Unix-to-Unix Copy)[1] is a suite of computer programs and protocols allowing remote execution of commands and transfer of files, email and netnews between computers.
A command named uucp is one of the programs in the suite; it provides a user interface for requesting file copy operations. The UUCP suite also includes uux (user interface for remote command execution), uucico (the communication program that performs the file transfers), uustat (reports statistics on recent activity), uuxqt (execute commands sent from remote machines), and uuname (reports the UUCP name of the local system). Some versions of the suite include uuencode/uudecode (convert 8-bit binary files to 7-bit text format and vice versa).
Although UUCP was originally developed on Unix in the 1970s and 1980s, and is most closely associated with Unix-like systems, UUCP implementations exist for several non-Unix-like operating systems, including DOS, OS/2, OpenVMS (for VAX hardware only), AmigaOS,[2] classic Mac OS, and even CP/M.
History
[edit]UUCP was originally written at AT&T Bell Laboratories by Mike Lesk.[3] By 1978, it was in use on 82 UNIX machines inside the Bell system, primarily for software distribution. It was released in 1979 as part of Version 7 Unix.[4]
The first UUCP emails from the U.S. arrived in the United Kingdom in 1979 and email between the UK, the Netherlands and Denmark started in 1980, becoming a regular service via EUnet in 1982.[5][6]
The original UUCP was rewritten by AT&T researchers Peter Honeyman, David A. Nowitz, and Brian E. Redman around 1983. The rewrite is referred to as HDB or HoneyDanBer uucp, which was later enhanced, bug fixed, and repackaged as BNU UUCP ("Basic Network Utilities").[7]
Each of these versions was distributed as proprietary software, which inspired Ian Lance Taylor to write a new free software version from scratch in 1991.[8] Taylor UUCP was released under the GNU General Public License. Taylor UUCP addressed security holes which allowed some of the original network worms to remotely execute unexpected shell commands. Taylor UUCP also incorporated features of all previous versions of UUCP, allowing it to communicate with any other version and even use similar config file formats from other versions.
UUCP was also implemented for non-UNIX operating systems, most-notably DOS systems. Packages such as UUSLAVE/GNUUCP (John Gilmore, Garry Paxinos, Tim Pozar), UUPC/extended (Drew Derbyshire of Kendra Electronic Wonderworks) and FSUUCP (Christopher Ambler of IODesign), brought early Internet connectivity to personal computers, expanding the network beyond the interconnected university systems. FSUUCP formed the basis for many bulletin board system (BBS) packages such as Galacticomm's Major BBS and Mustang Software's Wildcat! BBS to connect to the UUCP network and exchange email and Usenet traffic. As an example, UFGATE (John Galvin, Garry Paxinos, Tim Pozar) was a package that provided a gateway between networks running Fidonet and UUCP protocols.
FSUUCP was the only other implementation of Taylor's enhanced 'i' protocol, a significant improvement over the standard 'g' protocol used by most UUCP implementations.[citation needed]
Technology
[edit]Before the widespread availability of Internet access, computers were only connected by smaller local area networks within a company or organization. They were also often equipped with modems so they could be used remotely from character-mode terminals via dial-up telephone lines. UUCP used the computers' modems to dial out to other computers, establishing temporary, point-to-point links between them. Each system in a UUCP network has a list of neighbor systems, with phone numbers, login names and passwords, etc. When work (file transfer or command execution requests) is queued for a neighbor system, the uucico program typically calls that system to process the work. The uucico program can also poll its neighbors periodically to check for work queued on their side; this permits neighbors without dial-out capability to participate.
Over time, dial-up links were replaced by Internet connections, and UUCP added a number of new link layer protocols. These newer connections also reduced the need for UUCP at all, as newer application protocols developed to take advantage of the new networks. Today, UUCP is rarely used over dial-up links, but is occasionally used over TCP/IP.[9][10] The number of systems involved, as of early 2006, ran between 1500 and 2000 sites across 60 enterprises. UUCP's longevity can be attributed to its low cost, extensive logging, native failover to dialup, and persistent queue management.
Sessions
[edit]UUCP is normally started by having a user log into the target system and then running the UUCP program. In most cases, this is automated by logging into a known user account used for transfers, whose account's shell has been set to uucico. Thus, for automated transfers, another machine simply has to open a modem connection to the called machine and log into the known account.
When uucico runs, it will expect to receive commands from another UUCP program on the caller's machine and begin a session. The session has three distinct stages:
- Initial handshake
- File request(s)
- Final handshake
Initial handshake
[edit]On starting, uucico will respond by sending an identification string, \20Shere=hostname\0, where \20 is the control-P character, and \0 is a trailing null. The caller's UUCP responds with \20Scallername options\0, where options is a string containing zero or more Unix-like option switches. These can include packet and window sizes, the maximum supported file size, debugging options, and others.
Depending on the setup of the two systems, the call may end here. For instance, when the caller responds with their system name, the called system may optionally hang up if it does not recognize the caller, sending the RYou are unknown to me\0 response string and then disconnecting.
File requests
[edit]If the two systems successfully handshake, the caller will now begin to send a series of file requests. There are four types:
- S causes a file to be Sent from the caller to the called system (upload). The from and to names are provided, allowing the filename to be changed on the receiver. When the S command is received on the called system, it responds with SY if it succeeded and it is ready to accept the file, or SNx if it failed, where x is a failure code. If an SY is received by the caller, it begins uploading the file using the protocol selected during the initial handshake (see below). When the transfer is complete, the called system responds with CY if it successfully received the file, or CN5 if it failed.
- R is a Request for the called system to send a file to the caller (download). It is otherwise similar to S, using RY and RN to indicate the command was accepted and it will begin to send data or had a problem, and expecting a CY and CN5 from the caller at the end of the transfer.
- X uploads commands to be eXecuted on the called system. This can be used to make that system call another and deliver files to it. The called system responds with XY if it succeeded, or XN if it failed.
- H, for Hangup, indicates the caller is done. The called system responds with HY if it succeeded, or HN if it failed.
Final handshake
[edit]After sending an H command, the calling system sends a final packet \20OOOOOO\0 (control-P, six ohs, null-terminator) and the called system responds with \20OOOOOO\0 (control-P, seven ohs, null-terminator). Some systems will simply hang up on the successful reception of the H command and not bother with the final handshake.
g-protocol
[edit]Within the suite of protocols in UUCP, the underlying g-protocol is responsible for transferring information in an error-free form. The protocol originated as a general-purpose system for packet delivery, and thus offers a number of features that are not used by the UUCP package as a whole. These include a secondary channel that can send command data interspersed with a file transfer, and the ability to renegotiate the packet and window sizes during transmission. These extra features may not be available in some implementations of the UUCP stack.[11]
The packet format consisted of a 6-byte header and then between zero and 4096 bytes in the payload. The packet starts with a single \020 (control-P). This is followed by a single byte, known as "K", containing a value of 1 to 8 indicating a packet size from 32 to 4096 bytes, or a 9 indicating a control packet. Many systems only supported K=2, meaning 64 bytes. The next two bytes were a 16-bit checksum of the payload, not including the header. The next byte is the data type and finally, the last byte is the XOR of the header, allowing it to be checked separately from the payload.[11]
The control byte consists of three bit-fields in the format TTXXXYYY. TT is the packet type, 0 for control packets (which also requires K=9 to be valid), 1 for alternate data (not used in UUCP), 2 for data, and 3 indicates a short packet that re-defines the meaning of K. In a data packet, XXX is the packet number for this packet from 0 to 7, and YYY is the last that was received correctly. This provides up to 8 packets in a window. In a control packet, XXX indicates the command and YYY is used for various parameters. For instance, transfers are started by sending a short control packet with TT=0 (control), XXX=7 and YYY the number of packets in a window, then sending another packet with XXX=6 and YYY as the packet length (encoded as it would be in K) and then a third packet that is identical to the first but XXX=5.[11]
g-protocol uses a simple sliding window system to deal with potentially long latencies between endpoints. The protocol allows packets to size from 32 to 4096 8-bit bytes, and windows that include 1 to 7 packets. In theory, a system using 4k packets and 7 packet windows (4096x7) would offer performance matching or beating the best file-transfer protocols like ZMODEM. In practice, many early implementations only supported a single setting of 64x3. As a result, the g-protocol has an undeserved reputation for poor performance. Confusion over the packet and window sizes led to the G-protocol, differing only in that it always used 4096x3. Taylor UUCP did not support G, but did support any valid requested window or packet size, so remote systems starting G would work fine with Taylor's g, while two Taylor systems could negotiate even faster connections.[11]
Telebit modems used protocol spoofing to improve the performance of g-protocol transfers by noticing end-of-packet markers being sent to the remote system and immediately sending an ACK back to the local host, pretending that the remote system had already received the packet and decoded it correctly. This triggered the software stack on the local computer to send the next packet, so rapidly that the transfer became almost continuous. The data between the two modems was error-corrected using a proprietary protocol based on MNP that ran over Telebit's half-duplex connections much better than g-protocol would normally,[11] because in the common 64x3 case the remote system would be sending a constant stream of ACKs that would overflow the low-speed return channel. Combined with the modem's naturally higher data rates, up to 23 kbps, they greatly improved overall throughput and generally performed about seven times the speed of a 2400 bit/s modem.[12] They were widely used on UUCP hosts as they could quickly pay for themselves in reduced long-distance charges.
Other protocols
[edit]UUCP implementations also include other transfer protocols for use over certain links.
f-protocol is designed to run over 7-bit error-corrected links. This was originally intended for use on X.25 links, which were popular for a time in the 1980s. It does not packetize data, instead, the entire file is sent as a single long string followed by a whole-file checksum. The similar x-protocol appears to have seen little or no use. d-protocol was similar to x, but intended for use on Datakit networks that connected many of Bell Labs offices.[11]
t-protocol originated in the BSD versions of UUCP and like some similar ones, is designed to run over 8-bit error-free TCP/IP links. It has no error correction at all, and the protocol consists simply of breaking up command and file data into 512 or 1024-byte packets to easily fit within typical TCP frames.
e-protocol ("e" for Ethernet) was developed by Clem Cole at MASSCOMP and was widely released by Brian Redman in the later HoneyDanBer versions. It was developed and released before the t-protocol, but the t-protocol was more commonly used because the BSD version of UUCP was the dominant implementation. The e-protocol differs from the t-protocol only in that commands are not packetized and are instead sent as normal strings, while files are padded to the nearest 20 bytes.[11][13]
Mail routing
[edit]
The uucp and uuxqt capabilities could be used to send email between machines, with suitable mail user interfaces and delivery agent programs. A simple UUCP mail address was formed from the adjacent machine name, an exclamation mark (often pronounced bang), followed by the user name on the adjacent machine. For example, the address barbox!user would refer to user user on adjacent machine barbox.[14]
Mail could furthermore be routed through the network, traversing any number of intermediate nodes before arriving at its destination. Initially, this had to be done by specifying the complete path, with a list of intermediate host names separated by bangs. For example, if machine barbox is not connected to the local machine, but it is known that barbox is connected to machine foovax which does communicate with the local machine, the appropriate address to send mail to would be foovax!barbox!user.
User barbox!user would generally publish their UUCP email address in a form such as …!bigsite!foovax!barbox!user. This directs people to route their mail to machine bigsite (presumably a well-known and well-connected machine accessible to everybody) and from there through the machine foovax to the account of user user on barbox. Publishing a full path would be pointless, because it would be different, depending on where the sender was. (e.g. Ann at one site may have to send via path gway!tcol!canty!uoh!bigsite!foovax!barbox!user, whereas from somewhere else, Bill has to send via the path pdp10!router22!bigsite!foovax!barbox!user). Many users would suggest multiple routes from various large well-known sites, providing even better and perhaps faster connection service from the mail sender.
Bang path
[edit]An email address of this form was known as a bang path. Bang paths of eight to ten machines (or hops) were not uncommon in 1981, and late-night dial-up UUCP links could cause week-long transmission times. Bang paths were often selected by both transmission time and reliability, as messages would often get lost. Some hosts went so far as to try to "rewrite" the path, sending mail via "faster" routes—this practice tended to be frowned upon.
The "pseudo-domain" ending .uucp was sometimes used to designate a hostname as being reachable by UUCP networking, although this was never formally registered in the domain name system (DNS) as a top-level domain. The uucp community administered itself and did not mesh well with the administration methods and regulations governing the DNS; .uucp works where it needs to[where?]; some hosts[which?] punt mail out of SMTP queue into uucp queues on gateway machines if a .uucp address is recognized on an incoming SMTP connection.[citation needed]
Usenet traffic was originally transmitted over the UUCP protocol, typically over dialup modems. At each receiving node, each Usenet article's Path header line would have the current node's name prepended to the path, separated by "!". For example, an article that came in from node utzoo to node decvax with Path: utzoo!henry would have that line change to Path: decvax!utzoo!henry). Usenet software would then send a copy of each article to every neighbor node which had been configured to receive the newsgroup(s) that the article had been posted to -- unless that neighbor was already in the Path line. These paths were thus used to ensure that articles did not "loop" back to a node that already had them.
In general, like other older e-mail address formats, bang paths have now been superseded by the "@ notation", even by sites still using UUCP. A UUCP-only site can register a DNS domain name, and have the DNS server that handles that domain provide MX records that cause Internet mail to that site to be delivered to a UUCP host on the Internet that can then deliver the mail to the UUCP site.
UUCPNET and mapping
[edit]UUCPNET was the name for the totality of the network of computers connected through UUCP. This network was very informal, maintained in a spirit of mutual cooperation between systems owned by thousands of private companies, universities, and so on. Often, particularly in the private sector, UUCP links were established without official approval from the companies' upper management. The UUCP network was constantly changing as new systems and dial-up links were added, others were removed, etc.
The UUCP Mapping Project was a volunteer, largely successful effort to build a map of the connections between machines that were open mail relays and establish a managed namespace. Each system administrator would submit, by e-mail, a list of the systems to which theirs would connect, along with a ranking for each such connection. These submitted map entries were processed by an automatic program that combined them into a single set of files describing all connections in the network. These files were then published monthly in a newsgroup dedicated to this purpose. The UUCP map files could then be used by software such as "pathalias" to compute the best route path from one machine to another for mail, and to supply this route automatically. The UUCP maps also listed contact information for the sites, and so gave sites seeking to join UUCPNET an easy way to find prospective neighbors.
Connections with the Internet
[edit]Many UUCP hosts, particularly those at universities, were also connected to the Internet in its early years, and e-mail gateways between Internet SMTP-based mail and UUCP mail were developed. A user at a system with UUCP connections could thereby exchange mail with Internet users, and the Internet links could be used to bypass large portions of the slow UUCP network. A "UUCP zone" was defined within the Internet domain namespace to facilitate these interfaces.
With this infrastructure in place, UUCP's strength was that it permitted a site to gain Internet e-mail and Usenet connectivity with only a dial-up modem link to another cooperating computer. This was at a time when true Internet access required a leased data line providing a connection to an Internet Point of Presence, both of which were expensive and difficult to arrange. By contrast, a link to the UUCP network could usually be established with a few phone calls to the administrators of prospective neighbor systems. Neighbor systems were often close enough to avoid all but the most basic charges for telephone calls.
Remote commands
[edit]uux is remote command execution over UUCP. The uux command is used to execute a command on a remote system, or to execute a command on the local system using files from remote systems. The command is run by the uucico daemon, which handles remote execution requests as simply another kind of file to batch-send to the remote system whenever a next-hop node is available. The remote system will then execute the requested command and return the result, when the original system is available. Both of these transfers may be indirect, via multi-hop paths, with arbitrary windows of availability. Even when executing a command on an always-available neighbor, uux is not instant.
Decline
[edit]UUCP usage began to die out with the rise of Internet service providers offering inexpensive SLIP and PPP services. The UUCP Mapping Project was formally shut down in late 2000.
The UUCP protocol has now mostly been replaced by the Internet TCP/IP based protocols SMTP for mail and NNTP for Usenet news.
In July 2012, Dutch Internet provider XS4ALL closed down its UUCP service, claiming it was "probably one of the last providers in the world that still offered it"; it had only 13 users at that time (prior to its shut-down it had refused requests from new users for several years).[15]
Current uses and legacy
[edit]One surviving feature of UUCP is the chat file format, largely inherited by the Expect software package.
UUCP was in use over special-purpose high cost links (e.g. marine satellite links) long after its disappearance elsewhere,[16] and still remains in legacy use.[citation needed] In addition to legacy use, in 2021 new and innovative UUCP uses are growing, especially for telecommunications in the HF band, for example, for communities in the Amazon rainforest for email exchange and other uses. A patch to Ian's UUCP was contributed to UUCP Debian Linux package[17] to adapt for the HERMES (High-Frequency Emergency and Rural Multimedia Exchange System) project, which provides UUCP HF connectivity.[18]
In the mid 2000s, UUCP over TCP/IP (often encrypted, using the SSH protocol[10]) was proposed[by whom?] for use when a computer does not have any fixed IP addresses but is still willing to run a standard mail transfer agent (MTA) like Sendmail or Postfix.
Bang-like paths are still in use within the Usenet network, though not for routing; they are used to record, in the header of a message, the nodes through which that message has passed, rather than to direct where it will go next.[19] "Bang path" is also used as an expression for any explicitly specified routing path between network hosts. That usage is not necessarily limited to UUCP, IP routing, email messaging, or Usenet.
The concept of delay-tolerant networking protocols was revisited in the early 2000s.[20] Similar techniques as those used by UUCP can apply to other networks that experience delay or significant disruption.
See also
[edit]References
[edit]- ^ UNIX(TM) TIME-SHARING SYSTEM: UNIX PROGRAMMER'S MANUAL, Seventh Edition, Volume 1 (PDF). Murray Hill, New Jersey: Bell Telephone Laboratories, Incorporated. January 1979. Archived (PDF) from the original on 2016-04-29. Retrieved 2018-02-20.
- ^ "Aminet - Search".
- ^ McIlroy, M. D. (1987). A Research Unix reader: annotated excerpts from the Programmer's Manual, 1971–1986 (PDF) (Technical report). CSTR. Bell Labs. 139. Archived (PDF) from the original on 2017-11-11. Retrieved 2015-02-01.
- ^ "Version 7 Unix manual: "UUCP Implementation Description" by D. A. Nowitz, and "A Dial-Up Network of UNIX Systems" by D. A. Nowitz and M. E. Lesk" (PDF). Archived (PDF) from the original on 2018-02-21. Retrieved 2018-02-21.
- ^ Houlder, Peter (19 January 2007). "Starting the Commercial Internet in the UK" (PDF). 6th UK Network Operators' Forum. Retrieved 2020-02-12.
- ^ Reid, Jim (3 April 2007). "Networking in UK Academia ~25 Years Ago" (PDF). 7th UK Network Operators' Forum. Archived from the original (PDF) on 2007-08-20. Retrieved 2020-02-12.
- ^ Gary J. Murakami (September 24, 1988). "The History of ihnp4 and The Growth of the Email Network". Archived from the original on September 11, 2013. Retrieved June 7, 2013.
- ^ Ian Lance Taylor (September 1991). "Beta release of new UUCP package available". Retrieved 2009-01-19.
- ^ Ian Lance Taylor (June 2003). "UUCP 'f' Protocol". Archived from the original on 2008-07-18. Retrieved 2008-08-04.
- ^ a b Fabien Penso. "UUCPssh". Archived from the original on 2009-09-30. Retrieved 2009-08-09.
- ^ a b c d e f g Taylor, Ian Lance (8 March 1996). "UUCP Internals Frequently Asked Questions". Archived from the original on 6 November 2019. Retrieved 29 August 2020.
- ^ Kirksey, Kenneth (25 December 1991). "What You Need To Know About Modems". Archived from the original on 24 October 2020. Retrieved 29 August 2020.
The actual throughput is around 14400 bps.
- ^ Talbot, Stephen (February 1988). UUCP Management Guide, Rev C. User Manuals. Massachusetts Computer Corporation.
- ^ Cerf, Vint (20 March 2022). "[Internet Policy] Why the World Must Resist Calls to Undermine the Internet". IETF-Discussion (Mailing list). Retrieved 24 March 2022.
- ^ Huijbregts, Niels (30 July 2012). "XS4ALL Weblog: Afscheid van UUCP (Goodbye to UUCP)" (in Dutch). XS4ALL. Archived from the original on 31 July 2013.
- ^ Randolph Bentson (August 1995). "Linux Goes To Sea". Archived from the original on 2008-02-26. Retrieved 2009-02-21.
- ^ Rafael Diniz (January 2021). "UUCP 1.07.27-changelog". Archived from the original on 2020-08-12. Retrieved 2021-01-10.
- ^ Rafael Diniz (January 2021). "High-frequency Emergency and Rural Multimedia Exchange System". Retrieved 2021-01-10.
- ^ K. Murchison; C. Lindsey; D. Kohn (November 2009). "Path". Netnews Article Format. IETF. p. 14-16. sec. 3.1.5. doi:10.17487/RFC5536. RFC 5536.
- ^ Kevin Fall (August 2003). "A Delay-Tolerant Network Architecture for Challenged Internets". Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '03. 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. ACM SIGCOMM. pp. 27–34. doi:10.1145/863955.863960. ISBN 978-1-58113-735-4.
External links
[edit]- Using & Managing UUCP. Ed Ravin, Tim O'Reilly, Dale Doughtery, and Grace Todino. 1996, O'Reilly & Associates, Inc. ISBN 1-56592-153-4
- Mark Horton (1986). RFC 976: UUCP Mail Interchange Format Standard. Internet Engineering Task Force Requests for Comment.
- Taylor UUCP Documentation – useful information about UUCP in general and various uucp protocols.
- The UUCP Project: History at the Wayback Machine (archived January 6, 2014)
site1!site2!destination), which specify the sequence of intermediate hosts for message delivery, and support for multiple low-level protocols (such as 'g' for packet-based transfer) to handle varying connection qualities over telephone lines.[2] Later evolutions, like the Berkeley Network Utility (BNU) or Honeywell/Denver/Bell (HDB) implementation in 1983 by P. Honeyman, D. A. Novitz, and B. E. Redman, introduced enhancements such as improved spool management and additional transfer protocols, broadening its compatibility across hardware platforms.[1] By the 1980s, UUCP had become integral to the growth of Usenet—a decentralized discussion system—and early email networks like UUCPNET, connecting thousands of sites worldwide and serving as a bridge to the emerging Internet until TCP/IP protocols largely supplanted it in the 1990s.[1][2] Despite its obsolescence for mainstream use, modern implementations like Taylor UUCP continue to support legacy systems and offline networks.[1]
History
Origins and Development
UUCP, or Unix-to-Unix Copy, originated in 1976 at AT&T Bell Laboratories, where computer scientist Mike Lesk developed the initial program to facilitate communication between UNIX systems.[3] This early implementation was a simple utility designed primarily for transferring files over dial-up telephone lines at speeds like 300 baud, addressing the need for basic remote operations in an era when UNIX was proliferating beyond Bell Labs but lacked standardized networking tools.[3] The key motivations for UUCP's creation stemmed from the limitations of computing infrastructure in the late 1970s, including the absence of affordable wide-area networks accessible to most universities and organizations. With ARPANET restricted to government and research entities, and leased lines prohibitively expensive, UUCP enabled decentralized file transfers, email exchange, and remote command execution via inexpensive modems and public phone networks, fostering connectivity among scattered UNIX users.[3][1] Preceding more structured releases, the original UUCP functioned as an ad-hoc script-like command, the simple uucp utility for copying files between systems, which evolved rapidly through collaborative refinements at Bell Labs. By 1977, Version 2 (V2) emerged as a rewrite by Lesk, David Nowitz, and Greg Chesson, enhancing reliability for batch processing and error handling. Further formalization occurred in 1983 with the HoneyDanBer (HDB) implementation by Peter Honeyman, Nowitz, and Brian E. Redman, which introduced more robust protocols for secure sessions and spooling, solidifying UUCP as a protocol suite for intermittent connections.[3][4]Early Adoption and Expansion
Following the initial development of UUCP in the late 1970s, its adoption gained momentum in the early 1980s as Unix systems proliferated in academic and research environments, enabling batch transfers of files, email, and news over dial-up telephone lines, particularly driven by the growth of Usenet. By 1983, the number of connected UUCP sites had reached approximately 550, reflecting the protocol's appeal for cost-effective connectivity among institutions without dedicated network infrastructure.[3] A significant milestone came with the release of the Honey DanBer version of UUCP, often referred to as Version 3, developed in 1983 by AT&T Bell Laboratories researchers Peter Honeyman, David A. Nowitz, and Brian Redman. This iteration introduced key enhancements, including the 'f' and 'g' protocols for improved error detection and correction during transfers, as well as wildcard expansion in file specifications and refined error handling to manage unreliable phone connections more robustly.[5] Distributed as part of UNIX System V Release 3 (SVR3) starting around 1986, it was officially branded as Basic Networking Utilities (BNU) and became widely available through shareware channels.[6] Version 4 followed in 1988, building on the Honey DanBer foundation with optimizations for higher-speed modems and further protocol refinements, solidifying its status as the de facto standard for UUCP implementations. By the mid-1980s, the network had expanded significantly from about 400 sites in 1982, connecting thousands across North America, Europe, and Asia, driven by its integration into Berkeley Software Distribution (BSD) Unix variants and informal shareware dissemination among Unix users.[7][3] A pivotal event in this expansion was the formalization of UUCPNET in 1984, the earliest large-scale UUCP-based network topology that interconnected hundreds of sites and laid the groundwork for global distribution of Usenet news precursors like A News and B News.[3] This structure facilitated international collaboration, with early European links appearing by mid-decade, transforming UUCP from a local tool into a foundational element of pre-Internet academic networking.[3]Technical Architecture
Communication Sessions
A UUCP communication session represents the fundamental unit of interaction between two systems, operating as a point-to-point, store-and-forward exchange typically over serial links such as modems or direct connections. These sessions enable the transfer of queued work items, including files and commands, in a batch-oriented manner, with calls often scheduled via cron jobs to occur during off-peak hours, resulting in durations ranging from minutes to hours depending on the volume of data and connection quality.[8][9] The session lifecycle begins with initiation by the caller system, which establishes the physical connection—such as dialing a modem—and invokes theuucico daemon to start the process, while the callee system accepts the incoming call by configuring uucico as the login shell for a dedicated UUCP user account. This is followed by three primary phases: an initial handshake for authentication and protocol negotiation, a body phase for executing data transfer requests from the spool queue, and a final handshake to acknowledge completion or signal abort. During the initial phase, the caller sends its hostname and optional flags, and both sides exchange login credentials via scripted "chat" sequences to verify identity before proceeding; the body phase processes work items prioritized by grade (e.g., mail or news), and the final phase confirms the session's outcome before disconnection.[8][9]
In terms of roles, the caller acts as the master, initiating and controlling the session, while the callee operates in slave mode, responding to directives; however, roles can reverse mid-session if the slave has outgoing work to send. Asynchronous communication is facilitated through polling mechanisms, where the caller periodically checks for queued work on remote systems by generating poll files, ensuring that systems without permanent connections can exchange data reliably over intermittent links.[8][9]
Error handling in UUCP sessions emphasizes robustness for unreliable serial connections, incorporating timeouts during handshake and chat scripts to detect connection failures, configurable retry schedules that delay subsequent attempts based on failure counts (e.g., exponential backoff starting at minutes), and comprehensive logging of events, statuses, and errors in dedicated spool directories like /var/spool/uucp/Log for post-session analysis and debugging. Failed sessions are marked with status codes (e.g., code 4 for handshake failures), allowing administrators to monitor and adjust configurations without interrupting ongoing operations.[8][9]
Protocols and Handshakes
The initial handshake in UUCP establishes a connection between the calling and called systems, beginning with the called system sending a message in the format\020Shere=hostname\000 to identify itself.[10] The calling system responds with \020Shostname options\000, where options include parameters such as -QSEQ for sequence numbering, -pGRADE for file priority grades, -R for transfer restart support, -ULIMIT for maximum file sizes, and -N[NUMBER] for size negotiation, allowing negotiation of protocol capabilities and parameters like window sizes.[10] If the called system accepts, it replies with \020ROK\000; otherwise, it sends an error code such as RLCK for locked or RCB for busy, potentially leading to protocol downgrade or connection failure.[11] Following this, the called side lists supported protocols with \020Pprotocols\000 (e.g., f, g, i) and the calling side selects one via \020Uprotocol\000, ensuring compatibility for the session.[10]
The g-protocol, serving as the standard for reliable transfers over noisy links like telephone lines, is a packet-oriented protocol requiring an 8-bit clean connection.[12] It uses a sliding window mechanism for flow control with window sizes ranging from 1 to 7 packets, negotiated during initialization via control packets like INITA, INITB, and INITC to synchronize parameters.[12] Packets consist of a 6-byte header followed by data: the header includes \020 (DLE) as a frame delimiter, a k value (1-8) indicating packet data size as 32 × 2^(k-1) bytes (32 to 4096 bytes), or k=9 for control packets, a 2-byte checksum, a control byte encoding packet type (00 for control, 10 for data, 11 for short data), 3-bit sequence numbers (0-7 modulo 8), and 3-bit acknowledgments, plus an XOR byte for validation.[11] Error checking employs a per-packet checksum computed via a specific algorithm, with acknowledgments sent in the yyy field of subsequent packets or via control messages like RR (receive ready) or RJ (reject), enabling retransmission of lost or corrupted packets; this ensures reliability without higher-layer intervention.[12]
The f-protocol, a simpler 7-bit streaming protocol used in some implementations such as BSD, suited for basic file transfers without built-in flow control, relying instead on external XON/XOFF signaling.[10] In the f-protocol, data is restricted to ASCII characters from space (040) to tilde (176), with files transformed by escaping control characters, and integrity verified by a file-level checksum appended at the end in the format \176\176<checksum>\r.[13] For higher-speed connections, variants of the g-protocol in System V Release 4 (denoted as G) allow configurable larger packet sizes up to 4096 bytes and adjusted windows to optimize throughput on faster modems.[9] Taylor UUCP introduced enhancements like the i-protocol, a bidirectional variant of g that supports simultaneous file transfers in both directions over full-duplex links, using separate sequence numbers (1-31 modulo 32) per direction, 6-byte headers with 4-byte CRC-32 error checking, and sliding windows acknowledged at the halfway point for efficient flow control.[10]
The session concludes with a final handshake where the calling system sends \020OOOOOO\000 to signal completion, and the called system responds with \020OOOOOOO\000 to confirm, followed by cleanup of temporary files and logging of session statistics such as throughput and errors, though command execution confirmations occur earlier during the transfer request phase.[11]
Data Transfer Mechanisms
File Transfer Process
Theuucp command is the primary tool for initiating file transfers in UUCP, functioning similarly to the Unix cp utility but extended for remote operations across interconnected systems. Its basic syntax is uucp [options] source-file... destination-file, where source and destination arguments can specify local pathnames or remote locations using the bang-path notation, such as system-name!pathname for a single hop or system1!system2!pathname for multi-hop routing.[14] Common options include -c to copy source files to the spool directory (the default for remote transfers), -m to send mail notification upon completion, -n user to notify a specific user on the destination system, and -g grade to assign a priority grade to the job for queuing purposes.[14] For instance, to transfer a local file data.txt to a user's home directory on a remote system named siteB, the command would be uucp data.txt siteB!~user/data.txt, which queues the request without immediate execution.[15]
The transfer workflow begins with the uucp command generating a command file (typically named C.*) in the local spool directory—commonly /var/spool/uucp—containing instructions for the copy operation, along with a data file (D.*) if the source requires spooling.[16] These files are not transmitted immediately; instead, the uucico daemon, which runs periodically or on demand, manages the queuing and actual delivery by establishing communication sessions with remote systems.[16] During a session—enabled by prior handshakes for authentication and protocol negotiation—the sending system pushes files using commands like S (send) in the UUCP conversation protocol, specifying the source, destination, and options.[10] The receiving system responds with acceptance (SY or RY) and stores the incoming data in its own spool or public directory (default /var/spool/uucppublic), pulling the file as a continuous stream or packet sequence depending on the selected protocol.[10] Upon completion, the receiver verifies integrity via checksums: for example, the g protocol computes a 16-bit checksum per packet, while the f protocol uses a 16-bit checksum over the entire file, retransmitting on mismatch before acknowledging success with CY.[10] Multi-hop transfers queue intermediate requests, with each leg handled sequentially across sessions until the file reaches the final destination.[17]
Permissions and security in UUCP file transfers rely on system-level checks to prevent unauthorized access, enforced primarily through the /etc/uucp/Permissions file, which defines rules for remote systems based on their login name or machine identity.[18] User and group validations occur at the operating system level, with uucp and uucico typically running under the uucp user and daemon group to restrict privileges, ensuring that only authorized processes can read from or write to spool directories.[19] Path restrictions are specified via options like READ and WRITE in the permissions file, limiting transfers to designated directories such as /var/spool/uucppublic by default, while NOREAD or NOWRITE can exclude sensitive paths; additionally, the REQUEST and SENDFILES options control whether remote sites can initiate or queue transfers.[18] Anonymous transfers are heavily limited, often requiring callback verification (CALLBACK=yes) or explicit validation (VALIDATE=[login](/page/Login)), preventing unauthenticated systems from accessing beyond public areas.[18] For example, a multi-hop transfer like uucp report.txt siteA!siteB!~user/reports.txt would fail if intermediate permissions on siteA restrict writes from the originating user or path.[9]
Email Routing and Bang Paths
UUCP facilitated electronic mail delivery by serving as a transport mechanism for messages across its store-and-forward network, integrating with mail transfer agents like sendmail to handle addressing and routing at network boundaries.[20] In this setup, sendmail's UUCP mailers—such as uucp-old and uucp-new—processed messages by converting domain-based addresses to bang paths for transmission over UUCP links, while preserving RFC 822 headers where possible.[20] This allowed UUCP to emulate SMTP-like functionality in a batch-oriented environment, with rmail invoked remotely to accept and queue incoming mail at each hop.[21] The bang path addressing system provided explicit source routing for mail, formatted as user!host1!host2!destination, where the path was read from right to left to determine the sequence of intermediate hosts.[22] For example, a message addressed to foo!bar!user would first reach bar, which would then forward it to foo for delivery to user.[2] Paths typically comprised 8 to 10 hops in the early 1980s, though longer ones were possible, increasing the risk of failure if any segment exceeded system-specific buffer limits during processing.[23] In the routing process, email messages were queued as files in a site's UUCP spool directory, similar to general file transfers, and forwarded hop-by-hop during communication sessions between connected systems.[24] At each intermediate site, the receiving system executed rmail to parse the envelope, expand aliases if defined locally, and re-queue the message for the next hop along the specified path.[21] This batch transfer continued until the destination host, where the message was handed off to the local mailer for final delivery.[2] Significant challenges arose from the fragility of bang paths, particularly breakage when network topology changed, such as a site's removal or link reconfiguration, rendering the explicit route invalid.[22] In such cases, the mailer at the failure point would generate an undeliverable notification, often bouncing the message back along the reverse path, which could delay or lose correspondence in dynamic environments.[21] Additionally, ambiguous hostnames across disconnected UUCP regions required manual path adjustments, complicating reliable delivery without centralized mapping tools.[22]Network Organization
UUCPNET Structure
UUCPNET emerged as the primary UUCP-based network in the early 1980s, with significant organizational efforts coalescing around 1984 through initiatives like the UUCP Project, coordinated by Mary Ann Horton, then a PhD student at UC Berkeley, and involving key figures such as Rick Adams, who took over maintenance of the B News software at the Center for Seismic Studies. This period marked a pivotal expansion from around 550 sites by 1981 to approximately 940 connected hosts by the end of 1984, growing further to thousands by 1990 as Unix systems proliferated in academic and research environments.[25][3][26] The network's topology combined hierarchical and peer-to-peer elements, resembling a tree structure where backbone sites acted as high-connectivity hubs, linking multiple regional or institutional nodes via dedicated leased lines for efficient data relay. Leaf nodes, often smaller or remote installations, connected intermittently as dial-up endpoints, polling backbone sites to exchange batches of email and news over telephone lines, which minimized costs while accommodating asynchronous communication. This design supported scalability but relied on careful site configuration to avoid bottlenecks.[27][3] Governance of UUCPNET remained informal and community-driven, lacking a central authority; instead, participants maintained connectivity through shared email-distributed maps generated by tools like pathalias, which compiled routing information from voluntary submissions. Operational costs, including long-distance phone charges for polling sessions, were borne individually by site operators or shared via cooperative arrangements, fostering a collaborative ethos among universities, research labs, and early commercial entities.[25][3] By the late 1980s, UUCPNET reached its peak scale of roughly 20,000 sites worldwide, functioning as the essential backbone for Usenet news propagation and enabling global dissemination of discussions across thousands of newsgroups. This vast reach underscored its role in pre-Internet connectivity, bridging isolated Unix systems into a cohesive information-sharing fabric.Site Mapping and Path Resolution
In UUCP networks, site mapping relied on distributed text files known as UUCP maps, which enumerated participating sites, their neighboring connections, and associated costs to facilitate route discovery. These maps followed a simple format where each entry began with a site name followed by tab-separated links to neighbors, including cost expressions in parentheses, such asmoria.orcnet.org bert.sesame.com(DAILY/2), swim.twobirds.com(WEEKLY+LOW). Costs were defined using predefined variables like DAILY or WEEKLY for polling frequencies, combined arithmetically with numerical values to reflect connection expenses like time or distance. Maps were periodically updated and distributed through the Usenet newsgroup comp.mail.maps as part of the UUCP Mapping Project, allowing administrators to download and integrate them into local configurations; alternative networks maintained separate maps for internal use.[28][29]
The primary tool for processing these maps into usable routing information was the Pathalias program, a command-line utility developed in the early 1980s to address the growing complexity of UUCP routing amid the expansion of USENET. Written by Peter Honeyman at Princeton University and Steven M. Bellovin at AT&T Bell Laboratories, Pathalias compiled map data into a database of shortest paths by modeling the network as a directed graph, with sites as nodes and connections as weighted edges. It employed a variant of Dijkstra's algorithm with a priority queue to compute least-cost routes in O(e log v) time complexity, where e represents edges and v vertices, producing output files formatted for integration with mailers, such as duke!%s where %s placeholders allowed substitution of usernames. Administrators ran Pathalias periodically after updating maps to regenerate the routing table, which supported mixed routing syntax including UUCP bang paths (!) and ARPANET operators (@).[30]
Path resolution occurred during the job queuing phase, where UUCP software consulted the Pathalias-generated database to expand partial or symbolic addresses into full routes. For instance, when queuing email or remote execution requests via commands like uux, the system queried the map-derived tables to select low-cost paths, appending them to bang paths for forwarding—such as resolving user@remote to neighbor!intermediate!remote!user. The uuxqt daemon, invoked post-connection by arriving work files, then executed these resolved jobs, handling any further forwarding if the destination required it, while validating permissions via files like /etc/uucp/Permissions. This process ensured efficient store-and-forward delivery without real-time routing, leveraging precomputed paths for batch operations.[31][9][30]
Despite its effectiveness, the reliance on static UUCP maps introduced limitations, as updates depended on manual administrator intervention and periodic Usenet postings, often resulting in outdated paths during network changes. Pathalias's commitment to shortest-path trees could also overlook alternative routes in dynamic topologies, and host name collisions required workarounds like "private" declarations, exacerbating maintenance burdens in large, decentralized networks. These issues contributed to inefficiencies as UUCP scaled, prompting eventual transitions to more dynamic protocols.[30][28]
Applications and Extensions
Remote Command Execution
Remote command execution in UUCP is facilitated by theuux utility, which allows users to queue and execute commands on remote systems or locally using remote files. The basic syntax per POSIX standard is uux [-jnp] command-string, where the system-name is prefixed in the command-string using UUCP's bang path notation (e.g., site!command [arguments]); some implementations, such as IBM z/OS, support additional options like -r to queue the job without immediately starting the transfer daemon uucico.[32][33] This queues the request, spooling any required input files and output redirections (e.g., > /dev/null) as temporary files in the spool directory, such as /usr/spool/uucp, for batch processing during the next communication session.[34]
The execution model involves the uucico daemon transferring the job file to the target system during a scheduled session, after which the uuxqt daemon processes it in a dedicated execution directory (e.g., /usr/spool/uucp/.XQTDIR). Jobs run under a restricted shell environment provided by uuxqt, which invokes the command via sh -c with a sanitized setup: the PATH is explicitly set to a safe value (e.g., /usr/lib/uucp:/bin:/usr/bin), preventing access to arbitrary directories, and input/output streams are redirected from spooled files to avoid direct user interaction. This model ensures reliable, asynchronous execution across intermittently connected systems, with the originating site notified of completion or failure via mail or status queries using uustat. Briefly referencing session queuing from the technical architecture, jobs remain spooled until a valid connection is established.[34][32][35]
Common use cases for uux include distributed processing tasks, such as remotely compiling code by queuing uux site!cc source.c -o output to leverage a more powerful remote machine's resources, or generating reports with commands like uux site!sort datafile > report.txt to process large datasets off-site. For email delivery, commands like uux site!rmail user@domain route messages to remote users. It also integrates with scheduling tools like at or cron for automated execution; for instance, a cron job can invoke uux at regular intervals to run maintenance scripts remotely, enabling coordinated workloads across a UUCP network without constant connectivity. These applications were particularly valuable in early distributed computing environments where resources were unevenly distributed. Additionally, uux supported Usenet news operations, such as queuing posts with uux site!inews < article to distribute articles to remote news servers via batch processing.[33][35][34][36]
Security is paramount in remote execution to mitigate risks from untrusted networks, with UUCP implementing several safeguards. Commands are restricted per remote site via the /etc/uucp/Permissions file, which whitelists allowable executables (e.g., COMMANDS=rmail:lp:/usr/bin/sort) and limits file read/write paths (e.g., READ=/usr/spool/uucppublic), preventing arbitrary code injection. Shell metacharacters like ;, |, or * must be quoted or escaped in the command string to avoid unintended expansion, and the execution environment sanitizes variables to block inheritance of potentially malicious settings. All executed commands are logged in the UUCP log files (e.g., /usr/spool/uucp/LOGFILE), with details like timestamps, sites, and outcomes for auditing; debug modes (e.g., uux -x 9) provide granular tracing. These features, refined since early implementations, ensured secure operation in multi-site networks.[37][34][32]
