{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:40:03Z","timestamp":1751416803536,"version":"3.41.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00224-018-9856-3","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T05:25:24Z","timestamp":1519363524000},"page":"237-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Packet Efficient Implementation of the Omega Failure Detector"],"prefix":"10.1007","volume":"63","author":[{"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5449-2755","authenticated-orcid":false,"given":"Dianne","family":"Foreback","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"key":"9856_CR1","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 328\u2013337. ACM (2004)","DOI":"10.1145\/1011767.1011816"},{"issue":"4","key":"9856_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00446-008-0068-y","volume":"21","author":"MK Aguilera","year":"2008","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing omega in systems with weak reliability and synchrony assumptions. Distrib. Comput. 21(4), 285\u2013314 (2008)","journal-title":"Distrib. Comput."},{"issue":"9","key":"9856_CR3","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1109\/TPDS.2009.163","volume":"21","author":"AF Anta","year":"2010","unstructured":"Anta, A.F., Raynal, M.: From an asynchronous intermittent rotating star to an eventual leader. IEEE Trans. Parallel Distrib. Syst 21(9), 1290\u20131303 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst"},{"key":"9856_CR4","doi-asserted-by":"crossref","unstructured":"Arantes, L., Greve, F., Sens, P., Simon, V.: Eventual leader election in evolving mobile networks. In: International Conference on Principles of Distributed Systems (OPODIS), vol. 8304, pp. 23\u201337 (2013)","DOI":"10.1007\/978-3-319-03850-6_3"},{"issue":"1","key":"9856_CR5","first-page":"4","volume":"4","author":"M Biely","year":"2009","unstructured":"Biely, M., Widder, J.: Optimal message-driven implementations of omega with mute processes. ACM Trans. Auto. Adaptive Syst. 4(1), 4 (2009)","journal-title":"ACM Trans. Auto. Adaptive Syst."},{"key":"9856_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs, 2 edn","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random graphs, 2 edn. Cambridge University Press, Cambridge (2001). http:\/\/www.worldcat.org\/isbn\/0521797225"},{"issue":"4","key":"9856_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"9856_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"9856_CR9","volume-title":"Parallel program design: A Foundation","author":"KM Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel program design: A Foundation. Addison-Wesley, Boston (1988)"},{"key":"9856_CR10","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: Approximate consensus in highly dynamic networks. arXiv: 1408.0620 (2014)"},{"key":"9856_CR11","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Devismes, S., Fauconnier, H.: Robust stabilizing leader election. In: Symposium on Self-Stabilizing Systems, pp. 219\u2013233. Springer (2007)","DOI":"10.1007\/978-3-540-76627-8_18"},{"key":"9856_CR12","unstructured":"Delporte-Gallet, C., Devismes, S., Fauconnier, H., Larrea, M.: Algorithms for extracting timeliness graphs. In: Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings, pp. 127\u2013141 (2010)"},{"key":"9856_CR13","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P.: R\u0117nyi: On random graphs I. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"9856_CR14","doi-asserted-by":"crossref","unstructured":"Ferna\u0307ndez, A., Jim\u0117nez, E., Raynal, M.: Eventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony. In: International Conference on Dependable Systems and Networks (DSN\u201906), pp. 166\u2013178. IEEE (2006)","DOI":"10.1109\/DSN.2006.34"},{"key":"9856_CR15","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez-Campusano, C., Larrea, M., Corti\u00f1as, R., Raynal, M.: A communication-efficient leader election algorithm in partially synchronous systems prone to crash-recovery and omission failures. In: Proceedings of the 17th International Conference on Distributed Computing and Networking, p. 8. ACM (2016)","DOI":"10.1145\/2833312.2833444"},{"issue":"2","key":"9856_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985). https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"issue":"4","key":"9856_CR17","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Statist. 30(4), 1141\u20131144 (1959). https:\/\/doi.org\/10.1214\/aoms\/1177706098","journal-title":"Ann. Math. Statist."},{"issue":"4","key":"9856_CR18","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TDSC.2008.24","volume":"6","author":"M Hutle","year":"2009","unstructured":"Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Chasing the weakest system model for implementing \u03c9 and consensus. IEEE Trans. Dependable Sec. Comput. 6(4), 269\u2013281 (2009)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"issue":"2","key":"9856_CR19","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2006.05.009","volume":"100","author":"E Jim\u00e9nez","year":"2006","unstructured":"Jim\u00e9nez, E., Ar\u00e9valo, S., Fern\u00e1ndez, A.: Implementing unreliable failure detectors with unknown membership. Inf. Process. Lett. 100(2), 60\u201363 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9856_CR20","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.jcss.2014.06.010","volume":"81","author":"A Lafuente","year":"2015","unstructured":"Lafuente, A., Larrea, M., Soraluze, I., Corti\u00f1as, R.: Communication-optimal eventually perfect failure detection in partially synchronous systems. J. Comput. Syst. Sci. 81(2), 383\u2013397 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"9856_CR21","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1109\/TC.2004.33","volume":"53","author":"M Larrea","year":"2004","unstructured":"Larrea, M., Ferna\u0307ndez, A., Ar\u0117valo, S.: On the implementation of unreliable failure detectors in partially synchronous systems. IEEE Trans. Comput. 53(7), 815\u2013828 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"9856_CR22","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: \u03a9 meets paxos: Leader election and stability without eventual timely links. In: Distributed Computing, pp. 199\u2013213. Springer (2005)","DOI":"10.1007\/11561927_16"},{"key":"9856_CR23","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Mourgaya, E., Raynal, M.: Asynchronous implementation of failure detectors. In: 2013 43rd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 351\u2013351. IEEE Computer Society (2003)","DOI":"10.1109\/DSN.2003.1209946"},{"issue":"7","key":"9856_CR24","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TPDS.2006.95","volume":"17","author":"A Most\u0117faoui","year":"2006","unstructured":"Most\u0117faoui, A., Raynal, M., Travers, C.: Time-free and timer-based assumptions can be combined to obtain eventual leadership. IEEE Trans. Parallel Distrib. Syst. 17(7), 656\u2013666 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9856_CR25","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"issue":"1-2","key":"9856_CR26","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(00)00042-6","volume":"243","author":"RD Prisco","year":"2000","unstructured":"Prisco, R.D., Lampson, B.W., Lynch, N.A.: Revisiting the PAXOS algorithm. Theor. Comput. Sci. 243(1-2), 35\u201391 (2000)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-018-9856-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9856-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9856-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:04:47Z","timestamp":1751414687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-018-9856-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["9856"],"URL":"https:\/\/doi.org\/10.1007\/s00224-018-9856-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"23 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}