THE OMEGA FAILURE DETECTOR IN THE CRASH-RECOVERY MODEL

[1]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[2]  Marcos K. Aguilera,et al.  Failure Detection and Randomization: A Hybrid Approach to Solve Consensus , 1998, SIAM J. Comput..

[3]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[4]  Ulrich Schmid,et al.  The Theta-Model: achieving synchrony without clocks , 2009, Distributed Computing.

[5]  Idit Keidar,et al.  On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial , 2003, LADC.

[6]  Leslie Lamport,et al.  Paxos Made Simple , 2001 .

[7]  Marcos K. Aguilera,et al.  On the quality of service of failure detectors based on control theory , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[8]  Salahuddin Mohammad Masum,et al.  Asynchronous leader election in mobile ad hoc networks , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[9]  Carole Delporte-Gallet,et al.  Robust Stabilizing Leader Election , 2007, SSS.

[10]  Nancy A. Lynch,et al.  Bounds on the time to reach agreement in the presence of timing uncertainty , 1994, JACM.

[11]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[12]  Dawn Xiaodong Song,et al.  SIA: secure information aggregation in sensor networks , 2003, SenSys '03.

[13]  Mikel Larrea,et al.  Eventually consistent failure detectors , 2005, J. Parallel Distributed Comput..

[14]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[15]  Bernadette Charron-Bost,et al.  Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes , 1996, WDAG.

[16]  Arkady Zamsky.  An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time , 1996, PODC '96.

[17]  Rachid Guerraoui,et al.  Fast non-blocking atomic commit: an inherent trade-off , 2004, Inf. Process. Lett..

[18]  Rachid Guerraoui,et al.  The information structure of indulgent consensus , 2004, IEEE Transactions on Computers.

[19]  Sam Toueg,et al.  Fault-tolerant broadcasts and related problems , 1993 .

[20]  Antonio Fernández,et al.  Implementing unreliable failure detectors with unknown membership , 2006, Inf. Process. Lett..

[21]  Hagit Attiya,et al.  Achievable cases in an asynchronous environment , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[22]  Rachid Guerraoui,et al.  Consensus in Asynchronous Distributed Systems: A Concise Guided Tour , 1999, Advances in Distributed Systems.

[23]  Michel Raynal,et al.  From an Intermittent Rotating Star to a Leader , 2007, OPODIS.

[24]  Achour Mostéfaoui,et al.  A Time-free Assumption to Implement Eventual Leadership , 2006, Parallel Process. Lett..

[25]  Yair Amir,et al.  The Spread Wide Area Group Communication System , 2007 .

[26]  James Aspnes,et al.  Randomized protocols for asynchronous consensus , 2002, Distributed Computing.

[27]  Sam Toueg,et al.  Randomized Byzantine Agreements , 1984, PODC '84.

[28]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[29]  M. Bjorkman,et al.  Asymmetric multihop communication in large sensor networks , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

[30]  Silvio Micali,et al.  An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement , 1989, ICALP.

[31]  Achour Mostéfaoui,et al.  Time-free and timer-based assumptions can be combined to obtain eventual leadership , 2006, IEEE Transactions on Parallel and Distributed Systems.

[32]  Shmuel Zaks,et al.  A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor , 1988, PODC '88.

[33]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[34]  Shmuel Zaks,et al.  Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks , 1995, Theor. Comput. Sci..

[35]  Rachid Guerraoui,et al.  Non blocking atomic commitment with an unreliable failure detector , 1995, Proceedings. 14th Symposium on Reliable Distributed Systems.

[36]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[37]  Ozalp Babaoglu,et al.  Non-blocking atomic commitment , 1993 .

[38]  Rachid Guerraoui,et al.  On the Weakest Failure Detector for Non-Blocking Atomic Commit , 2002, IFIP TCS.

[39]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[40]  Louise E. Moser,et al.  Processor Membership in Asynchronous Distributed Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[41]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[42]  James Aspnes,et al.  Fast deterministic consensus in a noisy environment , 2000, PODC '00.

[43]  Fei Hu,et al.  Optimized scheduling for data aggregation in wireless sensor networks , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[44]  Dale Skeen,et al.  Nonblocking commit protocols , 1981, SIGMOD '81.

[45]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[46]  Dahlia Malkhi,et al.  Chasing the Weakest System Model for Implementing Ω and Consensus , 2009, IEEE Transactions on Dependable and Secure Computing.

[47]  Leslie Lamport.  Lower bounds for asynchronous consensus , 2003 .

[48]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[49]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[50]  Bernadette Charron-Bost.  Comparing the atomic commitment and consensus problems , 2003 .

[51]  André Schiper,et al.  Uniform consensus is harder than consensus , 2004, J. Algorithms.

[52]  Roy Friedman,et al.  Failure detectors in omission failure environments , 1997, PODC '97.

[53]  Marcos K. Aguilera,et al.  On implementing omega in systems with weak reliability and synchrony assumptions , 2008, Distributed Computing.

[54]  Rachid Guerraoui.  Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus , 1995, WDAG.

