D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical report, The Hebrew University of Jerusalem, November 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....sends and receives are achieved efficiently, the processing cost of the total ordering protocol is high : the delivery predicate is not built incrementally, the ordering has to take into account the recovery of lost messages. Dolev, Kramer and Malki refined this approach in the Transis system [DKM92] If i is in ack(m p ) then p has received i and all j in ack (i) where ack is the transitive closure of ack. Therefore, acknowledgments directly create a causal order, simplifying the total ordering (Toto) and group membership protocol. Both use this partial order and have a reasonable ....

....candidate message j (if win(j; i) 1 in G, win(j; i) 1 in any extension of G) We have presented an informal proof of correctness based on internal and external stability arguments while ignoring the interaction of the protocol with failures and group changes. These details are discussed in [DKM92] We note that ToTo delivery rule 1b) is only used to guarantee that when the delivery of messages occurs, the processor has received every source message. 4 Generalized ToTo The S ToTo protocol can permit the delivery of a message after messages have been received from as few as n=2 1 ....

[Article contains additional citation context not shown here]

D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical report, The Hebrew University of Jerusalem, November 1992.

....is stable and can be delivered: 1. MG nSG = fA; I; Jg nvt(A) u = 3 Phi 9B 2 SG ; votes(B; A) 5 Phi nvt(I) u = 4 Phi 9B 2 SG ; votes(B; I) 5 nvt(J) u = 3 Phi 9B 2 SG ; votes(B; J) 5 2. ntail(G) 10 n Gamma Phi 9B 2 SG ; nvt(B) Phi 2 Neither Total [60] nor ToTo [35] are able to elect messages with such DAG, as they require a candidate set to receive more than n=2 votes to be elected. Now suppose that H has not been inserted yet. The functions are modified as follows: ntail(G) 9; u = 3; nvt(I) 1; votes(I; A) votes(I; B) votes(I; F ) votes(I; J) ....

D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical report, The Hebrew University of Jerusalem, November 1992.

.... processors, Phi = 4 majority threshold ntail(G) 10 number of processors that have voted u = n Gamma ntail(G) 2 unseen votes, MG = fA; B; F; I; Jg roots of the dag m i A B F I J nvt(m i ) jfAgj = 1 jfB; C; D;E;Ggj = 5 jfC; D;E;F gj = 4 jfH; Igj = 1 jfJgj = 1 10 Neither Total [61] nor ToTo [36] are able to elect messages with such DAG, as they require a candidate set to receive more than n=2 votes to be elected. votes(row; col) A B F I J A Gamma jfAgj = 1 1 1 1 B jfB; C; D;E;Ggj = 5 Gamma jfB; Ggj = 2 5 5 F jfC; D;E;F gj = 4 jfF gj = 1 Gamma 4 4 I jfH; Igj = 2 2 2 Gamma 2 J ....

D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical report, The Hebrew University of Jerusalem, November 1992.

....This service delivers the message immediately from the DAG to the upper level. 2. Causal multicast: guarantees that delivery order preserves causality. 3. Agreed multicast: delivers messages in the same order at all sites. The ToTo algorithm implements the agreed multicast service in Transis (see [1]) 4. Safe multicast: delivers a message after all the active machines have acknowledged its reception. The Transis protocols employ the network broadcast capability for the efficient dissemination of messages to multiple destinations via a single transmission. 3 The Membership Problem The ....

....members learn about the failure within a finite time and proceed to make the decision using the subset of the values. Note that this subset is the same at all the machines, due to the virtual synchrony property. A more complicated consensus decision that utilizes the dynamic membership is given in [1]. Fault tolerant mutual exclusion can be achieved. If the holder of a lock should fail, the remaining machines can retrieve it. A set of coordinated processes can provide reliable work sharing. In this application, a certain set of tasks is distributed among replicated processes, each ....

Y. Amir, D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical Report CS92-9, Dept. of Comp. Sci., the Hebrew University of Jerusalem, 1992.

....below) 4. Agreed multicast: delivers messages in the same order at all sites. There are various protocols for achieving the agreed order, some not involving additional messages ( 14, 17] others involving a central coordinator ( 8, 5] We developed a symmetrical algorithm that achives this (see [2]) 5. Safe multicast: delivers a message after all the active processors have acknowledged its reception. These services resemble the ISIS approach, however the design and implementation differ. The main benefit of the Transis approach is that it operates over nonreliable communication channels ....

....causal order is a partial order, the agreed multicast needs to concur on a single total order of the messages. Note that a majority decision does not achieve the agreed order, since the environment is asynchronous and exhibits crashes. The agreed multicast is implemented via the ToTo algorithm ([2]) The index of synchrony in ToTo is n 2 1. Safe Sometimes the user is concerned that a specific message is received by all the destined processors before taking an action. The safe multicast provides this information, and delivers the message to the upper level 3 The range of time is ....

[Article contains additional citation context not shown here]

Y. Amir, D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical Report CS92-9, dept. of comp. sci.., the Hebrew University of Jerusalem, 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