leff@CSVAX.SEAS.SMU.EDU (Laurence Leff) (07/22/90)
This is the SIGCOMM bibliography of recent publications in computer
networking which appears in the July 90 issue of Computer Communication
Review. This bibliography is also available on-line in
nnsc.nsf.net:CCR/jul90/jul90.refer
Persons interested in submitting recent tech reports for inclusion
in the bibliography should send the citation and abstract to me
at craig@bbn.com
Craig Partridge
Editor, ACM SIGCOMM Computer Communication Review
[PS: Don't forget to come to SIGCOMM '90 in Philadelphia, 24-27 September]
%K Electronic\0Mail
%A S. Kille
%T Mapping between X.400(1988) / ISO 10021 and RFC 822; RFC-1148
%J Internet Request for Comments
%N 1148
%D March 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC suggests an electronic mail protocol mapping for the Internet
community and UK Academic Community, and requests discussion and
suggestions for improvements. This memo does not specify an Internet
standard. This edition includes material lost in editing.
[\fIEd. Note\fP: Earlier version was RFC-1138]
%K Queueing\0Theory
%A O. J. Boxma
%A H. Daduna
%T Sojourn times in queueing networks
%C Amsterdam
%D 1989
%M f 16,00
%R CWI. Dept. of Operations Research, Statistics, and System Theory ; R 891
%K Queueing\0Theory
%A P. R. de Waal
%A N. M. van Dijk
%T Interconnected networks of queues with randomized arrival and departure
blocking
%C Amsterdam
%D 1989
%M f 12,00
%R CWI. Dept. of Operations Research, Statistics, and System Theory ; R 8934
%K Network\0Management
%A Richard E. Caruso
%T Network Management: A Tutorial Overview
%P 20-25
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A Ashok K. Malik
%T Network Management and Control Systems and Strategic Issues
%P 26-29
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A Ivan Frisch
%T Who Logged Out My Terminal
%P 30
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A Bruce Bassett
%A Frederick P. Heinrich
%A Diana Kuhl
%A Ali Shadman
%T Customer Network Management: A Service Provider's Veiw
%P 31-30
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A Makoto Yoshida
%A Makoto Kobayashi
%A Yaruo Yamaguchi
%T Customer Control of Network Management from the Service Provider's Perspective
%P 35-40
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A William E. Gilbert
%T Managing Networks in a Multi-Vendor Environment
%P 41-60
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A Ian Sugarbroad
%T An OSI-Based Interoperability Architecture for Managing Hybrid Networks
%P 61-69
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A Randal Campbell
%A Bob Howard
%A John Lamb
%A John Stevenson
%A Amy Tennant
%T IBM's Network Management Approach
%P 70-75
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Network\0Management
%A Dixon R. Doll
%T The Future of Customer Control
%P 76-80
%J IEEE Communications
%V 28
%N 3
%D March 1990
%K Cost\0Allocation
%T On Cost Allocation in Computer Networks
%A D. Granot
%A M. Hojati
%J networks - an international journal
%V 20
%N 2
%D March 1990
%P 209-230
%K Network\0Management
%A Teresa Cochran
%A Joseph M. Mellichamp
%T AUTOREC: An Automated Error Recovery System for Network Management
%P 14-18
%J IEEE Network
%D March 1990
%V 4
%N 2
%K High-Speed\0Networks
%A Gurudatta M. Parulkar
%A Jonathan S. Turner
%T Towards a Framework for High-Speed Communication in a Heterogeneous
Networking Environment
%P 19-27
%J IEEE Network
%D March 1990
%V 4
%N 2
%K Miscellaneous
%A William P. Lidinsky
%T Data Communications Needs
%P 28-33
%J IEEE Network
%D March 1990
%V 4
%N 2
%K High-Speed\0Networks
%A David J. Wright
%A Michael To
%T Telecommunications Applications of the 1990s and Their Transport
Requirements
%P 34-40
%J IEEE Network
%D March 1990
%V 4
%N 2
%K High-Speed\0Networks
%A John F. Patterson
%A Carmen Egido
%T Three Keys to the Broadband Future: A View of Applications
%P 41-47
%J IEEE Network
%D March 1990
%V 4
%N 2
%K Distributed\0Systems
%A S. Chandrasekaran
%A S. Venkatesan
%T A Message-Optimal Algorithm for Distributed Termination Detection
%P 245-252
%J Jour. Parallel and Distributed Computing
%D March 1990
%V 8
%N 3
%K Distributed\0Systems
%A Marc Shapiro
%A Yvon Gourhant
%A Sabine Habert
%A Laurence Mosseri
%A Michel Ruffin
%A Celine Valot
%T SOS: An Object-Oriented Operating System - Assessment and Perspectives
%P 287-338
%D Fall 1989
%V 2
%N 4
%K Miscellaneous
%A A. E. Kamal
%A V.C. Hamacher
%T Utilizing Bandwidth Sharing in the Slotted Ring
%P 298-299
%J IEEE Trans. Computers
%V 39
%N 3
%D March 1990
%K Miscellaneous
%A H. Yoon
%A K.Y. Lee
%A M.T. Liu
%T Performance Analysis of Multibuffered Packet-Switching Networks in Multiprocessor Systems
%P 319-327
%J IEEE Trans. Computers
%V 39
%N 3
%D March 1990
%K Distributed\0Systems
%A M. Satyanarayanan
%A E.H. Siegal
%T Parallel Communication in a Large Distributed Environment
%P 328-348
%J IEEE Trans. Computers
%V 39
%N 3
%D March 1990
%K Security
%A Jon A. Rochlis
%A Mark W. Eichin
%T With Microscope and Tweezers: The Worm from MIT's Perspective
%J Communications of the ACM
%D June 1989
%V 32
%N 6
%P 689-698
%O \fIReviews\fP: \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%K Remote\0Procedure\0Calls
%A Larry L. Peterson
%A Nick C. Bucholz
%A Richard D. Schlicting
%T Preserving and Using Context Information in Interprocess Communication
%P 217-246
%J ACM Trans. Computer Systems
%D August 1989
%V 7
%N 3
%O \fIReviews\fP: \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%K Directory\0Services
%A David Cheriton
%A Timothy P. Mann
%T Decentralizing a Global Naming Service for Improved Performance
%J ACM Trans. Computer Systems
%V 7
%N 2
%D May 1989
%P 147-183
%O \fIReviews\fP: \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%K Miscellaneous
%A G. Malkin
%A J. Reynolds
%T F.Y.I on F.Y.I: Introduction to the F.Y.I. Notes
%J Internet Request for Comments
%N 1150
%D March 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo is the first in a new sub-series of RFCs called FYIs (For
Your Information). This memo provides information for the Internet
community. It does not specify any standard.
%K Routing
%A C.G. Cassandras
%A M. Vasmi Abidi
%A D. Towsley
%T Distributed Routing with On-Line Marginal Delay Estimation
%J IEEE Trans. on Communications
%V 38
%N 3
%D March 1990
%P 348-359
%K Routing
%A D.W. Glazer
%A C. Tropper
%T A New Metric for Dynamic Routing Algorithms
%J IEEE Trans. on Communications
%V 38
%N 3
%D March 1990
%P 360-367
%K Flow\0Control
%A S. Fdida
%A H.G. Perros
%A A. Wilk
%T Semaphore Queues: Modeling Multilayered Window Flow Control Mechanisms
%J IEEE Trans. on Communications
%V 38
%N 3
%D March 1990
%P 309-317
%K Multimedia\0Communication
%A H. Nakada
%A K.-I. Sato
%T Variable Rate Speech Encoding for Asynchronous Transfer Mode
%J IEEE Trans. on Communications
%V 38
%N 3
%D March 1990
%P 277-284
%K Miscellaneous
%A J. Reynolds
%A J. Postel
%T Assigned Numbers; RFC 1060
%N 1060
%J Internet Request for Comments
%D March 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo is a status report on the parameters (i.e., numbers and
keywords) used in protocols in the Internet community.
%K Distributed\0Systems
%A Michael D. Schroeder
%A Michael Burrows
%T Performance of Firefly RPC
%P 1-17
%J ACM Trans. Computer Systems
%D February 1990
%V 8
%N 1
%K Authentication
%A Michael Burrows
%A Martin Abadi
%A Roger Needham
%T A Logic of Authentication
%P 18-36
%J ACM Trans. Computer Systems
%D February 1990
%V 8
%N 1
%K Distributed\0Systems
%A Brian N. Bershad
%A Thomas E. Anderson
%A Edward D. Lazowska
%A Henry M. Levy
%T Lightweight Remote Procedure Call
%J ACM Trans. Computer Systems
%P 37-55
%D February 1990
%V 8
%N 1
%K Miscellaneous
%A D. Waitzman
%T A Standard for the Transmission of IP Datagrams on Avian Carriers; RFC-1149
%J Internet Request for Comments
%N 1149
%D 1 April 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo describes an experimental method for the encapsulation of IP
datagrams in avian carriers. This specification is primarily useful
in Metropolitan Area Networks. This is an experimental, not recommended
standard.
%K Protocol\0Verification
%A Nikolay A. Anisimov
%T A Notion of Petri Net Entity for Communication Protocol Design
%I Institute of Automation and Control Processes
%C Vladivostok, USSR
%D 1989
%X \fBAbstract:\fP
The paper discusses a formal model that is intended to support
a modular approach to the design and verification of
concurrent systems. A new notion of entity is introduced which
is defined as Petri net together with a set of labelings,
with each labeling treated as an access point designed for
communication with other entities or for the observation of
the behaviour of an entity itself. Operations on entities,
such as parallel composition, abstraction, encapsulation and
autocomposition, are defined. A notion of equivalence of
entities is introduced based on bisimulation. The equivalence
is shown to be a congruence relation with respect to the operations
introduced. Methods of representing entities by predicate/transition
nets and with the aid of an algebra of regular Petri nets are
discussed. Finally, the application of the above model to some
problems of communication protocols theory is illustrated.
[Copies available from the author at Institute of Automation
and Control Processes; Far East division of the USSR Academy of
Sciences; 5, Radio st.; Vladivostok, 690032; USSR]
%K High-Speed\0Networks
%A William J. Dallas
%T A digital prescription for X-ray overload
%J IEEE Spectrum
%D April 1990
%V 27
%N 4
%X \fBNote:\fP A description of how hospitals might use high speed
computer networks to manage x-ray images.
%K Network\0Management
%A R. Stine
%T FYI on a Network Management Tool Catalog: Tools for
Monitoring and Debugging TCP/IP Internets and Interconnected Devices
%J Internet Request for Comments; RFC-1147
%N 1147
%D April 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
The goal of this FYI memo is to provide practical information to site
administrators and network managers. This catalog contains
descriptions of several tools available to assist network managers in
debugging and maintaining TCP/IP internets and interconnected
communications resources. Entries in the catalog tell what a tool
does, how it works, and how it can be obtained.
.sp 0.25
This memo provides information for the Internet community. It does
not specify any standard. It is not a statement of IAB policy or
recommendations. Comments, critiques, and new or updated tool
descriptions are welcome, and should be sent to Robert Stine, at
stine@sparta.com, or to the NOCTools working group, at
noctools@merit.edu.
%K Transport\0Protocols
%A C. Partridge
%A R. Hinden
%T Version 2 of the Reliable Data Protocol; RFC 1151
%N 1147
%D April 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC suggests several updates to the specification of the Reliable
Data Protocol (RDP) in RFC-908 based on experience with the protocol.
This revised version of the protocol is experimental
%K LANs
%A Benjamin Lewis Barnett, III
%T Evaluation and Implementation of Protocols in the Local Area
Network Testbed Environment
%R TR-89-35
%D November 1989
%I Dept. of Computer Sciences, Univ. Texas at Austin
%P 261
%X \fBAbstract:\fP
This thesis presents the results of the Local Area
Network Testbed experience. The design of the testbed, the
results of several experiments and the results of a formal protocol
analysis are included. Three data link layer protocols
for Carrier Sense Multiple Access with Collision Detection
(CSMA/CD) bus networks were implemented in the testbed. The
performance of these three protocols under several different
artificial workloads is compared. The three protocols were the
commercially available Ethernet, the Enet II protocol proposed
by Molloy, and the Virtual Time CSMA/CD (VTCSMA/CD) protocol
proposed by Molle. The three protocols represent three fundamentally
different approaches to handling collisions among
users of a broadcast channel. Ethernet randomizes retransmission
attempts for the conflicting packets in an attempt to
minimize the likelihood of successive collisions. Enet II uses
a probabilistic algorithm to schedule the retransmissions of
conflicting packets to resolve the collision. VTCSMA/CD uses a
technique which reduces the initial likelihood of collisions.
Enet II is shown to have significantly better variance of delay
than Ethernet. VTCSMA/CD has the best variance of delay of the
three protocols due to the success of its collision avoidance
method.
.sp 0.25
The implementation of Enet II demonstrates that techniques usually
reserved for slotted networks can be beneficially employed
on their unslotted counterparts. To investigate the adaptation
of slotted protocols to unslotted use, a well known slotted
Collision Resolution Protocol (CRP), the Gallager First-Come,
First-Served (FCFS) protocol, is adapted to unslotted operation
and proven to have bounded delay. A second adaptation of the
protocol which responds to collisions differently is shown to
deadlock. Deadlock detection and recovery methods are
presented. A new CRP based on the deadlock recovery method and
using information about the location of colliding stations is
proposed.
%K LANs
%A M.G. Gouda
%A N.F. Maxemchuk
%A U. Mukherji
%A K. Sabnani
%T Delivery and Discrimination: The Seine Protocol
%P 17
%R TR-88-41
%D December 1989
%X \fBAbstract:\fP
We present a family of protocols for data transmission
from multiple identical senders to a single receiver. At
each instant, every sender sends one bit, and the sent bits are
or-ed together into one bit before being received by the
receiver. If a sender has a data message to send, it sends the
message bits one by one; otherwise it sends zero bits.
Clearly, if the sending of two messages by two senders overlap
in time, then the resulting ``collision'' can cause the
receiver to receive a corrupted message, i.e., one that was not
sent by either sender. The function of the protocol is to
allow the receiver to detect and deliver those and only those
messages that are not corrupted by collision. (In other words,
the receiver acts as a discriminating seine that catches and
delivers only uncorrupted messages; hence the title.) The
seine protocol has been implemented in a class of fiber-optic
local area networks.
%K Distributed\0Systems
%A Chuck Koelbel
%A Gene Spafford
%A George Leach
%T Workshop on Experiences with Building Distributed and Multiprocessor Systems
%P 2-6
%J Operating Systems Review
%V 24
%N 2
%D April 1990
%X \fBNote:\fP Also published in the April issue of
\fIComputer Communication Review\fP.
%K Authentication
%A Dan M. Nessett
%T A Critique of the Burrows, Abadi and Needham Logic
%P 35-38
%J Operating Systems Review
%V 24
%N 2
%D April 1990
%K Authentication
%A Michael Burrows
%A Martin Abadi
%A Roger Needham
%T A Rejoinder to Nessett
%P 39-40
%J Operating Systems Review
%V 24
%N 2
%D April 1990
%K Distributed\0Systems
%A Roger Oliver
%T Protection in a Distributed Document Processing System
%P 56-65
%J Operating Systems Review
%V 24
%N 2
%D April 1990
%K Distributed\0Systems
%A Joseph W. Seigh
%T A Distributed Solution to the Reader-Writer Problem
%J Operating Systems Review
%V 24
%N 2
%D April 1990
%K High-Speed\0Networks
%A Craig Partridge
%T Workshop Report: Internet Research Steering Group Workshop on
Very-High-Speed Networks; RFC 1152
%N 1152
%D April 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo is a report on a workshop sponsored by the Internet Research
Steering Group. [\fINote:\fP To appear in October issue of \fICCR\fP].
%K Gateways
%A E.W. Biersack
%T A systematic approach for constructing gateways
%P 79-96
%J Computer Networks and ISDN Systems
%V 18
%N 2
%D 28 February 1990
%K Protocol\0Performance
%A A. Bondavalli
%A M. Conti
%A E. Gregori
%A L. Lenzini
%A L. Strigni
%T MAC protocols for high-speed MANs: Performance comparisons for a family
of Fasnet-based protocols
%P 97-114
%J Computer Networks and ISDN Systems
%V 18
%N 2
%D 28 February 1990
%K Multihoming
%A A. Orda
%A R. Rom
%T Multihoming in computer networks: A topology-design approach
%P 133-142
%J Computer Networks and ISDN Systems
%V 18
%N 2
%D 28 February 1990
%K Miscellaneous
%A A.A.A. Adas
%T Evaluation methodology for wide area networks
%P 115-132
%J Computer Networks and ISDN Systems
%V 18
%N 2
%D 28 February 1990
%K Distributed\0Systems
%A Douglas Comer
%A James Griffioen
%T A New Design for Distributed Systems: The Remote Memory Model
%J Proc. 1990 Summer USENIX Conf.
%C Anaheim
%D June 11-15, 1990
%X \fBAbstract:\fP
This paper describes a new model for constructing distributed systems
called the Remote Memory Model. The remote memory model consists of
several client machines, one or more dedicated machines called remote
memory servers, and a communication channel interconnecting them. In
the remote memory model, client machines share the memory resources
located on the remote memory server. Client machines that exhaust their
local memory move portions of their address space to the remote memory
server and retrieve pieces as needed. Because the remote memory server
uses a machine-independent protocol to communicate with client machines,
the remote memory server can support multiple heterogeneous client
machines simultaneously.
.sp 0.25
This paper describes the remote memory model and discusses the advantages
and issues of systems that use this model. It examines the design of a
highly efficient, reliable, machine-independent protocol used by the
remote memory server to communicate with the client machines. It also
outlines the algorithms and data structures employed by the remote memory
server to efficiently locate the data stored on the server. Finally, it
presents measurements of a prototype implementation that clearly demonstrate
the viability and competitive performance of the remote memory model.
%K Security
%A Bill Cheswick
%T The Design of A Secure Internet Gateway
%J Proc. 1990 Summer USENIX Conf.
%C Anaheim
%D June 11-15, 1990
%X \fBAbstract:\fP
The Internet supports a vast and growing community of computers users
around the world.
Unfortunately, this network can provide anonymous access to this
community by the unscrupulous, careless, or dangerous.
On any given Internet there is a certain percentage of poorly-maintained
systems.
AT&T has a large internal
Internet that we wish to protect from outside attacks, while providing
useful services between the two.
.sp 0.25
This paper describes our Internet gateway. It is an application-level
gateway that passes mail and many of the common Internet services
between our internal machines and the Internet. This is accomplished
without IP connectivity using a pair of machines: a trusted internal
machine and an untrusted external gateway. These are connected by a private
link. The internal machine provides a few carefully-guarded services
to the external gateway. This configuration helps protect the internal
internet even if the external machine is fully compromised.
%K Distributed\0File\0Systems
%A Bruce E. Keith
%T Perspectives on NFS File Service Performance Characterization
%J Proc. 1990 Summer USENIX Conf.
%C Anaheim
%D June 11-15, 1990
%K Distributed\0Systems
%A David F. Bacon
%A Andy Lowry
%T A Portable Run-Time System for the Hermes Distributed Programming Language
%J Proc. 1990 Summer USENIX Conf.
%C Anaheim
%D June 11-15, 1990
%K Distributed\0File\0Systems
%A Alex Siegal
%A Kenneth Birman
%A Keith Marzullo
%T Deceit: A Flexible Distributed File System
%J Proc. 1990 Summer USENIX Conf.
%C Anaheim
%D June 11-15, 1990
%X \fBAbstract:\fP
Deceit, a distributed file system being developed at Cornell, provides
flexible file semantics to control efficiency, scalability, and the
desired reliability. The user is able to set parameters on a file to
achieve different levels of availability, performance, and file
location transparency. File replication, file migration, and a
sophisticated update control protocol is supported. Deceit also
supports a file version control mechanism. Deceit can behave like a
plain Sun Network File System server and can be used by any NFS client
without modifying any client software. Deceit servers are
interchangeable and collectively provide the illusion of a single,
highly available, and large server machine to its clients.
Non-volatile replicas of each file are stored on a subset of the file
servers. Servers may be grouped into independent subsets, or cells,
for security and efficiency. The Deceit prototype uses the ISIS
Distributed Programming Environment for all communication and process
group management - an approach that reduces system complexity and
increases system robustness. Common faults such as lost messages,
crashes, and partitions are tolerated.
%K Distributed\0File\0Systems
%A Richard G. Guy
%A John S. Heidemann
%A Wai Mak
%A Thomas W. Page, Jr.
%A Gerald J. Popek
%A Dieter Rothmeier
%T Implementation of the Ficus Replicated File System
%J Proc. 1990 Summer USENIX Conf.
%C Anaheim
%D June 11-15, 1990
%X \fBAbstract:\fP
As we approach nation-wide integration of computer systems, it is
clear that file replication will play a key role, both to improve
data availability in the face of failures, and to
improve performance by locating data near where it will be used.
We expect that future file systems will have an extensible, modular
structure in which features such as replication can be ``slipped in'' as a
transparent layer in a stackable layered architecture.
We introduce the Ficus replicated file system for NFS and show how
it is layered on top of existing file systems.
.sp 0.25
The Ficus file system
differs from previous file replication services in that it permits
update during network partition if any copy of a file is accessible.
File and directory updates are automatically propagated to accessible
replicas.
Conflicting updates to directories are detected
and automatically repaired;
conflicting updates to ordinary files are
detected and reported to the owner.
The frequency of communications outages rendering inaccessible some
replicas in a large scale network and the relative
rarity of conflicting updates make this optimistic scheme attractive.
.sp 0.25
Stackable layers facilitate the addition of new features
to an existing file system without reimplementing existing functions.
This is done
in a manner analogous to object-oriented programming with inheritance.
By structuring the file system as a stack of modules, each
with the same interface, modules which augment existing services can be added
transparently.
This paper describes the implementation of the Ficus file system using
the layered architecture.
%K Operating\0Systems
%A John K. Ousterhout
%T Why Aren't Operating Systems Getting Faster As Fast as Hardware?
%J Proc. 1990 Summer USENIX Conf.
%C Anaheim
%D June 11-15, 1990
%X \fBAbstract:\fP
This paper evaluates several hardware platforms and operating
systems using a set of benchmarks that stress kernel entry/exit,
file systems, and other things related to operating systems. The
overall conclusion is that operating
system performance is not improving at the
same rate as the base speed of the underlying hardware.
The most obvious ways to remedy this situation are to improve
memory bandwidth and reduce operating systems' tendency to
wait for disk operations to complete.
%K Electronic\0Mail
%A F. Wancho
%T Digest Message Format; RFC-1153
%J Internet Request for Comments
%N 1153
%D April 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo describes the de facto standard Digest Message Format. This
is an elective experimental protocol.
%K Electronic\0Mail
%A D. Robinson
%A R. Ullman
%T Encoding header Field for Internet Messages; RFC-1154
%J Internet Request for Comments
%N 1154
%D April 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC proposes an elective experimental Encoding header field to
permit the mailing of multi-part, multi-structured messages.
.sp 0.25
The use of Encoding updates RFC 1049 (Content-Type), and is a
suggested update to RFCs 1113, 1114, and 1115 (Privacy Enhancement).
%K Distributed\0Systems
%A V.K. Garg
%A J. Ghosh
%T Symmetry in spite of hierarchy
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A Mohan Ahuja
%A Ajay D. Kshemkalyani
%A Timothy Carlson
%T A basic unit of computation in distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
A ground state in a distributed system is a global state in which there are no
messages in transit.
In this paper, we define basic units of computation in distributed systems, whet
her communicating synchronously or asynchronously, as comprising of indivisible
logical units of computation that take the system from one ground state to
another.
We analyze their properties.
This definition helps in understanding the nature of the communication pattern
in a computation and how the communication pattern is related to the concurrency
in the system.
The basic unit of computation is potentially
useful in checkpointing, distributed
debugging and asserting about attainment of stable properties.
%K Distributed\0Systems
%A R. Bubenik
%A W. Zwaenepol
%T Semantics of optimistic computation
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
We address the issue of deriving a semantically equivalent optimistic
computation from a pessimistic computation by application-independent
transformations. Computations are modeled by program dependence graphs
(pdgs). The semantics of a computation is defined by a mapping from an
initial state to a final state, and is realized by a graph rewriting
system. Semantics-preserving transformations are applied to the pdgs
of the pessimistic computation to produce an optimistic version. The
transformations result from guessing data values and control flow
decisions in the computation.
.sp 0.25
We use our transformations to derive an optimistic version of fault
tolerance based on message logging and checkpointing. The
transformations yield an optimistic version similar to optimistic fault
tolerance algorithms reported in the literature, although additional
application-dependent transformations are necessary to produce a
realistic optimistic implementation.
%K Distributed\0Memory
%A S. Zhou
%A M. Stumm
%A T. McInerney
%T Extending distributed shared memory to heterogeneous environments
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Memory
%A V.O. Tam
%A M. Hsu
%T Fast recovery in distributed shared virtual memory systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
Distributed shared virtual memory (DSVM) is an abstraction which
integrates the local memory of different machines in a local
area network environment into a single logical entity.
In this paper,
we study the problem of system failure and recovery of DSVM.
Most DSVM systems use the notion of tokens to
indicate a site's access rights on the data pages it caches,
and a locating scheme to get to
the most up-to-date version of a data page.
Our problem is to recover this token
directory after a site has failed.
Our solution is to treat the token directory
at each site as a fragment of a global token database
and the page migration activities as token transactions
that update this distributed database.
By the use of the unilateral commit protocol (UCP) for token transactions,
fast recovery of the token state at minimal
run time overhead of token transactions execution can be achieved.
%K Distributed\0Memory
%A S.E. Lucco
%A D.P. Anderson
%T Tarmac: A Language system substrate based on mobile memory
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A David P. Anderson
%A Shin-Yuan Tzou
%A Robert Wahbe
%A Ramesh Govindan
%A Martin Andrews
%T Support for Continuous Media in the DASH system
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
Future distributed systems will support
\fIcontinuous media\fP
such as digital audio and video, allowing user programs
to convert, process, store, and communicate continuous-media data.
The DASH project is building an experimental kernel for such a system.
We have defined the
\fIDASH resource model\fP
as a basis for reserving and scheduling resources
(disk, CPU, network, etc.) involved in end-to-end handling
of continuous media data.
The model uses primitives that express workload characteristics
and performance requirements, and defines an algorithm for
negotiated reservation of distributed resources.
This algorithm is embodied in the Session Reservation Protocol (SRP),
defined in the DoD Internet protocol family.
%K Distributed\0Real-Time\0Systems
%A C.W. Mercer
%A Y. Ishikawa
%A H. Tokuda
%T Distributed Hartstone: a distributed real-time benchmark suite
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
In our definition of the Distributed Hartstone (DHS) benchmark, we
extend the Hartstone real-time benchmark [Weiderman89] to the
distributed environment where communication and end-to-end scheduling
become important. Traditional performance metrics for real-time
systems do not tell the whole story, so we need a benchmark to gauge
the performance for different areas of the operating system.
Furthermore, we give a detailed description of the motivation and
formulation of the benchmark to enable practitioners to implement the
benchmark on a wide variety of systems. The benchmark is defined to
be easily implemented on any system with basic real-time capability
such as prioritized, preemptive scheduling and a real-time clock.
Also, the tests are open-ended to allow comparisons on a wide variety
of hardware.
.sp 0.25
The benchmark has been implemented on the ARTS Kernel
[Tokuda89a], a distributed real-time testbed we have developed in
the ART Project at Carnegie Mellon University. We give the benchmark
results from the ARTS Kernel for different types of processor and
communication scheduling algorithms. These results verify the
usefulness of the benchmark suite in distinguishing between
performance characteristics of these algorithm.
%K Protocol\0Analysis
%A G. Singh
%A A.J. Bernstein
%T On the relative execution times of distributed protocols
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Protocol\0Analysis
%A T. Bolognesi
%T A graphical composition theorem for networks of Lotos processes
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Real-Time\0Systems
%A Sang H. Son
%A Chun-Hyon Chang
%T Performance evaluation of real-time locking protocols using a distributed
software prototyping environment
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
Real-time systems must maintain data consistency while minimizing
the number of tasks that miss the deadline.
To satisfy both the consistency and real-time constraints, there is the
need to integrate synchronization protocols with real-time priority scheduling
protocols.
In this paper, we address the problem of priority scheduling in real-time
database systems. We first present a prototyping environment for
investigating distributed software.
Specific priority-based real-time locking protocols are then discussed,
together with a performance study which illustrates
the use of the prototyping environment for evaluation of synchronization
protocols for real-time database systems.
%K Distributed\0Systems
%A J. Fowler
%A W. Zwaenepoel
%T Causal distributed breakpoints
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
A causal distributed breakpoint is initiated by
a sequential breakpoint in one process of a
distributed computation, and restores each process
in the computation to its earliest state that reflects
all events that ``happened before'' the breakpoint.
A causal distributed breakpoint is the natural extension for
distributed programs of
the conventional notion of a breakpoint in a sequential program.
We present an algorithm for finding the causal distributed breakpoint
given a sequential breakpoint in one of the processes.
Approximately consistent
checkpoint sets are used for efficiently
restoring each process to its state in a causal distributed breakpoint.
.sp 0.25
Causal distributed breakpoints assume
deterministic processes that communicate solely by messages.
The dependencies that arise from communication
between processes are logged.
Dependency logging and approximately consistent checkpoint sets
have been implemented on a network of SUN workstations running
the V-System.
Overhead on the message passing primitives varies between
between 1 and 14 percent for dependency logging.
Execution time overhead for a 200 * 200 Gaussian elimination
is less than 4 percent, and generates a dependency
log of 288 kilobytes.
%K Distributed\0Systems
%A Paul C. Attie
%A Ira R. Forman
%A Eliezer Levy
%T On fairness as an abstraction for the design of distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
A fairness property called U-fairness is studied in the context of the
design of distributed systems with multiparty interactions. This is
done with an overlapping model of concurrency. A distributed
algorithm implementing this fairness notion is presented. U-fairness is
shown to be more appropriate to the design of distributed systems
because it provides an abstraction for stable property detection while
other known fairness notions do not.
%K Distributed\0Systems
%A O.C. Kowalski
%A H. Hartig
%T Protection in the Birlix operating system
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A S.C. Shyu
%A V.O.K. Li
%A C.P. Wang
%T An abortion-free distributed-deadlock detection/resolution algorithm
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A S. Lujun
%A F. Changpeng
%A S. Zhongxiu
%T Towards a combinative distributed operating system in Cluster 86
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Security
%A Shyh-Wei Luan
%A Virgil D. Gligor
%T On replay detection in distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
Various approaches to the problem of replay detection in distributed
systems are briefly reviewed. A new approach is proposed based on
combining a variable--size time--window mechanism with a challenge mechanism.
This approach has the properties that: (1) it does not depend
on clock synchronization, (2) it allows the setting of a minimum
server's memory-buffer size in a way that ensures acceptance of
all legitimate client requests, (3) it is robust without requiring
stable (non-volatile) memory for the server buffer needed to save
past client requests, (4) whenever the server has a steady heavy load,
it can be optimized to impose minimal memory-size demands without
undue network bandwidth overhead.
%K Fault-Tolerance
%A S.K. Shrivastava
%A S.M. Wheater
%T Implementing fault-tolerant distributed applications using objects and
multi-colored actions
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0File\0Systems
%A D.J. Makaroff
%A D.L. Eager
%T Disk cache performance in distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0File\0Systems
%A K. Korner
%T Intelligent caching for remote file service
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A R. Kamel
%A S.L. Lo
%T The implementation of remote rendez-vous
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A E. Walker
%A P. Neves
%A R. Floyd
%T Asynchronous remote operation execution in distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
Remote procedure call (RPC) has become a widely accepted
interprocess communication
mechanism in distributed systems.
The popularity of RPC stems from its simple call
syntax and semantics, and its support for compile-time type checking
and automatic interface generation.
However, the synchronous nature of
RPC makes it difficult to take advantage of the
parallelism inherent in a distributed environment.
We have implemented an asynchronous
remote operation execution facility that retains the benefits of
the RPC abstraction, but allows execution to proceed
locally in parallel with remote execution and provides extensive support for
managing replies.
This paper describes the
design and implementation of our facility, and
shows how it can be easily
used to support many common interprocess communication
styles, including RPC, multicast, broadcast,
returning incremental results,
and the multiplexing of multiple remote computations.
%K Distributed\0Systems
%A A. Thomassian
%A E. Rahm
%T A new distributed optimistic concurrency control method and a comparison
of its performance with two-phase locking
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A W.S. Lloyd
%A P. Kearns
%T Bounding sequence numbers in distributed systems: A general approach
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A D. Kumar
%T An implementation on N-way synchronization using tokens
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Databases
%A M.S. Chen
%A P.S. Yu
%T Using combination of join and semijoin operations for distributed
query processing
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A Shun Yan Cheung
%A Mustaque Ahamad
%A Mostafa H. Ammar
%T Multi-dimensional voting: A general method for implementing
synchronization in distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
We introduce a new concept, \fImulti-dimensional voting\fP,
in which the vote and quorum assignments
are k-dimensional vectors of non-negative integers and
each dimension is independent of the others.
Multi-dimensional voting is more powerful than traditional weighted
voting because it is equivalent to
the general method for achieving synchronization
in distributed systems which is based on coteries
(set of groups of nodes) but its implementation is
easier than coteries.
We describe an efficient algorithm for finding a multi-dimensional
vote assignment for any given coterie and show examples of its use.
We also show how multi-dimensional voting can be used to easily
implement novel algorithms for synchronizing access to replicated
data or to ensure mutual exclusion.
These algorithm cannot be implemented by traditional weighted voting.
%K Distributed\0Databases
%A C.L. Huang
%A V.O.K. Li
%T Regeneration-based multiversion dynamic voting scheme for replicated
database systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Databases
%A A. Kumar
%T Performance analysis of a hierarchical quorum consensus algorithm
for replicated objects
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Congestion\0Control
%A D. Comer
%A R. Yavatkar
%T A rate-based congestion avoidance and control scheme for packet
switched networks
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%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, informs the
traffic sources of congestion, and relies on the external 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 argue that it is
important to
exercise congestion control inside the network and discard the excess
traffic before it enters the network instead of waiting for the
congestion to build at some intermediate point in the network.
We have
devised a congestion avoidance and control scheme
that monitors the incoming traffic to each destination and provides
rate based feedback information to the sources of bursty traffic so
that sources of traffic can adjust their packet rates to match the
network capacity.
The paper discusses the scheme
in detail and describes the results of an experimental evaluation.
%K Routing
%A D.D. Kandlur
%A K.G. Shin
%T Traffic routing for multi-computer networks with
virtual cut-through capability
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Congestion\0Control
%A P. Gopinath
%A R. Gupta
%T Opportunistic evaluation of communication link loads
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0File\0Systems
%A X. Jia
%A H. Nakano
%A K. Shimuzu
%A M. Maekawa
%T Highly concurrent directory management in distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0File\0Systems
%A C. Brian Pinkerton
%A Edward D. Lazowska
%A David Notkin
%A John Zahorjan
%T A heterogeneous distributed file system
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
The increase in diversity of computing hardware and software has
made heterogeneity a fact of life in today's distributed systems.
The overall heterogeneous nature of such systems is of benefit to users
when working individually, since they are free to choose the environment
best suited to their work.
On the other hand, this same flexibility makes sharing more difficult.
.sp 0.25
The work presented here addresses the system service most critical to
sharing: the file system.
A distributed file system in a heterogeneous
environment must provide remote access between machines with different
hardware, operating systems, native file systems, and application programs.
To be most useful, it must provide convenient access to remote files,
which implies that no special preprocessing of files should be required
to make them available system-wide.
Furthermore, to be successful in an evolving heterogeneous environment,
the file system must be easy to build, maintain, and extend,
as well as easy to use.
.sp 0.25
Our goals for this project were to elucidate
the demands on a heterogeneous distributed file system,
and to design and implement a prototype to meet these demands.
Our prototype, the HCS File System (HFS), provides a network-wide
file system supporting a simple record-oriented file model.
Through this standard file model, the HFS provides global access to files
stored locally in many different file types, from byte stream to ISAM.
.sp 0.25
The HFS is implemented as a set of HFS servers, one running on each
participating host.
Each HFS server extends its host's local file system
by fielding remote requests for files stored locally,
translating those requests into the appropriate local file system calls,
and returning any information so obtained.
.sp 0.25
Our prototype HFS implementation has been used on a network composed of
VAX systems running Ultrix,
Sun systems running 4.2BSD UNIX, and Xerox Dandelions running XDE.
%K Distributed\0File\0Systems
%A A. Sandoz
%T Achieving high availability in a replicated file system
by dynamically ordering transactions
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Multicast
%A E. Cooper
%T Programming language support for multicast communication in distributed
system
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract\fP:
Multicast or group communication is an important part of modern
distributed systems, but programming language support for such
communication is uncommon. Remote procedure call uses a familiar
programming language abstraction to support unicast request-response
communication; what should the corresponding abstraction be for multicast
communication?
.sp 0.5
The essential and desirable properties of a language construct for
multicast communication are presented first. Essential properties
include type safety, expressive power, and efficiency. Desirable
properties include use of familiar control and data structures,
appropriate semantic level, and first-class treatment of multicast
operations in progress.
.sp 0.5
The main contribution of the paper is the introduction of a spectrum
of abstractions for multicast communication, in increasing order of
both desirability and semantic level: functional mapping, iterators,
and streams. Examples of distributed algorithms from the literature
are used to illustrate the expressive power of each mechanism.
Streams in particular provide first-class status for multicast
communication in progress, and can be implemented efficiently in
typical multicast communication architectures.
[\fINote:\fP Also available as tech report CMU-CS-90-121, School
of Computer Science, Carnegie-Mellon].
%K Distributed\0Memory
%A R.G. Minnich
%A D.J. Farber
%T Reducing host load, network load and latency in distributed shared memory
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%X \fBAbstract:\fP
Mether is a Distributed Shared Memory (DSM) that runs on
Sun workstations
under the SunOS 4.0 operating system.
User programs access the
Mether address space in a way indistinguishable from other memory.
When we began to use Mether and measure its performance a number of
issues made themselves felt:
.sp 0.25
- Programs could saturate the network with packets while trying to
synchronize operations
.sp 0.25
- Because the communications are accomplished via a user level server,
an Mether client program spinning on a lock could block the user level server,
resulting in a backup of queued packets
.sp 0.25
- The combined effects of deep queues of packets waiting for service and
communications servers blocked by Mether clients greatly increased the
latency of the shared memory
.sp 0.25
- Too many packets had to flow for simple synchronization operations,
resulting in increased network load
.sp 0.25
- Programs that were trying to synchronize spent most of their time
spinning on unchanged data, increasing host load
.sp 0.25
We had seen the same increased latency problem on a different distributed
shared memory called MemNet. Although MemNet is hardware-based and uses a
token ring it is still possible to flood the network and increase the latency
by several orders of magnitude.
.sp 0.25
In this paper we discuss changes we made to Mether and protocols we developed
to use Mether that minimize host load, network load, and latency.
An interesting (and unexpected) result was the discovery that the same
``best'' protocol for Mether is identical to the ``best'' protocol for
MemNet.
.sp 0.25
The changes to Mether involve exposing an inconsistent store to the application
and making access to the consistent and inconsistent versions very convenient;
providing both demand-driven and
data-driven semantics for updating pages;
and allowing the user to specify that only
a small subset of a page need be transferred. All of these operations
are encoded in a few address bits in the Mether virtual address.
.sp 0.25
The ``best'' protocol which we have developed involves using pages as one-way
links. Only one processor has the consistent (or ``master'') copy.
All other processors have
an inconsistent copy.
As the consistent copy changes the process with the consistent copy can
cause the newest version to be broadcast to all the processes reading the
inconsistent copy. As a result only two packets need to flow, on average,
per synchronization operation.
%K Distributed\0Systems
%A J.E. Lumpp, Jr.
%A T.L. Casavant
%A H.J. Siegel
%A D.C. Marinescu
%T Specification and identification of events for debugging and performance
monitoring of distributed multiprocessor programs
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Memory
%A J.P. Sterbenz
%A G.M. Parulkar
%T AXON: Network virtual storage for high performance distributed applications
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K LANs
%A K. Goto
%A T. Suda
%T Performance analysis of a broadcast star local area network with collision
avoidance
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A I. Chalmtac
%A A. Ganz
%T A study of communication resource allocation in a distributed system
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Routing
%A Z. Liu
%T Optimal routing in the De Bruijn networks
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0File\0Systems
%A K.R. Pattipati
%A J.L. Wolf
%T A file assignment problem model for extended local area network
environments
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A C. Kim
%A H. Kameda
%T Optimal static load balancing of multi-class jobs in a distributed
computer system
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Distributed\0Systems
%A J. Kramer
%A J. Magee
%A A. Finkelstein
%T A constructive approach to the design of distributed systems
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K Multimedia\0Communication
%A E. Moeller
%A A. Schller
%A G. Shurmann
%T Distributed processing of multimedia information
%J Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10)
%D May 28-June 1, 1990
%C Paris, France
%I IEEE
%K OSI
%J Computer Standards & Interfaces
%T A COS Study of OSI Interoperability
%A J. Gadre
%A C. Rohrer
%A C. Summers
%A S. Symington
%P 217-238
%V 9
%N 3
%K High-Speed\0Networks
%A I. Chlamtac
%A W.R. Franta
%T Rationale, Directions, and Issues Surrounding High Speed Networks
%P 94-120
%J Proc. IEEE
%D January 1990
%V 78
%K High-Speed\0Networks
%A G. Hill
%T Wavelength Domain Optical Network Techniques
%P 121-132
%J Proc. IEEE
%D January 1990
%V 78
%K ISDN
%A F.A. Tobagi
%T Fast Packet Switch Architectures for Broadband Integrated Services Digital
Networks
%P 133-167
%J Proc. IEEE
%D January 1990
%V 78
%K High-Speed\0Networks
%A I. Rubin
%A J.E. Baker
%T Media Access Control for High-Speed Local Area and Metropolitan Area
Communications Networks
%P 168-203
%J Proc. IEEE
%D January 1990
%V 78
%K High-Speed\0Networks
%A N.F. Maxemchuk
%A M. El\0Zarki
%T Routing and Flow Control in High-Speed Wide-Area Networks
%P 204-221
%J Proc. IEEE
%D January 1990
%V 78
%K Distributed\0Systems
%A D. Notkin
%T Proxies: A Software Structure for Accommodating Heterogeneity
%J Software Practice & Experience
%I John Wiley
%V 20
%N 4
%D April 1990
%P 357-364
%K Directory\0Services
%A M. Bowman
%A L.L. Peterson
%A A. Yeatts
%T Univers: An Attribute-based Name Server
%J Software Practice & Experience
%I John Wiley
%P 403-424
%V 20
%N 4
%D April 1990
%K Security
%A M. Satyanarayanan
%T Integrating Security in a Large Distributed System
%P 247-280
%J ACM Trans. Computer Systems
%D August 1989
%V 7
%N 3
%O \fIReviews\fP: \fIComputing Reviews\fP, May 1990.
%K Protocol\0Performance
%A Van Jacobson
%T 4BSD Header Prediction
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 13-15
%K Protocol\0Performance
%A Lawrence H. Landweber
%A Mitchell Tasman
%T An ISO Tp4-TP0 Gateway
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 16-21
%K Protocol\0Performance
%A Martin L. Schoffstall
%A Wengyik Yeong
%T A Critique of Z39.50 Based On Implementation Experience
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 22-29
%K Security
%A Colin I'Anson
%A Chris Mitchell
%T Security Defects in CCITT Recommendation X.509 - The Directory
Authentication Framework
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 30-34
%K Flow\0Control
%A Jean-Chrysostome Bolot
%A A. Udaya Shankar
%T Dynamical Behavior of Rate-Based Flow Control Mechanisms
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 35-49
%K Distributed\0Systems
%A James P.G. Sterbenz
%A Gurudatta M. Parulkar
%T AXON: Virtual Network Storage Design
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 50-65
%K Security
%A Robert W. Shirey
%T Defense Data Network Security Architecture
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 66-71
%K Electronic\0Mail
%A Guy Genilloud
%T X.400 MHS: First Steps Toward an EDI Communication Standard
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 72-86
%K Network\0Management
%A David Piscitello
%A Patrick Sher
%T Network Management Capabilities for Switched Multi-megabit Data Service
%J Computer Communication Review
%I ACM SIGCOMM
%D April 1990
%V 20
%N 2
%P 87-97
%K Multimedia\0Communication
%A C.-H. Chow
%A M. Adachi
%T Achieving Multimedia Communications on a Heterogeneous Network
%P 348-359
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K Multimedia\0Communication
%A S. Nakano
%A N. Nagai
%A R. Sawada
%A O. Miyagishi
%T Network Control Method and Human-Machine Interface Design for ISDN
Multimedia Terminal
%P 360-367
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K High-Speed\0Networks
%A D. Ferrari
%A D.C. Verma
%T A Scheme for Real-Time Channel Establishment in Wide-Area Networks
%P 368-379
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K Multimedia\0Communication
%A W.H. Leung
%A T.J. Baumgartner
%A Y.H. Hwang
%A M.J. Morgan
%A S.-C. Tu
%T A Software Architecture for Workstations Supporting Multimedia Conferencing
in Packet Switching Networks
%P 380-391
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K Multimedia\0Communication
%A G.M. Woodruff
%A R. Kostpaiboon
%T Multimedia Traffic Management Principles for Guaranteed ATM Network
Performance
%P 437-446
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K High-Speed\0Networks
%A M. Murata
%A Y. Oie
%A T. Suda
%A H. Miyahara
%T Analysis of a Discrete-Time Single-Server Queue with Bursty Inputs for
Traffic Control in ATM Networks
%P 447-458
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K High-Speed\0Networks
%A H.S. Kim
%A A. Leon-Garcia
%T A Self-Routing Multistage Switching Network for Broadband ISDN
%P 459-466
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K High-Speed\0Networks
%A A.A. Lazar
%A G. Pacifici
%A J.S. White
%T Real-Time Traffic Measurements on MAGNET-II
%P 467-483
%J IEEE Jour. Selected Areas in Communications
%D April 1990
%V 8
%N 3
%K Distributed\0File\0Systems
%A Mahadev Satyanarayanan
%T Scalable, Secure, and Highly Available Distributed File Access
%P 9-22
%J Computer
%I IEEE
%D May 1990
%V 23
%N 5
%K Distributed\0Systems
%A Larry Peterson
%A Norman Hutchinson
%A Sean O'Malley
%A Herman Rao
%T The x-kernel: A Platform for Accessing Internet Resources
%P 23-34
%J Computer
%I IEEE
%D May 1990
%V 23
%N 5
%K Distributed\0Systems
%A Sape J. Mullender
%A Guido van Rossum
%A Andrew S. Tanenbaum
%A Robbert van Renesse
%A Hans van Staveren
%T Amoeba: A Distributed Operating System for the 1990s
%P 44-53
%J Computer
%I IEEE
%D May 1990
%V 23
%N 5
%K Distributed\0Systems
%A Michael Stumm
%A Songnian Zhou
%T Algorithms Implementing Distributed Shared Memory
%P 54-64
%J Computer
%I IEEE
%D May 1990
%V 23
%N 5
%K Network\0Management
%A M. Rose
%A K. McCloghrie
%T Structure and Identification of Management
Information for TCP/IP-based Internets; RFC-1155
%N 1155
%J Internet Request for Comments
%D May 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC is a re-release of RFC 1065, with a changed "Status of this
Memo", plus a few minor typographical corrections. The technical
content of the document is unchanged from RFC 1065.
.sp 0.25
This memo specifies a Standard Protocol for the Internet community.
Its status is "Recommended". TCP/IP implementations in the Internet
which are network manageable are expected to adopt and implement this
specification.
%K Network\0Management
%A K. McCloghrie
%A M. Rose
%T Management Information Base for Network
Management of TCP/IP-based internets; RFC-1156
%J Internet Request for Comments
%N 1156
%D May 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC is a re-release of RFC 1066, with a changed "Status of this
Memo", "IAB Policy Statement", and "Introduction" sections plus a few
minor typographical corrections. The technical content of the
document is unchanged from RFC 1066.
.sp 0.25
This memo specifies a Standard Protocol for the Internet community.
TCP/IP implementations in the Internet which are network manageable
are expected to adopt and implement this specification.
%K Network\0Management
%A J. Case
%A M. Fedor
%A M. Schoffstall
%A J. Davin
%T A Simple Network Management Protocol (SNMP); RFC-1157
%J Internet Request for Comments
%N 1157
%D May 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC is a re-release of RFC 1098, with a changed "Status of this
Memo" section plus a few minor typographical corrections.
This memo defines a simple protocol by which
management information for a network element may be inspected or
altered by logically remote users.
%K Miscellaneous
%A J. Postel
%T IAB Official Protocol Standards; RFC-1140
%J Internet Request for Comments
%N 1140
%D May 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC describes the state of standardization of protocols used in
the Internet as determined by the Internet Activities Board (IAB).
.sp 0.25
This memo is issued quarterly, please be sure the copy you are reading
is dated within the last three months. Current copies may be obtained
from the Network Information Center or from the Internet Assigned
Numbers Authority. Do not use this edition after 31-Aug-90.
%K Distributed\0Systems
%A M.L. Scott
%T An overview of Lynx
%R TR 308
%I Univ. of Rochester Computer Science Dept.
%D Aug. 1989
%Z 27 pages, $1.25
%X \fBAbstract:\fP
A programming language can provide much better support for
interprocess communication than a library package can. Most
message-passing languages limit this support to communication between
the pieces of a single program, but this need not be the case. Lynx
facilitates convenient, typesafe message-passing not only within
applications, but also between applications, and among distributed
collections of servers. Specifically, it addresses issues of compiler
statelessness, late binding, and protection that allow run-time
interaction between processes that were developed independently and
that do not trust each other. Implementation experience with Lynx has
yielded important insights into the relationship between distributed
operating systems and language run-time support packages, and into the
inherent costs of high-level message-passing semantics.
%K Network\0Management
%A Bruce L. Hitson
%R CSL-TR-90-414
%T Knowledge-based Monitoring and Control of Distributed Systems
%D February 1990
%I Computer Systems Lab, Stanford University
%X \fBAbstract:\fP
Monitoring and control (M&C) refers to the process of collecting information
about a system, interpreting it, and finally using it to affect system
behavior. We show that a knowledge-based approach is both necessary and
appropriate for M&C of complex message-based distributed systems, and that a
blackboard architecture can be successfully applied to M&C problems in the same
way that it has been previously applied in other signal processing domains. To
achieve good performance, we have augmented the traditional purely declarative
rule system approach with cached temporal linkage information and fast
procedural analysis routines.
Scheduling or search control must be tuned for individual M&C applications. We
have developed multi-level weighted search control to overcome some of the
scheduling problems that are encountered in domains such as M&C where shallow
heuristic knowledge predominates. Our ideas have been developed and refined in
the context of two implementations of monitoring and control "expert systems":
an automated TCP/IP network protocol analyst, and a system for both performing
Time Warp distributed simulations and analyzing the results. Their common
aspects form the basis for KNOBS---a knowledge-based M&C shell and environment
that is suitable and practical for studying a wide range of distributed
systems. [To order, call +1 415-723-1430].
%K Distributed\0File\0Systems
%A Cary C. Gray
%A David R. Cheriton
%T Leases: An Efficient Fault-Tolerant Mechanism for Distributed File
Cache Consistency
%D January 1990
%R CSL-TR-90-409
%I Computer Systems Lab, Stanford University
%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.
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. [To order, call +1 415-723-1430]
%K Distributed\0Systems
%A G. Bruns
%A C. Richter
%P 16
%D October 1989
%R STP-251-89
%I MCC Software Technology Program
%T Rada - An Ada-Based Language for Distributed Systems Design
%X \fBAbstract:\fP
Rada is a language for the design of distributed systems. It is based on Ada, but replaces the concurrency mechanisms of Ada with those of
the language Raddle. Specifically, Rada replaces the task and
rendezvous of Ada with the team, role, N-party interaction, and
non-deterministic choice of Raddle. The form of this report mirrors
the form of the Ada reference manual, and presumes some familiarity
with Ada. The syntax for each new Rada concurrency construct is
given, followed by a informal description of the semantics of the
construct. The Appendix contains a Rada version of a Raddle cellular
telephone system design. [For copies, email to babcock@mcc.com]
%K Protocol\0Testing\0and\0Verification
%A Alfred. V. Aho
%A Barry S. Bosik
%A Stephen J. Griesmer
%T Protocol testing and verification within AT&T
%P 4-6
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Testing\0and\0Verification
%A Herbert V. Bertine
%A Wolfgang B. Elsner
%A Promde K. Verma
%A Kamlesh T. Tewani
%T Overview of Protocol Testing Programs, Methodologies, and Standards
%P 7-16
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Testing\0and\0Verification
%A M. Umit Uyar
%A Aleta Lapone
%A Krishan K. Sabnani
%T Algorithmic Verification of ISDN Network Layer Protocol
%P 17-31
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Testing\0and\0Verification
%A Gerard L. Holzmann
%T Algorithms for Automated Protocol Verification
%P 32-44
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Testing\0and\0Verification
%A Zri Har'El
%A Robert Kurshan
%T Software for Analytical Development of Communications Protocols
%P 45-59
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Conformance\0Testing
%A Mostafa Hasehm Sherif
%A M. Umit Uyar
%T Protocol Modeling for Conformance Testing: Case Study for the ISDN LAPD Protocol
%P 60-83
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Conformance\0Testing
%A Mathew Bush
%A Kris Rasmussen
%A Fai Wong
%T Conformance Testing Methodologies for OSI Protocols
%P 84-100
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Conformance\0Testing
%A Anton T. Dahbura
%A Krishan K. Sabnani
%A M. Umit Uyar
%T Algorithm Generation of Protocol Conformance Tests
%P 101-118
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Protocol\0Testing\0and\0Verification
%A Darrell Hubbard
%T Deterministic Execution Testing of FSM-Based Protocols
%J AT&T Technical Journal
%V 69
%N 1
%D January/February 1990
%K Security
%A Raju Ramaswamy
%T A Key management Algorithm for Secure Communication in Open
Systems Interconnection Architecture
%J Computers & Security - international Journal
%V 9
%N 1
%D February 1990
%P 77-84
%X \fBAbstract:\fP
A key management algorithm is presented in this paper. It is applied
to secure transmission of user data between two peer layers of an open systems
interconnection reference model architecture located at any source and
destination end_user host systems. In particular, the algorithm (i) generates
and distributes a session key between two peer layers during the connection
establishment phase,(ii) encrypts and decrypts the user data, present in the
protocol data unit, using the same session key during the data transfer phase
and (iii) after transmitting the user data, it destroys the session key during
the connection release phase. For the purpose of simulation, the algorithm is
shown applied between the transport service user and the provider, present at
the source and the destination host systems, for secure transfer of transport
service user data to the corresponding remote peer layer using the class 4
transport protocol of the OSI_RM architecture.
%K Network\0Design
%A Raju Ramaswamy
%T Design of terrestrial/satellite computer communication
networks using Slotted ALOHA and SS/TDMA satellite systems
%J Space Communications - International Journal
%V 7
%D 1990
%P 139-154
%X \fBAbstract:\fP
With the rate of growth of packet-switched computer communication
networks, the future networks are expected to comprise hundreds or thousands of
packet switching nodes. In view of the network design and computational time
requirements, ultimately the topological design complexity of such large-scale
computer communication networks would grow exponentially with the size of the
network. Therefore, efficient procedures for the design and operation of large-
scale computer communication networks are required. In this paper, a
multi-level
hierarchial approach is presented for the topological design of a large-scale
computer
communication network using terrestrial and Slotted
ALOHA and Satellite Switched SS/TDMA satellite with
terrestrial or mixed-media systems. In this
paper, for a given set of packet switching nodal locations, the nodes are
initially decomposed into an M-level Hierarchial Clustering (MHC) structure
Then, an M-level Hierarchial Topological (MHT) structure is formed over the
above MHC structure. Finally, an M-level Hierarchical Routing (MHR) scheme is
presented for routing the messages between any source-destination node-pair.
Also, an expression for the average time delay of a message in an M-level
hierarchically clustered and topologically structured terrestrial and satellite
computer communication network is given.
%K Security
%A Raju Ramaswamy
%T A Security Architecture and Mechanism for Data Confidentiality in TCP/IP Protocols
%J Proc.1990 IEEE Symposium on Research in Security and Privacy
%D May 1990
%C Oakland, Calif.
%P 249-259
%X \fBAbstract:\fP
A method to provide data confidentiality service for secure data
communication between two end users through TCP/IP protocols is presented in
this paper. The system call functions of the Socket Compatibility Interface
and Transport Level Interface libraries are used for Connection Establishment,
Data Transfer, and Connection Release between two TCP/IP end users. In this
paper, a new security architecture consisting of Interactive Application
Program, Client/Server, and Security Service modules as well as the
corresponding security mechanism to provide data confidentiality service are
presented.
%K Network\0Design
%A Raju Ramaswamy
%T Satellite Ground Stations Location Problem In Terrestrial/
Satellite Computer Communication Networks Design
%D 1990
%R TR-NT-1990-2
%I Computer Science Telecommunication program, Univ. Missouri-Kansas City
5100 Rockhill Rd, Kansas City, MO 64110
%X \fBAbstract:\fP
In a terrestrial Computer communication network, When the input
traffic requirement is gradually increased, a set of saturated cut-set links
virtually disconnects the network into two disjoint regions of nodes.
To increase the network throughput further,
a high-capacity Slotted-ALOHA satellite
channel is added across the saturated cut-set links. Since the cost of locating
a satellite ground station is more or less the
same, irrespective of its location, an SGSLOC algorithm
is presented to properly locate the satellite ground
stations in order to achieve an increase in Network throughput,
improved network reliability, and decrease in average packet delay for the
same location cost
For a model computer network, the simulation results are given to demonstrate
the improvement in network performance.
%K Time\0Synchronization
%A M.G. Gouda
%A T. Herman
%T Stabilizing Unison
%D January 1990
%R TR-90-01
%I Comp. Science Dept, Univ. Texas at Austin
%P 7
%X \fBAbstract:\fP
We present an elegant implementation of ``clocks'' in
distributed synchronous systems.
The implementation is stabilizing
in the following sense. Starting from any state, the
clocks are guaranteed to reach ``unison'' where they show the
same time, and the shown time is incremented in each step.
%K Network\0Management
%J Internet Request for Comments
%A M. Rose
%T Management Information Base for Network Management
of TCP/IP-based internets: MIB-II
%N 1158
%D May 1990
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo defines the second version of the Management Information
Base (MIB-II) for use with network management protocols in TCP/IP-
based internets. In particular, together with its companion memos
which describe the structure of management information (RFC 1155)
along with the network management protocol (RFC 1157) for TCP/IP-
based internets, these documents provide a simple, workable
architecture and system for managing TCP/IP-based internets and in
particular the Internet community.
.sp 0.25
This document on MIB-II incorporates all of the technical content of
RFC 1156 on MIB-I and extends it, without loss of compatibility.
However, MIB-I as described in RFC 1156 is full Standard Protocol of
the Internet, while the MIB-II described here is Proposed Standard
Protocol of the Internet.
.sp 0.25
This memo defines a mandatory extension to the base MIB (RFC 1156)
and is a Proposed Standard for the Internet community. The
extensions described here are currently Elective, but when they
become a standard, they will have the same status as RFC 1156, that
is, Recommended. The Internet Activities Board recommends that all
IP and TCP implementations be network manageable. This implies
implementation of the Internet MIB (RFC 1156 and the extensions in
RFC 1158) and at least one of the two recommended management
protocols SNMP (RFC 1157) or CMOT (RFC 1095).
%K Miscellaneous
%A V. Cerf
%T The Internet Activities Board; RFC-1160
%J Internet Request for Comments
%N 1160
%D May 1990
%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. This is a
revision of RFC 1120.
%K Multicast
%A B. Awerbuch
%A O. Goldreich
%A D. Peleg
%A R. Vainish
%T A Trade-Off between Information and Communication in Broadcast Protocols
%P 238-256
%J Jour. Assoc. for Computing Machinery
%D April 1990
%V 37
%N 2
%K Distributed\0Systems
%A M. Herlihy
%T Concurrency and Availability as Dual Properties of Replicated Atomic Data
%P 257-275
%J Jour. Assoc. for Computing Machinery
%D April 1990
%V 37
%N 2
%A L. Zahn
%A T. Dineen
%A P. Leach
%A E. Martin
%A N. Mishkin
%A J. Pato
%A G. Wyant
%T Network Computing Architecture
%D 1990
%I Prentice Hall
%P 224
%A M. Kong
%A T. Dineen
%A P. Leach
%A E. Martin
%A N. Mishkin
%A J. Pato
%A G. Wyant
%T Network Computing System Reference Manual
%D 1990
%I Prentice Hall
%P 416
%A Terry Knowles
%A John Larmouth
%A Keith Knightson
%T Standards for Open Systems Interconnection
%I BSP Professional Books
%D 1987
%O \fIReviews\fP: \fIConneXions\fP, Vol. 4, No. 3, March 1990.
%A J. Fitzgerald
%T Business data communications (2nd ed.)
%I John Wiley and Sons
%C New York
%D 1988
%P 683
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A C.T. Medow
%A A.S. Tedesco
%T Telecommunications for Management
%D 1985
%I McGraw-Hill
%P 379
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A J. Misra
%A Byron Belitsos
%T Business Telecommunications: concepts, technologies and cases in telematics
%I Richard D. Irwin, Inc.
%I Homewood, Illinois
%P 532
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A George W. Reynolds
%A Donald Riecks
%T Introduction to business telecommunications
%D 1988
%I Merrill Publishing
%C Columbus
%P 269
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A Stanford H. Rowe
%T Business telecommunications
%I Macmillan
%C New York
%D 1988
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A Kenneth Sherman
%T Data communications: a users guide (2nd ed.)
%D 1985
%I Reston Publishing Co.
%C Reston, Virginia
%P 446
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A Gerald A. Silver
%A Myrna Silver
%T Data communications for business
%I Boyd & Fraser
%C San Francisco
%P 411
%D 1987
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A William Stallings
%T Data and computer communications (2nd ed.)
%D 1988
%I Macmillan
%C New York
%P 456
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A David A. Stamper
%T Business data communications (2nd ed.)
%I Benjamin/Cummings
%C Menlo Park, California
%D 1989
%P 556
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A William Stallings
%T ISDN: an introduction
%P 418
%I Macmillan
%C New York
%D 1989
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A Gerd E. Keiser
%T Local Area Networks
%I McGraw-Hill
%C New York
%D 1989
%P 420
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 3, March 1990.
%A J.R. Freer
%T Computer Communications and networks
%I Plenum Publishing Corp.
%C New York
%D 1989
%P 432
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 4, April 1990.
%A Franz-Joachim Kauffels
%T Practical LANs analysed
%I Halsted Press
%C New York
%D 1989
%P 334
%O \fIReviews:\fP \fIComputing Reviews\fP, Vol. 31, No. 4, April 1990.
%A W. Richard Stevens
%T UNIX Network Programming
%I Prentice Hall
%D 1990
%O \fIReviews:\fP \fIConneXions\fP, Vol. 4, No. 4, April 1990. [Note:
the same review appears in this issue of \fICCR\fP]
%A William Stallings
%A Paul Mockapetris
%A Sue McLeod
%A Tony Michel
%A Craig Partridge
%A Keith McCloghrie
%T Handbook of Computer-Communications Standards Volume 3: The
TCP/IP Protocol Suite, Second Edition
%I Howard W. Sams & Co
%D 1989
%O \fIReviews:\fP \fIConneXions\fP, Vol. 4, No. 4, April 1990.
%A A.S. Tanenbaum
%A Et. Al.
%T The Amoeba Distributed Operating System
%D 1990
%X \fBNote:\fP A collection of key reports on Amoeba, available as
a free book, by anonymous FTP from midgard.ucsc.edu.
%A Nathan J. Muller
%A Robert P. Davidson
%T LANs to WANs: Network Management in the 1990s
%I Artech House
%D August 1990
%C Norwood, Massachusetts
%X \fBNote:\fP Can be ordered in advance of publication date.
ISBN #0-89006-410-5.