Optimistic Generic Broadcast Export

@misc{citeulike:2356601, abstract = {Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all processes receive messages in the same order. Generic Broadcast requires two steps if no messages conflict. We present an algorithm that subsumes both of these approaches and guarantees two-step delivery if all conflicting messages are received in the same order, and three-step delivery otherwise.}, author = {July, Piotr Z.}, citeulike-article-id = {2356601}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/734399.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/734399.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/734399.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/734399.html}, keywords = {2005, broadcast, generic, optimistic}, posted-at = {2008-02-09 11:04:57}, priority = {2}, title = {Optimistic Generic Broadcast}, url = {http://citeseer.ist.psu.edu/734399.html} }

TY - GEN ID - citeulike:2356601 L3 - citeulike-article-id:2356601 N2 - Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all processes receive messages in the same order. Generic Broadcast requires two steps if no messages conflict. We present an algorithm that subsumes both of these approaches and guarantees two-step delivery if all conflicting messages are received in the same order, and three-step delivery otherwise. TI - Optimistic Generic Broadcast KW - 2005 KW - broadcast KW - generic KW - optimistic AU - July, Piotr UR - http://citeseer.ist.psu.edu/734399.html ER -