• Algorithm satisfies ME1
  • Two processes $p_i$ and $p_j$ can only access CS at the same time if both replied straight away to each other
  • BUT pairs $<T_i , p_i >$ are totally ordered, one process has to place the other in the queue
• Algorithm satisfies ME2
  • All other N-1 processes will eventually reply
• Algorithm satisfies ME3
  • Requests with lower Lamport timestamps are granted earlier
• Performance
  • Msg complexity: 2(N-1) msg
  • Client delay: Roundtrip time of request and reply
  • SD: one msg transmission time
• Improved versions exist for reducing bandwidth costs, e.g., repeated entry of same process without executing protocol