A reliable datagram protocol on local area networks
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Improving round-trip time estimates in reliable transport protocols
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Efficient at-most-once messages based on synchronized clocks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
UNIX network programming
Computing the internet checksum
ACM SIGCOMM Computer Communication Review
Hi-index | 0.24 |
The reliable delivery of data is important to distributed applications as it simplifies applications design. However, existing datagram transport services do not usually provide reliable delivery of messages. In view of this, we have designed and implemented a robust reliable datagram transport protocol, called SRDTP. SRDTP provides reliable end-to-end transport of data between host processes in a connectionless and orderly manner. It provides flow control, incorporates error handling, and supports the transport of urgent datagrams. We believe that SRDTP is particularly useful for implementing distributed client-server applications which are largely involved in intermittent exchanges. SRDTP is currently implemented as part of the SHILPA distributed computing environment. This paper describes the motivation for a reliable datagram, the SRDTP protocol, and its implementation, in detail.