To RTO-multicast (reliable, totally-ordered multicast) a message m, a process attaches a totally-ordered, unique identifier to m and R-multicasts it. Each process records the set of message it has R-delivered and the set of messages it has RTO-delivered. Thus it knows which messages have not yet been RTO-delivered. From time to time it proposes its set of not-yet-RTO-delivered messages as those that should be delivered next. A sequence of runs of the consensus algorithm takes place, where the k’th proposals (k = 1, 2, 3, ...) of all the processes are collected and a unique decision set of messages is the result. When a process receives the k’th consensus decision, it takes the intersection of the decision value and its set of not-yet-RTO-delivered messages and delivers them in the order
What will be an ideal response?
If we used a reliable but not totally ordered multicast, the majority function can only be used meaningfully if it is applied to the same set of values. But, in an asynchronous system, we cannot know how long to wait for the set of all values – the source of a missing message might be slow or it might have crashed. Waiting for the first message delivered by a reliable totally ordered multicast finesses that problem.
You might also like to view...
A(n) ________ generally appears at the bottom of slides and offers consistent text and/or graphics on each slide
Fill in the blank(s) with correct word
________ lists the following security objective with respect to current employees: “to ensure that employees, contractors, and third-party users are aware of information security threats and concerns and their responsibilities and liabilities with regard to information security and are equipped to support organizational security policy in the course of their normal work and to reduce the risk of human error”.
Fill in the blank(s) with the appropriate word(s).