Optimal Atomic Broadcast and Multicast Algorithms forWide Area Networks.pptVIP

Optimal Atomic Broadcast and Multicast Algorithms forWide Area Networks Nicolas Schiper Fernando Pedone University of Lugano Switzerland Atomic Broadcast and Multicast Atomic Broadcast: m1 m2 m1 m2 m1 m2 m1 m2 m1 m2 m1 m2 ABCast m1 ABCast m2 ABCast m3 server 4 server 1 server 2 server 3 server 5 server 6 Atomic Multicast: AMCast m1 to g1, g2 AMCast m2 to g2, g3 AMCast m3 to all groups g1 g2 g3 m3 m3 m3 m3 m3 m3 m1 m1 m1 m1 m2 m2 m2 m2 m1 m2 = ?p : p A-Delivers m1 before m2 The relation is acyclic * Problem (2) Atomic multicast is reducible to atomic broadcast: Every multicast msg. is broadcast, only addresses of the msg. deliver it Solution of no practical interest: Communication among processes unrelated to msg. Genuine atomic multicast: Only processes addressed by the message take part in the protocol * Context Wide Area Networks: Fast and cheap Toronto Lugano Beijing Melbourne Slow and expensive * Goal Minimize number of inter-group msg. delays between multicast and deliver A-XCast(m) A-Del(m) A-Del(m) A-Del(m) = 2 inter-group msg. delays for delivery * In The Full Paper (1) … Genuine atomic multicast lower bound: Minimum 2 inter-group msg. delay We present an algorithm that achieves this lower bound Based on Skeen’s multicast algorithm (not fault-tolerant) Optimized version of Fritzke et al’s. (SRDS’98) * In The Full Paper (2) … Atomic Broadcast: We present an atomic broadcast algorithm that needs only 1 inter-group msg. delay The algorithm is proactive, nevertheless quiescent Msg. broadcast after algo. quiescent =  2 inter-group msg. delay for delivery Quiescence has an inherent cost: Our algorithm is optimal * Final Remarks Latency degree vs. msg. complexity tradeoff for data replication: Update data item A Optimize latency = atomic broadcast … but high msg. complex. Optimize msg. complex. = atomic multicast … but at least 2 inter-group msg. delays A B, C A A A,B A, B A, B B, C B, C B, C D, B D, B D, B * * * * Repl locally