A reliable datagram protocol on local area networks

ABSTRACT

Most of interprocess communications in transaction oriented distributed systems are based on client-server model, in which one process communicates with several processes simultaneously. Datagram service fits this type of communication rather than virtual circuit service. Transaction oriented distributed systems sometimes need to move large data such as a file or a part of database from a machine to other. The reliable delivery is fairly important since an error might cause retransmission of a whole data. In this paper, we propose the efficient mechanism for reliable datagram service, i) the concept of semi-virtual circuit and ii) the simple error detection and recovery algorithm based on our existing transport protocol, UDSTP. We describe implementation details supporting those facilities and performance results.

REFERENCES

• Watson81: Richard W. Watson, IPC Interface and End-to-End Protocols, Distributed Systems - Architecture and Implementation, An Advanced Course, p.140-174, January 1981
• Zimmermann80: H. Zimmermann, "OSI Reference Model- The ISO Model of Architecture for Open System Interconnection," iEEE Trans. on Communications 23(4), pp. 425-432 (Apr. 1980).
• Lee85: D. Lee and A. Linton, "A Transport Protocol for a Uniform Datagram Service," TR 208, Computing Laboratory, University of Newcastle upon Tyne (Oct. 1985).
• Panzieri85: Fabio Panzieri , Brian Randell, Interfacing UNIX to data communications networks, IEEE Transactions on Software Engineering, v.11 n.10, p.1016-1032, Oct. 1985 [doi>10.1109/TSE.1985.231548]
• Ritchie74: Dennis M. Ritchie , Ken Thompson, The UNIX time-sharing system, Communications of the ACM, v.17 n.7, p.365-375, July 1974 [doi>10.1145/361011.361061]
• Zwanepoel85: Willy Zwaenepoel, Protocols for large data transfers over local networks, Proceedings of the ninth symposium on Data communications, p.22-32, September 1985, Whistler Moutain, British Columbia, Canada
• Linton84: A. Linton and F. Panzieri, "A Communication System Supporting Large Datagrams on a Local Area Network," TR193, Computing Laboratory, University of Newcastle upon Tyne (1984).
• Leffler83: S. Leffier, W. Joy, and R. Fabry, 4.2BSD IPC Primer, University of California, Berkeley (1983).
• Torek85: C. Torek, Personal Communication (1985).
• Davies81: Donald W. Davies , Richard W. Watson, Hierarchy, Distributed Systems - Architecture and Implementation, An Advanced Course, p.94-139, January 1981
• Chon86: K. Chon, "Pagoda: KAIST Computing Environment,'' Proceedings of SDN Summer Workshop (to be published) (July 1986).
• Chung86: C. Chung , D. Lee, J.H. Hur, H.J. Park, D.H. Oh, and K. Chon, "Experimental Pagoda: Testbed for Distributed Computing," Proceedings of SDN Summer Workshop (to be published) (July 1986).

INDEX TERMS

Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
  C.2 COMPUTER-COMMUNICATION NETWORKS

  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.5 Testing and Debugging
          Subjects: Error handling and recovery

General Terms:
Algorithms, Performance, Reliability