leff@DEPT.CSCI.UNT.EDU ("Dr. Laurence L. Leff") (04/10/90)
This is the January 90 issue of the SIGCOMM quarterly bibliography of papers in computer communication. (Actually, due to publication space problems in ACM Computer Communication Review, this bibliography covers 6 months -- June-December 1989). The bibliography is published quarterly in Computer Communication Review. Craig Partridge Editor, ACM SIGCOMM Computer Communication Review %K Transport\0Protocols %A R. Fox %T TCP Big Window and Nak Options; RFC 1106 %J Internet Request for Comments %N 1106 %D June 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo discusses two extensions to the TCP protocol to provide a more efficient operation over a network with a high bandwidth*delay product. The extensions described in this document have been implemented and shown to work using resources at NASA. This memo describes an Experimental Protocol, these extensions are not proposed as an Internet standard, but as a starting point for further research. %K Protocol\0Testing %A S.T. Chanson %A B.P. Lee %A N.J. Parakh %A H.X. Zeng %T Protocol Conformance Testing Using Multiple UIO Sequences %J Proc. 9th Intl. Symp. on Protocol Specification, Testing and Verification (IFIP WG 6.1) %D June 6-9 %C Enschede, The Netherlands %X \fBAbstract:\fP The Ferry Clip concept has been proposed as a general approach to realize protocol test methods. This paper describes the design and implementation of a Ferry Clip based Test System for protocol testing. By structuring the system into a specialized set of modules, the effort required to test different protocol implementations can be reduced considerably. Implementation issues encountered in building the system under different hardware/software environments are also discussed. %K Protocol\0Testing %A Teruo Higashino %A Kiyoshi Ninomiya %A Tomohisa Kimoto %A Ken'ichi Taniguchi %A Masaaki Mori %T Automated Verification of Equivalence of Protocol Machines %J Proc. 9th Intl. Symp. on Protocol Specification, Testing and Verification (IFIP WG 6.1) %D June 6-9 %C Enschede, The Netherlands %X \fBAbstract:\fP A protocol machine is described as an automaton with a finite state control and a finite number of registers whose values are integers. We define that two protocol machines M1 and M2 are equivalent if and only if the output sequences of M1 and M2 are the same for any input sequence. M1 and M2 are equivalent if, for some predicate P which represents a relation between the states and the values of the registers of M1 and M2, (A)P is an invariant and (B)for any reachable states of M1 and M2, any values of the registers satisfying P at those states and any input, M1 and M2 emit the same outputs. We have developed a program for verifying that (A) and (B) hold for given M1, M2 and P. Our program prints out the useful information to succeed in the proof of the equivalence of given protocol machines even if the proof of the equivalence failed. Using this program, we proved that two machines of HDLC procedures are equivalent. %K LANs %A C.C. Ko %A K.M. Lye %A K.C. Chua %A F.T. Yap %T Analysis of a CSMA/CD-based Protocol with Dynamic Segmentation %J Computer Networks and ISDN Systems %V 16 %N 5 %D May 1989 %P 347-356 %K Applications %A S. Han %A K. Chon %A D. Lee %T A Virtual Terminal Protocol with Windowing Capability %J Computer Networks and ISDN Systems %V 16 %N 5 %D May 1989 %P 357-366 %K Routing %A J.J. Garci-Luna-Aceves %T A Minimum-Hop Routing Algorithm Based on Distributed Information %J Computer Networks and ISDN Systems %V 16 %N 5 %D May 1989 %P 367-382 %K Transport\0Protocols %A A. Zissopoloulos %A C. Tropper %T On Buffer Allocation in Transport Protocols %J Computer Networks and ISDN Systems %V 16 %N 5 %D May 1989 %P 383-394 %K Network\0Protocols %A F.M. Burg %A P. Puges %T X.25: It's Come a Long Way %J Computer Networks and ISDN Systems %V 16 %N 5 %D May 1989 %P 395-404 %K Integrated\0Voice-Data\0Networks %A T.M. Chen %A J. Walrand %A D.G. Messerschmitt %T Dynamic Priority Protocols for Packet Voice %P 632-643 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Integrated\0Voice-Data\0Networks %A T.M. Chen %A D.W. Petr %A L.A. DaSilva, Jr. %A V.S. Frost %T Priority Discarding of Speech in Integrated Packet Networks %P 644-656 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Integrated\0Voice-Data\0Networks %A T.A. Gonsalves %A F.A. Tobagi %T Comparative Performance of Voice/Data Local Area Networks %P 657-669 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Integrated\0Voice-Data\0Networks %A P.-C. Wong %A T.-S.P. Yum %T An Integrated Services Token-Controlled Ring Network %P 670-679 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K ISDN %A T.D. Todd %A P.A. Lopinski %T A Compatible Fixed-Frame ISDN Gateway for Broadband Metropolitan Area Networks %P 680-689 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Transport\0Protocols %A John. B. Carter %A Willy Zwaenepoel %T Optimistic Implementation of Bulk Data Transfer Protocols %P 61-69 %J Proc. 1989 ACM SIGMETRICS and PERFORMANCE '89: International Conference on Measurement and Modeling of Computer Systems %I ACM Press %D May 23-26, 1989 %C Berkeley, CA %K LANs %A Amarnath Mukherjee %A Larry H. Landweber %A John C. Strikwerda %T Evaluation of Retransmission Strategies in a Local Area Network %P 98-107 %J Proc. 1989 ACM SIGMETRICS and PERFORMANCE '89: International Conference on Measurement and Modeling of Computer Systems %I ACM Press %D May 23-26, 1989 %C Berkeley, CA %K LANs %A Peter B. Danzig %T Finite Buffers for Fast Multicast %P 108-117 %J Proc. 1989 ACM SIGMETRICS and PERFORMANCE '89: International Conference on Measurement and Modeling of Computer Systems %I ACM Press %D May 23-26, 1989 %C Berkeley, CA %X \fBAbstract:\fP When many or all of the recipients of a multicast message respond to the multicast's sender, their responses may overflow the sender's available buffer space. Buffer overflow is a serious, known problem of broadcast-based protocols, and can be troublesome when as few as three or four recipients respond. We develop analytical models that calculate the expected number of buffer overflows that can be used to estimate the number of buffers necessary for an application. The common cure for buffer overflow requires that recipients delay their responses by some random amount of time in order to increase the minimum spacing between response messages, eliminate collisions on the network, and decrease the peak processing demand at the sender. In our table driven algorithm, the sender tries to minimize the multicast's latency, the elapsed time between its initial transmission of the multicast and its reception of the final response, given the number of times (rounds) it is willing to retransmit the multicast. It includes in the multicast the time interval over which it anticipates receiving the response, the round timeout. We demonstrate that the latency of single round multicasts exceeds the latency of multiple round multicasts. We show how recipients minimize the sender's buffer overflows by independently choosing their response times as a function of the round's timeout, sender's buffer size, and the number of other recipients. %K Distributed\0File\0Systems %A O. Kure %T File Migration in Distributed File Systems Without Replication %P 229 %J Proc. 1989 ACM SIGMETRICS and PERFORMANCE '89: International Conference on Measurement and Modeling of Computer Systems %I ACM Press %D May 23-26, 1989 %C Berkeley, CA %K Routing %A J.E. Beasley %A N. Christofides %T An Algorithm for the Resource Constrained Shortest Path Problem %J networks: an international journal %V 19 %N 4 %P 379-394 %K Transport\0Protocols %A L.H. Ngoh %A T.P. Hopkins %T Transport Protocol Requirements for Distributed Multimedia Information Systems %J The Computer Jour. %V 32 %N 3 %D June 1989 %P 252-261 %K Integrated\0Voice-Data\0Networks %A M.J. Miller %T Error Control Techniques for Integrated Services Packet Networks %P 690-697 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Integrated\0Voice-Data\0Networks %A C. Ziegler %A G. Weiss %A E. Friedman %T Implementation Mechanisms for Packet Switched Voice Conferencing %P 698-706 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Integrated\0Voice-Data\0Networks %A J. Suzuki %A M. Taka %T Missing Packet Recovery Techniques for Low-Bit-Rate Coded Speech %P 707-717 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Integrated\0Voice-Data\0Networks %A S. Dravida %A K. Sriram %T End-to-End Performance Models for Variable Bit Rate Voice Over Tandem Links in Packet Networks %P 718-728 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Integrated\0Voice-Data\0Networks %A C. Yuan %A A. Silvester %T Queueing Analysis of Delay Constrained Voice Traffic in a Packet Switching System %P 729-739 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A G. Karlsson %A M. Vetterli %T Packet Video and Its Integration into the Network Architecture %P 739-751 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A M. Nomura %A T. Fujii %A N. Ohta %T Basic Characteristics of Variable Rate Video Coding in ATM Environment %P 752-761 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A W. Verbiest %A L. Pinnoo %T A Variable Rate Video Codec for Asynchronous Transfer Mode Networks %P 761-771 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A H. Shimizu %A M. Mera %A H. Tani %T Packet Communication Protocol for Image Services on a High-Speed Multimedia LAN %P 782-788 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A J.C. Darragh %A R.L. Baker %T Fixed Distortion Subband Coding of Images for Packet-Switched Networks %P 789-800 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A F. Kishino %A K. Manabe %A Y. Hayashi %A H. Yasuda %T Variable Bit-Rate Coding of Video Signals for ATM Networks %P 801-806 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A M. Wada %T Selective Recovery of Video Packet Loss Using Error Concealment %P 807-814 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A K. Joseph %A D. Raychaudhuri %A J. Zdepski %T Shared Access Packet Transmission Systems for Compressed Digital Video %P 815-825 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A R. Kishimoto %A Y. Ogata %A F. Inumaru %T Generation Interval Distribution Characteristics of Packetized Variable Rate Video Coding Data Streams in an ATM Network %P 833-841 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A R. Kositpaiboon %A P. Tsingotjidis %A L.O. Barbosa %A N.D. Georganas %T Packetized Radiographic Image Transfers over Local Area Networks for Diagnosis and Conferencing %P 842-856 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A C. Chamzas %A D.L. Duttweiler %T Encoding Facsimilie Images for Packet-Switched Networks %P 857-864 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Network\0Video %A P. Sen %A B. Maglaris %A N.-E. Rikli %A D. Anastassiou %T Models for Packet Switching of Variable-Bit-Rate Video Sources %P 865-869 %J IEEE Jour. Selected Areas Communications %D June 1989 %V 7 %N 5 %K Security\0and\0Authentication %A Stephen T. Kent %T Comments on ``Security Problems in the TCP/IP Protocol Suite'' %J Computer Communication Review %V 19 %N 3 %D July 1989 %P 10-19 %K Applications %A Kester Fong %A Jim Reinstedler %T Development of An OSI Application Layer Protocol Interface %P 21-57 %J Computer Communication Review %V 19 %N 3 %D July 1989 %K Network\0Management %A Adarshpal S. Sethi %T Bibliography on Network Management %P 58-75 %J Computer Communication Review %V 19 %N 3 %D July 1989 %K Protocol\0Verification %A Fei-Yue Wang %A Kevin Gildea %A Alan Rubenstein %T A Colored Petri Net Model for Connection Management Services in MMS %P 76-98 %J Computer Communication Review %V 19 %N 3 %D July 1989 %K Standards\0and\0Standards-Related\0Activities %A A. Lyman Chapin %T Status of OSI Standards %J Computer Communication Review %V 19 %N 3 %D July 1989 %P 99-118 %K Transport\0Protocols %A Richard W. Watson %T The Delta-t Transport Protocol: Features and Experiences Useful for High Performance Networks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A A.G. Fraser %T The Universal Receiver Protocol %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Greg Chesson %T XTP Design %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Alfred C. Weaver %T XTP for the Nasa Space Station %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Transport\0Protocols %A Erik Nordmark %A David R. Cheriton %T Experiences from VMTP: How to Achieve Low Response Time %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Patrick Cocquet %T GAM-T-103 Reeference Model for Military Real-Time Local-Area Networks (MRT-LAN) %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Protocol\0Implementation %A Peter Sjodin %A Per Gunningberg %A Erik Nordmark %A Stephen Pink %T Towards Protocol Benchmarks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Marjory J. Johnson %T Performance Analysis of CCSDS Path Service %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Transport\0Protocols %A Sharon Heatly %A Dan Stokesberry %T Analysis of Transport Measurements over a Local Area Network %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Pascale Minet %T Performance Issues in LTPB %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A R.F Hille %T Communication across High Speed Wide Area Backbone Networks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A D.R. McAuley %T High Speed Interneting %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Transport\0Protocols %A K.K. Sabnani %A A.N. Netravali %T Lightweight transport protocols for datagram/virtual-circuit networks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Joseph D. Touch %A David J. Farber %T MIRAGE: A Model for Ultra-High-Speed Protocol Analysis and Design %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Walid Dabbous %T On High Speed Transport Protocols %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Protocol\0Implementation %A David L. Tennenhouse %T Layered Multiplexing Considered Harmful %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Martina Zitterbart %T High-Speed Protocol Implementation Based on a Multiprocessor-Architecture %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Dario Giarrizzo %A Matthias Kaiserswerth %A Thomas Wicki %A Robin Williamson %T High-Speed Parallel Protocol Implementation %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A H. Abu-Amara %A T. Barzilai %A Y. Yemini %A T. Balraj %T PSi: A Silicon Compiler for Very-Fast Protocol Processing %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Lars Nedergard %A Soren Nielsen %A Sven Moller Pedersen %A Morten Skov %T On the Design of Generic High-Speed Physical and Media Access Protocol Processors %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Network\0Protocols %A Imrich Chlamtac %T Network Layer Protocols for Lightpath Networks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A H. Kadima %T High-speed Communication over FDDI-LAN Prototype: A Performance Study %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Aura Ganz %T End-to-End Protocols for WDM Star Networks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A Philippe Jacquet %A Paul Muhthaler %T An Efficient High-Speed Access Protocol for Broadcast Networks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K High-Speed\0Networking %A David J. Greaves %A Ian D. Wilson %T Cambridge HSLAN Protocol Review %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Distributed\0Systems %A Adrian Segall %A Reuvan Cohen %T A Distributed Query Algorithm for High-Speed Networks %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K External\0Data\0Formats %A Christian Huitema %A Assem Doghri %T A High Speed Approach for the OSI Presentation Protocol %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Transport\0Protocols %A Berthold Butscher %T A Flexible Transport Service in the BERKOM Broadband Environment %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Transport\0Protocols %A Dietmar Hehmann %A Michale Salmony %A Heinrich Stuttgen %T High Speed Transport Systems for Multi-Media Applications %J Proc. IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks %D May 9-11 1989 %E Harry Rudin and Robin Williamson %C Zurich, Switzerland %K Directory\0Services %A K. Sollins %T A Plan for Internet Directory Services; RFC 1107 %J Internet Request for Comments %N 1107 %D July 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo proposes a program to develop a directory service for the Internet. It reports the results of a meeting held in February 1989, which was convened to review requirements and options for such a service. This proposal is offered for comment, and does not represent a committed research activity of the Internet community. Activity in this area is anticipated, and comments should be provided promptly. %K Lower-Layer\0Protocols %A Stephen Timms %T Broadband Communications: The Commercial Impact %P 10-15 %J IEEE Network %D July 1989 %V 3 %N 4 %K Network\0Management %A Lawrence Bernstein %A Christine M. Yuhas %T How Technology Shapes Network Management %P 16-19 %J IEEE Network %D July 1989 %V 3 %N 4 %K Network\0Protocols %A Ranjan Pant %T X.25 Broadcast Service %P 20-26 %J IEEE Network %D July 1989 %V 3 %N 4 %K Network\0Protocols %A Hanwei Peng %A David H. Su %A Shukri A. Wakid %T A Conformance Tester for X.25 DTE Implementations %P 27-30 %J IEEE Network %D July 1989 %V 3 %N 4 %K Network\0Design %A Lillian Ruston %A Prodip Sen %T Rule-Based Network Design: Application to Packet Radio Networks %P 31-39 %J IEEE Network %D July 1989 %V 3 %N 4 %K Lower-Layer\0Protocols %A Albert G. Greenberg %A Philippe Flajolet %A Richard E. Ladner %T Estimating the Multiplicities of Conflicts to Speed Their Resolution in Multiple Access Channels %J Jour. ACM %V 34 %N 2 %D April 1987 %P 289-325 %O \fIReviews\fP: Computing Reviews, Vol. 30, No. 7 %K Lower-Layer\0Protocols %A James B. Sinclair %T Optimal Assignments in Broadcast Networks %D May 1988 %J IEEE Trans. Computers %V 37 %N 5 %P 521-531 %O \fIReviews\fP: Computing Reviews, Vol. 30, No. 7 %K Distributed\0Systems %A Bao-Chyuan Jenq %A Walter H. Kohler %A Don Towsley %T A Queueing Network Model for a Distributed Database Testbed System %V 14 %N 7 %D July 1988 %P 908-921 %O \fIReviews\fP: Computing Reviews, Vol. 30, No. 7 %K Distributed\0Systems %A Benjamin Goldberg %T Reference Counting: A Reduced-Communication Distributed Storage Reclamation Scheme %J SIGPLAN Notices (Proc. SIGPLAN '89) %V 24 %N 7 %D July 1989 %P 313-321 %X \fBAbstract:\fP [Excerpt] This paper describes generational reference counting, a new distributed storage reclamation scheme for loosely-coupled multiprocessors. It has a significantly lower communication overhead than distributed versions of conventional reference counting. Although generational reference counting has greater computational and space requirements than ordinary reference counting, it may provide a significant savings in overall execution time on machines in which message passing is expensive. %K Directory\0Services %A David Cheriton %A Timothy P. Mann %T Decentralizing a Global Naming Service for Improved Performance %J ACM Trans. Computer Systems %V 7 %N 2 %D May 1989 %P 147-183 %K Network\0Management %A V. Cerf %T Report of the Second Ad Hoc Network Management Review Group; RFC 1109 %J Internet Request for Comments %N 1109 %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC reports an official Internet Activities Board (IAB) policy position on the treatment of Network Management in the Internet. This RFC presents the results and recommendations of the second Ad Hoc Network Management Review on June 12, 1989. The results of the first such meeting were reported in RFC 1052 [1]. This report was approved and its recommendations adopted by the IAB as assembled on July 11- 13, 1989. %K Transport\0Protocols %A A. McKenzie %T A Problem with the TCP Big Window Option; RFC 1110 %N 1110 %J Internet Requests for Comments %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP The TCP Big Window option discussed in RFC 1106 will not work properly in an Internet environment which has both a high bandwidth * delay product and the possibility of disordering and duplicating packets. In such networks, the window size must not be increased without a similar increase in the sequence number space. Therefore, a different approach to big windows should be taken in the Internet. %K Cooperative\0Work %A T.K. Bikson %A J.D. Eveland %T Electronic mail and distributed task groups: Effect on structure and interaction %J Proceedings First European Conference on Computer Supported Cooperative Work %D September 13-15, 1989 %C London, England %X \fBAbstract Excerpt:\fP A year-long field experiment was designed to examine the role of computer-mediated communication in establishing or maintaining links between members of geographically distributed task groups and to assess its effects on social structures and interpersonal interactions.... .sp 0.25 A major research hypothesis was that collocated group members would be better known, better integrated into their task groups, and have higher participation rates initially; availability of computer based communication, however, was expected to overcome spatial and temporal constraints on interaction for noncollocated members of the electronic task force. Such electronic linkages were expected to promote rather than to replace other types of social interaction (e.g., face-to-face meetings). Additionally, both task and social structures in the electronic group were expected to exhibit networked and flexible structures rather than centralized and fixed structures (which were expected to be more characteristic of the standard task force). .sp 0.25 These hypotheses were, in the main, confirmed.... %K Cooperative\0Work %A M. Sihto %T Distributed Hypertext as a basis for communication and collaboration tools in distributed software environments %J Proceedings First European Conference on Computer Supported Cooperative Work %D September 13-15, 1989 %C London, England %K Cooperative\0Work %A A. Nylund %T Co-operation in a distributed problem solving environment %J Proceedings First European Conference on Computer Supported Cooperative Work %D September 13-15, 1989 %C London, England %K Directory\0Services %A W. Prinz %T Relevance of X.500 Directory for CSCW applications %J Proceedings First European Conference on Computer Supported Cooperative Work %D September 13-15, 1989 %C London, England %K Routing %A W.T. Tsai %A C.V. Ramamoorthy %A W.K. Tsai %A O. Nishiguchi %T An Adaptive Hierarchical Routing Protocol %P 1059-1075 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K LANs %A S. Saito %A H. Yoshida %A T.L. Junii %T The CrossoverNet LAN System Using an Intelligent Head-End %P 1076-1085 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Routing %A W. Lin %A T.-L. Sheu %A C.R. Das %A T.-Y. Feng %A C.-L. Wu %T A Conflict Free Routing Scheme on Multistage Interconnection networks %P 1086-1097 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Distributed\0Systems %A K.M. Baumgartner %A B.W. Wah %T GAMMON: A Load Balancing Strategy for Local Computer Systems with Multiaccess Networks %P 1098-1109 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Distributed\0Systems %A K. Ramamritham %A J.A. Stankovic %A W. Zhao %T Distributed Scheduling of Tasks With Deadlines and Resource Requirements %P 1110-1123 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Distributed\0Systems %A K.G. Shin %A Y.-C. Chang %T Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts %P 1124-1143 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Distributed\0Systems %A K.G. Shin %A C.M. Krishna %A Y.-H. Lee %T Optimal Dynamic Control of Resources in a Distributed System %D October 1989 %V 15 %N 10 %J IEEE Trans. on Software Engineering %P 1188-1198 %K Applications %A V. Iyer %A H.A. Sholl %T Software Partitioning for Distributed, Sequential, Pipelined Applications %D October 1989 %V 15 %N 10 %J IEEE Trans. on Software Engineering %P 1270-1279 %K Remote\0Procedure\0Calls %A K. Ravindran %A S.T. Chanson %T Failure Transparency in Remote Procedure Calls %P 1173-1187 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Distributed\0Systems %A K.H. Kim %A S.M. Yang %T Performance Impacts of Look-Ahead Execution in the Conversation Scheme %P 1188-1202 %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Distributed\0Systems %A M. Roesler %A W.A. Burkhard %T Resolution of Deadlocks in Object-Oriented Distributed Systems %P 1212- %J IEEE Trans. Computers %V 38 %N 8 %D August 1989 %K Distributed\0Systems %A M.P. Herlihy %A M.S. McKendry %T Timestamp-Based Orphan Elimination %P 825-831 %J IEEE Trans. Software Engineering %D July 1989 %V 15 %N 7 %X \fBAbstract:\fP An orphan in a distributed transaction system is an activity executing on behalf of an aborted transaction. Orphans are undesirable because they waste system resources and because they may observe inconsistent data. This paper proposes a new method for managing orphans created by crashes and aborts. The method ensures that orphans are detected and eliminated in a timely manner, and it prevents them from observing inconsistent states. A major advantage of this method is simplicity: it is easy to understand, to implement, and to prove correct. An ``eager'' version of this method uses approximately synchronized real-time clocks to ensure that orphans are eliminated within a fixed duration, and a ``lazy'' version uses logical clocks to ensure that orphans are eventually eliminated as information propagates through the system. The method is fail-safe: unsynchronized clocks and lost messages may affect performance, but they cannot produce inconsistencies or protect orphans from eventual elimination. %K Time\0Synchronization %A R. Guesella %A S. Zatti %T The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD %P 847-853 %J IEEE Trans. Software Engineering %D July 1989 %V 15 %N 7 %X \fBAbstract:\fP We discuss the upper and lower bounds on the accuracy of the time synchronization achieved by the algorithm implemented in TEMPO, the distributed service that synchronizes the clocks of Berkeley UNIX\(rg 4.3BSD systems. We show that the accuracy is a function of the network transmission latency, and depends linearly upon the drift rate of the clocks and the interval between synchronizations. Comparison with other clock synchronization algorithms reveals that TEMPO may achieve better synchronization at lower cost. %K Standards\0and\0Standards-Related\0Activities %A J. Postel %T Request for Comments on Request for Comments: Instructions to RFC Authors %N 1111 %J Internet Requests for Comments %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC specifies a standard for the Internet community. Authors of RFCs are expected to adopt and implement this standard. [\fIEd. Note:\fP This RFC also announces that Postscript RFC submissions are now acceptable]. %K Radio\0Networks %A Y.-C. Cheng %A T.G. Robertazzi %T Critical Connectivity Phenomena in Multihop Radio Networks %J IEEE Trans. Communications %V 37 %N 7 %D July 1989 %P 770-776 %K Multicasting %A S. Deering %T Host Extensions for IP Multicasting; RFC 1112 %D August 1989 %J Internet Requests for Comments %N 1112 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This memo specifies the extensions required of a host implementation of the Internet Protocol (IP) to support multicasting. It is the recommended standard for IP multicasting in the Internet. This RFC obsoletes RFCs 998 and 1054. %K Distributed\0Systems %A E. Rahm %A A. Thomasian %T Distributed Optimistic Concurrency Control for High Performance Transaction Processing %I Department of Computer Science, University of Kaiserslautern, West Germany %X \fBAbstract:\fP The performance of high-volume transaction processing systems is determined by the degree of hardware and data contention. This is especially a problem in the case of distributed systems with global transactions accessing and updating objects from multiple systems. While the conventional two-phase locking method of centralized systems can be adapted for concurrency control in distributed systems, it may restrict system throughput to very low levels. This is due to a significant increase in lock holding times and associated transaction waiting time for locks, as compared to centralized systems. Optimistic concurrency control (OCC) which is similarly extensible to distributed systems has the disadvantage of repeated transaction restarts, which is a weak point of currently proposed methods. We propose a new hybrid method based on OCC followed by locking, which is an integral part of distributed validation and two-phase commit. This advanced OCC method assures that a transaction failing its validation will not be re-executed more than once, in general. Furthermore deadlocks, which are difficult to handle in a distributed environment, are avoided by serializing lock requests. We outline implementation details and compare the performance of the new scheme with distributed two-phase locking. [\fIEd. Note:\fP Report can be ordered from: Dr. Erhard Rahm, Dept. of Computer Science, Univ. Kaiserslautern,P.O. Box 3049, D-6750 Kaiserslautern, West Germany, (rahm@uklirb.uucp)] %K Distributed\0Systems %A V. Bohn %T Performance Evaluation of a Distributed Database System by Means of Discrete Event Simulation %I Department of Computer Science, University of Kaiserslautern, West Germany %X \fBAbstract:\fP We investigate the performance behavior of locally distributed database system which use front-end processors to allocate the workload to transaction processing nodes. The performance analysis is based on a complex simulation system which is driven by page reference strings and employs discrete event handling for simulation control. Main parameters of the simulation system include the number of nodes and the multiprogramming level. Response time and throughput results are analysed as well as internal statistics (communication frequency, CPU utilization etc.) [\fIEd. Note:\fP Report can be ordered from: Dr. Erhard Rahm, Dept. of Computer Science, Univ. Kaiserslautern,P.O. Box 3049, D-6750 Kaiserslautern, West Germany, (rahm@uklirb.uucp)] %K Distributed\0Systems %A E. Rahm %T A Framework for Workload Allocation in Distributed Transaction Systems %I Department of Computer Science, University of Kaiserslautern, West Germany %X \fBAbstract:\fP Ever increasing demands for high transaction rates, limitations of high-end processors, high availability and modular growth considerations are all driving forces towards distributed architectures for transaction processing. A key prerequisite to take advantage of the capacity of a distributed transaction system, however, is an effective strategy for workload allocation. The distribution of the workload should not only achieve load balancing, but also support an efficient transaction processing with a minimum of inter-system communication. To this end, dynamic - yet efficient - schemes for transaction routing have to be employed which are highly responsive to configuration changes and workload fluctuations. We develop a general framework for workload allocation in distributed transaction systems. This framework is based on a classification of distributed architectures and execution models for transaction processing which determine the optimization potential for workload distribution. The framework helps to identify key factors and alternatives in the design of appropriate allocation schemes. Furthermore, it facilitates a comparison of existing schemes and may guide the development of new, more effective protocols. [\fIEd. Note:\fP Report can be ordered from: Dr. Erhard Rahm, Dept. of Computer Science, Univ. Kaiserslautern,P.O. Box 3049, D-6750 Kaiserslautern, West Germany, (rahm@uklirb.uucp)] %K Security\0and\0Authentication %T Computer Security: Virus Highlights Need for Improved Internet Management %A United States General Accounting Office %R GAO/IMTEC-89-57 %D June 1989 %X \fBDescription:\fP The report of the GAO to the House Subcommittee on Telecommunications and Finance. Recommends that the government consider improving the government management of the Internet. Copies may be ordered from the U.S. General Accounting Office, P.O. Box 6105, Gaithersburg MD 20877 (202) 275-6241. The first five copies are free. Additional copies are $2 each. Copies may also be FTPed from nnsc.nsf.net:pub/GAO_RPT. %K Distributed\0File\0Systems %A D. Barbara %A R. J. Lipson %T A Randomized Technique for Remote File Comparison %P 12-21 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A M. Theimer %A L.-F. Cabrera %A J. Wyllie %T QuickSilver Support for Access to Data in Large, Geographically Dispersed Systems %P 28-35 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Remote\0Procedure\0Calls %A S. K. Chung %A E. D. Lazowska %A D. Notkin %A J. Zahorjan %T Performance Implications of Design Alternatives for Remote Procedure Call Stubs %P 36-43 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A M. Spezialetti %A J. P. Kearns %T Simultaneous Regions: A Framework for the Consistent Monitoring of Distributed Systems %P 61-69 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A M. Singhal %T A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems %P 70-78 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A S.-T. Huang %T Detecting Termination of Distributed Computations by External Agents %P 79-84 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Security\0and\0Authentication %A L. Gong %T Securely Replicating Authentication Services %P 85-91 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A A. Kumar %A A. Segev %T Optimization And Evaluating Algorithms for Replicated Data Concurrency Control %P 101-109 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Multicasting %A N. E. Belkeir %A M. Ahamad %T Low Cost Algorithms for Message Delivery in Dynamic Multicast Groups %P 110-119 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A P. M. Melliar-Smith %A L. E. Moser %T Fault-Tolerant Distributed Systems Based on Broadcast Communication %P 129-133 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A S. A. Yemini %A C. S. Goldsmidt %A A. D. Stoyenko %A Y.-H.Wei %A L. W. Beeck %T CONCERT: A High-Level Language Approach to Heterogeneous Distributed Systems %P 162-171 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A J. J. Bloch %T The Camelot Library: A C Language Extension for Programming A General Purpose Distributed Transaction System %P 172-180 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A M. Sullivan %A D. Anderson %T Marionette: A System for Parallel Distributed Programming Using a Master/Slave Model %P 181-188 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Time\0Synchronization %A Y. Ofek %T Generating Fault Tolerant Global Clock in a High Speed Distributed System %P 218-226 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A G.-C. Roman %A H. C. Cunningham %T A Shared Dataspace Model of Concurrency - Language and Programming Implications %P 270-279 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Time\0Synchronization %A F. Cristian %T A Probabilistic Approach to Distributed Clock Synchronization %P 288-296 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A R. Mirchandaney %A D. Towsley %A J. A. Stankovic %T Adaptive Load Sharing in Heterogeneous Systems %P 298-306 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A K. Efe %A B. Groselj %T Minimizing Control Overheads in Adaptive Load Sharing %P 307-315 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A P. Liu %A Y. Kiyoki %A T. Masuda %T Efficient Algorithms for Resource Allocation in Distributed and Parallel Query Processing Environments %P 316-323 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A C. E. Will %T A Service Execution Mechanism for a Distributed Environment %P 326-334 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A H. F. Wedde %A B. Korel %A W. G. Brown %A S. Chen %T Transparent Distributed Object Management Under Completely Decentralized Control %P 335-342 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Multicasting %A H. Garcia-Molina %A A. M. Spauster %T Message Ordering in a Multicast Environment %P 354-361 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Routing %A A. Bouloutas %A P. M. Gopal %T Some Graph Partitioning Problems and Algorithms Related to Routing in large Computer Networks %P 362-370 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Routing %A C. D. Wolfson %A E. Voorhees %A M. M. Flatley %T Intelligent Routers %P 371-376 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Databases %A A. Leff %A P. S. Yu %A Y.-H. Lee %T Adaptive Transaction Routing in a Heterogeneous Database Environment %P 406-413 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Databases %A S. T. Vinter %A N. Phadnis %A R. Floyd %T Distributed Query Processing in Cronus %P 414-422 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Lower-Layer\0Protocols %A A. M. Viterbi %T Performance Analysis of Synchronous Packet Networks with Priority Queueing Disciplines %P 440-447 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K LANs %A V. V. Karmarkar %A J. G. Kuhl %T A High Performance Virtual Token-Passing Multiple-Access Method for Multiple-Bus Local Networks %P 432-439 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K LANs %A W. B. Watson %T Capacity Testing a HYPERchannel-Based Local Area Network %P 448-454 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Directory\0Services %A S. Sarin %A R. Floyd %A N. Phadnis %T A Flexible Algorithm for Replicated Directory Management %P 456-464 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A L. Kleinrock %A W. Korfhage %T Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems %P 482-489 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Memory %A R. E. Kessler %A M. Livny %T An Analysis of Distributed Shared Memory Algorithms %P 498-505 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A S. R. Koppolu %A S. Thanawastien %A R. R. Henry %T Fast Ring: A Distributed Architecture and Protocol for Local Area Distributed Processing %P 534-549 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Databases %A C.-L. Haung %A V.O.K. Li %T Missing-Partition Dynamic Voting Scheme for Replicated Database Systems %P 579-586 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A J. M. Purtilo %A P. Jalote %T An Environment for Prototyping Distributed Applications %P 588-595 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Distributed\0Systems %A S. S. Yau %A K. W. I. Chen %T An Approach to Verification of Communication in Distributed Computing System Software %P 603-618 %J Proc. 9th Intl. Conf. Distributed Computing Systems %I IEEE %D June 1989 %K Miscellaneous %A Anthony Ephremides %A Sergio Verdu %T Control and Optimization Methods in Communication Network Problems %J IEEE Trans. Automatic Control %V 34 %N 9 %D September 1989 %P 930-942 %X \fBAbstract:\fP In this paper we focus on two areas of communication network design in which methods of control and optimization theory have proven useful. These are the area of multiple access communication (for networks with shared links such as radio networks and local area networks) and the area of network routing (for networks with point-to-point interconnections). We review a few selected problems in each area to show the role of the control concepts involved and we then proceed to identify other areas of communication network design in which the same control theoretic and optimization methodology may be applicable and useful. We do not survey the work done in this area, nor do we review work in control areas whose methods are applicable to other communication network problems. Instead, we attempt to bring to the attention of the control system community the numerous instances of problems arising the pure communication network design process that can benefit from the attention and capabilities of this community. %K Multicasting %A D.M. Topkis %T All-to-All Broadcast by Flooding in Communications Networks %P 1330-1332 %D September 1989 %N 9 %V 38 %J IEEE Trans. Computers %K Remote\0Procedure\0Calls %A Larry L. Peterson %A Nick C. Bucholz %A Richard D. Schlicting %T Preserving and Using Context Information in Interprocess Communication %P 217-246 %J ACM Trans. Computer Systems %D August 1989 %V 7 %N 3 %K Security\0and\0Authentication %A M. Satyanarayanan %T Integrating Security in a Large Distributed System %P 247-280 %J ACM Trans. Computer Systems %D August 1989 %V 7 %N 3 %K Transport\0Protocols %A A. Udaya Shankar %T Verified Data Transfer Protocols with Variable Flow Control %J ACM Trans. Computer Systems %P 281-316 %D August 1989 %V 7 %N 3 %K Network\0Design %A James B. Harris %A Michale W. Humes %A Joseph M. Mellichamp %A O-Joung Kwon %T Nestor: Network Engineering System for Topology and Requirements %J Expert Systems %V 6 %N 3 %D 1989 %K Electronic\0Mail %A J. Linn %T Privacy Enhancement for Internet Electronic Mail: Part I -- Message Encipherment and Authentication Procedures; RFC 1113 %N 1113 %J Internet Request for Comments %D August 1989 %I Network Information Center, SRI International %C Menlo Park, CA %X \fBAbstract:\fP This RFC suggests a draft standard elective protocol for the Internet community, and requests discussion and suggestions for improvements. This memo obsoletes RFC 989 and RFC 1040.