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.
- Watson81 R. W. Watson, "IPC Interface and End-to- End(transport) Protocol Design Issues," pp. 140- 174 in Lecture Notes in Computer Science , Srpinger Verlag (1981). Google ScholarDigital Library
- 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).Google ScholarCross Ref
- 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).Google Scholar
- Panzieri85 F. Panzieri and B. Randell, "Interfacing UNIX to Data Communication Networks," IEEE Trans. on Software Engineering 11(10), pp. 1016-1032 (Oct. 1985). Google ScholarDigital Library
- Ritchie74 D. M. Ritchie and K. Thompson, "The UNIX Time-Sharing System," CACM 17(7), pp. 365-375 (Jul. 1974). Google ScholarDigital Library
- Zwanepoel85 W. Zwanepoel, "Protocols for Large Data Transfer Over Local Networks," Ninth Data Communications Symposium, pp. 22-32 (Sep. 1985). Google ScholarDigital Library
- 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).Google Scholar
- Leffler83 S. Leffier, W. Joy, and R. Fabry, 4.2BSD IPC Primer, University of California, Berkeley (1983).Google Scholar
- Torek85 C. Torek, Personal Communication (1985).Google Scholar
- Davies81 D. W. Davies and R. W. Watson, "Hierarchy," pp. 94-138 in Lecture Notes in Computer Science, Sringer-Verlag (1981). Google ScholarDigital Library
- Chon86 K. Chon, "Pagoda: KAIST Computing Environment,'' Proceedings of SDN Summer Workshop (to be published) (July 1986).Google Scholar
- 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).Google Scholar
Index Terms
- A reliable datagram protocol on local area networks
Recommendations
A reliable datagram protocol on local area networks
SIGCOMM '86: Proceedings of the ACM SIGCOMM conference on Communications architectures & protocolsMost 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 ...
Network measurement and path characterization using user datagram protocol
The Internet is very dynamic, unreliable, and complex in nature. Many of its characteristics are not very visible since TCP (Transmission Control Protocol) provides a reliable end-to-end data delivery between two communicating hosts. However, it is ...
Comments