leff@smu.UUCP (Laurence Leff) (11/24/88)
This is the refer source for the networking bibliography printed in the October 1988 issue of Computer Communication Review. The bibliography tries to list all publications on networking in the three months between issues (in this case, July 15th to September 15th). I enter items as they are received, which is not necessarily their official date of publication, so there are items from this spring that appear in this bibliography. Note that for major publications just the citation is given. For publications less likely to be read by networking folk, an abstract (in Troff format) is included as the %X field. I expect to circulate this bibliography for future issues as well, but in deference to the SIGCOMM membership (which pays $$ for their issues of CCR) I will delay circulating the bibliography until a few weeks after the appropriate issue has been mailed out. Anyone wishing to have a paper or technical report included in this bibliography is encouraged to the citation to me (craig@bbn.com). %A A.J.A. Abdul-Reda %A P.G. Farrell %T Simulation Performance Study of Aloha Network %P 161-165 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A H. Akimaru %A H. Kuribayashi %A T. Inoue %T Approximate Evaluation for Mixed Delay and Loss Systems with Renewal and Poisson Inputs %P 850-854 %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %T Loop Distribution Using Coherent Detection %A A. Albanese %A R.C. Menendez %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 959-973 %A P. Amer %A A. Pridor %A M. Srivas %T Well-formedness of Transitions in Estelle Formal Specifications %J Computer and Information Science Dept. Technical Reports %I University of Delaware %C Newark, Delaware %D July 1988. %X \fBAbstract:\fP Two algorithms are presented to check whether or not a syntactically correct transition-declaration-part of an Estelle specification also is well-formed in that it satisfies static, context dependent constraints defined in the ISO Estelle Draft International Standard 9074. Well-formed and not well-formed examples are given. The first algorithm operates in the manner of the ISO recursive definition of well-formedness. Its worst-case time complexity is 7.5N + constant, where N is the length of the input. An example of its worst-case behavior is provided. The second algorithm is a non-recursive, stack-based one. A proof of correctness for it is provided, and its worst-case time complexity is shown to be less than 2N. Both algorithms assume the input transition-declaration-part is syntactically correct. %A P. Amer %A A. Pridor %A J. Schmidt %T Expansion of Transitions in Estelle Formal Specifications %J Proc. 8th IFIP Int. Symp. on Protocol Specification Testing, and Verification %D June 1988 %C Atlantic City %X \fBAbstract:\fP A revised definition, clearer than the one in ISO DIS9074, is proposed for the expansion of well-formed Estelle transition-declarations. Expansion is a translation of a transition-declaration written in shorthand notation into a sequence of simple transitions, i.e., transition-declarations each containing exactly one expanded transition. As Estelle's formal semantics are defined only for simple transitions, removal of nested, inherited clauses is a required activity in software tools such as a compiler which must recognize the semantics of each module instance's finite state behavior. Two algorithms (one recursive, one stack based) are proposed for implementing expansion. The recursive algorithm is shown to perform expansion for a worst-case input in a time complexity of 6.5N + constant where N is the number of clauses and transition-blocks in the input. The stack algorithm has a worst-case time complexity of less than 2N. %A P. Amer %A F. Ceceli %A G. Juanole %T Formal Specification of ISO Virtual Terminal in Estelle %J Proc. IEEE INFOCOM %C New Orleans %D March 1988 %P 623-630 %X \fBAbstract:\fP An architecture model and a subset of a behavior model of the ISO Virtual Terminal (VT) are specified in the formal description technique Estelle. The architecture model includes modules and their appropriate interconnections (channels) for: a VT-User, a VT Protocol Machine (VTPM), an Association Control Service Entity (ACSE), Autonomous-Abort internal events, a presentation layer element, and a Mapping Machine to map protocol data units of the VTPM onto service primitives of the ACSE and the presentation layer. The behavior model specifies the Association Establishment phase of the VTPM for the synchronous mode of operation assuming that no optional functional units are selected. The combination of VT and Estelle demonstrates ISO's effort towards providing users with Open Systems Interconnection. %A D.P. Anderson %T A Software Architecture for Network Communication %P 376-383 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Current distributed systems use communication primitive such as datagrams, request/reply message-passing, and reliable virtual circuits. Are these primitives appropriate for future distributed systems based on high-performance large-scale networks? As an alternative, we propose a communication abstraction call Real-Time Message Streams (RMS). An RMS is a simplex (unidirectional) stream with several performance and security parameters that express 1) the needs of RMS clients and 2) the capabilities of the RMS provider. This information can be used in two ways. First, RMS providers can eliminate unnecessary or redundant work, and can optimally schedule resources such as network bandwidth and CPU. Second, the RMS client can use the parameters to select optimal methods for achieving whatever reliability and flow control are needed. .sp 0.5 RMS is the communication primitive of the DASH distributed systems currently being developed a UC Berkeley. This paper describes 1) the RMS abstraction itself, 2) the role of RMS in the DASH communication architecture, and 3) techniques and algorithms for providing RMS at different system levels. %T A New Double-Loop Computer Network, Its Simulated Performance %A S. Angelopoulos %A S. G. Papdopoulos %A S. Koubias %p 386-390 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A R. Ashany %A D. Ferrari %A J. Pasquale %T Application of AI Techniques to Adaptive Routing in Wide-Area Networks %P 157-161 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A P. Bates %T Distributed Debugging Tools for Heterogeneous Distributed Systems %P 308-315 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP This paper describes a collection of tools that form an implementation of Event Based Behavioral Abstraction (EBBA), a paradigm for high-level debugging of distributed systems. The tools are capable of operating effectively in a heterogeneous environment containing processors of varying design and power (DEC MicroVax, TI Explorer Lisp machines, and serveral Sequent multiprocessors). Toolset users construct libraries of behavior models and observe the behavior of the system through the models. The toolset is a collection of components that are collectively a distributed system for debugging distributed systems. The components can be combined in varying ways to provide levels of debugging service appropriate for the resources available at individual nodes. %A D.C. Baxter %A T. Suda %A J. Bae %T The Robustness of Tree Algorithms in an Unshared Feedback Error Environment %P 313-317 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %H [Old listing with new review] %A D. Bertsekas %A R. Gallager %T Data Networks %D 1987 %C Englewood Cliffs, NH %I Prentice-Hall, Inc. %O \fBReviews:\fP \fIComputing Reviews\fP, Vol. 29, No. 5, May 1988; \fIIEEE Network\fP, October 1987. %A A. Bhargava %A J.F. Kurose %A D. Towsley %T A Hybrid Media Access Protocol for High-Speed Ring Networks %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 924-933 %H [Old listing with new review] %A U. Black %T Computer networks: protocols, standards, interfaces %D 1987 %C Englewood Cliffs, NH %I Prentice-Hall, Inc. %O \fBReviews:\fP \fIComputing Reviews\fP, Vol. 29, No. 4, April 1988. %T Measured Capacity of an Ethernet %A D.R. Boggs %A J.C. Mogul %A C.A. Kent %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 222-234 %T Performance Analysis of Transport Protocols over Congestive Channels %A J.C. Bolot %A A. Udaya Shankar %A B.D. Plateau %J Computer Science Dept. Technical Reports %I University of Maryland %C College Park, Maryland 02742 %N CS-TR-2004.1 %D August 1988 %X \fBAbstract:\fP We analyze a Markov model of the performance of transport protocols over congestive channels, which are channels whose delay and loss characteristics depend significantly upon the number of messages in transit. Such channels are typical of most store-and-forward networks, including the Internet. We present a general state transition framework for modeling various protocol policies and congestive channels, and for representing performance measures. Using this framework, we obtain a continuous-time Markov chain model of a protocol with simple policies. The Markov chain is solved numerically to obtain performance measures of interest to the user (response time, throughput, etc.), and of interest to the protocol designer (congestion in the channels, space available in the windows, etc.). The numerical solution technique yields not only the averages of these measures, but also their probability distributions. %T A Pseudo-Machine for Packet Monitoring and Statistics %A R.T. Braden %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 200-209 %A P.T. Brady %T Effects on Response Time Performance Using an Edge-to-Edge Protocol in an X.25 Packet Network %J IEEE Network %V 2 %N 4 %D July 1988 %P 45-54 %A E.F. Brickell %A A.M. Odlyzko %T Cryptanalysis: A Survey of Recent Results %J Proc. IEEE %V 76 %N 5 %D May 1988 %P 578-593 %X \fBAbstract:\fP In spite of the progress in computational complexity, it is still true that cryptosystems are tested by subjecting them to cryptanalytic attacks by experts. Most of the cryptosystems that have been publicly proposed in the last decade have been broken. This paper outlines a selection of the attacks that have been used and explains some of the basic tools available to cryptanalyst. Attacks on knapsack cryptosystems, congruential generators, and a variety of two key secrecy and signature schemes are discussed. There is also a brief discussion of the status of the security of cryptosystems for which there is no known feasible attack, such as the RSA, discrete exponentiation, and DES cryptosystems. %A S. Casale %A V. Catania %A L. Vita %T On the Implementation of an Optical Token-Ring LAN %P 166-173 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A J. Case %A M. Fedor %A M. Schoffstall %A J. Davin %T A Simple Network Management Protocol %J Internet Request for Comments %D August 1988 %N 1067 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC defines a simple protocol by which management information for a network element may be inspected or altered by logically remote users. In particular, together with its companion memos which describe the structure of management information along with the initial management information base, these documents provide a simple, workable architecture and system for managing TCP/IP-based internets and in particular, the Internet. .sp 0.5 This memo specifies a draft standard for the Internet community. TCP/IP implementations in the Internet which are network manageable are expected to adopt and implement this specification. %A S.T. Chanson %A K. Ravindran %T Host Identification in Reliable Distributed Kernels %J Computer Networks and ISDN Systems %V 15 %N 3 %P 159-176 %T A Protocol to Maintain a Minimum Spanning Tree in a Dynamic Topology %A C. Cheng %A I. Cimet %A P. Kumar %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 330-338 %T Exploiting Recursion to Simplify RPC Communication Architectures %A D.R. Cheriton %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 76-87 %X \fBNote:\fP Also available as Report No. STAN-CS-88-1213, Department of Computer Science, Stanford, CA 94305. %T Performance Analysis of a Large Interconnected Network by Decomposition %A J. Chiarawongse %A M.M. Srinivasan %A T.J. Teorey %J IEEE Network %V 2 %N 4 %D July 1988 %P 19-27 %T Circuit Switching in Multi-Hop Lightwave Networks %A I. Chlamtac %A A. Ganz %A G. Karmi %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 188-199 %A I. Chlamtac %A A. Ganz %T A Multibus Train Communication (AMTRAC) Architecture for High-Speed Fiber Optic Networks %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 903-912 %A M. Choi %A C.M. Krishna %T An Adaptive Algorithm to Ensure Differential Service in a Token Ring Network %P 324-329 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %T The Design Philosophy of the DARPA Internet Protocols %A D.D. Clark %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 106-114 %A D.L. Cohrs %A B.P. Miller %A L.A. Call %P 66-62 %T Distributed Upcalls: A Mechanism for Layering Asynchronous Abstractions %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP It is common to use servers to provide access to facilities in a distributed system and to use remote procedure call semantics to access these servers. Procedure calls provide a synchronous interface to call downward through successive layers of abstraction, and remote procedure calls allow the layers to reside in different address spaces. Servers, however, often need the ability to initiate asynchronous and independent actions. Examples of this asynchrony are when a network server needs to signal to an upper layer in a protocol, or when a window manager server needs to respond to user input. .sp 0.5 Upcalls are a facility that allows a lower level of abstraction to pass information to a higher level of abstract in a clean way. We describe a facility for distributed upcalls that allows upcalls to cross address space boundaries. The complement of remote procedure calls for handling synchronous server requests and distributed upcalls for handling asynchronous server activities provide a powerful tool for structuring servers. These facilities, together with the ability to dynamically load modules into a server, allow the user to arbitrarily place abstractions in the server or in the client. .sp 0.5 Distributed Upcalls have been built into a server structuring system called CLAM, which is currently being used to support an extensible window management system. The CLAM system, including distributed upcalls, remote procedure call extensions to C++, dynamic loading, and basic window classes, is currently running under 4.3BSD UNIX on Microvax workstations. %T A Congestion Filtering Scheme for Packet Switched Networks %J Computer Science Dept. Technical Reports %N CSD-TR-758 %A D. Comer %A R. Yavatkar %I Purdue University, %C West Lafayette, IN 47907 %D April 10, 1988 %X \fBAbstract:\fP The problem of congestion control in packet switched networks continues to attract widespread attention in the networking community. Under overloading conditions, a network drops packets and informs the traffic sources to reduce the load on the network. The policy of reacting to the congestion after it occurs results in considerable degradation in the throughput during network recovery. We have devised a congestion control scheme based on the principles of a feedback control scheme. Our scheme uses rate-based feedback that allows a source to reduce transmission proportional to its contribution to the total traffic through an affected node. The scheme can be adopted for use in the existing Internet without adding new protocol or message formats. %T FLOWS: Performance Guarantees in Best Effort Delivery Systems %J Computer Science Dept. Technical Reports %N CSD-TR-791 %A D. Comer %A R. Yavatkar %I Purdue University, %C West Lafayette, IN 47907 %D July 1, 1988 %X \fBAbstract:\fP A best effort delivery system provides a connectionless, datagram service in which the packets may be delayed or dropped in the presence of congestion. The underlying network does not make any guarantees about performance seen by an application. Performance needs of various applications differ greatly and some of the applications such as packet voice and video have strict performance limits. .sp 0.5 Existing network architectures and protocols do not make provisions for applications to specify their performance needs, and communication architectures do not have mechanisms that satisfy and guarantee performance needs. We introduce a network level communication abstraction called \fIflow\fP. A flow is a communication channel that has specific performance characteristics associated with its traffic. The underlying delivery system guarantees to meet performance needs of a flow once it accepts a flow request. Upper layers use flows to implement high performance applications and transport level protocols. .sp 0.5 In this paper, we describe the concept of flows in detail and describe algorithms to implement flows in a high speed packet switched network under development at Purdue. %A D. Comer %A J. Griffioen %A R. Yavatkar %T Shadow Editing: A Distributed Service for Supercomputer Access %P 215-223 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Long-haul networks are now being used by the scientific community to access resources at the supercomputing centers. There is a need for high-level user services and tools to provide transparent and efficient access to remote resources. This paper describes a way to provide a computational service for supercomputer access in a distributed environment. We discuss the issues involved in the design of such a service and focus on a remote job submission facility. The paper also describes a prototype implementation. %A M. Crispin %T Interactive Mail Access Protocol - Version 2; RFC1064 %J Internet Request for Comments %N 1064 %D July 1988 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo suggests a method for workstations to dynamically access mail from a mailbox server (``repository''). This RFC specifies a standard for the SUMEX-AIM community and a proposed experimental protocol for the Internet community. Discussion and suggestions for improvement are requested. %T A Multicast Transport Protocol %A J. Crowcroft %A K. Paliwoda %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 247-256 %T A High Performance Broadcast File Transfer Protocol %A J.S.J. Daka %A A.G. Waters %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 274-281 %A P. Dasgupta %A R.J. Leblanc %A W.F. Appelbe %T The Clouds Distributed Operating System %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %P 2-9 %X \fBAbstract:\fP Clouds is an operating system in a novel class of distributed operating systems providing the integration, reliability and structure that makes a distributed system usable. Clouds is designed to run on a set of general purpose computers that are connected via a medium-to-high speed local area network. The structure of Clouds promotes transparency, support for advanced programming paradigms, and integration of resource management, as well as a fair degree of autonomy at each site. .sp 0.5 The system structuring paradigm chosen for the Clouds operating system, after substantial research, is an object/thread model. All instances of services, programs and data in Clouds are encapsulated in objects. The concept of persistent objects does away with the need for file systems, and replaces it with a more powerful concept, namely the object system. The facilities in Clouds include integration fo resources through location transparency; support for various types of atomic operations, including conventional transactions; advanced support for achieving fault tolerance, and provisions for dynamic reconfiguration. %A J. Davidson %T An Introduction to TCP/IP %I Springer-Verlag %C New York, NY %D 1988 %O \fBReview:\fP \fIComputing Reviews\fP, Vol. 29, No. 8, August 1988 %T Static Priority Queues with Application to a Computer Network %A G.R. Davis %P 335-339 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A R. Day %T Interconnected LANS: Performance Tools and Performance Measurements %J Computer Science Technical Report %I University of Washington %N 88-06-06 %D June 1988 %X \fBAbstract:\fP A follow-up study to the original Shoch and Hupp paper ``Measured Performance of an Ethernet Local Network'' is presented. The ramifications of advances in technology, particularly the integration of isolated Ethernet segments into larger interconnected networks, the use of more demanding network applications like network file systems, and the advances in processor speed are considered. The design of Ethernet monitoring tools for interconnected LANs is discussed, and the results of using one such monitor to observe a larger LAN are presented. (Order from: Dept. of Computer Science, University of Washington, Seattle WA 98195). %T Multicast Routing in Internetworks and Extended LANs %A S.E. Deering %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 55-64 %X \fBNote:\fP Also available as Report No. STAN-CS-88-1214, Department of Computer Science, Stanford, CA 94305. %T An Analysis of Memnet - An Experiment in High Speed Memory Mapped Local Networking %A G. Delp %A A. Sethi %A D. Farber %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 165-174 %A R.A. Demers %T Distributed files for SAA %J IBM Systems Jour. %V 27 %N 3 %P 348-361 %X \fBAbstract:\fP Files are still a major way of storing data in computer systems, and they are a significant part of the information to be handled by the distributed processing networks that are developing. Systems Application Architecture is supporting distributed files. In this paper, the goals, benefits, and problems of providing this support are discussed, along with the role of Distributed Data Management Architecture. %A A. DeSchon %A B. Braden %T Background File Transfer Program (BFTP); RFC 1068 %J Internet Request for Comments %D August 1988 %N 1068 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC describes an Internet background file transfer service that is built upon the third-party transfer model of FTP. No new protocols are involved. The purpose of this memo is to stimulate discussion on new Internet service modes. %A W. Diffie %T The First Ten Years of Public-Key Cryptography %J Proc. IEEE %V 76 %N 5 %D May 1988 %P 560-577 %X \fBAbstract:\fP Public-key cryptosystems separate the capacities for encryption and decryption so that 1) many people can encrypt messages in such a way that only one person can read them, or 2) one person can encrypt messages in such a way that many people can read them. This separation allows important improvements in the management of cryptographic keys and makes it possible to `sign' a purely digital message. .sp 6p Public key cryptography was discovered in the Spring of 1975 and has followed a surprising course. Although diverse systems were proposed early on, the ones that appear both practical and secure today are all closely related and the search for new and different ones has met with little success. Despite this reliance on a limited mathematical foundation public-key cryptography is revolutionizing communication security by making possible secure communications networks with hundreds of thousands of subscribers. .sp 6p Equally important is the impact of public key cryptography on the theoretical side of communication security. It has given cryptographers a systematic means of addressing a broad range of security objectives and pointed the way toward a more theoretical approach that allows the development of cryptographic protocols with proven security characteristics. %T Effective Algorithms for Partitioning Distributed Programs %A J.G. Donntt %A M. Starkey %A D.B. Skillicorn %P 363-369 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A D. Dykeman %A W. Bux %T Analysis and Tuning of the FDDI Media Access Control Protocol %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 997-1010 %A M. Eisenberg %A N. Mehravari %T Performance of the Multichannel Multihp Lightwave Network Under Nonuniform Traffic %J IEEE Jour. on Selected Areas in Communications %V 6 %N 7 %D August 1988 %P 1063-1078 %A J.S. Emer %A K.K. Ramkrishnan %T Performance Considerations for Distributing Services \(em A Case Study: Mass Storage %P 289-299 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP In this paper, we address the issue of partioning operating system services in a distributed system. There are many factors that may influence how a service is partioned between client and server. However, one significant impact of this partitioning is on performance. We consider this effect on performance by examining the tradeoff between partitioning a service at a higher layer, which could potentially result in greater computation at the server, and partitioning at a lower layer, which could result in less service-related computation at the server but may require more communication with the server. As a case study, we consider the performance implications of providing alternate types of distributed mass storage services. In particular, we consider those partitionings that result in a file and a disk service. To examine the performance ramifications of selecting between these two partitionings, we developed a detailed multi-class closed queueing network model of the remote service with users on workstations. The workload applied to the mass storage systems is based on measurements of timesharing systems performed in earlier studies. We study the sensitivity of the performance of the two alternatives to a variety of parameters, with special emphasis on how they affect the different partitionings differently. %A K.Y. Eng %T A Photonic Knockout Switch for High-Speed Packet Networks %J IEEE Jour. on Selected Areas in Communications %V 6 %N 7 %D August 1988 %P 1107-1116 %A M.E. Epstein %A C. Vandetta %A J. Sechrest %T Asmodeus: A Daemon Servant for the System Administrator %J Proc. 1988 Summer USENIX Conf. %I USENIX Assoc. %C San Francisco, CA %D June 20-24, 1988 %P 377-391 %X \fBAbstract:\fP Asmodeus is a distributed database system which simplifies the tasks of the Unix systems administrator. Using simple commands to the Asmodeus command interface, the systems administrator can perform many tedious operations over a large network of machines. The system uses a reliable datagram socket connection for all of its communications. It is designed to withstand server crashes so that the average user never knows when it happens. Asmodeus synchronizes changes across machine boundaries, while performing many varied tasks including changing passwords, adding and removing user accounts, and adding and removing users from groups and mail aliases. Programs which only read standard Unix system databases need not be changed. Asmodeus operates behind the scenes, uses minimal system and network resources, and can be used with binary-only Unix systems. %T A Distributed Broadcast Algorithm for Binary De Bruijn Networks %A A.-H. Esfahanian %A G. Zimmerman %P 318-323 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A M.S. Fedor %T Gated: A Multi-Routing Protocol Daemon For Unix %J Proc. 1988 Summer USENIX Conf. %I USENIX Assoc. %C San Francisco, CA %D June 20-24, 1988 %P 365-376 %X \fBAbstract:\fP With the emergence of the NSFNET backbone network and its innovative routing protocol, it became necessary to develop a way to interact with the backbone network's routing strategy. Also, during this time, many mid-level networks were becoming connected to the NSFNET backbone. Individual sites on these mid-level networks wished to communicate via the NSFNET backbone, but also wanted to use their own DDN ARPANET or MILNET link as a fallback route when necessary. Of course, this use of backup and fallback routes had to take place dynamically in order to be of any real value. .sp 6p This paper discusses the implementation of a UNIX routing daemon which is capable of performing the above described tasks as well as a number of other functions. Experiences in dealing with routing protocols when they are running in parallel and how they affected design decisions will also be discussed. This routing daemon has been in the field for almost a year and a half. While at first it was believed to be a very short term solution, it has proven itself well and has given us the necessary time to push forward towards the development of a new routing protocol. %T Sharing of the Optical Band in Local Systems %A G.J. Foschini %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 974-986 %A H. Garcia-Molina %A B. Kogan %A N. Lynch %T Reliable Broadcast in Networks with Nonprogrammable Servers %P 428-438 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP The problem of implementing reliable broadcast in ARPA-like computer networks is studied. The environment is characterized by the absence of any multicast facility on the communications subnetwork level. Thus, broadcast protocol has to be implemented directly on hosts. A reliable broadcast protocol is presented and evaluated by several important performance criteria. %A M. Gerla %A L. Fratta %T Tree Structured Fiber Optic MAN's %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 934-943 %A D.K. Gifford %A N. Glasser %T Remote Pipes and Procedures for Efficient Distributed Communication %J ACM Trans. on Computer Systems %V 6 %N 3 %D August 1988 %P 258-283 %X \fBAbstract:\fP We describe a new communication model for distributed systems that combines the advantages of remote procedure call with the efficient transfer of bulk data. Three ideas form the basis of this model. First, remote procedures are first class values which can be freely exchanged among nodes, thus enabling a greater variety of protocols to be directly implemented in a remote procedure call framework. Second, a new type of abstract object, called a \fIpipe\fP allows bulk data and incremental results to be efficiently transported in a type-safe manner. Unlike procedure calls, pipe calls do not return values and do not block a caller. Data sent down a pipe is received by the pipe's sink node in the order sent. Third, the relative sequencing of pipes and procedures can be controlled by combining them into \fIchannel groups\fP. Calls on the members of a channel group are guaranteed to be processed in order. Application experience with this model, which we call the \fIChannel Model\fP, is reported. Derived performance bounds and experimental measures demonstrate \fIk\fP pipe calls can perform \fImin(\fR1+(\fIr/p\fR),\fIk\fR) times faster than \fIk\fP procedure calls, where \fIr\fP is the total roundtrip remote communication time and \fIp\fP is the procedure execution time. %A J. Goodman %A A.G. Greenberg %A N. Madras %A P. March %T Stability of Binary Exponential Backoff %J Jour. of the Association for Computing Machinery %V 35 %N 3 %D July 1988 %P 579-602 %X \fBAbstract:\fP Binary exponential backoff is a randomized protocol for regulating transmissions on a multiple-access broadcast channel. Ethernet, a local-area network, is built upon this protocol. The fundamental theoretical issue is stability: Does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough? It is assume \fIn\fP\ \(>=\ 2 stations share the channel, each having an infinite buffer where packets accumulate while the station attempts to transmit the first from the buffer. Here, it is established that binary exponential backoff is stable if the sum of the arrival rates is sufficiently small. Detailed results are obtained on which rates lead to stability when \fIn\fP=2 stations share the channel. In passing, several other results are derived bearing on the efficiency of the conflict resolution process. Simulation results are reported that, in particular, indicate alternative retransmission protocols can significantly improve performance. %A D.M. Gordon %A R.E. Creps %A Y. Qu %T A Laboratory for Testing DoD Protocol Implementations: Its Architecture and Methodologies %P 404-409 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %T Delivery and Discrimination: The Seine Protocol %A M. Gouda %A N. Maxemchuk %A U. Mukherji %A K. Sabnani %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 292-302 %A R. Hayes %A S.W. Manweiler %A R.D. Schlicting %T A Simple System for Constructing Distributed, Mixed-Language Programs %J Software \(em Practice and Experience %I John Wiley and Sons, Ltd %C England %P 641-660 %D July 1988 %V 18 %N 7 %X \fBAbstract:\fP The Mixed-Language Programming (MLP) System is a simple system that facilitates construction of sequential programs in which procedures can be written in different programming languages to exploit heterogeneity in language functionality. In addition, MLP provides a simple remote procedure call (RPC) facility that allows heterogeneity in machine functionality to be exploited. To minimize implementation cost, the system does not solve all of the problems related to mixed-language programming; rather, MLP is designed to handle common situations well. Among unique aspects of MLP are its advanced facilities, which allow complex situations to be handled with user intervention; for example, these facilities now allow arguments of a type not defined by a language to be used by procedures written in that language. In addition, two programs that have been written using the MLP system \(em a small database system and a collection of plot routines \(em are discussed. The system executes on a collection of Vaxes and Suns running Berkeley UNIX. Currently support languages are C, Pascal and Icon. %A C. Hedrick %T Routing Information Protocol; RFC1058 %J Internet Request for Comments %N 1058 %D June 1988 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC describes an existing protocol for exchanging routing information among gateways and other hosts. It is intended to be used as a basis for developing gateway software for use in the Internet community. %A J.M. Helary %A N. Plouzeau %A M. Raynal %T A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network %J The Computer Journal %I The British Computer Society %V 31 %N 4 %D August 1988 %P 289-295 %X \fBAbstract:\fP A distributed algorithm for mutual exclusion is presented. No particular assumptions on the network topology are required, except connectivity; the communications graph may be arbitrary. The processes communicate by using messages only and there is no global controller. Furthermore, no process needs to know or learn the global network topology. In that sense, the algorithm is more general than the mutual exclusion algorithms which make use of an \fIa priori\fP knowledge of the network topology (for example either ring or complete network). A proof of the correctness of the algorithm is provided. The algorithm's complexity is examined by evaluating the number of messages required for the mutual exclusion protocol. %A W.B. Hilal %A H.T. Yuen %T Designing Large Electronic Mail Systems %P 402-409 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Electronic mail is one of the most important means for communication and information exchange in internetworking environments. In this paper, three methods for designing large mail systems are investigated with varying degrees of flexibilities, namely, mail systems with syntax-directed naming, mail systems with limited location-independent access and attribute-based mail systems. Mail systems with syntax-directed naming identify users by names which are syntactically structured according to user locations. Algorithms for load balancing among mail servers, system reconfiguration, and efficient message delivery are developed and tested using simulation. Mail systems with limited location-independent access allow users to access them from one primary location and a number of secondary locations. Procedures that keep track of users who migrate from their primary location and redirect their mail are presented. The attribute-based mail system provides maximum flexibility to users by allowing them to identify one or more mail recipients by attributes instead of only by precise names. It can also be used in mass distribution of electronic mail. An algorithm for efficient broadcasting and searching using Minimum-weight Spanning Tree (MST) is investigated. Finally, criteria for evaluating electronic mail systems are presented. %A H.S. Hinton %T Architecture Considerations for Photonic Switching Networks %J IEEE Jour. on Selected Areas in Communications %V 6 %N 7 %D August 1988 %P 1209-1226 %T Knowledge-Based Monitoring and Control: An Approach to Understanding the Behavior of TCP/IP Network Protocols %A B.L. Hitson %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 210-221 %A W. Hseush %A G.E. Kaiser %T A Network Architecture for Reliable Distributed Computing %J IEEE Network %V 2 %N 4 %D July 1988 %P 28-45 %T Design of an x-Kernel %A N. Hutchinson %A L. Peterson %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 65-75 %T Congestion Avoidance and Control %A V. Jacobson %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 314-329 %T Specification and Verification of Collision-Free Broadcast Networks %A P. Jain %A S.S. Lam %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 282-291 %A R. Jain %T Error Characteristics of FDDI %J Digital Equipment Corporation Technical Reports %N DEC-TR-553 %D June 1988 %X \fBAbstract:\fP Fiber Distributed Data Interface (FDDI) is a 100 megabits per second fiber optic local area network (LAN) standard being developed by the American National Standard Institute (ANSI). .sp 0.5 We analyze the impact of various design decisions on the error detection capability of the protocol. In particular, we quantify frame error rate, token loss rate, and undetected error rate. Several characteristics of the 32-bit frame check sequence (FCS) polynomial, which is also used in IEEE 802 LAN protocols, are discussed. .sp 0.5 The standard uses a ``non-return to zero invert on ones'' (NRZI) signal encoding and a 4 bit-to-5 bit (4B/5B) symbol encoding in the physical layer. Due to the combination of NRZI and 4B/5B encoding, many noise events are detected by code (or symbol) violations. A large percentage of errors is also detected by framing violations. Some of the remaining errors are detected by FCS violations. The errors that escape these three violations remain undetected. The probability of undetected errors due to creation of false starting delimiters, false ending delimiters, or merging of two frames is analyzed. .sp 0.5 It is shown that every noise event results in two code-bit errors, which in turn my result in up to four data-bit errors. The FCS can detect up to two noise events. Creation of a false starting delimited or ending delimiter on a symbol boundary also requires two noise events. This assumes enhanced frame validity criteria. We justify the enhancements by quantifying their effect. .sp 0.5 This analysis here is limited to noise events not resulting in a change of symbol boundaries. Extensions to the case of changed symbol boundaries is continuing and will be presented at a later time. %T Performance Issues in Management of the Space Station Information System %A M.J. Johnson %J RIACS Technical Report %N 88.22 %D September 1988 %X \fBAbstract:\fP The onboard segment of the Space Station Information System (SSIS), called the Data Management System (DMS), will consist of a Fiber Distributed Data Interface (FDDI) token ring network. We analyze performance of the DMS in scenarios representing two types of network management. In the first scenario we examine how the transmission of routine management messages impacts performance of the DMS. In the second scenario we examine techniques for ensuring low latency of real-time control messages in an emergency situation. (Reports available from: Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffett Field, CA 94035). %A S. Kallel %A D. Haccoun %T Sequential Decoding with ARG and Code Combining: A Robust Hybrid FEC/ARQ System %P 773-781 %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %T The VMP Network Adapter Board (NAB): High-Performance Network Communication for Multiprocessors %A H. Kanakia %A D. Cheriton %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 175-187 %T A Mesh/Token Ring Hybrid-Architecture LAN %A C. Kang %A J. Herzog %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 146-154 %T Optical Interconnection Using ShuffleNet Multihop Networks in Multi-Connected Ring Topologies %A M.J. Karol %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 25-34 %A A.I. Karshmer %A J. Phelan %A J. Thomas %T TVNet: An Image and Data Delivery System Using Cable T.V. Facilities %P 135-152 %J Computer Networks and ISDN Systems %I Elsevier Science Publishers B.V. (North-Holland) %C Amsterdam, The Netherlands %V 15 %N 2 %A J.L. Katz %A B.D. Metcalf %T SURVNET: A Survivable Network Implementation %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 950-958 %A M. Kavehrad %A I.M.I. Habbab %P 944-949 %T A Simple High-Speed Optical Local Area Network Based on Flooding %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %A J. Kikuts %A A. Lombardo %A S. Palazzo %T A Testing Methodology to Assess Conformance for OSI Application Protocol Entities %P 397-403 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A S.E. Kille %T The THORN Large Scale Pilot Exercise %J Computer Science Dept. Research Notes %I Computer Science Dept., University College London %N RN/88/18 %X \fBAbstract:\fP THORN is an Esprit project working on the implementation and study of OSI Directory Services. This paper gives a brief overview of the THORN Large Scale Pilot Exercise, which is an experiment to provide real usage of Directory Service in the Research Community. The preliminary results of this experiment are described, and the implications for RARE are assessed. (Available from department secretary). %A S.E. Kille %T Topology and Routing for MHS %J Computer Science Dept. Research Notes %I Computer Science Dept., University College London %N RN/88/23 %X \fBAbstract:\fP This document is COSINE Study 7.7. It considers the problems of routing and topology in Message Handling Systems. An overview of the problem is given, and a study of some existing systems are made. Then a wide consideration of issues is made, and a number of recommendations developed as to the nature of the Cosine MHS Topology. A text based format for exchange of information is proposed. (Available from department secretary). %A Y.K. Kim %T Asynchronous DS-CDMA System for VSAT Satellite Communication networks %P 140-144 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %T Distributed Election in Computer Networks %A C.-T. King %A T.B. Gendreau %A L.M. Ni %P 348-352 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A E. Knapp %T Deadlock Detection in Distributed Databases %P 303-328 %J ACM Computing Surveys %D December 1987 %V 19 %N 4 %X \fBAbstract:\fP The problem of deadlock detection in distributed systems has undergone extensive study. An important application relates to distributed database schemes. A uniform model in which published algorithms can be cast is given, and the fundamental principles on which distributed deadlock detection schemes are based in presented. These principles represent mechanisms for developing distributed algorithms in general and deadlock detection schemes in particular. In addition, a hierarchy of deadlock models is presented; each model is characterized by the restrictions that are imposed upon the form resource requests can assume. The hierarchy includes the well-known models of resource and communication deadlock. Algorithms are classified according to both the underlying principles and the generality of resource requests they permit. A number of algorithms are discussed in detail, and their complexity in terms of the number of messages employed is compared. The point is made that correctness proofs for such algorithms using operational arguments are cumbersome and error prone, and therefore, that only completely formal proofs are sufficient for demonstrating correctness. %A I. Koren %A Z. Koren %T On the Bandwidth of a Multistage Network in the Presence of Faulty Components %P 26-32 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Multi-processing systems consisting of a large number of components (e.g., processors, memory modules and interconnection sitches) are now being designed and implemented. Improvements in technology have reduced the failure rates of all system components. However, the large increase in the number of components per system has more than offset the increase in reliability of a single component. Therefore, we must expect some of the hundreds (or even thousands) of system components to become faulty while the system is in operation. .sp 0.5 In many cases, the continued operation of a system in the presence of faulty components, even with some degradation in performance, is desirable. The decision whether to support such graceful degradation should depend on the estimated reduction in system performance. In this paper we analyze the performance of multi-processor systems with a multi-stage interconnection network in the presence of faulty components. We present two models, providing lower and upper estimates for the bandwidth of these systems. We then compare the expected degradation in the performance of the multi-processor in the presence of faulty components for these two models through some numerical examples. %A P. Krueger %A M. Livny %T A Comparison of Preemptive and Non-Preemptive Load Distributing %P 123-131 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Numerous load distributing algorithms have been proposed over the past several years, with widely varying characteristics. While some of these algorithms rely solely on non-preemptive process placement, others make use of preemptive process migration. Because the state of a process becomes considerably more complex after it begins execution, the mechanism necessary for migration is correspondingly more complex than that for placement, and may incur significantly greater resource overhead. In light of this complexity, as well as the consequent implementation expense, we consider whether the addition of a migration facility to a distributed scheduler already capable of placement can significantly improve performance. We examine performance over a broad range of workload characteristics and file system structures. We find that, while placement alone is capable of large improvement in performance, the addition of migration can achieve considerable additional improvement. %A K. Kurosawa %A Y. Kuwabara %A T. Shigeno %T A Validation Method for Communication Protocols Using Context-Free Language Theory %J Systems and Computers in Japan %I Scripta Technica, Inc. %D April 1988 %V 19 %N 4 %X \fBAbstract:\fP Usually, communication protocols are modeled as a communication between two finite-state machines. Yu and Gouda [1] have shown that if the messages of a single type and the finite state machine have no mixed nodes, the verification of deadlock can be made in a polynomial time. This paper shows that if the messages are of a single type, the verification of deadlock can be made in a polynomial time, even if there does exist mixed nodes. The proof is derived by indicating that the communication sequences arriving at deadlock states form a context-free language. If there does not a exist a deadlock in the protocol obtained by converting all the messages into a single type, no deadlock exists in the original protocol (the converse is not always true). In this sense, the result in this paper is important. %A M. Lambert %T PCMAIL: A Distributed Mail System for Personal Computers; RFC1056 %J Internet Request for Comments %N 1056 %D June 1988 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC is a discussion of the Pcmail workstation based distributed mail system. It is identical to the discussion in RFC-993, save that a new, much simpler mail transport protocol is described. The new transport protocol is the result of continued research into ease of protocol implementation and use issues. %A T. LaQuey %T User's Directory of Computer Networks Accessible to the Texas Higher Education Network Member Institutions (2nd Edition) %D July 1988 %I The University of Texas System, Office of Telecommunications Services %X \fBAbstract:\fP This directory contains general, host, domain, and contact information, maps, an electronic mail tutorial and an organization index for networks such as ARPANET/MILNET, BITNET, SPAN, CSNET, ESnet, HEPnet, MFENET, NSFNET, SPAN, THEnet, USENET/UUCP and Internet Domains. In addition to the hard copy version, there is an on-line version available via anonymous ftp to emx.utexas.edu. The printed version of the directory differs from the ftp version primarily in the inclusion of maps and fancier formatting of the tables and host information. The printed version can be ordered for $15 from: The University of Texas System, Office of Telecommunications Services, Balcones Research Center, 10100 Burnett Rd, Austin TX 78758-4497 %T HUBNET Performance Measurements %A E.S. Lee %A P.I.P. Boulton %A B.W. Thomson %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %A S.-Q. Li %A M. El Zarki %T Dynamic Bandwidth Allocation on a Slotted Ring with Integrated Service %P 826-833 %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %A Y.N. Lien %T A New Node-Join-Tree Distributed Algorithm for Minimum Weight Spanning Trees %P 334-340 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP This paper develops a new distributed algorithm that uses Node-join-tree approach for the minimum spanning tree problem in a communication network. The algorithm needs at most (2\fIe\fP\ +\ \fIn\fP(\fIn\fP-1)/4) messages in \fIO\fP(\fIn\fP\u2\d) time on a general random graph. In the best case, it needs only 2\fIe\fP messages in \fIO\fP(log\ \fIn\fP) time. The parameters \fIe\fP and \fIn\fP are the number of edges and the number of nodes. Most existing algorithms use a Tree-join-tree approach and require at least (2\fIe\fP\ +\ 2\ \fIn\fP\ log\ \fIn\fP) messages and at most (2\fIe\fP\ +\ 5\ \fIn\fP\ log \fIn\fP) messages. Although the worst case performance of proposed algorithm is not better than Tree-join-tree algorithms under some extreme cases, it provides better performance in most cases as shown in our simulation study. The proposed algorithm is initialized from a single node such that there is no need to wake up all nodes at the beginning. Further, the algorithm is less complicated than other algorithms such that a reliable implementation is easier to achieve. Our results can be used to improve the algorithms for many other problems in distributed computing, such as Leader-election, node-counting, Deadlock-resolution, and Message-broadcasting. %A M.J. Litzkow %A M. Livny %A M.W. Mutka %T Condor \(em A Hunter of Idle Workstations %P 104-111 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP This paper presents the design, implementation, and performance of the Condor scheduling system. Condor operates in a workstation environment. The system aims to maximize the utilization of workstations with as little interference as possible between the jobs it schedules and the activities of the people who own workstations. It identifies idle workstations and schedules background jobs on them. When the owner of a workstation resumes activity at a station, Condor checkpoints the remote job running on the station and transfers it to another workstation. The system guarantees that the job will eventually complete, and that very little, if any, work will be performed more than once. The system hasbeen operational for more than five months. In this paper we present a performance profile of the system based on data that was accumulated from 23 stations during one month. During the one-month period, nearly 1000 jobs were scheduled by Condor. The system was used by heavy users and light users who consumed approximately 200 CPU days. An analysis of the response times observed by the different users is a clear display of the ability of Condor to protect the rights of light users against heavy users who try to monopolize all free capacity. Since a user of Condor has to devote some local capacity to support the remote execution of his/her jobs, the effectiveness of the remote scheduling system depends on the amount of this capacity. We show that this overhead is very small. On the average, a user has to sacrifice less than one minute of local CPU capacity to acquire a day of remote CPU capacity. Condor has proven to be an extremely effective means to improve the productivity of our computing environment. %A W.F. Lo %A P.L. Camwell %T Slotted Aloha Performance in a Rician Fading Environment %P 152-156 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A K.P. Lohr %A J. Muller %A L. Netwig %T DAPHNE: Support for Distributed Applications Programming in Heterogeneous Computer Networks %P 63-73 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP DAPHNE is a system of tools and run-time support routines that allow programs to be broken into parts for distributed execution on different nodes of a heterogeneous computer network. This approach to distributed programming is both simple and general. It serves as a natural basis for classical network services such as remote file access or remote login while at the same time allowing arbitrary distributed applications to be written in a standard programming language. The pivot of DAPHNE is a remote procedure call mechanism that is specifically adapted to a heterogeneous environment, notably heterogeneous systems software. The current language context of DAPHNE is Modula-2. Prototype software exists for a local area network including Unix and MS-DOS systems. %A L. Mackert %A R. Meyer %A U. Scheere %A J. Schneider %A R.J. Velthuys %A J. Burmeister %A J. de Meer %A L. Schroer %T A Generalized Conformance Test Tool for Communications Protocols %P 180-188 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Testing the conformance of protocol implementations to standards is a key requirement for realizing open systems communication. After discussing the major objectives, the design of a generalized conformance test tool is presented. It permits testing of different protocols, can be tailored to different test configurations, and is portable to different environments. Both interactive and automatic modes of testing are supported. The integration of three different test description languages, TTCN, LOTOS, and CRS is discussed. %A B. Maglaris %A S. Anastassiou %A P. Sen %A G. Karlsson %A J.D. Robbins %T Performance Models of Statistical Multiplexing in Packet Video Communications %P 834-844 %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %T Dynamic Resource Allocation in a Metropolitan Area Network %A K. Maly %A C. Overstreet %A X. Qui %A D. Tang %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 12-24 %T File Transfer in High-Speed Token Ring Networks: Performance Evaluation by Approximate Analysis and Simulation %A P. Martini %A O. Spaniol %A T. Welzel %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 987-996 %A K. Marzullo %A F. Schmuck %T Supplying High Availability with a Standard Network File System %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %P 447-455 %D June 1988 %X \fBAbstract:\fP This paper describes the design of the network file service that is tolerant to fail-stop failures and can be run on top of a standard network file service. The fault-tolerance is completely transparent, so the resulting file system supports the same set of heterogeneous workstations and applications as the chosen standard. To demonstrate that our design can provide the benefit of highly available files at a reasonable cost to the user, we implemented a prototype based on the Sun NFS protocol. Our approach is not limited to being used with NFS, however. And, the methodology used should apply to any network file service built along the client-server model. %A J. L. Massey %T An Introduction to Contemporary Cryptology %J Proc. IEEE %V 76 %N 5 %D May 1988 %P 533-549 %X \fBAbstract:\fP An appraisal is given of the current status, both technical and nontechnical, of cryptologic research. The principal concepts of both secret-key and public-key cryptology are described. Shannon's theory of secrecy and Simmon's theory of authenticity are reviewed for the insight they give into practical cryptographic systems. Public-key concepts are illustrated through consideration of the Diffie-Hellman public-key-distribution system and the Rivest-Shamir-Adelman public-key cryptosystem. The subtleties of cryptographic protocols are shown through consideration of some specific such protocols. %A M.K. Mehmet\0Ali %A C.M. Woodside %A J.F. Hayes %T Re-assembly Buffer Requirements in a Packet Voice Network %P 109-120 %J Computer Networks and ISDN Systems %I Elsevier Science Publishers B.V. (North-Holland) %C Amsterdam, The Netherlands %V 15 %N 2 %A S.F. Midkiff %T Link Allocation in Point-to-Point Multicomputer Networks %P 353-356 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A B.P. Miller %A J.D. Choi %T Breakpoints and Halting in Distributed Programs %P 316-325 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Interactive debugging requires that the programmer be able to halt a program at interesting points in its execution. This paper presents a definition of distributed breakpoints with an algorithm for implementing the detection of these breakpoints, and presents an algorithm for halting a distributed program in a consistent state. The definition of distributed breakpoints is based on those events that can be detected in a distributed system. Events that can be partially ordered are detectable and form the basis for the breakpoint predicates, and from the breakpoint definition comes the description of an algorithm that can be used in a distributed debugger to detect these breakpoints. The Halting Algorithm extends Chandy and Lamport's algorithm for recording global state and solves the problem of processes that are not fully connected or frequently communicating. %A D. Mills %T Network Time Protocol (Version 1): Specification and Implementation; RFC1059 %J Internet Request for Comments %N 1059 %D July 1988 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo 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 logical 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. .sp 0.5 The NTP architectures, algorithms and protocols which have evolved over several years of implementation and refinement are described in this document. The prototype system, which has been in regular operation in the Internet for the last two years, is described in an Appendix 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 nets. This is a Draft Standard for an Elective protocol. %T The Fuzzball %A D.L. Mills %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 115-122 %A S. Mirchandani %T Metropolitan Area Networks %I Data Communications Strategy Dept., Pacific Bell %J Pacific Bell Internal Report %X \fBAbstract:\fP This report examines various metropolitan area networking (MAN) technologies and evaluates them as a serving vehicle for the Pacific Bell internal data network. It also identifies potential applications including bulk data transfer, LAN interconnect and interconnection of high speed graphic workstations that can be best served by a MAN. Finally, a migration strategy for evolving to MANs has been identified. This report concludes with recommendations for Pacific Bell as they relate to internal and external uses. %A P. Mockapetris %A K.J. Dunlap %T Development of the Domain Name System %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 123-133 %A J.C. Mogul %T The Experimental Literature of the Internet: An Annotated Bibliography %J WRL Research Reports %I Digital Equipment Corporation, Western Research Laboratory %D August 1988 %N 88/3 %X \fBAbstract:\fP The DARPA Internet is the most successful experiment in heterogeneous internetworking. It connects computer systems from almost every major vendor, using a wide variety of wide-area and local-area network technology, and is in continual use by thousands of people. This annotated biliography covers the literature of the Internet as an experiment: publications which convey the experience acquired by the experimenters. (\fBEditors Note:\fP A revised version of this report will be published in the next \fICCR\fP). %A J.C. Mogul %A C.A. Kent %A C. Partridge %A K. McCloghrie %T IP MTU Discovery Options; RFC1063 %J Internet Request for Comments %N 1063 %D July 1988 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP A pair of IP options that can be used to learn the minimum MTU of a path through an internet is described, along with its possible uses. This is a proposal for an Experimental protocol. %A J.H. Moore %T Protocol Failures in Cryptosystems %J Proc. IEEE %V 76 %N 5 %D May 1988 %P 594-602 %X \fBAbstract:\fP When a cryptoalgorithm is used to solve data security or authentication problems, it is implemented within the context of a protocol which specifies the appropriate procedures for data handling. The purpose of this protocol is to insure that when the cryptosystem is applied, the level of security or authentication required by the system is actually attained. In this paper, we survey a collection of protocols in which this goal has not been met, not because of a failure of the cryptoalgorithm used, but rather because of shortcomings in the design of the protocol. Guidelines for the development of sound protocols will also be extracted from the analysis of these failures. %A S.P. Morgan %T Window Flow Control on a Trunked Byte-Stream Virtual Circuit %P 816-825 %A M. Shafi %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %A M. Murata %A H. Takagi %T Two-Layer Modeling for Local Area Networks %J IEEE Trans. on Communications %v 36 %N 9 %D September 1988 %T Service Specification and Protocol Construction for the Transport Layer %A S.L. Murphy %A A.U. Shankar %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 88-97 %A W. Najjar %A J.L. Gaudiot %T Network Disconnection in Distributed Systems %P 554-568 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP The failure of a node in a multicomputer system will not only reduce the system's computational power but also alter the network's topology. Successive failures might (can) eventually lead to a situation of disconnected graph topology. Network fault-tolerance, is a measure of the number of failures the network can sustain before a disconnection occurs. Traditionally, it has been evaluated as the network's node connectivity. In this paper, we propose a probabilistic measure of network fault-tolerance expressed as the probability of occurrence of a disconnection. We derive a simple analytical approximation to the disconnection probability that is verified using a Monte-Carlo simulation. Finally, an analysis of the effects of the disconnection probability on the overall system's reliability is presented using the proposed measure of Network Resilience. %A R.E. Nance %A R.L. Moose, Jr %T Link Capacity Assignment in Dynamic Hierarchical Networks %J Computer Networks and ISDN Systems %V 15 %N 3 %P 189-202 %A S. Narasimhan %A H. Pirkul %A P. De %T Route Selection in Backbone Data Communications Networks %P 121-135 %J Computer Networks and ISDN Systems %I Elsevier Science Publishers B.V. (North-Holland) %C Amsterdam, The Netherlands %V 15 %N 2 %A G. Narter %A K. Geihs %T An Accounting Service for Heterogenous Distributed Environments %P 207-214 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP The design and implementation of accounting services for heterogeneous distributed systems raise a number of research questions. We have integrated accounting functions and an Account Server into the Distributed Academic Computing Network Operating System (DACNOS), which is an NOS built on top of a heterogeneous collection of networked computers. Our accounting is supported by NOS-Kernel mechanisms that can be tailored to the needs of the heterogeneous servers. Accounting data is collected and stored by an Account Server in the NOS who manages balances and the resource consumption data of clients. Depending on privileges accounting data is accessible to clients, servers and an Account Server Administrator who may use this information for various resource and request management purposes. %T Reliable Group Communication in Distributed Systems %A S. Navaratnum %A S. Chanson %A G. Neufeld %P 439-446 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP The design and implementation of a reliable group communication mechanism is presented. The mechanism guarantees a form of atomicity in that messages are received by all operational members of the group or by none of them. In addition, the order of messages is the same at each of the recipients. The message ordering property can be used to simplify distributed database and distributed processing algorithms. The proposed mechanism can survive despite process, host and communication failures. Survivability is essential in fault-tolerant applications. %A E. Nussbaum %T Communication Network Needs and Technologies \(em A Place for Photonic Switching? %J IEEE Jour. on Selected Areas in Communications %V 6 %N 7 %D August 1988 %DP 1036-1043 %A A. Orda %A R. Rom %T Routing with Packet Duplication and Elimination in Computer Networks %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %A A. Paepcke %A R.D. Crawford %A R. Jamp %A C.A. Freeman %A F.J. Lee %J Computer Networks and ISDN Systems %V 15 %N 3 %P 203-216 %A D.K. Panda %A T. Viswanathan %T A Parallel-serial Binary Arbitration Scheme for Collision-free Multi-access Techniques %J Computer Networks and ISDN Systems %V 15 %N 3 %P 217-224 %A G.P. Parr %T Enhanced Address Resolution in a Multi-LAN Ethernet Communications System %T A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network %J The Computer Journal %I The British Computer Society %V 31 %N 4 %D August 1988 %P 296-303 %X \fBAbstract:\fP Executing a protocol P, a sending host S decides, through P's routing mechanism, that it wants to transmit to a target Host T located somewhere on a connected piece of 10 Mbit Ethernet cable which conforms to the IEEE 802.3. To actually transmit the Ethernet packet a 48-bit Ethernet/hardware address must be generated. The addresses assigned to hosts within protocol P are not always compatible with the corresponding Ethrent address (being different address space byte orderings or values). A protocol is presented which allows dynamic distribution of the information required to build tables that translate a host's address in protocol P's address space into a 48 bit Ethernet address. An extension is incorporated to allow such a protocol to be flexible enough to exist in a Transparent Bridge, or generic Host. The capability of the Bridge to detect host reboot conditions in a multi-LAN environment is also discussed, emphasizing particularly the effect on channel bandwidth. To illustrate the operation of the protocol mechanisms, the ARPA Internet Protocol (IP) is used as a benchmark. An introduction to Address Resolution is presented, followed by a discussion of a reboot detection process. %T Performance Models for Noahnet %A G.M. Parulkar %A A.S. Sethi %A D.J. Farber %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 262-273 %A D. Peacock %A M. Giuffrida %T Big Brother: A Network Services Expert %J Proc. 1988 Summer USENIX Conf. %I USENIX Assoc. %C San Francisco, CA %D June 20-24, 1988 %P 393-398 %X \fBAbstract:\fP At the University of Michigan, the monitoring of network services in a large heterogeneous network is becoming an automated process with the advent of ``Big Brother.'' The system can identify a network failure and take a specified set of actions to correct it. %T Pitfalls of a Certain Class of Distributed Routing Algorithms %A R. Perlman %A G. Varghese %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 43-54 %A L. Press %T Benchmarks for LAN Performance Evaluation %J Communications of the ACM %N 8 %V 31 %D August 1988 %P 1014-1017 %X \fBAbstract:\fP A technique for quickly benchmarking the performance of local area networks (LANs) is presented. Programs which model both intermittent and constant network activity are given. %T An Explicit Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer %A K.K. Ramakrishnan %A R. Jain %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 303-313 %A S. Ramakrishnan %A B. Jain %T An Unbounded Protocol for Point to Multipoint Communication %P 391-396 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A C.H. Reilly %T A Satellite System Synthesis Model for Orbital Arc Allotment Optimization %P 845-849 %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %A R. Reinsch %T Distributed Database for SAA %J IBM Systems Jour. %V 27 %N 3 %P 362-369 %X \fBAbstract:\fP This paper describes, in general terms, distributed database and its relationship to the Systems Application Architecture (SAA). It shows the importance to effective distribution of IBM's Structured Query Language (SQL), the database element of the Systems Application Architecture Common Programming Interface (SAA CPI). The paper defines five levels of distribution, showing how each fits real-world application requirements. Finally, it outlines the magnitude of the task. %A S. Romano %A M. Stahl %A M. Recker %T Internet Numbers; RFC1062 %J Internet Request for Comments %N 1062 %D July 1988 %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 gateway autonomous system numbers used in the Internet community. %A J. Romkey %T A Nonstandard For Transmission of IP Datagrams Over Serial Lines: SLIP; RFC1055 %J Internet Request for Comments %N 1055 %D June 1988 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP The TCP/IP protocol family runs over a variety of network media: IEEE 802.3 (ethernet) and 802.5 (token ring) LAN's, X.25 lines, satellite links, and serial lines. There are standard encapsulations for IP packets defined for many of these networks, but there is no standard for serial lines. SLIP, Serial Line IP, is a currently a de facto standard, commonly used for point-to-point serial connections running TCP/IP. It is not an Internet standard. %A M. Rose %A K. McCloghrie %T Structure and Identification of Management Information for TCP/IP-based internets %J Internet Request for Comments %D August 1988 %N 1065 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC provides the common definitions for the structure and identification of management information for TCP/IP-based internets. In particular, together with its companion memos, which describe the initial management information base along with the initial network management protocol, these documents provide a simple, working architecture and system for managing TCP/IP-based internets and in particular, the Internet. .sp 0.5 This memo specifies a draft standard for the Internet community. TCP/IP implementations in the Internet which are network manageable are expected to adopt and implement this specification. %A M. Rose %A K. McCloghrie %T Management Information Base for Network Management of TCP/IP-based internets %J Internet Request for Comments %D August 1988 %N 1066 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC provides the initial version of the Management Information Base (MIB) for use with network management protocols in TCP/IP-based internets in the short-term. In particular, together with its companion memos which describe the structure of management information along with the initial network management protocol, these documents provide a simple, workable architecture and system for managing TCP/IP-based internets, and in particular, the Internet. .sp 0.5 This memo specifies a draft standard for the Internet community. TCP/IP implementations in the Internet which are network manageable are expected to adopt and implement this specification. %A M.J. Ross %A A.A. Covo %A C.D. Hart, Jr. %T An AI-Based Network Management System %P 458-462 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %A K. Rothermel %T A Communication Mechanism Supporting Actions %P 97-108 %J Computer Networks and ISDN Systems %I Elsevier Science Publishers B.V. (North-Holland) %C Amsterdam, The Netherlands %V 15 %N 2 %A H. Saito %T Analysis of Measured Loss Probability and Grade-of-Service in ISDNs %P 87-96 %J Computer Networks and ISDN Systems %I Elsevier Science Publishers B.V. (North-Holland) %C Amsterdam, The Netherlands %V 15 %N 2 %A D. Sanghi %A M.C.V. Subramaniam %A A. Udaya Shankar %A O. Gudmundsson %A P. Jalote %T Instrumenting A TCP Implementation %J Computer Science Dept. Technical Reports %I University of Maryland %C College Park, Maryland 20742 %N CS-TR-2061/UMIACS-TR-88-50 %X \fBAbstract:\fP We describe an instrumentation of TCP/IP that monitors different aspects of a TCP connection, provides information about its performance, and displays relationships between a variety of variables that reflect the state of the connection. We define interface events for a TCP/IP connection, describe how traces are obtained, how application processes initiate trace collection, and how performance parameters are computed from these traces. Data presentation tools are provided to generate different types of graphs. The instrumentation has been done on a SUN 3/50 running UNIX (SUN OS 3.0 with 4.3BSD networking code). %A D.V. Sarwate %T Computation of Cyclic Redundancy Checks via Table Look-up %J Communications of the ACM %N 8 %V 31 %D August 1988 %P 1008-1013 %X \fBAbstract:\fP Cyclic Redundancy Check (CRC) codes provide a simple yet powerful method of error detection during digital data transmission. Use of a table lookup in computing the CRC bits will efficiently implement these codes in software. %A A.L. Scherr %T SAA distributed processing %J IBM Systems Jour. %V 27 %N 3 %P 370-383 %X \fBAbstract:\fP Discussed are motivations for distributed versus centralized data processing, the relative advantages of each, and the trade-offs involved as they relate to Systems Application Architecture (SAA). Presented is a taxonomy of the various approaches to designing applications to operate in a distributed manner. SAA support for these modes is described. The management of an enterprise-wide network of systems is discussed. %A F.W. Scholl %A M.H. Coden %T Passive Optical Star Systems for Fiber Optic Local Area Networks %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 913-923 %H [Old listing with new review] %A M. Schwartz %T Telecommunications Networks: Protocols, Modeling and Analysis %D 1987 %I Addison-Wesley %C Reading, MA %O \fBReviews:\fP \fIIEEE Network\fP, May 1988; \fIIEEE Computer\fP, August 1988. %A K. Seo %A J. Crowcroft %A P. Spilling %A J. Laws %A J. Leddy %T Distributed Testing and Measurement across the Atlantic Packet Satellite Network (SATNET) %J Proc. ACM SIGCOMM '88 %D August 1988 %P 235-246 %A M.H. Sharifi %A M. Arozullah %T A Multiple Access Technique for Centralized Multiple Satellite Networking with On-Board Processing in the Central Node %P 145-151 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %T Experience with Test Generation for Real Protocols %A D. Sidhu %A T. Leung %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 257-261 %A R.P. Signorile %A J. LaTourrette %A M. Fleisch %T MBRAM - A Priority Protocol for PC Based Local Area Networks %J IEEE Network %V 2 %N 4 %D July 1988 %P 55-59 %A M. E. Smid %A D. K. Branstad %T The Data Encryption Standard: Past and Future %J Proc. IEEE %V 76 %N 5 %D May 1988 %P 550-559 %X \fBAbstract:\fP The Data Encryption Standard (DES) is the first, and to the present date, only, publicly available cryptographic algorithm that has been endorsed by the U.S. Government. This paper deals with the past and future of the DES. It discusses the forces leading to the development of the standard during the early 1970s, the controversy regarding the proposed standard during the mid-1970s, the growing acceptance and use of the standard in the 1980s, and some recent developments that could affect the future of the standard. %A C.J. Smyth %T Nonblocking Photonic Switch Networks %J IEEE Jour. on Selected Areas in Communications %V 6 %N 7 %D August 1988 %P 1052-1062 %A A.K. Somani %A A. Gupta %T Rendezvous Type Protocols without Acknowledged Packets %P 308-315 %J Proc. Seventh Annual Intl. Phoenix Conf. on Computers and Communications %D March 1988 %C Scottsdale, AZ %T Optimizing Bulk Data Transfer Performance: The Packet Train Model %A C. Song %A L.H. Landweber %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 134-145 %A M.W. Strevell %A H.G. Cragon %T High-Speed Transformation of Primitive Data Types in a Heterogeneous Distributed Computer System %P 41-47 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP The performance of heterogeneous distributed computer systems is severely limited by the inability to directly transfer primitive data types between dissimilar processor due to different representations. This paper proposed the use of hardware transformation units to provide high-speed data transfer between heterogeneous processors. The types of transformations needed are categorized. Three alternative locations for the transformation units are presented, and performance models for these alternatives are provided. %T Tree LANs with Collision Avoidance: Protocol, Switch Architecture, and Simulated Performance %A T. Suda %A S. Morris %A T. Nguyen %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 155-164 %Q Sun Microsystems %T RPC: Remote Procedure Call Protocol Specification Version 2; RFC1058 %J Internet Request for Comments %N 1057 %D June 1988 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC describes a standard that Sun Microsystems and others are using, and is one we wish to propose for the Internet's consideration. This memo is not an Internet standard at this time. %A M.M. Theimer %A K.A. Lantz %T Finding Idle Machines in a Workstation-Based Distributed System %P 112-122 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Remote execution facilities allow the user of a workstation-based distributed system to offload programs onto idle workstations, thereby providing the user with access to computational resources far beyond that provided by his personal workstation. In order to make good use of such facilities, one must be able to find suitable candidate hosts for remote execution, typically the least-loaded host with the necessary number of resources to run a given program. In this paper we describe the design and performance of scheduling facilities for finding idle hosts in a workstation-based distributed system. We focus on the tradeoffs between centralized and decentralized architectures with respect to scalability, fault tolerance, and simplicity of design, as well as several implementation issues of interest when using multicast communication. We conclude that the principal tradeoff between the two approaches is that a centralized architecture can be scaled to a significantly greater degree and can more easily monitor global system statistics, while a decentralized architecture is simpler to implement. %A T.D. Todd %A L. Li %T Branch-Switching in Unidirectional Channel Systems Using the IEEE 802.4 Token-Passing Bus Access Method %J Computer Networks and ISDN Systems %V 15 %N 3 %P 177-188 %T A \fIk\fP Shortest Path Algorithm for Adaptive Routing in Communications Networks %A D.M. Topkis %P 855-859 %J IEEE Trans. on Communications %V 36 %N 7 %D July 1988 %A G. Trewitt %T Topological Analysis of Local-Area Internetworks %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 1-12 %T The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks %A P.F. Tsuchiya %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 35-42 %T A Network Management Language for OSI Networks %A U. Warrier %A A. Relan %A O. Berry %A J. Bannister %J Proc. ACM SIGCOMM '88 %C Stanford, CA %D August 1988 %P 98-105 %T Introduction to Systems Application Architecture %A E.F. Wheeler %A A.G. Ganek %J IBM Systems Jour. %V 27 %N 3 %P 250-263 %X \fBAbstract:\fP Systems Application Architecture is a framework in which applications are developed so that they run consistently on major IBM computing systems. This paper presents the motivation and requirements for this framework and describes the main elements of its structure. It also discusses the effect on current processing technologies and on application development. %A J.J. Wolf %A B. Ghosh %T Simulation and Analysis of Very Large Area Networks (VLAN) Using an Information Flow Model %J IEEE Network %V 2 %N 4 %D July 1988 %P 6-18 %A K.S. Yap %A P. Jalote %A S. Tripathi %T Fault Tolerant Remote Procedure Call %P 48-54 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP Remote Procedure Call (RPC) is a desirable primitive for distributed programming. RPC makes building distributed systems easier by providing a high level abstraction and hiding some of the complexities involved. However, if the node on which a remote procedure is executing fails, the caller may be indefinitely suspended. In this paper, we present a scheme that makes an RPC mechanism fault tolerant to hardware failures. Fault tolerance is provided by replicating the procedure at a group of nodes, called a cluster. The copies in a cluster are linearly ordered. A call to a procedure is sent to the first copy in the cluster, and is propogated internally to all other copies. In the event of failures, the first copy in the cluster that has not failed returns the result to the caller. The scheme is transparent to the user and supports nested procedure calls. It has been implemented on a network of Sun Workstations making use of SUN's existing RPC mechanism. %T Performance Analysis of Slotted Ring Protocols in HSLAN's %A M. Zafirovic-Vukotic %A I.G. Niemegeers %A D.S. Valk %J IEEE Jour. on Selected Areas in Communications %D July 1988 %V 6 %N 6 %P 1011-1024 %A W. Zhao %A J.A. Stankovic %A K. Ramamritham %T A Multiaccess Window Protocol for Transmission of Time Constrained Messages %P 384-392 %J Proc. 8th Intl. Conf. on Distributed Computing Systems %C San Jose, Calif. %D June 1988 %X \fBAbstract:\fP In this paper, we propose and study a new window protocol suitable for transmitting time constrained messages in a multi-access network. Our protocol differs from traditional window protocols in that it explicitly takes time constraints into account. In our protocol, the window is formed based on the latest time to send a message (LS). A major advantage of our window protocol is that newly arriving messages are immediately considered for transmission if its LS is less than that of the all pending messages in the system. As a result, our new protocol closely approximates the optimal minimum-laxity-first policy. A performance evaluation through simulation shows that the new window protocol performs well in a wide range of environments, even under overloaded conditions.