leff@DEPT.CSCI.UNT.EDU ("Dr. Laurence L. Leff") (04/10/90)
%K Electronic\0Mail %A S. Kent %A J. Linn %T Privacy Enhancement for Internet Electronic Mail: Part II -- Certificate-Based Key Management; RFC 1114 %N 1114 %J Internet Request for Comments %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC suggests a draft standard elective protocol for the Internet community, and requests discussion and suggestions for improvements. %K Electronic\0Mail %A J. Linn %T Privacy Enhancement for Internet Electronic Mail: Part III -- Algorithms, Modes, and Identifiers; RFC 1115 %N 1115 %J Internet Request for Comments %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC suggests a draft standard elective protocol for the Internet community, and requests discussion and suggestions for improvement. This RFC provides definitions, references, and citations for algorithms, usage modes, and associated identifiers used in RFC-1113 and RFC-1114 in support of privacy-enhanced electronic mail. %K Modelling\0and\0Simulation %A P. Kubat %T Estimation of Reliability for Communication/Computer Networks - Simulation/Analytic Approach %P 927-933 %J IEEE Trans. Communications %V 37 %N 9 %D September 1989 %K ISDN %A K.W. Ross %A D.H.K. Tsang %T Optimal Circuit Access Policies in an ISDN Environment: A Markov Decision Approach %P 934-939 %J IEEE Trans. Communications %V 37 %N 9 %D September 1989 %K Protocol\0Verification %A K.K. Sabnani %A A.M. Lapone %A M.U. Uyar %T An Algorithmic Procedure for Checking Safety Properties of Protocols %P 940-948 %J IEEE Trans. Communications %V 37 %N 9 %D September 1989 %K Lower-Layer\0Protocols %A A.G. Fraser %A W.T. Marshall %T Data Transport in a Byte Stream Network %P 1020-1033 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K ISDN %A W.H. Harman %A C.F. Newman %T ISDN Protocols for Connection Control %P 1034-1042 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K LANs %A F.E. Ross %T An Overview of FDDI: The Fiber Distributed Data Interface %P 1043-1052 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Applications %A P.F. Linington %T File Transfer Protocols %P 1052-1059 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K External\0Data\0Formats %A J.E. White %T ASN.1 and ROS: The Impact of X.400 on OSI %P 1060-1072 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Miscellaneous %A J.P. Sanders %A M.R. Jones %A J.E. Fevedt %A M.E. Ferree %T A Communications Interface for Systems Application Architecture %P 1073-1080 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Lower-Layer\0Protocols %A A.S. Krishnakumar %A K. Sabnani %T VLSI Implementations of Communications Protocols - A Survey %P 1081-1090 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Lower-Layer\0Protocols %A H. Ahmadi %A W.E. Denzel %T A Survey of Modern High-Performance Switching Techniques %P 1091-1103 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Network\0Management %A L.N. Cassel %A C. Partridge %A J. Westcott %T Network Management Architectures and Protocols: Problems and Approaches %P 1104-1114 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Protocol\0Implementation %A L. Svobodova %T Implementing OSI Systems %P 1115-1130 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Network\0Protocols %A F.M. Burg %A N. Di Iorio %T Networking of Networks: Interworking According to OSI %P 1131-1142 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Protocol\0Testing %A R.J. Linn, Jr. %T Conformance Evaluation Methodology and Protocol Testing %P 1143-1158 %J IEEE Jour. Selected Areas Communications %V 7 %N 7 %D September 1989 %K Applications %A D. Borman %T Telnet Linemode Option; RFC 1116 %J Internet Request for Comments %N 1116 %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC describes a proposed elective standard for the Internet community. Hosts on the Internet that support Linemode within the Telnet protocol are expected to adopt and implement this standard. %K Standards\0and\0Standards-Related\0Activities %A S. Romano %A M. Stahl %A M. Recker %T Internet Numbers; RFC 1117 %N 1117 %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo is an official status report on the network numbers and the autonomous system numbers used in the Internet community. %K Miscellaneous %A J. Etkin %A J.A. Zinky %T Development Life Cycle of Computer Networks: The Executable Model Approach %P 1078-1089 %J IEEE Trans Software Engineering %V 15 %N 9 %D September 1989 %K External\0Data\0Formats %A S.A. Mamrak %A M.J. Kaelbling %A C.K. Nicholas %A M. Share %T Chameleon: A System for Solving the Data Translation Problem %P 1090-1108 %J IEEE Trans Software Engineering %V 15 %N 9 %D September 1989 %K Miscellaneous %A E. Krol %T The Hitchhikers Guide to the Internet; RFC 1118 %N 1118 %D September 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC is being distributed to members of the Internet community in order to make available some ``hints'' which will allow new network participants to understand how the direction of the Internet is set, how to acquire online information and how to be a good Internet neighbor. While the information discussed may not be relevant to the research problems of the Internet, it may be interesting to a number of researchers and implementors. %K Time\0Synchronization %A D. Mills %T Network Time Protocol (Version 2) Specification and Implementation; RFC 1119 %N 1119 %D September 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This document describes the Network Time Protocol (NTP), specifies its formal structure and summarizes information useful for its implementation. NTP provides the mechanisms to synchronize time and coordinate time distribution in a large, diverse internet operating at rates from mundane to lightwave. It uses a returnable-time design in which a distributed subnet of time servers operating in a self-organizing, hierarchical-master-slave configuration synchronizes local clocks within the subnet and to national time standards via wire or radio. The servers can also redistribute reference time via local routing algorithms and time daemons. %K Standards\0and\0Standards-Related\0Activities %A V. Cerf %T The Internet Activities Board; RFC 1120 %J Internet Request for Comments %N 1120 %D September 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC provides a history and description of the Internet Activities Board (IAB) and its subsidiary organizations. This memo is for informational use and does not constitute a standard. %K Miscellaneous %A J. Postel %A L. Kleinrock %A V. Cerf %A B. Boehm %T Act One - The Poems; RFC 1121 %J Internet Request for Comments %N 1121 %D September 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC presents a collection of poems that were presented at "Act One", a symposium held partially in celebration of the 20th anniversary of the ARPANET. %K Miscellaneous %A B. Leiner %T Policy Issues in Interconnecting Networks; RFC 1124 %J Internet Request for Comments %N 1124 %D September 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP To support the activities of the Federal Research Internet Coordinating Committee (FRICC) in creating an interconnected set of networks to serve the research community, two workshops were held to address the technical support of policy issues that arise when interconnecting such networks. Held under the auspices of the Internet Activities Board at the request of the FRICC, and sponsored by NASA through RIACS, the workshops addressed the required and feasible technologies and architectures that could be used to satisfy the desired policies for interconnection. .sp 0.5 The purpose of this RFC is to report the results of these workshops. %K Protocol\0Specification %T Tools for Implementing Network Protocols %A N.C. Hutchinson %A S. Mishra %A L.L. Peterson %A V.T. Thomas %P 895-916 %J Software - Practice and Experience %D September 1989 %V 19 %N 9 %K Routing %A David Peleg %A Eli Upfal %T A Trade-Off between Space and Efficiency for Routing Tables %J Jour. of the ACM %P 510-530 %D July 1989 %V 36 %N 3 %K Distributed\0File\0Systems %A V. Srinivasan %A Jeffrey C. Mogul %T Spritely NFS: Experiments with Cache-Consistency Protocols %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP File caching is essential to good performance in a distributed system, especially as processor speeds and memory sizes continue to improve rapidly while disk latencies do not. Stateless-server systems, such as NFS, cannot properly manage client file caches. Stateful systems, such as Sprite, can use explicit cache consistency protocols to improve both cache consistency and overall performance. .sp 0.5 By modifying NFS to use the Sprite cache consistency protocols, we isolate the effects of the consistency mechanism from the other features of Sprite. We find dramatic improvements on some, although not all, benchmarks, suggesting that an explicit cache consistency protocol is necessary for both correctness and good performance. %K Remote\0Procedure\0Calls %A Michael D. Schroeder %A Michael Burrows %T Performance of Firefly RPC %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP In this paper, we report on the performance of the remote procedure call implementation for the Firefly multiprocessor and analyse the implementation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RPC could be if certain improvements were made. .sp 0.5 The elapsed time for an inter-machine call to a remote procedure that accepts no arguments and produces no results is 2.66 milliseconds. The elapsed time for an RPC that has a single 1440-byte result (the maximum result that will fit in a single packet) is 6.35 milliseconds. Maximum inter-machine throughput of application program data using RPC is 4.65 megabits/second, achieved with 4 threads making parallel RPCs that return the maximum sized result that fits in a single RPC packet. CPU utilization at maximum throughput is about 1.2 CPU seconds per second on the calling machine and a little less on the server. .sp 0.5 These measurements are for RPCs from user space on one machine to user space on another, using the installed system and a 10 megabit/second Ethernet. The RPC packet exchange protocol is built on IP/UDP, and the times include calculating and verifying UDP checksums. The Fireflies used in these tests had 5 MicroVAX II processors and a DEQNA Ethernet controller. %K Distributed\0Systems %A Mark Weiser %A Alan Demers %A Carl Hause %T The Portable Common Runtime Approach to Interoperability %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP Operating system abstractions do not always reach high enough for direct use by a language or applications designer. The gap is filled by language-specific runtime environments, which become more complex for richer languages (CommonLisp needs more than C++, which needs more than C). But language-specific environments inhibit integrated multi-lingual programming, and also make porting hard (for instance, because of operating system dependencies). To help solve these problems, we have built the Portable Common Runtime (PCR), a language-independent and operating-system-independent base for modern languages. PCR offers four interrelated facilities: storage management (including universal garbage collection), symbol binding (including static and dynamic linking and loading), threads (lightweight processes), and low-level I/O (including network sockets). PCR is "common" because these facilities simultaneously support programs in several languages. PCR supports C, Cedar, Scheme, and CommonLisp intercalling and runs pre-existing C and CommonLisp (Kyoto) binaries. PCR is "portable" because it uses only a small set of operating system features. The PCR source code is available for use by other researchers and developers. %K Distributed\0Systems %A Jeffrey S. Chase %A Franz G. Amador %A Edward D. Lazowska %A Henry M. Levy %A Richard J. Littlefield %T The Amber System: Parallel Programming on a Network of Multiprocessors %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP This paper describes a programming system called Amber that permits a single application program to use a homogeneous network of computers in a uniform way, making the network appear to the application as an integrated multiprocessor. Amber is specifically designed for high performance in the case where each node in the network is a shared-memory multiprocessor. .sp 0.5 Amber shows that support for loosely-coupled multiprocessing can be efficiently realized using an object-based programming model. Amber programs execute in a uniform network-wide object space, with memory coherence maintained at the object level. Careful data placement and consistency control are essential for reducing communication overhead in a loosely-coupled system. Amber programmers use object migration primitives to control the location of data and processing %K Standards\0and\0Standards-Related\0Activities %A R. Braden %T Requirements for Internet Hosts -- Communication Layers; RFC1122 %J Internet Request for Comments %N 1122 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. %K Standards\0and\0Standards-Related\0Activities %A R. Braden %T Requirements for Internet Hosts -- Application and Support; RFC1123 %J Internet Request for Comments %N 1123 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. %K Distributed\0Memory %A William J. Bolosky %A Robert P. Fitzgerald %A Michael L. Scott %T Simple But Effective Techniques for NUMA Memory Management %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP Multiprocessors with non-uniform memory access times introduce the problem of placing data near the processes that use them, in order to improve performance. We have implemented an automatic page placement strategy in the Mach operating system on the IBM ACE multiprocessor workstation. Our experience indicates that even very simple automatic strategies can produce nearly optimal page placement. It also suggests that the greatest leverage for further performance improvement lies in reducing false sharing, which occurs when the same page contains objects that would best be placed in different memories. %K Distributed\0File\0Systems %A David A. Edwards %A Martin S. McKendry %T Exploiting Read-Mostly Workloads in The FileNet File System %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP Most recent studies of file system workloads have focussed on loads imposed by general computing. This paper introduces a significantly different workload imposed by a distributed application system. The FileNet system is a distributed application system that supports document image processing. The FileNet file system was designed to support the workload imposed by this application. To characterize the read-mostly workload applied to the file system and how it differs from general computing environments, we present statistics gathered from live production installations. We contrast these statistics with previously published data for more general computing. .sp 0.5 We describe the key algorithms of the file system, focusing on the caching approach. A bimodal client caching approach is employed, to match the file modification patterns observed. Different cache consistency algorithms are used depending on usage patterns observed for each file. Under most conditions, files cached at workstations can be accessed without contacting servers. When a file is subject to frequent modification that causes excessive cache consistency traffic, caching is disabled for that file, and servers participate in all open and close activities. .sp 0.5 The data from production sites is examined to evaluate the success of the approach under its applied load. Contrasts with alternative approaches are made based on this data. %K Distributed\0File\0Systems %A Cary G. Gray %A David R. Cheriton %T Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP Caching introduces the overhead and complexity of ensuring consistency, reducing some of its performance benefits. In a distributed system, caching must deal with the additional complications of communication and host failures. .sp 0.5 Leases are proposed as a time-based mechanism that provides efficient consistent access to cached data in distributed systems. Non-Byzantine failures affect performance, not correctness, with their effect minimized by short leases. An analytic model and an evaluation for file access in the V system show that leases of short duration provide good performance. The impact of leases on performance grows more significant in systems of larger scale and higher processor performance. %K Security\0and\0Authentication %A T. Mark A. Lomas %A Li Gong %A Jerome H. Saltzer %A Roger M. Needham %T Reducing Risks from Poorly Chosen Keys %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP It is well-known that, left to themselves, people will choose passwords that can be rather readily guessed. If this is done, they are usually vulnerable to an attack based on copying the content of messages forming part of an authentication protocol and experimenting, e.g. with a dictionary, offline. The most usual counter to this threat is to require people to use passwords which are obscure, or even to insist on the system choosing their passwords for them. In this paper we show alternatively how to construct an authentication protocol in which offline experimentation is impracticable; any attack based on experiment must involve the real authentication server and is thus open to detection by the server noticing multiple attempts. %K Security\0and\0Authentication %A Michael Burrows %A Martin Abadi %A Roger Needham %T A Logic of Authentication %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP Authentication protocols are the basis of security in many distributed systems, and it is therefore essential to ensure that these protocols function correctly. Unfortunately, their design has been extremely error prone. Most the protocols found in the literature contain redundancies or security flaws. .sp 0.5 A simple logic has allowed us to describe the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication. We have been able to explain a variety of authentication protocols formally, to discover subtleties and errors in them, and to suggest improvements. In this paper, we present the logic and then give the results of our analysis of four published protocols, chosen either because of their practical importance or because they serve to illustrate our method. %K Security\0and\0Authentication %A Stanley A. Kurzban %T Defending Against Viruses and Worms %J SIGUCCS Newsletter %V 19 %N 3 %D Fall 1989 %P 11-23 %K Remote\0Procedure\0Calls %A Norm Hutchinson %A Larry Peterson %A Mark Abbott %A Sean O'Malley %T RPC in the \fIx\fR-Kernel: Evaluating New Design Techniques %T A Logic of Authentication %J Proc. 12th ACM Symposium on Operating Systems Principles %C Litchfield Park, Arizona %D December 3-6, 1989 %X \fBAbstract:\fP This paper reports our experiences implementing remote procedure call (RPC) protocols in the \fIx\fP-kernel. This exercise is interesting because the RPC protocols exploit two novel design techniques: \fIvirtual protocols\fP and \fIlayered protocols\fP. These techniques are made possible because the \fIx\fP-kernel provides an object-oriented infrastructure that supports three significant features: a uniform interface to all protocols, a late binding between protocol layers, and a small overhead for invoking any given protocol layer. For each design technique, the paper motivates the technique with a concrete example, describes how it is applied to the implementation of RPC protocols, and presents the results of experiments designed to evaluate the technique. %K Routing %A M. Little %T Goals and Functional Requirements for Inter-Autonomous System Routing; RFC 1126 %J Internet Request for Comments %N 1126 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This document describes the functional requirements for a routing protocol to be used between autonomous systems. This document is intended as a necessary precursor to the design of a new inter-autonomous system routing protocol and specifies requirements for the Internet applicable for use with the current DoD IP, the ISO IP, and future Internet Protocols. It is intended that these requirements will form the basis for the future development of a new inter-autonomous systems routing architecture and protocol. %K Standards\0and\0Standards-Related\0Activities %A R. Braden %T A Perspective on the Host Requirements RFCs; RFC 1127 %J Internet Request for Comments %N 1127 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC is for information only; it does not constitute a standard, draft standard, or proposed standard, and it does not define a protocol. %K Routing %A J. Moy %T The OSPF Specification; RFC 1131 %J Internet Request for Comments %N 1131 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC is the specification of the Open Shortest Path First (OSPF) Internet routing protocol. OSPF is in the class of Internal Gateway Protocols (IGPs) for distributing routing information between gateways of a single Autonomous System. This routing protocol is based on the link-state approach (in contrast to the distance-vector approach). This specification was developed by the OSPF Working Group of the Internet Engineering Task Force. %K Standards\0and\0Standards-Related\0Activities %A J. Postel %T IAB Official Protocol Standards; RFC 1130 %J Internet Request for Comments %N 1130 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo describes the state of standardization of protocols used in the Internet as determined by the Internet Activities Board (IAB). An overview of the standards procedures is presented first, followed by discussions of the standardization process and the RFC document series, then the explanation of the terms is presented, the lists of protocols in each stage of standardization follows, and finally pointers to references and contacts for further information. A new section has been added with a description of recent changes. %K Time\0Synchronization %A D. Mills %T Measured Performance of the Network Time Protocol in the Internet System; RFC 1128 %J Internet Request for Comments %N 1128 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This paper describes a series of experiments involving over 100,000 hosts of the Internet system and located in the U.S., Europe and the Pacific. The experiments are designed to evaluate the availability, accuracy and reliability of international standard time distribution using the DARPA/NSF Internet and the Network Time Protocol (NTP), which is specified as an Internet Standard in RFC-1119. NTP is designed specifically for use in a large, diverse internet system operating at speeds from mundane to lightwave. In NTP a distributed subnet of time servers operating in a self-organizing, hierarchical, master-slave configuration exchange precision timestamps in order to synchronize subnet clocks to each other and national time standards via wire or radio. .sp 0.5 The experiments are designed to locate Internet hosts and gateways that provide time by one of three time distribution protocols and evaluate the accuracy of their indications. For those hosts that support NTP, the experiments determine the distribution of errors and other statistics over paths spanning major portions of the globe. Finally, the experiments evaluate the accuracy and reliability of precision timekeeping using NTP and typical Internet paths involving DARPA, NSFNET and other agency networks. The experiments demonstrate that timekeeping accuracy throughout most portions of the Internet can be ordinarily maintained to within a few tens of milliseconds, even in cases of failure or disruption of clocks, time servers or networks. %K Time\0Synchronization %A D. Mills %T Internet Time Synchronization: the Network Time Protocol; RFC 1129 %J Internet Request for Comments %N 1129 %D October 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnable-time architecture in which a distributed subnet of time servers operating in a self-organizing, hierarchical, master-slave configuration synchronizes local clocks within the subnet and to national time standards via wire or radio. The servers can also redistribute time information within a network via local routing algorithms and time daemons. .sp 0.5 The architectures, algorithms and protocols which have evolved to NTP over several years of implementation and refinement are described in this paper. The synchronization subnet which has been in regular operation in the Internet for the last several years is described along with performance data which shows that timekeeping accuracy throughout most portions of the Internet can be ordinarily maintained to within a few tens of milliseconds, even in cases of failure or disruption of clocks, time servers or networks. %K Distributed\0Systems %A M.M. Theimer %A K.A. Lantz %T Finding Idle Machines in a Workstation-Based Distributed System %J IEEE Trans. Software Engineering %D November 1989 %V 15 %N 11 %P 1444-1458 %K Distributed\0Systems %A A. Hac %T A Distributed Algorithm for Performance Improvement Through File Replication, File Migration and Process Migration %J IEEE Trans. Software Engineering %D November 1989 %V 15 %N 11 %P 1459-1470 %K Miscellaneous %A J.-K. Choi %A C.K. Un %T On Acknowledgement Schemes of Sliding Window Flow Control %J IEEE Trans. on Communications %V 37 %N 11 %D November 1989 %P 1184-1191 %K Integrated\0Voice-Data\0Networks %A S.-Q. Li %T Study of Information Loss in Packet Voice Systems %J IEEE Trans. on Communications %V 37 %N 11 %D November 1989 %P 1192-1202 %K Routing %A A. Gersht %A A. Shulman %T Optimal Routing in Circuit Switched Communications Networks %J IEEE Trans. on Communications %V 37 %N 11 %D November 1989 %P 1203-1211 %K Miscellaneous %A E. Castelli %T The INFN and the INFNet %P 252-255 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Electronic\0Mail %A R. Grimm %A D. Heagert %T Recommendation for a Shorthand X.400 Address Notation %P 263-269 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Network\0Management %A C. Sluman %T A Tutorial on OSI Management %P 270-278 %D October 10, 1989 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %K Lower-Layer\0Protocols %A L. Clyne %T Lower Layer OSI Addressing %P 279-283 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Standards\0and\0Standards-Related\0Activities %T Is OSI Too Late? %A B.E. Carpenter %P 284-286 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Standards\0and\0Standards-Related\0Activities %A P.F. Linington %T Why OSI? %P 287-290 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Distributed\0File\0Systems %A W. Black %T File Access and Serving in an OSI Environment %P 294-299 %D October 10, 1989 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %K Miscellaneous %A W. Bauerfeld %A P. Holleczek %T Global Connectivity %P 300-304 %D October 10, 1989 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %K Directory\0Services %A J. Craigie %T UK Academic Community Directory Service Pilot Project %P 305-311 %D October 10, 1989 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %K Miscellaneous %A B. Gilmore %T Workstations: Beyond the Dumb Terminal %P 312-314 %D October 10, 1989 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %K Security\0and\0Authentication %A R. Grimm %T Security on Networks: Do We Really Need It? %P 315-323 %D October 10, 1989 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %K Electronic\0Mail %A C. Huitema %T The Challenge of Multimedia Mail %P 324-327 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Miscellaneous %A P. Herchuelz %T Supercomputers: Some Aspects of Their Impact on Communications %P 328-331 %J Computer Networks and ISDN Systems %V 17 %D October 10, 1989 %N 4&5 %K Miscellaneous %A P. Bakonyi %A L. Csaba %T Network for the Hungarian R&D Community %P 332-336 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %D October 10, 1989 %K Standards\0and\0Standards-Related\0Activities %A V. Cerf %T The Internet Activities Board %P 337-343 %J Computer Networks and ISDN Systems %V 17 %D October 10, 1989 %N 4&5 %K Protocol\0Implementation %A P. Tindemans %T COSINE: Ready to Move into Implementation Phase %P 344-345 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Miscellaneous %A C. Michau %T The IXI Pilot Project %P 346-347 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Protocol\0Implementation %A J. Onions %D October 10, 1989 %T ISODE: In Support of Migration %P 362-366 %J Computer Networks and ISDN Systems %V 17 %N 4&5 %K Protocol\0Implementation %A M. Lloyd %T Conformance: Assuring Interoperability %P 367-370 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Miscellaneous %A A. Ghiselli %T Internetworking in INFNet %P 371-375 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Miscellaneous %A E. Lovdal %T The Challenge of TCP/IP %P 376-380 %J Computer Networks and ISDN Systems %D October 10, 1989 %V 17 %N 4&5 %K Protocol\0Specification %A M. Diaz %A C. Vissers %T SEDOS: Designing Open Distributed Systems %J IEEE Software %D November 1989 %P 24-34 %K Electronic\0Mail %A M.S. Squillante %A D. Notkin %T Integrating Heterogeneous Local Mail Systems %J IEEE Software %D November 1989 %P 59 %K Security\0and\0Authentication %A Li Gong %T Using One-Way Functions for Authentication %P 8-11 %J Computer Communication Review %D October 1989 %V 19 %N 5 %K Congestion\0Control %A Gregory G. Finn %T A Connectionless Congestion Control Algorithm %P 12-31 %J Computer Communication Review %D October 1989 %V 19 %N 5 %K Protocol\0Implementation %A Keith Sklower %T Improving the Efficiency of the OSI Checksum Calculation %P 32-43 %J Computer Communication Review %D October 1989 %V 19 %N 5 %K External\0Data\0Formats %A Christian Huitema %A Assem Doghri %T Defining Faster Transfer Syntaxes for the OSI Presentation Protocol %P 44-55 %J Computer Communication Review %D October 1989 %V 19 %N 5 %K Congestion\0Control %A Raj Jain %T A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks %P 56-71 %J Computer Communication Review %D October 1989 %V 19 %N 5 %K LANs %A Piotr Bielkowicz %A Gerard Parr %T A Loop-Detect Packet Based Self Stabilizing Bridge Protocol for Extended-LANs %P 72-81 %J Computer Communication Review %D October 1989 %V 19 %N 5 %K High-Speed\0Networking %A M. Gerla %A A. Suruagy Monteiro %A R. Pazos %T Topology Design and Bandwidth Allocation in ATM Nets %P 1253-1262 %J IEEE Jour. Selected Areas Communications %D October 1989 %V 7 %N 8 %K High-Speed\0Networking %A J. Filipiak %T Structured Systems Analysis Methodology for Design of an ATM Network Architecture %P 1263-1273 %J IEEE Jour. Selected Areas Communications %D October 1989 %V 7 %N 8 %K Miscellaneous %A V.R. Saksena %T Topological Analysis of Packet Networks %P 1243-1252 %J IEEE Jour. Selected Areas Communications %D October 1989 %V 7 %N 8 %K Distributed\0Systems %A Benoit A. Gennart %T Processing for Parallel Discrete Event Simulation %R CSL-TR-89-389 %I Computer Science Labs, Stanford University %D September 1989 %X \fBAbstract:\fP Whether or not Discrete Event Simulation (DES) can be parallelized is the subject of an ongoing debate. This paper explains the problems encountered in parallelizing DES, for synchronous and distributed algorithms. It suggests a alternative way to confront the problem, namely preprocessing the data presented to the simulator. The goal of preprocessing is to give the simulator some hints as to where the parallelism is available. Consistently, the simulator with preprocessing step outperforms the conventional simulator. The best recorded performance is of the order of 75,000 gate evaluations per second, on a Sequent Symmetry. %K Security\0and\0Authentication %A Steven M. Bellovin %T Pseudo-Network Drivers and Virtual Networks %D January 22-26, 1990 %C Washington, DC %I USENIX Assoc. %J Proc. 1990 Winter USENIX Conf. %X \fBAbstract:\fP Many operating systems have long had \fIpseudo-teletypes\fP, inter-process communication channels that provide terminal semantics on one end, and a smart server program on the other. We describe an analogous concept, \fIpseudo-network\fP drivers. One end of the driver appears to be a real network device, with the appropriate interface and semantics; data written to it goes to a program, however, rather than to a physical medium. Using this and some auxiliary mechanisms, we present a variety of applications, including system test, network monitoring, dial-up TCP/IP, and ways to both improve and subvert network security. Most notably, we show how pseudo-network devices can be used to create \fIvirtual networks\fP and to provide encrypted communications capability. We describe two implementations, one using a conventional driver for socket-based systems, and one using stream pipes for System V. %K Distributed\0Systems %A Joel S. Emer %A William E. Weihl %T Integrated Interactive Access to Heterogeneous Distributed Services %D January 22-26, 1990 %C Washington, DC %I USENIX Assoc. %J Proc. 1990 Winter USENIX Conf. %X \fBAbstract:\fP In this paper, we consider how to provide interactive users with uniform and integrated access to heterogeneous distributed services. Access to distributed services though a single interface has many advantages. One is that it provides the user with an integrated interface environment that allows easy interaction between uses of distinct services. Another is that it simplifies creation of interfaces to new services by obviating the need to create a custom interface for that particular service. As a particular instance of such an interface, we examine the use of editors as an interface to distributed services. To date, the means provided within editors for accessing services has been relatively ad-hoc. In this paper, we examine the more general technique of using remote procedure call as the service access paradigm. This technique is shown to have many advantages including: ease of integration of new services; allowing for more powerful services since they can be written in languages and on hardware platforms appropriate to the service; and allowing access to remote data and access from multiple sites. %K Protocol\0Verification %A R. Lai %A T.S. Dillon %A K.R. Parker %T Verification Results for ISO FTAM Basic Protocol %J Proc. 9th Intl. Symp. on Protocol Specification, Testing and Verification (IFIP WG 6.1) %D June 6-9 %C Enschede, The Netherlands %X \fBAbstract:\fP This paper presents the results of verifying the ISO File Transfer, Access and Management, FTAM against the deadlock freeness property. There are two protocols specified for FTAM : the basic protocol and the error recovery protocol. The basic protocol consists of two protocols : the Basic File Protocol and the Bulk Data Transfer Protocol. Only the results of verifying the Basic protocol are described in this paper. The Formal Description Technique used is Numerical Petri Nets (NPN), an extension of Petri Nets. The verification technique used is reachability analysis. The behaviour of the protocol is analysed using an automated analysis tool, PROTEAN, developed at Telecom Australia. %K Distributed\0Systems %A Henri E. Bal %A M. Frans Kasshoek %A Andrew S. Tanenbaum %T A Distributed Implementation of the Shared Data-Object Model %P 1-20 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Memory %A Umakishore Ramachandran %A M. Yousef A. Khalidi %T An Implementation of Distributed Shared Memory %P 21-38 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Memory %A Gary M. Johnston %A R.H. Campbell %T An Object-Oriented Implementation of Distributed Virtual Memory %P 39-58 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A Fred Douglis %T Experience With Process Migration in Sprite %P 59-72 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A Debra Hensgen %A Raphael Finkel %T Dynamic Server Squads in Yackos %P 73-90 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %T Revolution 89, or Distributing UNIX Brings it Back to its Original Virtues %A Francois Armand %A Michel Gien %A Frederic Herrmann %A Marc Rozier %P 153-174 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K External\0Data\0Formats %A M. Frans Kasshoek %A Henri E. Bal %A Andrew S. Tanenbaum %T Experiences with the Distributed Data Structure Paradigm in Linda %P 175-192 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A Rodger Lea %A Jonathan Walpole %T The Implementation of Aide: A Support Environment for Distributed Object-Oriented Systems %P 289-300 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A D. Decouchant %A M. Riveill %A C. Horn %A E. Finn %T Experience With Implementing and Using an Object-Oriented, Distributed System %P 301-310 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A M. Shapiro %T Prototyping a Distributed Object-oriented OS on UNIX %P 311-332 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A C.J. Wilkenloh %A U. Ramachandran %A S. Menon %A R. J. LeBlanc %A M.Y.A. Khaldi %A P.W. Hutto %A P. Dasgupta %A R.C. Chen %A J.M. Bernabeu %A W.F. Appelbe %A M. Ahamad %T The Clouds Experience: Building an Object-Based Distributed Operating System %P 333-348 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A Marc F. Pucci %A James Alberi %T Experiences with Efficient Interprocess Communication in Dune %P 349-360 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A Horst Schaaser %T Using Transputer Networks to Accelerate Communications Protocols %P 361-372 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %A David L. Cohn %K Distributed\0Systems %A William P. Delaney %A Karen M. Tracey %T ARCADE: A Platform for Heterogeneous Distributed Operating Systems %P 373-390 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Distributed\0Systems %A Roger K. Shultz %T A Decentralized Real-Time Operating Systems Supporting Distributed Execution of Ada Tasks %P 391 %J Workshop on Experiences with Distributed and Multiprocessor Systems %D October 5-6, 1989 %C Fort Lauderdale, Florida %K Protocol\0Implementation %A Ian Vessey %A Glenn Skinner %T Implementing Berkeley Sockets in System V, Release 4 %J Proc. 1990 Winter USENIX Conf. %D January 22-26, 1990 %C Washington, DC %I USENIX Assoc. %X \fBAbstract:\fP A major goal of the UNIX System V, Release 4 (SVR4) development effort has been to unify divergent lines of UNIX development into a single system offering the best features of its progenitors. A closely related goal has been to augment the programming interface to ``capture'' applications written for other UNIX variants, by making the facilities they depend on available in the unified system. The socket interface is a cornerstone of the 4BSD networking facilities, so its presence in SVR4 is an absolute necessity for application capture. .sp This paper describes the design of the SVR4 socket implementation, the implementation problems we encountered, and their solutions. %K Routing %A D. Estrin %T Policy Requirements for Inter Administrative Domain Routing; RFC 1125 %J Internet Request for Comments %N 1125 %D November 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP The purpose of this memo is to focus discussion on particular problems in the Internet and possible methods of solution. No proposed solutions in this document are intended as standards for the Internet. Rather, it is hoped that a general consensus will emerge as to the appropriate solution to such problems, leading eventually to the development and adoption of standards. %K Lower-Layer\0Protocols %A L. McLaughlin, III %T A Standard for the Transmission of 802.2 Packets over IPX Networks; RFC 1132 %J Internet Request for Comments %N 1132 %D November 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This document specifies a standard method of encapsulating 802.2 packets on networks supporting Novell's Internet Packet Exchange Protocol (IPX). It obsoletes earlier documents detailing the transmission of Internet packets over IPX networks. It differs from these earlier documents in that it allows for the transmission of multiple network protocols over IPX and for the transmission of packets through IPX bridges. %K Routing %A J. Yu %A H-W. Braun %T Routing between the NSFNET and the DDN; RFC 1133 %J Internet Request for Comments %N 1133 %D November 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This document is a case study of the implementation of routing between the NSFNET and the DDN components (the MILNET and the ARPANET). We hope that it can be used to expand towards interconnection of other Administrative Domains. We would welcome discussion and suggestions about the methods employed for the interconnections. %K Lower-Layer\0Protocols %A D. Perkins %T The Point-to-Point Protocol: A Proposal for Multi-Protocol Transmission of Datagrams Over Point-to-Point Links; RFC 1134 %J Internet Request for Comments %N 1134 %D November 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo defines a proposed protocol for the Internet community. .sp 0.5 This proposal is the product of the Point-to-Point Protocol Working Group of the Internet Engineering Task Force (IETF). Comments on this memo should be submitted to the IETF Point-to-Point Protocol Working Group chair by January 15, 1990. Comments will be reviewed at the February 1990 IETF meeting, with the goal of advancing PPP to draft standard status. %K Distributed\0File\0Systems %A To-Yat Cheung %T An Algorithm with Decentralized Control for Sorting Files in a Network %J Journal of Parallel and Distributed Computing %V 7 %N 3 %D December 1989 %P 464-481 %K Network\0Fault\0Tolerance %A A.S. Finbow %A B.L. Hartnell %T On Designing and Network to Defend Against Random Attacks of Radius Two %J Networks: an international journal %V 19 %N 7 %D December 1989 %P 771-792 %K Multicasting %A D. Peleg %A A.A. Schaffer %T Time Bounds on Fault-Tolerant Broadcasting %J Networks: an international journal %V 19 %N 7 %D December 1989 %P 803-828 %K Multicasting %A Lawrence C.N. Tseung %T Guaranteed, Reliable, Secure Broadcast Networks %J IEEE Network %D November 1989 %V 3 %N 6 %P 33-37 %K Reviews %A P. Jalote %T Resilient Objects in Broadcast Networks %J IEEE Software Engineering %D January 1989 %V 15 %N 1 %P 68-71 %O \fIReviews:\fP Computing Reviews, Vol. 30, No. 11, November 1989 %K Reviews %O \fIReviews:\fP Computing Reviews, Vol. 30, No. 11, November 1989 %T Data Replicas in Distributed Information Services %A H.M. Gladney %J ACM Trans. Database Systems %V 14 %N 1 %D March 1989 %P 75-97 %A Donnalyn Frey %A Rick Adams %T !%@:: A Directory to Electronic Mail Addressing and Networks %I O'Reilly & Associates %D July 1989 %X \fBDescription:\fP This book provides readers with a directory to approximately 100 research and educational networks, plus a few commercial networks. The book will allow readers to become more familiar with networks they can use to reach other people around the world. It also assists readers in finding someone else's email address and sending mail. The book is in an easy-to-use short reference format and will be updated every six to ten months for greater accuracy. It should be of use to system administrators who field email questions, researchers who want to get in touch with other researchers, conference attendees with many contacts, and others who routinely send email. Each network section contains general information on the network, address structure and format, connections to other sites or networks, facilities available to users, contact name and address, cross references to other networks, and the date of the last update. Also included is a three-way index to network name, network type, and country. For further information on the network book, contact the publisher, O'Reilly & Associates at 617-354-5800. %A Martin Nemzow %T Keeping the Link: Ethernet Installation and Management %I McGraw Hill %D 1988 %O \fBReview:\fP \fIConneXions\fP, Vol. 3, No. 7. [\fIEd. Note:\fP review states that the book gives technically incorrect information about Ethernet] %A Tom McGovern %T Data Communications: Concepts and Applications %I Prentice-Hall %D 1988 %O \fBReview:\fP \fIComputing Reviews\fP, Vol. 30, No. 7 %A John McConnell %T Internetworking Computer Systems: Interconnecting Networks and Systems %I Prentice-Hall %D 1988 %O \fBReview:\fP \fIComputing Reviews\fP, Vol. 30, No. 7 %A B.G. Kim %T Current Advances in LANs, MANs, and ISDN %I Artech House %C Norwood, Massachusetts %D October 1989 %X \fBDescription:\fP A reprint collection of recent papers. %A Uyless Black %T Physical Level Interfaces and Protocols %I IEEE Computer Society Press %D 1988 %O \fBReview:\fP \fIIEEE Communications\fP, Vol. 27, No. 8, August 1989. %A Bernard Sklar %T Digital Communications: Fundamentals and Applications %I Prentice Hall %D 1988 %O \fBReview:\fP \fIIEEE Communications\fP, Vol. 27, No. 8, August 1989. %A Uyless Black %T Data Networks: Concepts, Theory and Practice %I Prentice Hall %D 1989 %A John Henshall %A Sandy Shaw %T OSI explained: end-to-end computer communication standards %I John Wiley and Sons, Inc. %C New York %D 1988 %O \fBReview:\fP \fIComputing Reviews\fP, Vol. 30, No. 8 %A Michael J. Miller %A Syed V. Ahamed %T Digital transmission systems and networks. Vol I.: principles %I Computer Science Press %C Rockville, MD %D 1987 %O \fBReview:\fP \fIComputing Reviews\fP, Vol. 30, No. 8 %A Anton Meijer %T Systems Network Architecture: A tutorial %I John Wiley and Sons, Inc. %C New York %D 1988 %O \fBReview:\fP \fIComputing Reviews\fP, Vol. 30, No. 8 %A Scott A. Helmers %T Data Communications: A Beginner's Guide to Concepts and Technology %D 1989 %I Prentice-Hall %C Englewood Cliffs, New Jersey %A Peter H.J. van Eijk %A Chris A. Vissers %A Michel Diaz %T The Formal Description Technique LOTOS: Results of the ESPRIT/SEDOS Project %I North-Holland %C New York %D 1989 %X \fBSummary:\fP LOTOS is a formal description technique that has been developed for the specification of distributed systems, in particular computer networks, and is now International Standard 8807. The book gives an overview of LOTOS including a tutorial, realistic specification examples, verification theory and supporting software tools. %T UNIX Network Programming %A W. Richard Stevens %I Prentice Hall %C Englewood Cliffs, N.J. %D January 1990 %X \fBNote:\fP ISBN # 0-13-949876-1 %A John McConnell %T Internetworking computer systems; interconnecting networks and systems %D 1988 %I Prentice-Hall %C Englewood Cliffs, N.J. %X \fBNote:\fP ISBN # 0-13-473976-0 %A Clifford Stoll %T The Cuckoo's Egg %I Doubleday %C New York %D 1989 %O \fBReview:\fP \fINew York Times\fP, November 26, 1989. %X \fBNote:\fP ISBN # 0-385-24946-2 %A Marshall T. Rose %T The Open Book: A practical perspective on OSI %D 1990 %I Prentice Hall %C Englewood Cliffs, N.J. %O \fBReview:\fP ConneXions, Vol 3., No. 11. %X \fBDescription:\fP A detailed examination of the OSI protocols from the implementor's perspective. (ISBN # 0-13-643016-3). %A John S. Quarterman %T The Matrix: Computer Networks and Conferencing Systems Worldwide %I Digital Press %C Bedford, MA %D 1989 %O \fBReview:\fP ConneXions, Vol 3., No. 11. %X \fBDescription:\fP A detailed survey of all known computer networks in the world. Provides information on connectivity, history, future plans and key personnel. %A Andrew S. Tanenbaum %T Computer Networks; Second Edition %D 1988 %I Prentice-Hall %O \fIReviews:\fP IEEE Communications, January 1989, Computing Reviews, Vol. 30, No. 11, November 1989. %A Carl Malamud %T DEC networks and architectures %D 1989 %I Intertext Pubs./McGraw-Hill %C New York %O \fIReviews:\fP Computing Reviews, Vol. 30, No. 11, November 1989. %A Paul J. Fortier %T Handbook of LAN Technology %I Intertext Pubs./McGraw-Hill %C New York %O \fIReviews:\fP Computing Reviews, Vol. 30, No. 11, November 1989.