[comp.doc.techreports] tr-input/sigcomm.1

leff@smu.UUCP (Laurence Leff) (04/24/89)

Here's the latest bibliography on data communications and networking
from the April issue of ACM SIGCOMM Computer Communication Review.
It covers the period from December '88 to March '89.  A copy of this
bibliography (as well as bibliographies from prior issues) can be retrieved
by anonymous FTP from sh.cs.net in directory sigcomm/*.refer

ACM SIGCOMM is the ACM SIG on data communications.  For information on
joining ACM SIGCOMM or the upcoming SIGCOMM '89 conference please feel
free to contact me (craig@bbn.com).

To have a recent article included in the bibliography, e-mail the citation
along with the abstract to me.

Thank you,

Craig Partridge
Editor, ACM SIGCOMM Computer Communication Review


%A P. Arbouw
%T Security in Multiple, Inter-Enterprise and Cascaded Networks
%J 7th Worldwide Congress Computer and Communications Security and Protection
%C Paris, France
%D March 1-3, 1989

%A Y. Le-Roux
%T Information Security in a Local Area Network Integrating Different Worldwide
Networks - The Security of DECWorld'88
%J 7th Worldwide Congress Computer and Communications Security and Protection
%C Paris, France
%D March 1-3, 1989

%T The Use of RSA Public Key Encryption Techniques for Securing Large EFT-POS Networks
%A D. Buckley
%J 7th Worldwide Congress Computer and Communications Security and Protection
%C Paris, France
%D March 1-3, 1989

%A J-C. Pailles
%T A Public key based Solution for Secured Data Communication
%J 7th Worldwide Congress Computer and Communications Security and Protection
%C Paris, France
%D March 1-3, 1989

%A W. Diffie
%T Protection of Terminal to Host Communications by End-to-End Cryptography
%J 7th Worldwide Congress Computer and Communications Security and Protection
%C Paris, France
%D March 1-3, 1989

%A W. Burger
%A N. Vasudevan
%T Networking of Secure AIX and Xenix Systems
%J 7th Worldwide Congress Computer and Communications Security and Protection
%C Paris, France
%D March 1-3, 1989

%A D. Pinkas
%T An Access Control Model for Distributed Systems Based on the Use of
Trusted Authorities
%J 7th Worldwide Congress Computer and Communications Security and Protection
%C Paris, France
%D March 1-3, 1989

%A L. Lanzillo
%A C. Partridge
%T Implementation of Dial-up IP for UNIX Systems
%J Proc. 1989 Winter USENIX Technical Conf.
%C San Diego, California
%I USENIX Association
%D January 30 - February 3, 1989
%X \fBAbstract:\fP
CSNET has developed a software package to support the sending of Internet
Protocol (IP) datagrams
over dial-up phone lines. This driver can automatically establish and
disconnect phone calls as IP traffic dictates. This code works in
binary-only BSD systems.

%A Morris S. Sloman
%A Jonathan D. Moffett
%T Domain Management for Distributed Systems
%J First Intl. Symp. Integrated Network Management (IFIP TC6/WG 6.6)
%E B. Meandzija and J.A. Westcott
%C Boston, Massachusetts
%D May 14-17, 1989
%I North Holland
%X \fBAbstract:\fP
Large distributed systems are characterised by large numbers of diverse
components, multiple autonomous managements. A means of grouping components
into units to which a common management policy can apply is required in order
to cope with the complexity of scale.
.sp 0.5
The informal concept of domain is in common use as a means of describing
groups of objects subject to a single management policy. The paper develops
and refines the concept. We discuss relationships between domains and how
these can be used to partition and structure the management of large
distributed systems. The necessary operations on domains themselves are
outlined.

%T ISO Presentation Services on top of TCP/IP-based internets
%A M. Rose
%J Internet Request for Comments
%N 1085
%D December 1988
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
RFC 1006 describes a mechanism for providing the ISO transport service
on top of TCP/IP. Once this method is applied, one may implement
``real'' ISO applications on top of TCP/IP-based internets, by simply
implementing OSI session, presentation, and application services on
top of the transport service access point which is provided on top of
the TCP. Although straight-forward, there are some environments in
which the richness provided by the OSI application layer is desired,
but it is nonetheless impractical to implement the underlying OSI
infrastructure (i.e., the presentation, session, and transport
services on top of the TCP).
.sp 0.5
This memo describes an approach for providing ``stream-lined'' support
of OSI application services on top of TCP/IP-based internets for such
constrained environments. This memo proposes a standard for the
Internet community.

%A Celia A. Joseph
%A James Kindrick
%A Kurudi H. Muralidhar
%A Cathy So
%A Tihamer T. Toth-Fejel
%T MAP Fault Management Expert System
%J First Intl. Symp. Integrated Network Management (IFIP TC6/WG 6.6)
%E B. Meandzija and J.A. Westcott
%C Boston, Massachusetts
%D May 14-17, 1989
%I North Holland
%X \fBAbstract:\fP
The MAP Fault Management system (MAPFaM) is an evolving expert system for
fault management of MAP and other OSI networks being developed at the
Industrial Technology Institute. This paper describes the design
requirements for MAPFaM, including its architecture, data model, reasoning
modalities, and knowledge base. As background, the paper also describes
fundamentals of ISO network management, and provides a brief survey of other
work done in this area.

%A Wojciech Cellary
%A Maciej Stroinski
%T Performance Management Architecture for Protocol Entity Optimization
%J First Intl. Symp. Integrated Network Management (IFIP TC6/WG 6.6)
%E B. Meandzija and J.A. Westcott
%C Boston, Massachusetts
%D May 14-17, 1989
%I North Holland
%X \fBAbstract:\fP
Performance management architecture for protocol entity optimization in
OSI networks is presented. Its main advantage is a possibility of the
integration of performance management functions with all other
management functions. Elementary performance services are proposed,
which compose the final performance services. More details are
given for the case of performance management architecture for
transmission medium monitoring. A measurement transducer method
referred to this architecture is proposed. Measurement transducer is
a component of the protocol entity monitor, which reproduces the states
and state transition times of the protocol entity observed. This is
done by the use of formal models of protocols.

%T ISO-TP0 bridge between TCP and X.25
%A J. Onions
%A M. Rose
%J Internet Request for Comments
%N 1086
%D December 1988
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo proposes a standard for the Internet community. Hosts on
the Internet that choose to implement ISO TP0 transport connectivity
between TCP and X.25 based hosts are expected to experiment with this
proposal. TCP port 146 is reserved for this proposal.

%A A.N. Choudhary
%A W.H. Kohler
%A J.A. Stankovic
%A D. Towsley
%T A Modified Priority Based Probe Algorithm for Distributed Deadlock
Detection and Resolution
%J IEEE Software Engineering
%D January 1989
%V 15
%N 1
%P 10-17

%A P. Jalote
%T Resilient Objects in Broadcast Networks
%J IEEE Software Engineering
%D January 1989
%V 15
%N 1
%P 68-71

%A R. Cole
%A Clare Foxcroft
%T An Experiment in Clock Synchronization
%J The Computer Journal
%D December 1988
%V 31
%N 6
%P 496-502
%X \fBAbstract:\fP
This paper describes an experiment to obtain an upper bound on the
accuracy that can be expected when attempting to synchronise the system
clock of one computer with the system clock of a physically remote
computer. The paper gives some reasons for wanting to synchronise
clocks and the relationship to previous work. The experiments used the
DARPA experimental Network Time Protocol (NTP).

%A Subrata Mazumdar
%A Aurel A. Lazar
%T Knowledge-Based Monitoring of Integrated Networks
%J First Intl. Symp. Integrated Network Management (IFIP TC6/WG 6.6)
%E B. Meandzija and J.A. Westcott
%C Boston, Massachusetts
%D May 14-17, 1989
%I North Holland
%X \fBAbstract:\fP
A knowledge based traffic monitor for Integrated Networks is presented.
An Entity-Relationship information model is described for representing
the knowledge about the network as a distributed database.
A computational model based on the IC* model of parallel computation
supports inference mechanism on the database.
The integration of these two models provides a basis for
monitoring, servicing user queries about the network status,
performance assessment of traffic and a dynamic observer system for
real-time resource management and control.

%T Data Flow Anomaly Detection for Raddle87
%A I. Forman
%R Technical Report STP-213-88
%I MCC Software Technology Program
%D September 22, 1988
%X \fBAbstract:\fP
The problem of detecting data flow anomalies in Raddle87, a language
for the design of distributed systems, is addressed. An algebra A is
described that is specialized for the detection of data flow
anomalies by interpreting the regular expression for the paths in a
program as an A expression. A method for efficiently computing data
is presented; the method is based on the iterative algorithm of
global data flow analysis.

%T XSCOPE: A Debugging and Performance Tool for X11
%A J. Peterson
%R Technical Report STP-335-88
%I MCC Software Technology Program
%D October 18, 1988
%X \fBAbstract:\fP
The X Window System architecture consists of separate processes for
the window server and its clients. When poor performance or errors
are a problem in such a system, it may be difficult to determine if
the problem is with the client, some client toolkit, or with the
server. Xscope allows a programmer to view the actual request, reply,
error, and event packets sent between the client and the server,
providing the data needed to understand the system. The design of
Xscope indicates some problems with the syntax of the X11 protocol.


%T A Survey of Distributed Coordination
%A E. Levy
%R Technical Report STP-271-88
%I MCC Software Technology Program
%D September 27, 1988
%X \fBAbstract:\fP
Distributed Coordination is a problem of implementing a synchronous
communication event between an arbitrary number of processes in a
distributed environment. The problem captures two primary aspects in
distributed computing: exclusion and synchronization. After
presenting a clear specification of the Distributed Coordination
problem, the paper surveys and assesses algorithms for solving it.
Both message passing and broadcast algorithms are discussed. Classes
of algorithms which exhibit common properties are identified and
analyzed.

%A Z. Rosberg
%A M. Sidi
%T TDM Policies in Multistation Packet Radio Networks
%J IEEE Trans. on Communications
%V 37
%N 1
%D January 1989
%P 31-38

%A P. Wild
%A C. Mitchell
%T One-Stage One-Sided Rearrangeable Switching Networks
%J IEEE Trans. on Communications
%V 37
%N 1
%D January 1989
%P 52-56

%A F. LeGall
%T About Loss Probabilities for General Routing Policies in Circuit-Switched Networks
%J IEEE Trans. on Communications
%V 37
%N 1
%D January 1989
%P 57-59

%A R.G. Bubenik
%A J.S. Turner
%T Performance of a Broadcast Packet Switch
%J IEEE Trans. on Communications
%V 37
%N 1
%D January 1989
%P 60-69

%A G.J. Handler
%T The Challenges of Implementing ISDN Service
%P 7-9
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J.F. Luby
%T Operational Experiences of Data Communications in ISDN
%P 10-15
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A S. Kindseth
%T Internetworking Between An ISDN and Dedicated Networks
%P 16-20
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A G.S. Poo
%A W. Ang
%T A Graphical Representation of ISO Transport Protocol
%P 21-25
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Fleischmann
%A M. Bever
%A S. Pappe
%A K. Urbschat
%A T. Kunz
%T Development of Communication Software Using the Pass Technique
%P 26-32
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A C. Rieu
%A J.J. Mercier
%A M.C. Vialatte
%T A Tool for Specification and Semi-Automatic Implementation of Communication
Protocols
%P 33-37
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A G. Schulze
%T Office Document Architecture and Its Use in Message Handling Systems
%P 38-43
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J. Palme
%T Extending Message Handling to Computer Conferencing
%P 44-49
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J. Otto
%T Videotext Internetworking; Gateways to the World of Telematics
%P 50-54
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A D. Lampe
%T Transfer Delay Deviation of Packets in ATD Switching Matrices and
Its Effect on Dimensioning A Depacketizer Buffer
%P 55-60
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Mankin
%A K. Thompson
%T Limiting Factors in the Performance of Jacobson's TCP Algorithms
%J Proc. 1989 Winter USENIX Technical Conf.
%C San Diego, California
%I USENIX Association
%D January 30 - February 3, 1989
%X \fBAbstract:\fP
Jacobson and Karels' Slow-start TCP offers an effective approach
to Internet congestion control. Limiting factors for the Slow-start
algorithms were explored by measuring
the performance of the Berkeley 4.3+ Slow-start implementation in
the presence of increasing gateway load.
Two network performance measurement tools, tcptrace and
NETMON/iptrace, were developed for this purpose, and
are available in source-code form from the authors.
The measurements of Slow-start TCP illustrate both the adaptive
range of the algorithms, and also some limitations of the
Slow-start technique of estimating gateway congestion.

%A F. Bernabei
%A M. Listani
%T A Hybrid Switching Exchange for Broadband Communications
%P 61-65
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A I. Cidon
%A I. Gopal
%A G. Grover
%T Memory Requirements for a Fast Packet Switching Node
%P 66-71
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Biocchi
%A M. Carosi
%A M. Listanti
%A G. Pacifici
%A A. Roveri
%A R. Winkler
%T Isochronous and Non-Isochronous Traffic Handling Policies in Infonet
Network
%P 72-77
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A K.S. Kwak
%A R.R. Rao
%T Priority-Based Random Access Networks
%P 78-82
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Mann
%A J. Ruckert
%T A New Distributed Slot Assignment Protocol for Packet Radio Networks
%P 83-88
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A I. Nicholls
%T Data Networks in Air Traffic Services
%P 89-93
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Cohen
%A T. Massart
%A B. Sales
%A P. Van Binst
%T The Helios Project: OSI Conformant, High Speed Data Communication by
Satellite in Europe
%P 94-98
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A W.J. Byrne
%T Survivability of Financial Networks - A Canadian Model
%P 99-103
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A W. Gora
%T Universal Network Monitoring Based on FAN.1
%P 104-114
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A G. Kapetansky
%T Management Experience with a Virtual Circuit LAN/WAN
%P 115-120
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A F.M. Fozdar
%T Network Management on the OPSX MAN
%P 121-126
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M. Ohta
%T Effects of Control Delay and Transmission Delay on Congestion Controls
%P 127-131
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A.D. Bovpoulos
%A A.A. Lazar
%T Decentralized Network Flow Control
%P 139-143
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A Y. Ofek
%T The Partial Optical Hypergraph as a Centralized Switch
%P 132-138
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A K.K. Ramakrishnan
%A J.S. Emer
%T Performance Analysis of Mass Storage Service Alternatives for Distributed
Systems
%J IEEE Trans. Software Engineering
%D February 1989
%V 15
%N 2
%P 120-133
%X \fBAbstract:\fP
In this paper, we consider the performance of alternative mass storage
services for a client-server style distributed system.
Some qualitative arguments are presented on the ramifications of implementations
of mass storage services at various levels of the storage semantics hierarchy.
This paper concentrates, in particular, on contrasting
disk and files services. The functionality of disk and file
services are distinguished by their primitive operations: individual disk
block access, for the disk service; and individual file block access, for the
file service. This difference results in different partitionings of the
computation between the client and server, as well as different network
communication requirements.
To understand the ramifications of such differences
between the services, this paper presents performance estimates for basic
disk and file services.
To provide a commensurate comparison of the performance of the two services,
a uniform closed queueing network model was developed that accurately
portrayed this computation/communication tradeoff.
Detailed parameterization of the model was done through measurements of prototype systems.
The workload applied to the mass storage service is based on measurements
of timesharing systems performed in earlier studies.
In addition to the basic comparisons,
performance estimates for several design alternatives are also presented.
Some of these performance enhancing alternatives were:
caching of file/disk blocks and file-opens, kernel-based services,
and using a network interface able to do \fIgather write\fP to
eliminate data copies.

%T Discuss: An Electronic Conferencing System for a Distributed
Computing Environment
%A Ken Raeburn
%A Jon Rochlis
%A Stan Zanarotti
%A William Sommerfield
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%D January 30 - February 3, 1989
%X \fBAbstract:\fP
As computers and computer networks become commonplace, electronic
communication is rising in importance and utility. The challenge is
to take a large, distributed computing environment and build a system
which allows its users to communicate effectively and efficiently with
each other. This paper compares and contrasts several common types
of electronic communication, focusing on electronic conferencing. We
describe the implementation of such a system, \fIDiscuss\fP, for
the computing environment found at MIT. Issues covered include the
basic model of an electronic meeting, the currently implemented user
interfaces, separation of user interface from underlying operations,
splitting the workload between client and server, communications
issues created by the heterogeneous environment, authentication and
authorization, notification, and unification of the numerous
subordinate UNIX.
libraries into a coherent whole.
The paper next summarizes the \fIDiscuss\fP system's current usage,
then closes with
a discussion of its possible future development.

%A J.-P. Coudreuse
%A W.D. Sincoskie
%A J.S. Turner
%T Guest Editorial
%P 1452-1454
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A T.T. Lee
%T Nonblocking Copy Networks for Multicast Packet Switching
%P 1455-1467
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A P. Newman
%T A Fast Packet Switch for the Integrated Services Backbone Network
%P 1468-1479
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A G.J. Anido
%A A.W. Seeto
%T Multipath Interconnection: A Technique for Reducing Congestion
Within Fast Packet Switching Fabrics
%P 1480-1488
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A A. Pattavina
%T Multichannel Bandwidth Allocation in a Broadband Packet Switch
%P 1489-1499
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A E. Arthurs
%A M.S. Goodman
%A H. Kobrinski
%A M.P. Veechi
%T HYPASS: An Optoelectric Hybrid Package Switching System
%P 1500-1510
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A H.J. Chao
%T Design of Transmission and Multiplexing Systems for Broadband Packet Networks
%P 1511-1520
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A H. Uematsu
%A R. Watanabe
%T Architecture of a Packet Switch Based on Banyan Switching Network
with Feedback Loops
%P 1521-1528
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A M. Devault
%A J.-Y. Cochennec
%A M. Servel
%T The `Prelude' ATD Experiment: Assignments and Future Prospects
%P 1528-1537
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A M. De-Pryker
%T Definition of Network Options for the Belgian ATM Broadband Experiment
%P 1538-1544
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A J.P. Vorstermans
%A A.P. De Vleeschouwer
%T Layered ATM Systems and Architectural Concepts for Subscribers' Premises networks
%P 1545-1555
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A H. Suzuki
%A T. Takeuchi
%A F. Akashi
%A T. Yamaguchi
%T Very High-Speed and High-Capacity Packet Switching for Broadband ISDN
%P 1556-1564
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A A. Bhargava
%A J.F. Kurose
%A D. Towsley
%A G. VanLeemput
%T Performance Comparison of Error Control Schemes in High-Speed Computer
Communication Networks
%P 1565-1575
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A I. Cidon
%A I. Gopal
%A G. Grover
%A M. Sidi
%T Real-Time Packet Switching: A Performance Analysis
%P 1576-1586
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A M.G Hluchyji
%A M.J. Karol
%T Queueing in High-Performance Packet Switching
%P 1587-1597
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A J.Y. Hui
%T Resource Allocation for Broadband Networks
%P 1598-1608
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A H. Ohnishi
%A T. Okada
%A K. Noguchi
%T Flow Control Schemes and Delay-Loss Tradeoff in ATM Networks
%P 1609-1616
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A B.M. Waxman
%T Routing of Multipoint Connections
%P 1617-1622
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988

%A W. Berbiest
%A L. Pinnoo
%A B. Voeten
%T The Impact of the ATM Concept on Video Coding
%P 1623-1632
%J IEEE Jour. Selected Areas in Communications (Special Issue:
Broadband Packet Communications)
%V 6
%N 9
%D December 1988


%T INTEROP\(tm 88 - A Landmark Event in Internetworking
%A Dan Lynch
%P 11-12
%J Computer Communication Review
%V 19
%N 1
%D January 1989

%T Case Diagrams: A First Step to Diagrammed Management Information Bases
%A Jeffrey D. Case
%A Craig Partridge
%P 13-16
%J Computer Communication Review
%V 19
%N 1
%D January 1989

%T The Internet Worm Program: An Analysis
%A Eugene H. Spafford
%P 17-57
%J Computer Communication Review
%V 19
%N 1
%D January 1989

%T The Experimental Literature of the Internet: An Annotated Bibliography
%A Jeffrey C. Mogul
%P 58-71
%J Computer Communication Review
%V 19
%N 1
%D January 1989

%T Network and Nodal Architectures For the Internetworking
Between Frame Relaying Services
%A Wai Sum Lai
%P 72-84
%J Computer Communication Review
%V 19
%N 1
%D January 1989

%T Wiretap: An Experimental Multiple-Path Routing Algorithm
%A David L. Mills
%P 85-98
%J Computer Communication Review
%V 19
%N 1
%D January 1989

%A P.E. Green
%T Evolution to All-Optical Networks
%P 144-148
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A P.R. Prucnal
%A P.A. Perrier
%T A New Direction in Photonic Switching
%P 149-154
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A D. Van-Mierop
%T FDDI - A Sign of Things to Come in Data Communication
%P 155-161
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A U. Mazzei
%A C. Mazzetti
%A R. Parodi
%T Planning Large-Size Public Padcket Networks With High Throughput Nodes
%P 162-166
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M.N. Huber
%A E.P. Rathgeb
%A T.H. Theimer
%T Self Routing Banyan Networks In an ATM-Environment
%P 167-174
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A Y. David
%T Interface Board for PCs Providing SO Interface With Voice and Data
Communications Capabilities
%P 175-180
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A T. Hasegawa
%A H. Horiuchi
%A T. Kato
%A K. Suzuki
%A Y. Urano
%T Automatic ADA Program Generation from Protocol Specifications
%P 181-185
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A O. Takahashi
%A S. Yoshitake
%A S. Kawano
%T Experience With A Remote Conformance Testing System
%P 186-190
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A V. Carchiolo
%A A. Faro
%T BIP System: A Tool for Protocol Verification
%P 191-198
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J.S. Kaufman
%A Y.T. Wang
%T Approximate Analysis of a Simultaneous Resource Possession Problem
%P 199-206
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M. Makpangou
%A M. Shapiro
%T The SOS Object-Oriented Communication Service
%P 207-212
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Nakajima
%T A Hierarchical Process Management for a Processor Pool Network
%P 213-217
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A D.A. Phillips
%T The Social Effects of Computer Communications in Organizations
%P 219-223
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A P.J. Booth
%T Computers and Telecommunications: The Context of Economic and Social
Impacts on the Developing World
%P 224-231
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A F. Ruzic
%T Information Technology Impact on Modern Society From The Videotex View
%P 232-236
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A H.E. Hudson
%T Computer Communications and Development: Policy Issues
in Technology Transfer
%P 237-243
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%J Communications of the ACM
%V 32
%N 1
%D January 1989
%P 3
%A Bryan Kocher
%T A Hygiene Lesson
%X \fBDescription:\fP
Editorial on the Internet worm.

%A J.L. Wang
%A J.A. Silvester
%T Throughput Optimization of the Adaptive Multi-Receiver Selective-Repeat
ARQ Protocols over Broadcast Links
%P 244-250
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A W. Bux
%A P. Kermani
%A W. Kleinoder
%T Performance of An Improved Data Link Control Protocol
%P 251-258
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A N. Shacham
%A B.C. Shin
%T A Selective Repeat ARQ Protocol for Parallel Channels and Its Resequencing
Analysis
%P 259-264
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M.D. Sawchuk
%T Call Management Services
%P 265-268
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J. Pitteloud
%T OSI/Value Added Services: Experiences of a Telecommunication
Administration Based on the Message Handling Service
%P 269-274
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A D. Rosenne
%T Israel's Telecommunications - Present and Future
%P 275-279
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A F.M. Burg
%T X.25: It's Come a Long Way
%P 280-287
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A H.-G. Hegering
%A R. Valta
%T Describing An OSI Network Configuration - Problems and Possible Solutions
%P 288-293
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A H.-G. Hegering
%A E. Botsch
%T A Proposal for An Originator-Oriented Accounting Scheme in OSI-Like
Multinetwork Environments
%P 294-298
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A R. Cohen
%A A. Segall
%T A Distributed Query Protocol for High-Speed Networks
%P 299-302
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A S. Asano
%A Y. Sakai
%A M.H. Choi
%T A Study on High Speed Packet Switching by Self Routing Control
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Albanese
%A L. Fratta
%A L. Strigini
%T A Routing Strategy for Interconnecting High-Speed Metropolitan Area Networks
%P 303-309
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A G. Messina
%A G. Tricomi
%T Robot Network Integration in Automated Factories
%P 310-314
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A H.J. Greenbaum
%A L.W. Weigle
%T The Challenge of Manufacturing Data Networking
%P 315-319
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M. Bosch
%A O. Gihr
%T Simulation of Application Layer Protocols for Factory Automation
%P 320-328
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A R. Popescu-Zeletin
%A B. Btuscher
%A P. Egloff
%A J. Kanzow
%T A Global Architecture for Broadband Communication Systems: The BERKOM Approach
%P 329-336
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel
%X [Ed. Note: Paper also available in \fIProc. Workshop on Future Trends
of Distributed Computing\fP, see January 1989 listing]

%A R.F. Albers
%T Toward Broadband Network Services
%P 337-341
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A P.W. Shumate, Jr
%A J.E. Berthold
%T Progress in Switching Technology for the Emerging Broadband Network
%P 342-344
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A K.E. Nussler
%A D. Runkel
%T Advanced Routing Strategies in a Large Packet Network
%P 345-350
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A T. Uhl
%T Routing in Packet Switching Computer Networks with Different Criteria
%P 351-355
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A Y. Kurachi
%A K. Oya
%A K. Kunimasa
%T Integrated International Communications Network - An Experience With MHS Facsimile
%P 356-360
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A K. Ono
%T Development of Network Architecture and Its Impact on Telecommunication Services
%P 361-362
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M. Rozenbilt
%T A Synchronous Virtual Circuit Network Architecture for Integrated Services
%P 363-367
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A W. Chou
%A S.H. Chao
%A R.V. Kuruppilai
%A J.G. Kneuer
%T A Two Priority Scheme for Packetized Voice
%P 368-372
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A S.R. Treves
%T Broadband Local and Metropolitan Area Networks in an IBCN Environment
%P 373-378
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A P.D. Bloom
%A P. Donnelly
%T A Network Solution for Improved Security for Computer Access
%P 379-382
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A Y. Roze
%A P. Put
%A J-P. Thomas
%T Use of Smart Cards for Security of Access to Transpac Through the Telephone
Network and The ISDN
%P 383-390
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A B. Kowalski
%A K.D. Wolfenstetter
%T Security for Electronic Mail and Telematic Services
%P 391-396
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J.M. Forneau
%A E. Gelebe
%A R. Mazumdar
%T Instability of a Slotted Ring Local Area Network
%P 397-401
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Goyal
%A D.M. Dias
%T Correctness and Access Time Properties of an Extended Token Ring Protocol
%P 402-407
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A R. Shani
%T Fiber Optic IEEE 802.3 CSMA/CD Networks
%P 408-414
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J.M. Jaffe
%A M. Sidi
%T Distributed Deadlock Resolution
%P 434-438
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Orda
%A R. Rom
%T Distributed Shortest-Path Protocols for Time-Dependent Networks
%P 439-445
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A S. Kutten
%T Stepwise Construction of an Efficient Distributed Traversing Algorithm
for General Strongly Connected Directed Networks or: Traversing One
Way Streets With No Map
%P 446-452
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A G. Fantauzzi
%T An OSI Oriented Architecture for Virtual Private Networks Based on
Public Packet Switched Data Facilities
%P 453-457
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A G.W. Arnold
%A J.B. Weinman Jr.
%T A Distributed Applications Architecture for AT&T Manufacturing
%P 458-462
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A B. Goldstein
%A J.M. Jaffe
%A J. Low
%A H. Meleis
%T High Bandwidth Metropolitan Area Networking Architecture
%P 463-469
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A D. Touillet
%T X.400 The Key for New Networking Applications: The Example of Atlas 400
%P 470-475
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M. Matsubara
%T Evolution of CCITT Numbering Plans and Network Interworking
%P 476-481
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A C-H. Rokitansky
%T Internet Cluster Addressing Scheme and Its Application to Public Data Networks
%P 482-491
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A K.A. Bahr
%A M. Giessler
%A J. Rebb
%T Steps Toward a Corporate Network Based on Packet Switching and ISDN
%P 492-496
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A G. Barberis
%A A. Bovo
%A L. Musumeci
%T Integration of ISDN Packet Services in a Distributed Switching System
%P 497-501
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A S. Mariani
%A D. Piazza
%T Data Communication in ISDN
%P 502-506
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A P. Camarda
%A M. Gerla
%T Synthesis of Reliable Double Loop Topologies
%P 507-511
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A A. Herzberg
%T Network Management in the Presence of Faults
%P 512-517
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A J. Spencer
%T The Design of a Resilient Network Concentrator
%P 518-523
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A R. Colcher
%T Data Communications Services and Standards in Brazil
%P 524-527
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A Y.H. Song
%A K.H. Song
%A K.S. Lee
%T The Implementation Activities and Strategies for Value Added Network in Korea
%P 528-532
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A T. Soga
%A S. Fujiwara
%A T. Kawahara
%T NTT-PCN: Development and Operation
%P 533-537
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A R. Caldarella
%A L. Santagostino Barbone
%A L. Musumeci
%T Narrowband Packet Services in the Linea UT Exchanges for The Italian ISDN
Pilot Service
%P 538-542
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A B. Litofsky
%A W.R. Moe
%A J.S. Sykes
%T International Switched Digital Service at 64 Kbit/s
%P 543-548
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A H. Choi
%A Y. Back
%A K. Lee
%A N. Lee
%A Y. Choi
%T Specification and Testbed Implementation for CCITT No. 7 Signalling
System in Korea
%P 548-552
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M.D. Abrams
%A S.I. Schaen
%T LAN Security: A Case Study
%P 553-557
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel
%X \fBAbstract:\fP
This paper presents the results of a study of data communications
security in a hypothetical organization.  Issues addressed include
threats, such as disclosure, message stream modification, and denial of
service; authentication; access controls; and communications security.
Risk management is emphasized.

%A A.E. Karbowiak
%A G. Anido
%A S.Z. Wang
%T A Fully Distributed LAN Capable of Supporting Voice and Data - Laboratory
Studies of XLNET
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A Y. Sun
%A M. Berla
%T A Virtual Data Queue Access Scheme For Integrated LANs
%P 558-562
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A M. Lesk
%A T. Mouton
%T CREDO HG: A Graphical Tool for Data Networking Planning
%P 563-567
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%A I.W. Cotton
%T Planning for Local Area Networks
%P 568-576
%J Proc. 9th Intl. Conf. Computer Communication
%I Elsevier Science Publishing Company
%E J. Raviv
%D October 30-November 4, 1988
%C Tel Aviv, Israel

%T Distributed System Software Design Paradigm with Application to Computer
Networks
%A Norman F. Schneidewind
%J IEEE Transactions on Software Engineering
%D April 1989

%A Internet Activities Board
%T Ethics and the Internet
%J Internet Request for Comments
%N 1087
%D January 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo is a statement of policy by the Internet Activities Board
(IAB) concerning the proper use of the resources of the Internet.

%A David B. Holden
%T Predictive Languages for Management
%J First Intl. Symp. Integrated Network Management (IFIP TC6/WG 6.6)
%E B. Meandzija and J.A. Westcott
%C Boston, Massachusetts
%D May 14-17, 1989
%I North Holland
%X \fBAbstract:\fP
The difference between a system manager and  someone who
maintains software is not great in small computer systems; while
in large systems, there are often a large number of people
needed to support the system. With the advent of large distributed
 systems created by interconnecting large numbers of small
systems, the problems of managing the large system are being
forced onto the small system managers.  This paper highlights
the issues, and shows how extensible languages, and the use of
predictive methods can overcome the problems in the field of
distributed systems management.

%T A UNIX Implementation of the Simple Network Management Protocol
%A Wengyik Yeong
%A Martin Lee Schoffstall
%A Mark S. Fedor
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%D January 30 - February 3, 1989
%X \fBAbstract:\fP
The many choices in network products available today from a diversity of
vendors clearly indicates the need for a single, non-proprietary solution
to the problem of managing all the entities in the existing TCP/IP
Internet. The Simple Network Management Protocol (SNMP) is a
solution to the network management needs of Local Area Networks, as
well as the greater Internet.
.sp 0.5
This paper describes the design and implementation of software conforming
to the SNMP for computer systems running Berkeley 4.2/4.3 and related
operating systems. The implementation described herein includes
all software necessary for the management of machines running such
operating systems: a network management station for UNIX, and an SNMP
agent (server) intended to run on similar systems.

%A Rainer Handel
%T Evolution of ISDN Towards Broadband ISDN
%P 7-14
%J IEEE Network
%V 3
%N 1
%D January 1989

%A Jerry Gechter
%A Peter O'Reilly
%T Conceptual Issues for ATM
%P 14-16
%J IEEE Network
%V 3
%N 1
%D January 1989

%A Michael J. Rider
%T Protocols for ATM Access Networks
%P 17-22
%J IEEE Network
%V 3
%N 1
%D January 1989

%A William R. Byrne
%A Toomas A. Kilm
%A Bruce L. Nelson
%A Marius D. Soneru
%T Broadband ISDN Technology and Architecture
%P 23-28
%J IEEE Network
%V 3
%N 1
%D January 1989

%A Anthony S. Acompora
%A Mark J. Karol
%T An Overview of Lightwave Packet Networks
%P 29-41
%J IEEE Network
%V 3
%N 1
%D January 1989

%T Experience With PARPC
%A Bruce Martin
%A Charles Bergan
%A Walter Burkhard
%A Jehan-Francois Paris
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%P 1-12
%D January 30 - February 3, 1989
%X \fBAbstract:\fP
PARPC provides an
interprocess communication mechanism based on the semantics of
a procedure call.
PARPC programs always execute a single logical
thread of control but may execute multiple physical threads of control.
PARPC provides users with a well defined,
high level network process model
of execution and a familiar program development model supporting heterogeneous, non-uniform environments.
The administrative overhead of PARPC is minimal because
users administer
their own distributed programs and existing UNIX mechanisms for access
control and resource accounting are utilized.
Our experiences indicate that PARPC has been an effective system for the
development and administration of distributed programs.

%A Geoffrey M. Lee
%T Integrating UNIX Terminal Services into a Distributed Operating System
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%D January 30 - February 3, 1989
%P 29-42
%X \fBAbstract:\fP
One solution to the problem of integrating the terminal services of a
UNIX host into a distributed operating system is to implement the distributed
operating system as a guest layer in UNIX and then to add a software interface
that runs on the host and translates between the terminal services of the host
and the distributed operating system.  Such an interface was implemented at
the Lawrence Livermore National Laboratory.  Design issues and decisions
that preceded software development are discussed, followed by details of
software operation.  Development experiences that would be applicable to a
similar effort are described.

%T The Automounter
%A Brent Callaghan
%A Tom Lyon
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%D January 30 - February 3, 1989
%P 43-51
%X \fBAbstract:\fP
This paper describes the automounter - an automatic filesystem mounting
service distributed with Sun Microsystems version of the Unix,
operating system (SunOs). The automounter detects access to remote
filesystems and mounts them on demand. This action is transparent to
users and programs. Automounted filesystems are automatically
unmounted after a period of inactivity. The map files that control the
automounter can specify multiple locations for filesystems replicated
across a network and can describe mount hierarchies. Automount maps
can be administered on a single machine through local files or across a
Yellow Pages domain.

%T Improving the Performance and Correctness of an NFS Server
%A Chet Juszczak
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%D January 30 - February 3, 1989
%P 52-64
%X \fBAbstract:\fP
The Network File System (NFS) utilizes a stateless
protocol between clients and servers; the major
advantage of this statelessness is that NFS crash
recovery is very easy. An NFS client simply con-
tinues to send a request until it gets a response
from the server. However, this client retry model
also has disadvantages: a server can receive mul-
tiple copies of the same request. The processing
of duplicate requests is an expense of server
effort that is better spent elsewhere. Worse than
that, it can result in incorrect results.  This
paper describes a work avoidance technique that
utilizes a cache on the server to avoid the need-
less processing of duplicate client requests. An
implementation of this technique has resulted in a
significant increase in server bandwidth. A bene-
ficial side effect is that it can help avoid the
destructive  re-application  of  non-idempotent
operations. It can be used in any NFS server
implementation, requires no client modifications,
and in no way violates the NFS crash recovery
design.

%T Viral Attacks on UNIX\(rg System Security
%A Tom Duff
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%P 165-172
%D January 30 - February 3, 1989
%X \fBAbstract:\fP
Executable files in the Ninth Edition of the UNIX system contain small amounts of
unused space, allowing small code sequences to be added to them
without noticeably affecting their functionality. A program fragment
that looks for binaries and introduces copies of itself into their slack
space will transitively spread like a virus. Such a virus program could,
like the Trojan Horse, harbor Greeks set to attack the system when run by
sufficiently privileged users or from infected set-userid
programs.
.sp 0.5
The author wrote such a program (without the Greeks)
and ran several informal experiments to test its characteristics. In one
experiment, the code was planted on one of Center 1127's computers and
spread in a few days through the Datakit\(rg network to about forty machines.
The virus escaped during this test onto a machine running an experimental
secure UNIX system, with interesting (and frustrating for the system's developers)
consequences.
.sp 0.5
Viruses of this sort must be tiny to fit in the small amount of space available,
and consequently are very timid. There are ways to construct similar viruses
that are not space-constrained and can therefore spread more aggressively and
harbor better-armed Greeks. As an example, we exhibit a frighteningly virulent
portable virus that inhabits shell scripts.
.sp 0.5
Viruses rely on users and system administrators being insufficiently vigilant
to prevent them from infiltrating systems. I outline a number of steps that
people ought to take to make infiltration less likely.
.sp 0.5
Numerous recent papers have suggested modifications to the UNIX system kernel
to interdict viral attacks. Most of these are based on the notion of
`discretionary access controls.' These proposals cannot usually be made
to work, either because they make unacceptable changes in the `look and
feel' of the UNIX system's environment or they entail placing trust in code that
is inherently untrustworthy. In reply to these proposals, I suggest a small
change to the UNIX system permission scheme that may be able to effectively interdict
viral attacks without serious effect on the UNIX system's functioning and habitability.

%T The Shared Memory Server
%A Alessandro Forin
%A Joseph Barrera
%A Richard Sanzi
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%P 229-244
%D January 30 - February 3, 1989

%T A Trusted Network Architecture for AIX Systems
%A Chii-Ren Tsai
%A Virgil D. Gligor
%A Wilhelm Burger
%A Mark E. Carson
%A Pau-Chen Cheng
%A Janet A. Cugini
%A Mathew S. Hecht
%A Shau-Ping Lo
%A Sohail Malik
%A N. Vasudevan
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%D January 30 - February 3, 1989
%P 457-471

%A Donn Seeley
%T A Tour of the Worm
%J Proc. 1989 Winter USENIX Technical Conf.
%I USENIX Association
%C San Diego, California
%D January 30 - February 3, 1989
%P 287-304
%X \fBAbstract:\fP
On the evening of November 2, 1988,
a self-replicating program was released upon the Internet.
This program (a \fIworm\fP) invaded VAX and Sun-3 computers
running versions of Berkeley UNIX and used their resources to attack
still more computers.  Within the space of hours this program had
spread across the U.S., infecting hundreds or thousands of computers and
making many of them unusable due to the burden of its activity.
This paper provides a chronology for the outbreak
and presents a detailed description of the internals of the worm,
based on a C version produced by decompiling.

%A Guru Parulkar
%A Jon Turner
%T Towards to a Framework for High Speed Communication in
Heterogeneous Networking Environment
%J Proc. IEEE INFOCOM '89
%C Ottawa, Ontario, Canada
%D April 23-27, 1989
%X \fBAbstract:\fP
In this paper we attempt to formulate a framework for high speed
communication in an environment comprising a mix of subnetworks with
widely varying characteristics. Recent work on high speed wide area
packet switching systems is expected to lead to the development of
large public networks capable of supporting applications ranging from
low speed data to voice, high speed data and video. If such networks
are to realize their full potential, they must be designed to operate
in an environment that includes networks with widely varying
characteristics. Since the early seventies, much of the work on
computer communication has been directed toward the development of
protocols that allow interworking among computers, operating systems
and communication subnetworks of different types. These efforts have
culminated in the Arpa Internet Protocol Suite which has introduced
a number of ideas of fundamental importance.
.sp 0.5
Since the development of the internet protocols, the technological
context in which we find ourselves has changed dramatically. The
development of high speed LANs and workstations, and the growing
role of supercomputers in scientific computing have led to new and
largely unfulfilled requirements for high speed computer
communication. These needs have been difficult to satisfy for a
combination of reasons. First, existing wide-area computer networks
have been unable to support the data rates required and second, the
existing end-to-end protocols and host computers are unable to deliver
the data to the application at those rates.
.sp 0.5
On the other hand, fiber optic transmission systems are being
introduced rapidly into the national communications infrastructure
offering vast amounts of bandwidth at fairly modest costs. Several
research groups at industrial and academic laboratories around the
world have demonstrated that new high speed packet switching
techniques can make these resources available in a flexible fashion,
but up to now these groups have failed to consider the need to operate
in a complex networking environment consisting of autonomous and/or
technologically dissimilar subnetworks. We feel that it is important
to recognize that this kind of heterogeneous environment is here to
stay and if we are to make the best possible use of new developments
in networking, we need to establish a framework that supports such
diversity.
.sp 0.5
In this paper we attempt to address these issues. We first provide
some background on both the current internet model and high speed
packet switching. We then outline the major elements of an extended
internet model that allows interworking of new high speed packet
networks with a wide range of other networks, including current data
networks and national telephone networks. Finally, we discuss some
end-to-end and host interface issues.

%A J.-C. Liu
%A K.G. Shin
%T Polynomial Testing of Packet Switching Networks
%P 202-217
%J IEEE Trans. Computers
%V 38
%N 2
%D February 1989

%A J.E. Wieseltheir
%A A. Ephremides
%A L.A. Michaels
%T An Exact Analysis and Performance Evaluation of Framed ALOHA with Capture
%P 125-137
%J IEEE Trans. Communications
%V 37
%N 2
%D February 1989

%A G. Agha
%T The Relation between Problems in Large-Scale Concurrent Systems and
Distributed Databases
%P 2-12
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
We first describe the state of the art in models of
concurrency.  The models are analyzed along two dimensions: communication
and computation.  The paper then discusses some problem which make it
difficult to realize large-scale concurrent systems.  Such problems
include compositionality, heterogeneity, debugging,
resource management, and concurrent control.  Some useful comparisons
are drawn to problems in distributed databases and it is argued that
solutions to these problems cross disciplinary boundaries.  Finally,
the paper discusses trends in building concurrent computers and provides
some expectations for the future.

%A R.A. Lerner
%T Reliable Servers: Design and Implementation in Avalon/C++
%P 13-21
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
Avalon/C++ is a programming language that supports the construction of
reliable programs consisting of a set of servers communication of
a network.  It provides high-level language support for user-defined
data types with customized synchronization and fault-tolerance properties.
These data types are encapsulated ins servers, and accessed through
exported server operations.  Avalon/C++ greatly simplifies the
programming of these servers by hiding the distributed nature of a server
from both the implementor and callers of a server.  Avalon/C++ exploits
the similarity of servers and classes, making server definition and use
look like that for C++ classes.  A detailed description is given of
a typically Avalon/C++ server, the catalog server, which is used by
clients to locate servers.

%A J.A. Brumfield
%A J.L. Miller
%A H.-T. Chou
%T Performance Modeling of Distributed Object-Oriented Database Systems
%P 22-33
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
A simulation model has been designed to evaluate the performance of
distributed object-oriented database systems.  By adjusting parameters,
a variety of different hardware configurations and workloads can be
represented.  The model has been used to study a number of performance
issues relating to ORION-2, a distributed object-oriented database
system being developed by the Advanced Computer Architecture program
at MCC.  Experiments show that the central server or the local
area network can be a performance bottleneck.

%A X. Wang
%A W.S. Luk
%T Parallel Join Algorithms on a Network of Workstations
%P 87-96
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
We propose a non-traditional system architecture for backend database
processing, i.e. a network of workstations.  By moving data dynamically
to otherwise idle workstations over a local area network, a high
degree of processing parallelism could be achieved through load sharing.
In this paper, three load sharing join algorithms are developed and implemented
on a network of Sun workstations.  These join algorithms are designed on
the basis of different assumptions, e.g. , whether indicies are available
and whether join result is required to be sorted.  Based on the analytical
results and empirical performance data for each
algorithm, we are able to show that the load sharing strategy in each
case is an effective method to achieve processing speedups.
However, the network bandwidth of 10Mbits/second becomes a bottleneck,
when more than a dozen or so workstations are deployed, which
indicates that a higher bandwidth network is
needed for further improvement in performance.

%A S. Bandyopadhyay
%A A. Sengupta
%T A Robust Protocol for Parallel Join Operation in Distributed Data Bases
%P 97-106
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
Fault tolerant distributed databases use replicated data (e.g., record
or relation) to handle failures of one or more nodes in a computer network.
Efficient and economic access strategies for such data bases have not
been investigated.  In this paper, the binary hypercube, a popular
model for fault tolerant interconnection networks has been studied.
It has been shown that, for a local area network based on a binary
hypercube, having \fI2\u\s-2r\s0\d\fR nodes where every data
is replicated \fIr\fP times, in the absence of faults, any
query involving an arbitrary sequence of joins \fIR\d\s-2\1\s0\u \(mu
R\d\s-2\2\s0\u \(mu ... R\d\s-2n\s0\u\fP, \fIn \(<= r\fP, may
be performed by repatedly executing joins in a distributed fashion
using \fIn\fP node disjoint paths from \fIn/2\fP distinct sites of
database operations to \fIn\fP arbitrary sites containing a target
relation each.  This protocol also solves the problem of faults,
the protocol still guarantees N node disjoint paths to arbitrary sites.
The value of N is determined by the number of faulty nodes.

%A P. Agrawal
%A D. Bitton
%A K. Guh
%A C. Liu
%A C. Yu
%T A Case Study for Distributed Query Processing
%P 124-130
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBExcerpt:\fP
Very few distributed database systems implement a truly distributed query
processing strategy.  In this paper, we report a case study of
an experimental distributed database system that we implemented on
top of SunIngres, in a network of Sun 3/50 workstations connected
by an Ethernet.

%A P. Bodorik
%A J.S. Riordan
%T Heuristic Algorithms for Distributed Query Processing
%P 144-157
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
This paper examines heuristic algorithms for processing distributed
queries using generalized joins.  As this optimization is NP-hard,
heuristic algorithms are deemed to be justified.  A heuristic algorithm
to form/formulate strategies to process queries is presented.  It has
a special property in that its overhead can be ``controlled.''
The higher its overhead the better the strategies it produces.
Modeling on a test-bed of queries is
used to demonstrate that there is a trade-off between the strategy's
execution and formulation delays.  The modeling results also support
the notion that simple greedy heuristic algorithms such as are
proposed by many researchers are sufficient in that they are likely to
lead to near-optimal strategies and that increasing the overhead
in formulating strategies is only marginally beneficial.  Both the
strategy formulation and the execution delays are examined in relation
to the number of operations specified by the strategy and the total size
of partial results.

%A H. Garcia-Molina
%A B. Kogan
%T Node Autonomy in Distributed Systems
%P 158-167
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
The goal of this paper is to explore the notion of node
autonomy in distributed computer systems.  Some motivations for
autonomy are exposed.  Different facets of autonomy as well as
relationships among them are discussed. Finally, we look into
how autonomy affects other aspects of distributed computing, including
timeliness, correctness, load sharing, data sharing, and data replication.

%A E. Kuhn
%A T. Ludwig
%T VIP-MDBS: A Logic Multidatabase System
%P 190-201
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
We present a multidatabase management system built in Vienna Integrated
Prolog (VIP) for cooperative management of autonomous databases.
Data in different databases may differ with respect to naming, structures
and value types.  VIP-MDBS (VIP MultiDataBase System) allows the
ability to manipulate them jointly and in a non-procedural way.
Its features are similar to those of the relational multidatabase
language MSQL, but adapted to logic programming.  We introduce the
concept of so-called semantic relations, a concept which stems from
the extension of global views by deductiveness. VIP-MDBS allows for
representation of intentional data and formulation of recursive multiple
queries.

%A Y.-H. Lee
%A P.S. Yu
%A A. Leff
%T Robust Transaction Routing in Distributed Database Systems
%P 210-220
%J Proc. Intl. Symp. Databases in Parallel and Distributed Systems
%I IEEE Computer Society Press
%D December 5-7, 1988
%C Austin, TX
%X \fBAbstract:\fP
In this paper, we examine the issue of robust transaction routing
in distributed database systems.  A class of dynamic routing
strategies which use estimated response times to make routing
decisions is studied in details.  Since response time estimation
and decision making depend on the assumed transaction model
and parameters, it is important to examine the robustness of
sensitivity to the inaccuracy in the assumptions and parameter
values.  Through simulations, we find that the dynamic
routing strategy based strictly on response time is too aggressive
in sharing loads and makes too many non-preferred system routings.
It is robust with respect to change in the number of
database calls per transaction, but is relatively sensitive to the distribution
of database calls.  Two refinements are proposed which
improve system performance as well as robustness of routing decisions.

%A J.O. Onunga
%A R.W. Donaldson
%T Personal Computer Communications on Intrabuilding Power Line
LAN's USing CSMA with Priority Acknowledgements
%P 180-191
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A S.T. Vuong
%A A.H.T. Ma
%T A Low-Cost and Portable Local Area Network For Interconnecting PC's
Using Electric Power Lines
%P 192-201
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A J.S.J. Chen
%A V.O.K. Li
%T Reservation CSMA/CD: A Multiple Access Protocol for LAN's
%P 202-210
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A E. Friedman
%A C. Ziegler
%T Packet Voice Communications Over PC-Based Local Area Networks
%P 211-218
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A M. Aicardi
%A F. Davoli
%A A. Giordano
%T Radio_ISA_Net: A Single-Hop Centralized Packet Radio Network for
PC-to-Mainframe Interconnection
%P 219-226
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A R.J. Diersing
%A J.W. Ward
%T Packet Radio in the Amateur Satellite Service
%P 226-234
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A T.T. Ha
%T Personal Computer Communications Via VSAT Networks
%P 235-245
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A J.A. Copeland
%T Data Compression Technique for PC Communications
%P 246-248
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A R. Cole
%A J. Burns
%T An Architecture for a Mobile OSI Mail Access System
%P 249-256
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A S.E. Hauser
%A M.I. Felsen
%A M.J. Gill
%A G.R. Thoma
%T Networking AT-Class Computers for Image Distribution
%P 268-276
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A R.E. Blumberg
%A D.H. Walters
%T A PC-Based Multimedia Document Manager
%P 283-290
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A E. Okamoto
%A K. Tanaka
%T Identity-Based Information Security Management System for Personal Computer
Networks
%P 290-294
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A M.H.G. Willems
%T Design of a PC Interface Card for Office Communications Using the ISDN Basic
Access
%P 295-302
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A R.E. Felderman
%A E.M. Schooler
%A L. Kleinrock
%T The Benevolent Bandit Laboratory: A Testbed for Distributed Algorithms
%P 303-311
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A W. Burger
%T Networking of Secure Systems
%P 312-318
%J IEEE Jour. Selected Areas in Communications
%D February 1989
%V 7
%N 2

%A Mark W. Eichlin
%A Jon A. Rochlis
%T With Microscope and Tweezers: An Analysis of the Internet
Virus of November 1988
%J Proc. 1989 IEEE Symp. on Research in Security and Privacy
%X \fBAbstract:\fP
In early November 1988 the Internet, a collection of networks
consisting of 60,000 host computers implementing the TCP/IP protocol
suite, was attacked by a virus, a program which broke into computers
on the network and which spread from one machine to another.  This
paper is a detailed analysis of the virus program itself, as well as
the reactions of the besieged Internet community.  We discuss the
structure of the actual program, as well as the strategies the virus
used to reproduce itself. We present the chronology of events as seen
by our team at MIT, one of a handful of groups around the country
working to take apart the virus, in an attempt to discover its secrets
and to learn the network's vulnerabilities.
.sp 0.5
We describe the lessons that this incident has taught the Internet
community and topics for future consideration and resolution.  A
detailed routine by routine description of the virus program including
the contents of its built in dictionary is provided.
[\fIEd. Note\fP: A version of this paper is available on line in Postscript
form as @bitsy.mit.edu:pub/virus/mit.PS]

%A J.C. Shu
%A Ming T. Liu
%T A Synchronization Model for Protocol Conversion
%J Proc. INFOCOM '89
%D April 24-27, 1989
%C Ottawa, Canada
%X \fBAbstract:\fP
Protocol conversion is to resolve the incompatibility between protocols
so that users on different networks can communicate with each other.
This paper presents a formal model to analyze
two aspects of conversion problems: translation and synchronization.
The purpose of the translation is to map messages in one protocol to those in
another protocol, whereas the synchronization is
to hold matched messages for carrying out the translation.
An algorithm is then given to construct a valid converter.
The algorithm itself is low in space complexity,
and yields a converter with several merits: concurrent processing,
easy debugging, minimum work on development,
and easy implementation for half-gateways.

%A I-En Liao
%A Ming T. Liu
%T Incremental Protocol Verification Using Deductive Database System
%J Proc. Fifth Intl. Conf. on Data Engineering
%D February 1989
%X \fBAbstract:\fP
Reachability analysis has been widely used in validating and verifying
communication protocols; however, it is incapable of
expressing the verification
procedure elegantly, and it also suffers from
the state space explosion problem. A new approach
using the relational database system due to Lai and Lee
does alleviate the above problems.
In this paper, we first incorporate the predicate logic into the
relational algebraic approach
so that the recursive definitions are permitted and
different functional properties of a protocol can be proved by providing users
with a uniform query interface.
Next, we apply our approach to incremental verification,
which allows for a complex protocol to be verified incrementally.
Our scheme is intended to cut down the verification time by saving the
explored global-state transitions in the database so that whenever the
specification is modified and the verification needs to be performed again,
only a small portion of the database will be updated without regenerating
all the global states from the initial state.

%A P.-Y. M. Chu
%A Ming T. Liu
%T Global State Graph Reduction Techniques for Protocol Validation
%J Proc. IEEE Eighth Intl. Phoenix Conf. on
Computers and Communications (PCCC '89)
%D March 1989
%X \fBAbstract:\fP
The Extended Finite State Machine (EFSM) model has been widely accepted and
used as the underlying model for many existing protocol specification
languages.  In the EFSM model, the behavior of each protocol entity is
described as an Finite State Machine (FSM), and a set of context variables
declared for the entity may be accessed during state transitions.  One of the
most severe difficulties in using reachability analysis for protocol validation
in the EFSM model is the global state explosion problem. The problem is caused
in part by a wide range of possible values that could be taken on by a context
variable.  To alleviate the effect of context variables on the global state
explosion problem, two global state graph reduction techniques are proposed
in this paper.  In the first reduction technique, we define a global state
equivalence based on dead variable sets as studied in the area of program
flow analysis.  The global state graph is then generated taking the global
state equivalence into consideration.  An upper bound for the effect of the
first reduction technique on the reduction of the global state graph is shown
to demonstrate how the first reduction technique may best perform.
Finally, the second reduction technique based on a similar reasoning is derived
to complement the first reduction technique.

%A P.-Y. M. Chu
%A Ming T. Liu
%T Protocol Synthesis in a State-Transition Model
%J Proc. IEEE COMPSAC '88
%P 505-512
%D October 1988
%X \fBAbstract:\fP
Two inherently different approaches to ensuring the correctness of
computer-communication protocols are analysis and synthesis.
The synthesis approach has the advantage over the analysis approach in
aiding the protocol designer to reduce the possibility of making errors,
if not to prevent it totally, during the protocol construction process.
In this paper we propose a protocol synthesis method in which both service
and protocol specifications are based on a state-transition model.
We present an algorithm for deriving the protocol specification
from a given service specification, which is described by a set of
directly coupled Finite State Machines (FSMs).  These FSMs together regulate
the execution sequence of service primitives intended by the service
specification.  To complement the protocol derivation algorithm for
dealing with erroneous channels, we also devise a transformation procedure
to construct an error-recoverable protocol from its error-free version that is
generated from the proposed algorithm.

%A R. Callon
%A H.W. Braun
%T Guidelines for the use of Internet-IP addresses in the ISO
Connectionless-Mode Network Protocol
%J Internet Request for Comments
%N 1069
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC suggests an addressing scheme for use with the ISO
Connectionless Network Protocol (CLNP) in the Internet.  This is a
solution to one of the problems inherent in the use of ``ISO-grams'' in
the Internet.  This memo is a revision of RFC 986.  This RFC suggests
a proposed protocol for the Internet community, and requests
discussion and suggestions for improvements.

%A R. Hagens
%A N. Hall
%A M. Rose
%T Use of the Internet as a Subnetwork for Experimentation with
the OSI Network Layer
%J Internet Request for Comments
%N 1070
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC proposes a scenario for experimentation with the
International Organization for Standardization (ISO) Open Systems
Interconnection (OSI) network layer protocols over the Internet and
requests discussion and suggestions for improvements to this scenario.
This RFC also proposes the creation of an experimental OSI internet.
To participate in the experimental OSI internet, a system must abide
by the agreements set forth in this RFC.

%T A Standard for the Transmission of IP Datagrams over NetBIOS networks
%A L. McLaughlin
%J Internet Request for Comments
%N 1088
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This document specifies a standard method of encapsulating the
Internet Protocol (IP) datagrams on NetBIOS networks.

%A Pietro Schicker
%T Message Handling Systems, X.400
%P 1-20
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
The CCITT X.400 series recommendations of 1988 differ in
appearance drastically from those of 1984.  Although the model,
on which the definitions are based, remains basically the same,
subtle extensions were necessitated by the increase of
functionality in the message handling services.
.sp 0.5
The most apparent change from 1984 to 1988 lies in the
structure of the application (in the OSI sense).  This
modification is due to the fact that ISO has progressed work on
the definition of the application layer structure and CCITT
followed in their 1988 recommendations this new development.
.sp 0.5
A large number of service elements have been added to the
recommendations many of which reflect the new functionality
(e.g., postal delivery, distribution lists, secure messages,
etc.).  In the annex, a complete list of all service elements
as defined in X.400 is given.

%A Jon Stranger
%T UK Government OSI Profile (GOSIP)
%P 21-20
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper gives an overview of the scope and taxonomy of the
UK Government OSI Profile (GOSIP), with particular reference to
the subprofiles covering X.400, ODA and EDI.  The relationships
with functional standards and other profiles are considered and
several outstanding issues which are of concern to the use of
GOSIP in procurement are discussed.

%A Bernhard Plattner
%A Hannes Lubich
%T Electronic Mail Systems and Protocols Overview and Case Study
%P 31-74
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper discusses electronic mail systems and protocols used
in the academic world today.  Since the mail protocol which is
currently used in the US Internet (RFC 822) will only gradually
be replaced by the internationally standardized protocol (X.400),
electronic mail systems will continue to use gateways to
achieve full interconnectivity.  Therefore we describe problems
and solutions associated with internetworking, i.e. gateway
functionality, and focus on address translation.  We present
the approaches taken in mapping electronic mail addresses of
the two protocol worlds and use the architecture of the
electronic mail service in the Swiss Academic and Research
Network (SWITCH) as an illustration.

%A Susan Klein Lebeck
%T Implementing MHS: 1984 versus 1988
%P 75-88
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
The author has written a message handling system for the Unix
RT/4.3 environment conforming to the CCITT X.400 1984 series of
recommendations.  This effort uncovered several problems with the
current standard due to design issues that were explicitly or
implicitly left as ``a local matter.''  These issues include
availability of a destination machine for accepting delivery,
automatic actions triggered by message delivery, loop suppression
and detection, directory services, distribution list handling,
mailbox structure, representation of mailbox addresses on
external media, and message routing.  A draft of a new standard
has recently been distributed that offers more advice in most
of these areas, leaving only external address representation
and message routing unspecified.  We discuss problems with the
1984 standard from an implementor's point of view and consider
the extend to which the 1988 standard solves them, illustrating
as appropriate with strategies we chose for our implementation.

%A S.E. Kille
%T PP - A Message Transfer Agent
%P 89-102
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper describes the design and implementation of PP, which
is an advanced system for provision of Message Transfer Services.
The following features are of particular notes:
.sp 0.5
.in +0.2i
- Support for a wide range of encoded information types, and for
conversion between them.
.sp 0.5
-  Support for different Message Transfer Protocols, and
conversion between them.
.sp 0.5
-  Robustness and efficiency for use in large scale service
environments.
.br
.in -0.2i
.sp 0.5
This paper describes the approaches to achieve these features,
and considers how they could be used as a basis for future
services and research.  PP will be released into public domain,
as a part of the ISODE Package [1].

%A A.M. Shivji
%A N.K. Koorland
%T Implementing X.400 Gateways - Identifying the Issues
%P 103-114
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
Despite the growing acceptance of the CCITT X.400-series of
Recommendations for Message Handling Systems, non-X.400 mail
systems remain in widespread use, necessitating the
implementation of gateways.  As a contribution to providing a
framework for the design and implementation of X.400 gateways,
this paper identifies a set of common issues that arose in the
implementation of gateways to three non-X.400 Mail Systems:
IBM's PROFS, Telenet's Telemail, and RFC 822-based systems.

%A Steve Benford
%T Navigation and Knowledge Management within a Distributed
Directory Service
%P 115-134
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper is concerned with the routing of operations within a
distributed directory service.  The goal of this work is to
explore and solve problems which occur when the Directory
Information Tree is physically distributed among server
applications  (called Directory System Agents (DSA's)) which
cooperate to provide the directory service.
.sp 0.5
The paper proposes a distributed directory model describing the
knowledge required by DSAs in order to route operations to the
correct point within the distributed system.  This model
specifies the knowledge required to guarantee and then optimize
the navigation process as well as mechanisms for maintaining this
knowledge and detecting and correcting inconsistencies which
may occur as a result of directory reconfiguration.

%A Meichun Hsu
%A Va-On Tam
%T Transaction Synchronization in Distributed Shared Virtual Memory Systems
%R TR-05-89
%I Havard University, Center for Research in Computing Technology
%C Cambridge, Massachusetts
%D January 1989

%A Christian Huitema
%A Anne-Marie Bustos
%T Using A Standard Directory As A Name Server Within The Thorn Project
%P 135-144
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
The THORN project aims at implementing a distributed directory
service, that will be useful for the substitution of name servers
and the management of several types of applications, e.g. the
group communications or the network administration.  It must
follow the friendly aspect that exists for instance in the
directory service of the French ``Minitel'', and also the
international standards that are settling down.  The work began
in 1985, using an ECMA defined protocol and we have implemented a
first directory service prototype.  During the last year, ISO and
CCITT have published several successive drafts of the directory
standard.  The situation is now stabilizing and the final objects
of the THORN directory service is to implement an absolutely
standard directory service.

%A S.E. Kille
%T The QUIPU Directory Service
%P 145-158
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
The QUIPU Directory Service is an early implementation of the OSI
Directory Service, which is being made available in the
public domain as a part of the ISODE package.  It is intended
as a lightweight implementation to facilitate experimentation
with Directory Services.  The paper gives an overview of some
aspects of the design of QUIPU:
.sp 0.5
.in +0.2i
- The memory based approach of the QUIPU DSA.
.sp 0.5
-  The DSA internal structure.
.sp 0.5
-  Extensions to the OSI Directory in order to support Access
Control and Schema.
.br
.in -0.2i
.sp 0.5
The discussion of using QUIPU then shows the QUIPU can be used by
other applications, and some early experience with this is
described.  Finally, a discussion of future work with QUIPU is
given.

%A James M. Galvin
%T Privacy Without Authentication
%P 159-175
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
Maintaining the security of private information as it is
transferred from one use to another should be a necessary and
fundamental requirement of electronic communications.
Unfortunately, users are typically surprised to learn how
easily others can access their private information.  Plans to
automate office environments rarely include the handling of
sensitive information.  The existence of a communication path
between one or more computers can be a breeding ground of
information insecurity.
.sp 0.5
A unique solution to the problem of securing a form of electronic
communication, mail, is presented.  The solution is unique
because ``security'' in this context includes only privacy, not
authentication, i.e., the messages that are exchanged will be
private with respect to the peers, but the peers will be
guaranteed they know each others' identity.

%A Tibor Gyires
%T Distributed Problem Solving Network with Uncertainty
%P 175-187
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
In a distributed problem-solving network (DPSN) a complex task is
decomposed into smaller subtasks with lesser complexity which are
to be distributed among different autonomous processors for
execution.  Each processor accommodates its own knowledge base
relevant to the execution of some tasks and has only a limited
view of the global system.  To avoid bottlenecks and increase
efficient task execution control and data are also distributed
along with the tasks.  Due to the partial knowledge and limited
capabilities of nodes or varying availability of
hardware/software resources the task is accepted with an
uncertainty estimated by the processor.
.sp 0.5
We discuss a procedure that specifies a method of distribution of
tasks and the selection  of the most appropriate processors for
the cooperative execution of those based on quantitative
measurements taking into account the experience of former
interactions between processors.

%A Manuel Medina
%A Jaime Delgado
%T Using of the Abstract Service Definition Conventions for
Distributed Information Processing Systems Specification
%P 187-202
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
After a brief introduction, the paper explains the use of the
Abstract Service Definition Conventions as a tool to describe
Distributed Information Processing Systems.  Then, two example
are given:  the description of a Distributed Office Environment
based on Distributed Office Applications Model of ISO, and the
description of a Group Communication System.

%A Craig Partridge
%A Marshall T. Rose
%T A Comparison of External Data Formats
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%P 203-216
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
A comparison and analysis of three external data formats:
Abstract Syntax Notation One (ASN.1), Sun Microsystems'
External Data Representation (XDR) language and Apollo Computer's
Network Data Representation (NDR) language is presented.  The
performance, ease of implementation and use in specifications
of the three schemes is examined.

%A Julian P. Onions
%A Marshall T. Rose
%T The Applications Cookbook
%P 217-236
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper gives an overview of tools and methods used to build
applications on top of the OSI Remote Operations Service.  An
object model for distributed applications design is presented
that is supported by tools to automate much of the implementation
process.   The facilities described help the applications
designer concentrate on the application rather than the network.

%A Robert Cole
%A Colin I'Anson
%A Adrian Pell
%T Architectural Aspects of a Mobile X.400 Service
%P 237-248
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper describes the architecture used in the UK, DTI-Alvey
sponsored, Locator project which will provide mobile and secure
access to electronic messaging service.  As store and forward
messaging system is an important component of the mobile office
environment; we are using the X.400 Message Handling System (MHS)
to provide this service.  When this is used in a mobile office
environment, two particular architectural problems arise:
limited communications capacity and increased security risks in
the communications medium.  Unfortunately, both of these are
inherent in the cellular telephone technology being used in the
project; by utilizing the CCITT X.413 Message Store and the X.400
extensions for security they can be overcome.  We provide an
introduction to the Message Store and secure messaging,
describe the architecture of our system and explain how it is
used to provide a secure messaging facility.  We discuss some
limitations of the Message Store Recommendations and suggest
extensions for the mobile environment.

%A Maria Janilce A. Wilkens
%A Liane M. Rockenbach Tarouco
%T Message System as Communication Media Among Computer Processes
%P 249-254
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
The paper describes the result of a study on use of a message
system as communications media among computer processes running
in a distributed manner on different computers.  The work being
done is part of the REDURGS project, aiming interconnecting all
computer systems at UFRGS - Federal University of Rio Grande do
Sul.

%A Gerald Neufeld
%A Edward Sadowski
%T A Store-and-Forward File Transfer System
%P 255-272
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
Most existing File Transfer Systems are connection-based, where
the actual transfer of a file immediately follows the
transfer's specification.  Few systems allow Three-Party
Transfers, where a person on one computer can request the
transfer of a file residing on a second computer to a third
computer.
.sp 0.5
A Store-and-Forward File Transfer System separates the
specification and transmission phases of a file transfer.  A
Store-and-Forward File Transfer System has been designed and
implemented using as its medium of transmission a distributed
message transfer system based on CCITT X.400.  This File Transfer
System allows genuine Multi-Party Transfers.
.sp 0.5
Results indicate that such a system is both feasible and
practical.

%A Kazuaki Oya
%A Toshihiro Tsukishima
%A Kouichi Kunimasa
%T The Development of a MHS Facsimile Network - The Experience of
Hitachi d-Mail
%P 273-278
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
Facsimile communications have been getting more popular not
only in Japan, but also in the U.S.A. and European countries
recently.  As a result of the development of compact laser beam
printers, the quality of prints obtained from a facsimile now
compares favorably with those from a standard copy machine.  G4
facsimile standard, which facilitates more accurate and quicker
transmission of image document data, has now been achieved as a
result of the long efforts in attempting to standardize facsimile
communications.  The increasing demand and transmission of
facsimile data by Japanese users has produced a need for
enhancing facilities such as quality, capacity and user
friendliness where has outgrown the capabilities of
conventional facsimile networks.  To address this situation,
Hitachi, one of the largest Japanese manufactures of
international communications networks in Japan, has developed a
large capacity store and forward mode facsimile communication
network based on X.400 MHS recommendations.  The system
consists of distributed processors for X.400 nodes, MHS facsimile
terminals developed on the base of a G4 facsimile, and MHSFTCs
which work as G3 facsimile servers.  The final field test was
completed at the end of September 1988, and this system is now
being used at the present time.

%A A. Danthine
%A P. Godelaine
%T MHS in a Corporate Communication System Offering Internet Service
%P 279-294
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
A corporate communication system will be based on a hierarchy
of LANs where a wideband backbone network will play an
essential role, especially on a broad site.  The basic
characteristics of the BWN (Backbone Wideband Network)
currently developed in the ESPRIT project 73 are presented.
The network architecture adopted is offering a connectionless
network service which will allow use of this communication
infrastructure by various global architectures.
.sp 0.5
The Message Handling System is one of the applications which must
be defined on the corporate basis and integrated in public
MHS.  The trend to X.400 is clear today but there exist several
implementations in the local areas of the corporate domain.  We
introduce the idea of a Corporate Reliable Transfer Sever which
will offer the same service that the CCITT RTS but will allow
efficient implementation.  We also discuss the concept of a
Distributed User Agent in a local corporate domain
environment.  The possible extension of the service offered by
the Interpersonal MHS is briefly discussed.

%A Andres G. Lanceros
%A Juan A. Saras
%T Definition of Group Communication Facilities In The MHS
%P 295-308
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
The communication in groups (or Group Communication) is not
covered by the CCITT MHS Recommendations X.400 (84 Version).
Nevertheless, there are currently systems which support some type
of group communication.  The most simple type is the distribution
list, other types are the bulletin board and conferencing
systems.  A model for introducing some group communication
facilities in the MHS will be presented in this paper.  Special
emphasis will be given to the group management and the handling
of group messages.

%A M. Schoffstall
%A C. Davin
%A M. Fedor
%A J. Case
%T SNMP over Ethernet
%J Internet Request for Comments
%N 1089
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo describes an experimental method by which the Simple Network
Management Protocol (SNMP) can be used over Ethernet MAC layer framing
instead of the Internet UDP/IP protocol stack.  This specification is
useful for LAN based network elements that support no higher layer
protocols beyond the MAC sub-layer.

%A R. Ullmann
%T SMTP on X.25
%J Internet Request for Comments
%N 1090
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo proposes a standard for SMTP on the virtual circuit facility
provided by the X.25 standard of the CCITT.

%A P.A. Humbelt
%A S.R. Soloway
%T Topology Broadcast Algorithms
%J Computer Networks and ISDN Systems
%D January 1989
%V 16
%N 3
%P 179-186

%A B. Turman
%A R. Rubin
%T Bell Operating Company Packet Interfaces Between Networks and Subnets
%J Computer Networks and ISDN Systems
%D January 1989
%V 16
%N 3
%P 187-196

%A S. Aggarwal
%A Z. Har'el
%T Simulation Analysis of Protocols in an Integrated Software Environment
%J Computer Networks and ISDN Systems
%D January 1989
%V 16
%N 3
%P 197-216

%A D.-W. Tcha
%A C.-Y. Jin
%T Link-by-Link Bandwidth Allocation in an Integrated Voice/Data Network
Using the Fuzzy Set Principle
%J Computer Networks and ISDN Systems
%D January 1989
%V 16
%N 3
%P 217-228

%A L. Fratta
%A J. Wozniak
%T PR-EXPRESS: Collision-free Access Protocol for Packet Radio Networks
%J Computer Networks and ISDN Systems
%D January 1989
%V 16
%N 3
%P 229-242

%A L. Lenzini
%T The OSIRIDE-Interest Iniative: Status and Trends
%J Computer Networks and ISDN Systems
%D January 1989
%V 16
%N 3
%P 243-256

%A J. VanBokkelen
%T Telnet Terminal-Type Option
%J Internet Request for Comments
%N 1091
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC specifies a standard for the Internet community.  Hosts on
the Internet that exchange terminal type information within the
Telnet protocol are expected to adopt and implement this standard.
.sp 0.5
This standard supersedes RFC 930.  A change is made to permit cycling
through a list of possible terminal types and selecting the most
appropriate.

%A Ming Qiang Xu
%A S.J. Turner
%T Randomized Routing: 'Hot Potato' Simulations
%D 1988
%R Report 164
%I University of Exeter, England
%X [\fIEd. Note:\fP Available for 1.14p from
Mrs. J. Stevens, Dept of Computer Science,
University of Exeter, Exeter EX4 4PT, Devon, UK.]

%A M.J. Flynn
%A R. Zeidman
%A E. Lochner
%T Sparse Distributed Memory Prototype: Address Module Hardware Guide
%R CSL-TR-88-373
%I Stanford University
%D December 1988
%X \fBAbstract:\fP
This document is a detailed specification of the hardware design of the Address
Module for the prototype Sparse Distributed Memory. It contains all of the
information needed to build, test, debug, modify and operate the Address
Module. [\fIEd. Note:\fP Available for $6.90 from
Naomi Schulman, COMPUTER SYSTEMS LABORATORY, Stanford University,
Stanford, CA 94305-4055, (415-723-1430)]

%A Joseph W.M. Pang
%A Fouad A. Tobagi
%T Throughput Approximation for the Generalized Timer Based
Protocol for Token Passing Systems
%R CSL-TR-89-375
%I Stanford University
%D January 1989
%X \fBAbstract:\fP
Recently, a timer based integrated access protocol has been adopted by two
major local area network (LAN) standards, the IEEE 802.4 Token Bus Standard [1]
and the ANSI drafted Fiber Distributed Data Interface Standard [2]. This timer
based approach is capable of providing bounded access delay for real-time
traffic (i.e., traffic with stringent delay requirements), multiple classes of
service, and efficient use of the communication channel [3]-[4]. Based on a
careful examination of the dynamical behaviour of the timer based protocol
under heavy traffic, we have been able to generalize the underlying idea behind
the protocol and proposed a new class of access control schemes in [5].  We
have also established in [5] important results pertaining to the bandwidth
allocation under heavy traffic and upper bounds on token cycles under general
traffic for the generalized control schemes. Although the results on bandwidth
allocation obtained in [5] are very useful for first-cut design purposes, they
are only applicable under heavy traffic. In this report, we are interested in
obtaining the station throughputs for the generalized control schemes under
arbitrary input traffic. Based on the assumption that the variances of station
service times are small, we develop a simple and yet very good approximation
for the station throughputs, that is dependent only on the average data arrival
rates at the stations. Using this approximation, we can determine whether a
station in the system is stable or not. Furthermore, if a station is not
stable, its throughput can be obtained from the approximation.   This
approximation is also applicable to the timer based protocol used in the LAN
standards [1]-[2].
[\fIEd. Note:\fP Available for $5.10 from
Naomi Schulman, COMPUTER SYSTEMS LABORATORY, Stanford University,
Stanford, CA 94305-4055, (415-723-1430)]

%A J. Rekhter
%T EGP and Policy Based Routing in the New NSFNET Backbone
%J Internet Request for Comments
%N 1092
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This memo discusses implementation decisions for routing issues in the
NSFNET, especially in the NSFNET Backbone.  Of special concern is the
restriction of routing information to advertize the best route as
established by a policy decision.

%A H.W. Braun
%T The NSFNET Routing Architecture
%J Internet Request for Comments
%N 1093
%D February 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This document describes the routing architecture for the NSFNET
centered around the new NSFNET Backbone, with specific emphasis on the
interface between the backbone and its attached networks.

%A Sylvia Wilbur
%T Group Communication as a Tool in an Organisation Support Environment
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%P 309-316
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper reviews work on group activity modelling, and on the view of group
working as constraints on actions.  The constraints imposed on groups at work
by the organisational context of their activities are explored, and two
real-world examples of activities involving groups are presented.
.sp 0.5
The conclusion of this paper is that models of group activities should take
account of the impact of the organisation on group work, and that support for
group communication should be viewed as a component of a wider environment to
support organisational requirements.

%A Uta Pankoke-Babatz
%A Wolfgang Prinz
%T Support for Coordinating Group Activities
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed Applications
%I North-Holland
%P 317-330
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper introduces the AMICO Activity Model which allows the modeling of
the coordination of group communication activities.  Starting with general
considerations about patterns in electronic communication we introduce the
concept of a mediator for the coordination of group activities.  We will then
present the components of the AMIGO Activity Model, together with a description
of the specification technique that uses BNF notation.  Finally we propose an
evaluation procedure which can be used to run an activity specified with the
AAM.


%A Wolfgang Prinz
%A Michael Woitass
%T The Date Planning System - Example of a Cooperative Group Activity
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 331-352
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper presents the example of a date planning system to support the
cooperation within a group of persons.  Date planning is considered here the
process of negotiation between the persons involved in order to find a date for
a joint meeting.  A premise for our Date Planning System DPS is that each
person's freedom to decide whether to approve or disapprove of a date should
not be restricted by the system.  The DPS works without disclosing the
calendars of the persons involved.  A modeling means to describe the
coordination of a such a group activity is the AMIGO Activity Model that has
been developed in the AMIGO project sponsered by the Cost1 1ter Programme of
the Commission of the European Communities.  We show how to model date planning
by means of the AMIGO Activity Model.  On the basis of this modeling we have
developed an implementation concept of the DPS.  Finally a system architecture
of DPS is presented which is based on an embedding of the system in a Message
Handling System (MHS) that follows the CCITT X.400 communication standards.

%A Frank Eliassen
%A Ingrid Nordli
%A Thore Danielsen
%T Communication via shared conceptual memory; Applied to joint editing
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 353-368
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
Communication via shared conceptual memory (CSCM) denotes a general
communication service and protocol supporting applications dealing with
computer-supported cooperative work.  CSCM can support applications where a
group of participants cooperate through coordinated access to shared
hierarchically structured data.  A high level of availability to the shared
data is achieved by letting every participant maintain a copy of the shared
data.  Updates done on one copy is asynchronously propagated to every other
copy of the data.  In consequence the participants may have inconsistent views
of the state of the shared data at any particular moment of time.  CSCM enables
the creation of consistent copies of the shared data at each participant site
through the provision of a sychronization service.  This paper will focus on
the CSCM communication model and the protocol mechanisms for access and
concurrency control and synchronization using a multiple-token based protocol
scheme.  The general ideas of our communication model will also be explained in
the context of a real application (Joint Editing) in order to give a more
understandable concrete meaning to many of the abstract notions and, not the
least, to validate the approach.

%A P.A. Pays
%A Y.Z. You
%T A General Multi-User Message Store
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 368-384
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
In this paper, we present SAM, a general multi-user message store which is
intended to support the MHS and Group Communication applications in distributed
environments.  The main features of the design of SAM are a clear separation
between the user conceptual view and the internal model, and, at the
architectural level, between a common Message Archive Processor and various
application specific front-ends.  In the body of this paper we concentrate on
the features and functionnalities provided by the common and central part of
this meassage store, leaving out the different strategies for the activity
specific parts.  The final part of this paper discusses how such a message
store might be used as a key component of an advanced User Agent and of a
distributed conferencing system.

%A G. Altomare
%A O. Berlen
%A D. Rotondi
%A A. Scopece
%T DICOM: An Approach to the MHS UA design
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 385-396
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper describes an approach to the design of User Agents for Message
Handling Systems adopted for the DICOM (DIstributed COmputer based Messaging
system) project.
Its purpose is the development of a distributed system, DICOM, which will
support IPMS functionalities, document archiving and retrieval, group
communication and directory services according to international standards.
The paper focuses on DICOM main features, services and architecture; finally,
the current implementation work and future plans are described.

%A Beryl L. Bellman
%T Towards a Model for Interface & Information Server Design
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 397-416
%C Costa Mesa, California
%D October 10-12, 1988

%A G. Schurmann
%A K.H. Weiss
%A M. Tschicholz
%A U. Holzmann
%T Multi-Media-Document Handling Architecture in a
Distributed Broadband Environment
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 417-438
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper presents a short analysis of multi-media documents (MMDs) and
proposes a communication architecture for multi-media documents in a
distributed broadband environment, such as ISDN-B with an approximate
transmission rate of 140 Mbit/s.  The proposed multi-media document handling
system (MMDHS) will provide user with extended document handling facilities.
The service integrates and unifies existing and future services, such as
transfer, distribution, handling, storage and retrieval of MMD objects.  The
aim is to provide a structurally clear and highly integrated communication
architecture supporting multi-media documents including text, graphics, audio,
moving and still images and modelling information (e.g., CAD).

%A Nathaniel S. Borenstein
%A Craig F. Everhart
%A Jonathan Rosenberg
%A Adam Stoller
%T Architectural Issues In the Andrew Message System
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 439-456
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
The Andrew Message System is one of the most ambitious and technically
successful systems yet built in the area of electronic communication.  In this
paper, the authors of the system explain the key decisions in the architecture
and reflect on what was done right and what was clearly wrong.  Implementation
details are mentioned only in passing, in order to maximize the relevance of
this paper for the designers of successor systems.

%A Ruth J. Boaden
%A A. Geoffrey Lockett
%T A Study of Electronic Mail: Its Value, Management and Development
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 457-476
%C Costa Mesa, California
%D October 10-12, 1988

%A Andrew Feenberg
%T The Planetary Classroom
International Applications of Advanced Communications to Education
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 477-490
%C Costa Mesa, California
%D October 10-12, 1988

%A Henry Etzkowitz
%T The Electronic Focussed Interview:
Email As A Dialogic Interviewing Medium
%J Proc. IFIP WG 6.5: Message Handling Systems and Distributed ApplicationsO
%I North-Holland
%P 491-502
%C Costa Mesa, California
%D October 10-12, 1988
%X \fBAbstract:\fP
This paper discusses an experiment in using electronic mail (email) in
qualitative social research. A classic research technique, the face-to-face
focussed interview, is adapted for electronic use.  Previous research on email
as a communications and interviewing medium is reviewed.  The concept of the
focussed interview and its electronic adaptation is presented.  An example of
an email focussed interview is analyzed and a comparison offered between email
and face-to-face focussed interviewing.

%A D.P. Bertsekas
%T An analysis of stochastic shortest path problems
%R CICS-P-83
%D October 1988
%I Computer Science Department, U.C. Berkeley

%A J.M. Spinelli
%T Reliable communication on data links
%D January 1989
%R CICS-P-102
%I Computer Science Department, U.C. Berkeley

%A Radia Perlman
%T Network Layer Protocols With Byzantine Robustness
%R TR-429
%I MIT Laboratory for Computer Science
%D October 1988

%A C. Mitchell
%T Multi-destination secure electronic mail
%J The Computer Journal
%V 32
%N 1
%D January 1989
%P 13-15
%X \fBAbstract:\fP
Electronic mail messages are often sent to more than one
destination; this gives rise to problems when security is
required.  A recent draft for a standard for securing electronic
mail messages suggests a novel mechanism for solving the
problem.  Unfortunately, as shown herein, the solution is flawed
and can allow the construction of fake messages which will pass
the authenticity tests.
[\fIEd. Note:\fP This article describes problems in RFC 989 which are
believed to have been fixed by RFC 1040]

%A Sun Microsystems, Inc.
%T NFS: Network File System Protocol Specification
%J Internet Request for Comments
%N 1094
%D March 1989
%I Network Information Center, SRI International
%C Menlo Park, CA
%X \fBAbstract:\fP
This RFC describes a protocol that Sun Microsystems, Inc., and others
are using.  A new version of the protocol is under development, but
others may benefit from the descriptions of the current protocol, and
discussion of some of the design issues.

%A Ivan P. Kaminow
%T Non-Coherent Photonic Frequency-Multiplexed Access Networks
%J IEEE Network
%D March 1989
%P 4-12
%V 3
%N 2

%A Richard A. Linke
%T Frequency Division Multiplexed Optical Networks Using Heterodyne
%J IEEE Network
%D March 1989
%P 13-21
%V 3
%N 2

%A Giovanni Vannucci
%T Combining Frequency-Division and Code-Division Multiplexing in a
High-Capacity Optical Network
%J IEEE Network
%D March 1989
%P 21-30
%V 3
%N 2

%T Emerging Optical Code-Division Multiple Access Communications Systems
%A Jawad A. Salehi
%J IEEE Network
%D March 1989
%P 31-39
%V 3
%N 2

%A Joseph Y. Hui
%T Network, Transport, and Switching Integration for Broadband
%J IEEE Network
%D March 1989
%P 40-51
%V 3
%N 2

%A T. Suda
%A T.T. Bradley
%T Packetized Voice/Data Integrated Transmission on a Token Passing Ring
Local Area Network
%J IEEE Trans. on Communications
%V 37
%N 3
%D March 1989
%P 238-244

%A D.-L. Lu
%A J.-F. Chang
%T Analysis of ARQ Protocols via Signal Flow Graphs
%J IEEE Trans. on Communications
%V 37
%N 3
%D March 1989
%P 245-251

%A W.-T.Chen
%A N.-F. Huang
%T The Strongly Connecting Problem on Multihop Packet Radio Networks
%J IEEE Trans. on Communications
%V 37
%N 3
%D March 1989
%P 293-294

%A John S. Quarterman
%T The Matrix:  Computer Networks and Conferencing Systems Worldwide
%I Digital Press
%C Bedford, MA
%D 1989
%X \fBDescription:\fP
A detailed survey of all known computer networks in the world.
Provides information on connectivity, history, future plans and
key personnel.

%A S. Leffler
%A K. McKusick
%A M. Karels
%A J.S. Quarterman
%T The Design and Implementation of the 4.3BSD UNIX Operating System
%I Addison-Wesley Publishing Company
%C Massachusetts
%D 1989
%X \fBDescription:\fP
Includes a chapter on the BSD networking interface.

%A J. Martin
%A K.K. Chapman
%T SNA: IBM's Networking Solution
%I Prentice-Hall
%C Englewood Cliffs, New Jersey
%D 1988

%A Michael Killen
%T IBM: The Making of the Common View
%I Harcourt Brace Jovanovich
%D 1988
%X \fBDescription:\fP
\fISoul of A New Machine\fP for SAA.

%A Andrew S. Tanenbaum
%T Computer Networks; Second Edition
%D 1988
%I Prentice-Hall
%O \fIReviews:\fP IEEE Communications, January 1989.

%A Douglas Comer
%T Internetworking with TCP/IP: principles, protocols, and architecture
%I Prentice-Hall
%O \fIReviews:\fP Computing Reviews, Vol. 30, No. 2, February 1989

%A Michel Raynal
%T Networks and distributed computation: concepts, tools and algorithms
%I MIT Press
%O \fIReviews:\fP Computing Reviews, Vol. 30, No. 2, February 1989

%A Israel Mitrani
%T Modelling of Computer and Communication Systems
%I Cambridge University Press
%O \fIReviews:\fP Computing Reviews, Vol. 30, No. 2, February 1989