[55]  Mohamed G. Gouda,et al.  Stabilization and pseudo-stabilization , 2005, Distributed Computing.

[56]  Dahlia Malkhi,et al.  Omega Meets Paxos: Leader Election and Stability Without Eventual Timely Links , 2005, DISC.

[57]  Felix C. Freiling,et al.  Modular Consensus Algorithms for the Crash-Recovery Model , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[58]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[59]  Nicola Santoro,et al.  Time is Not a Healer , 1989, STACS.

[60]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[61]  Richard A. Golding,et al.  GROUP MEMBERSHIP IN THE EPIDEMIC STYLE , 1992 .

[62]  Péter Urbán,et al.  Token-based atomic broadcast using unreliable failure detectors , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[63]  Samir R. Das,et al.  Serial data aggregation using space-filling curves in wireless sensor networks. , 2003 .

[64]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[65]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[66]  Christoph Peter Malloth,et al.  Conception and implementation of a toolkit for building fault-tolerant distributed applications in large scale networks , 1996 .

[67]  André Schiper,et al.  Stubborn Communication Channels , 1998 .

[68]  Arthur L. Liestman,et al.  Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks , 2005, Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'05).

[69]  André Schiper,et al.  From set membership to group membership: a separation of concerns , 2006, IEEE Transactions on Dependable and Secure Computing.

[70]  Felix C. Freiling,et al.  Secure Failure Detection in TrustedPals , 2007, SSS.

[71]  Michel Raynal,et al.  A simple and fast asynchronous consensus protocol based on a weak failure detector , 1999, Distributed Computing.

[72]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[73]  Antonio Fernández,et al.  Minimal System Conditions to Implement Unreliable Failure Detectors , 2006, 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06).

[74]  Nancy A. Lynch,et al.  Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[75]  Dawn Song,et al.  SIA: Secure information aggregation in sensor networks , 2007, J. Comput. Secur..

[76]  Eli Gafni,et al.  Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). , 1998, PODC 1998.

[77]  Felix C. Freiling,et al.  Optimal Randomized Fair Exchange with Secret Shared Coins , 2005, OPODIS.

[78]  Mikel Larrea,et al.  On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems , 2004, IEEE Trans. Computers.

[79]  Marcos K. Aguilera,et al.  On implementing omega with weak reliability and synchrony assumptions , 2003, PODC '03.

[80]  Jo-Mei Chang,et al.  Reliable broadcast protocols , 1984, TOCS.

[81]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[82]  Paul D. Ezhilchelvan,et al.  An optimal atomic broadcast protocol and an implementation framework , 2003, Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003)..

[83]  Keith Marzullo,et al.  Election Vs. Consensus in Asynchronous Systems , 1995 .

[84]  P. F. Tsuchiya.  The landmark hierarchy: a new hierarchy for routing in very large networks , 1988, SIGCOMM.

[85]  André Schiper,et al.  Consensus in the Crash-Recover Model , 1997 .

[86]  Boaz Patt-Shamir,et al.  Communication-efficient probabilistic quorum systems for sensor networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[87]  Michel Raynal,et al.  Eventual Leader Service in Unreliable Asynchronous Systems: Why? How? , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[88]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[89]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[90]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[91]  Donald F. Towsley,et al.  Design and analysis of a leader election algorithm for mobile ad hoc networks , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[92]  RajagopalanR.,et al.  Data-aggregation techniques in sensor networks , 2006 .

[93]  Andrew Chi-Chih Yao,et al.  Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.

[94]  Marcos K. Aguilera,et al.  Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication , 1997, WDAG.

[95]  André Schiper,et al.  The Heard-Of model: computing in distributed systems with benign faults , 2009, Distributed Computing.

[96]  Mikel Larrea,et al.  Optimal implementation of the weakest failure detector for solving consensus , 2000, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000.

[97]  Michel Raynal,et al.  Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony , 2006, DSN.

[98]  André Schiper.  Early consensus in an asynchronous system with a weak failure detector , 1997, Distributed Computing.

[99]  Michel Raynal,et al.  From an intermittent rotating star to a leader , 2007, PODC '07.

[100]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[101]  Rachid Guerraoui,et al.  Fast Indulgent Consensus with Zero Degradation , 2002, EDCC.

[102]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[103]  Leslie Lamport,et al.  Disk Paxos , 2003, Distributed Computing.

[104]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[105]  Paul G. Spirakis,et al.  Fundamental control algorithms in mobile networks , 1999, SPAA '99.

[106]  Achour Mostéfaoui,et al.  Leader-Based Consensus , 2001, Parallel Process. Lett..

[107]  A.E. Kamal,et al.  Data aggregation in wireless sensor networks - exact and approximate algorithms , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[108]  Achour Mostéfaoui,et al.  Asynchronous implementation of failure detectors , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[109]  Bernadette Charron-Bost,et al.  On the impossibility of group membership , 1996, PODC '96.

[110]  Marcos K. Aguilera,et al.  Stable Leader Election , 2001, DISC.

[111]  Marcos K. Aguilera,et al.  Failure detection and consensus in the crash-recovery model , 2000, Distributed Computing.