S. Kramer. Total Ordering of Messages in Multicast Communication Systems. PhD thesis, The Hebrew University of Jerusalem, Jerusalem, Israel, December 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a total ordering. Maffies [67] also studies total ordering among multiple groups. Each subgroup is assigned a group transport service (GTS) agent, which provides a total ordering within the subgroup (inter group total ordering is not addressed) There are many other transport ordering protocols [14, 16, 15, 26, 55, 69, 73, 83] which are not discussed here since their primary focus is the ordering algorithm, as opposed to receiver feedback and error control. 2.2. Reliable Multicast Protocols 13 2.2 Reliable Multicast Protocols The drawback to the multicast ordering protocols presented in Section 2.1 is the latency and ....

S. Kramer. Total Ordering of Messages in Multicast Communication Systems. PhD thesis, The Hebrew University of Jerusalem, Jerusalem, Israel, December 1992.

....is based on the Trans protocol, with several important modifications that adapt it for practical use (see [4] The Total protocol reaches agreement on the total order of messages among a majority of the processes in the systems. The protocol is prone to deadlock in rare situations (see proof in [36]) The Xamp protocol of [60] relies on special network hardware that orders messages. The guarantee of message delivery in Xamp is based on a 2 phase acknowledgment protocol. An early delivery distributed protocol for totally ordering multicast messages appears in [26] and is employed in Transis. ....

S. Kramer. Total Ordering of Messages in Multicast Communication Systems. Master's thesis, Inst. of Computer Science, The Hebrew University of Jerusalem, 1992.

....different machines are required in order to decide on the next set of messages to be added to the total order. Experiments with the ToTo protocol in the Transis environment show a factor of O(log(n) speedup over the all ack protocol. These results match the theoretical predictions developed in [18]. ffl The ToTo protocol is fairly simple and does not bear a significant processing burden. ToTo was implemented in the Transis system, over UDP IP. Experimentis show a sustained throughput of 250 1K messages per second between 8 Sun 4 machines connected a 10 Mbit sec Ethernet, when all 8 ....

....to point communication, will give rise to communication scenarios in which the DAG is wider. For these systems we expect the optimal Phi to be greater than n 2 . The ToTo protocol was implemented as part of the Transis communication system. Details about this implementation can be found in [18]. Denote by n c the number of candidate messages. Denote by n p the number of pending messages. In our implementation, the ToTo protocol may inflict a complexity of O(n p n 2 c ) operations on message reception, a complexity of O(n 2 c ) operations on the processing of a crash event and a ....

[Article contains additional citation context not shown here]

S. Kramer. Total ordering of messages in multicast communication systems. Master's thesis, Hebrew University, Jerusalem, Il, December 1992.

....that this does not violate the impossibility of making consensus decisions ( 19] since our membership protocol employs timeouts. ffl The ToTo protocols preserve a bounded latency worst case behavior: the ToTo protocols always admit a message after all the machines acknowledge its reception. In [24], we show that this upper bound is impossible to incorporate in inherently fault tolerant protocols. Related Work The problem of total ordering has received considerable attention in the distributed processing community. Synchronous protocols for the total ordering problem have been studied ....

....to point communication, will give rise to communication scenarios in which the DAG is wider. For these systems we expect the optimal Phi to be greater than n 2 . The ToTo protocols were implemented as part of the Transis communication system. Details about this implementation can be found in [24]. Denote by n c the number of candidate messages. Denote by n p the number of pending messages. In our implementation, the ToTo protocols may inflict a complexity of O(n p n 2 c ) operations on message reception, a complexity of O(n 2 c ) operations on the processing of a crash event and a ....

[Article contains additional citation context not shown here]

S. Kramer. Total ordering of messages in multicast communication systems. Master's thesis, Hebrew University, Jerusalem, Il, December 1992.

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