{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:11:36Z","timestamp":1743027096196,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_21","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T07:22:50Z","timestamp":1311232970000},"page":"234-245","source":"Crossref","is-referenced-by-count":1,"title":["On the Performance of a Retransmission-Based Synchronizer"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Nowak","sequence":"first","affiliation":[]},{"given":"Matthias","family":"F\u00fcgger","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"K\u00f6\u00dfler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. John Wiley & Sons, Chichester (2004)","edition":"2"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of Network Synchronization. J. ACM\u00a032, 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1214\/aoap\/1019487510","volume":"10","author":"F. Baccelli","year":"2000","unstructured":"Baccelli, F., Hong, D.: Analytic Expansions of Max-Plus Lyapunov Exponents. Ann. Appl. Probab.\u00a010, 779\u2013827 (2000)","journal-title":"Ann. Appl. Probab."},{"key":"21_CR4","volume-title":"21st Annual ACM Symposium on Principles of Distributed Computing","author":"O. Bakr","year":"2002","unstructured":"Bakr, O., Keidar, I.: Evaluating the Running Time of a Communication Round over the Internet. In: 21st Annual ACM Symposium on Principles of Distributed Computing. ACM, New York (2002)"},{"key":"21_CR5","volume-title":"2nd Annual ACM Symposium on Principles of Distributed Computing","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In: 2nd Annual ACM Symposium on Principles of Distributed Computing. ACM, New York (1983)"},{"key":"21_CR6","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D.P. Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs (1989)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G. Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous Consensus and Broadcast Protocols. J. ACM\u00a032, 824\u2013840 (1985)","journal-title":"J. ACM"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B. Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The Heard-Of Model: Computing in Distributed Systems with Benign Faults. Distrib. Comput.\u00a022, 49\u201371 (2009)","journal-title":"Distrib. Comput."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. J. ACM\u00a035, 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-38995-0","volume-title":"Max-Plus Linear Stochastic Systems and Pertubation Analysis","author":"B. Heidergott","year":"2006","unstructured":"Heidergott, B.: Max-Plus Linear Stochastic Systems and Pertubation Analysis. Springer, Heidelberg (2006)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM T. Progr. Lang. Sys.\u00a04, 382\u2013401 (1982)","journal-title":"ACM T. Progr. Lang. Sys."},{"key":"21_CR12","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"21_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3267-7","volume-title":"Markov Chains and Stochastic Stability","author":"S. Meyn","year":"1993","unstructured":"Meyn, S., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, Heidelberg (1993)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger, G., Toueg, S.: Automatically Increasing the Fault-Tolerance of Distributed Algorithms. J. Algorithm\u00a011, 374\u2013419 (1990)","journal-title":"J. Algorithm"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Nowak, T., F\u00fcgger, M., K\u00f6\u00dfler, A.: On the Performance of a Retransmission-based Synchronizer. Research Report 9\/2011, TU Wien, Inst. f. Technische Informatik (2011), http:\/\/www.vmars.tuwien.ac.at\/documents\/extern\/2899\/paper.pdf","DOI":"10.1007\/978-3-642-22212-2_21"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0020-0190(94)90102-3","volume":"49","author":"S. Rajsbaum","year":"1994","unstructured":"Rajsbaum, S.: Upper and Lower Bounds for Stochastic Marked Graphs. Inform. Process. Lett.\u00a049, 291\u2013295 (1994)","journal-title":"Inform. Process. Lett."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/71.308532","volume":"5","author":"S. Rajsbaum","year":"1994","unstructured":"Rajsbaum, S., Sidi, M.: On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays. IEEE T. Parall. Distr.\u00a05, 939\u2013950 (1994)","journal-title":"IEEE T. Parall. Distr."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-4149(90)90091-6","volume":"36","author":"J.A.C. Resing","year":"1990","unstructured":"Resing, J.A.C., de Vries, R.E., Hooghiemstra, G., Keane, M.S., Olsder, G.J.: Asymptotic Behavior of Random Discrete Event Systems. Stochastic Process. Appl.\u00a036, 195\u2013216 (1990)","journal-title":"Stochastic Process. Appl."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,28]],"date-time":"2021-11-28T12:47:12Z","timestamp":1638103632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}