{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T23:40:01Z","timestamp":1749685201650,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319492582"},{"type":"electronic","value":"9783319492599"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49259-9_6","type":"book-chapter","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T01:11:34Z","timestamp":1478049094000},"page":"70-87","source":"Crossref","is-referenced-by-count":1,"title":["Packet Efficient Implementation of the Omega Failure Detector"],"prefix":"10.1007","author":[{"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianne","family":"Foreback","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"crossref","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":"6_CR2","doi-asserted-by":"crossref","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."},{"issue":"1","key":"6_CR3","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. Auton. Adapt. Syst. (TAAS) 4(1), 4 (2009)","journal-title":"ACM Trans. Auton. Adapt. Syst. (TAAS)"},{"key":"6_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Foreback, D., Nesterenko, M., Tixeuil, S.: Packet efficient implementation of the omega failure detector, Research Report. UPMC Universit\u00e9 Paris VI; Kent State University, February 2016. arXiv:1505.05025","DOI":"10.1007\/978-3-319-49259-9_6"},{"issue":"4","key":"6_CR6","doi-asserted-by":"crossref","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":"6_CR7","doi-asserted-by":"crossref","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":"6_CR8","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: Approximate consensus in highly dynamic networks. arXiv preprint arXiv:1408.0620 (2014)","DOI":"10.1007\/978-3-662-47666-6_42"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-13284-1_11","volume-title":"Structural Information and Communication Complexity","author":"C Delporte-Gallet","year":"2010","unstructured":"Delporte-Gallet, C., Devismes, S., Fauconnier, H., Larrea, M.: Algorithms for extracting timeliness graphs. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 127\u2013141. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13284-1_11"},{"key":"6_CR10","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\u00e9nyi, A.: On random graphs I. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"issue":"2","key":"6_CR11","doi-asserted-by":"crossref","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)","journal-title":"J. ACM"},{"issue":"4","key":"6_CR12","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"4","key":"6_CR13","doi-asserted-by":"crossref","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 $$\\omega $$ and consensus. IEEE Trans. Dependable Secur. Comput. 6(4), 269\u2013281 (2009)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"issue":"2","key":"6_CR14","doi-asserted-by":"crossref","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":"6_CR15","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1109\/TC.2004.33","volume":"53","author":"M Larrea","year":"2004","unstructured":"Larrea, M., Fern\u00e1ndez, A., Ar\u00e9valo, 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":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11561927_16","volume-title":"Distributed Computing","author":"D Malkhi","year":"2005","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: $$\\omega $$ meets paxos: leader election and stability without eventual timely links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 199\u2013213. Springer, Heidelberg (2005). doi: 10.1007\/11561927_16"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Mourgaya, E., Raynal, M.: Asynchronous implementation of failure detectors. In: 43rd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 351\u2013351. IEEE Computer Society (2013)","DOI":"10.1109\/DSN.2003.1209946"},{"issue":"7","key":"6_CR18","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/TPDS.2006.95","volume":"17","author":"A Most\u00e9faoui","year":"2006","unstructured":"Most\u00e9faoui, 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."},{"issue":"1\u20132","key":"6_CR19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0304-3975(00)00042-6","volume":"243","author":"R Prisco De","year":"2000","unstructured":"De Prisco, R., Lampson, B.W., Lynch, N.A.: Revisiting the PAXOS algorithm. Theor. Comput. Sci. 243(1\u20132), 35\u201391 (2000)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49259-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T23:12:42Z","timestamp":1749683562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49259-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319492582","9783319492599"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49259-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}