Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks
暂无分享,去创建一个
[1] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.
[2] J. Gross,et al. Graph Theory and Its Applications , 1998 .
[3] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[4] Rachid Guerraoui,et al. Indulgent algorithms (preliminary version) , 2000, PODC '00.
[5] André Schiper,et al. Reaching Agreement with Unknown Participants in Mobile Self-Organized Networks in Spite of Process Crashes , 2005 .
[6] Francis C. Chu. Reducing &Ω to ◊ W , 1998 .
[7] Xavier Défago,et al. Gathering Asynchronous Mobile Robots with Inaccurate Compasses , 2006, OPODIS.
[8] Bernard Harris,et al. Graph theory and its applications , 1970 .
[9] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.
[10] André Schiper,et al. Consensus with Unknown Participants or Fundamental Self-Organization , 2004, ADHOC-NOW.
[11] Sam Toueg,et al. The weakest failure detector for solving consensus , 1992, PODC '92.