R. W. Watson. The delta-t transport protocol: Features and experience. In IEEE 14th Conference on Local Computer Networks, pages 399--407, October 1989. 432  Home/Search   Document Not in Database   Summary   Related Articles   Check

....with synchronized clocks, if the server does not remember the time of the last crash, then a three way handshake is necessary for reliable message delivery. Another approach to the design of reliable transport level protocol is to use timer based mechanisms. For example, the Delta t protocol [37] relies on clocks that run at the rate of real time and exploits the knowledge of the maximum segment lifetime (MSL) In this type of environment, Kleinberg et al. show that either it takes a three way handshake to deliver a message, or at least the maximum packet lifetime must elapse before ....

R. W. Watson. The delta-t transport protocol: Features and experience. In IEEE 14th Conference on Local Computer Networks, pages 399--407, October 1989. 432

....a network. A typical transaction is a request from a client and a response from a server. The canonical example being remote procedure call. Transport level protocols such as TCP [14] and ISO TP 4 [9] work well for data streaming, but are inefficient for transactions. However, several protocols [19, 11, 17] have been designed to meet both needs, including a proposed extension of TCP call T TCP [4, 5] The goal of T TCP is not to perform efficient transactions all the time, but only under certain conditions. However, in examining T TCP [18] we observed that in certain situations the protocol may ....

....TCP whenever a connection is closed the state information associated with that connection is deleted. However, if the server does not immediately quiesce when a connection closes then timer based mechanisms can be used for reliable transport level protocols. For example, Watson s Delta t protocol [19] relies on clocks that run at the rate of real time and exploits the knowledge of the maximum packet lifetime (MPL) to achieve transactions in one round trip across the network. For the Delta t protocol, quiesce time is based on the MPL. If the client and server hosts are assumed to have ....

Watson, R. W. The delta-t transport protocol: Features and experience. In IEEE 14th Conference on Local Computer Networks (October 1989), pp. 399--407. 9

....from user data exchange. Moreover, since a large amount of data may be traveling between communicating end systems, state exchange (e.g. acknowledgments and connection state information exchange) after dedicated requests and errors (e.g. XTP [8] or periodic exchanges (e.g. SNR [7] and Delta t [15]) seem to be more suitable than state exchange for each data packet. All FSM protocols use separate P frames (external messages) individual error recovery mechanisms, and timers. P frames containing user data are called Pdata frames or packets in contrast to the P control frames, which contain ....

Watson, R. W.: The Delta-t Transport Protocol: Features and Experiences, in: Rudin, H. and Williamson R. (eds.): Protocols for High-Speed Networks, North-Holland, 1989, pp. 3-17

....such delivery must be provided using an underlying network that may lose,duplicate, reorder, or arbitrarily delay packets; the Internet is a well known example of such a network. Many protocols have been designed for this purpose, such as TCP [Pos81] Birrell and Nelson s RPC [BN84] Delta t [Wat89] and SCMP [LSW91] but they fall short of either reliability or efficiency. In particular, protocols that guarantee reliable delivery over unreliable networks with unbounded delays require an exchange of mutual information, called a handshake, before two processes can communicate [Tom75, Bel76] ....

....protocols avoid handshakes by making assumptions about the time characteristics of the underlying network, but they fail when those assumptions do not hold. For example, some protocols assume that no copy of a packet may be present in the network after its maximum lifetime has passed [FW78, BN84, Wat89] If a duplicate packet survives for longer,these protocols might deliver duplicate messages. Another protocol relies on looselysynchronized clocks at hosts and bounded packet delay so that old information can be discarded [LSW91] If clock skews or packet delays are longer, this protocol might ....

[Article contains additional citation context not shown here]

R. W. Watson. The delta-t transport protocol: Features and experience. In Proc. 14th Conf. Local Computer Networks, pages 399--407. IEEE, Oct. 1989. 9

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC