作者: Marcos K. Aguilera , Carole Delporte-Gallet , Hugues Fauconnier , Sam Toueg
关键词:
摘要: We introduce the notion of stable leader election and derive several algorithms for this problem. Roughly speaking, a algorithm is if it ensures that once elected, remains as long does not crash its links have been behaving well, irrespective behavior other processes links. In addition to being stable, our desirable properties. particular, they are all communication-efficient, i.e., eventually use only n carry messages, robust, work in systems where to/from some correct process required be timely. Moreover, best tolerates message losses, elected constant time when system stable. conclude paper by applying above ideas robust efficient perfect failure detector lP.