{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:10:16Z","timestamp":1758845416433},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40026-5_17","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T19:59:07Z","timestamp":1181678347000},"page":"253-267","source":"Crossref","is-referenced-by-count":21,"title":["Gossip versus Deterministically Constrained Flooding on Small Networks"],"prefix":"10.1007","author":[{"given":"Meng-Jang","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keith","family":"Marzullo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Masini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"17_CR1","unstructured":"G. R. Andrews. Concurrent programming: Principles and practice, Benjamin\/Cummings, 1991."},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/29868.31332","volume":"5","author":"Babaoglu","year":"1987","unstructured":"\u00f6. Babaoglu. On the reliability of consensus-based fault-tolerant distributed computing systems. ACM Transactions on Computer Systems, 5(4):394\u2013416 (November 1987).","journal-title":"ACM Transactions on Computer Systems"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1112\/S0025579300003806","volume":"14","author":"L. W. Beineke","year":"1967","unstructured":"L. W. Beineke and F. Harary. The connectivity function of a graph. Mathematika 14:197\u2013202 (1967).","journal-title":"Mathematika"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/312203.312207","volume":"17","author":"K. Birman","year":"1999","unstructured":"K. Birman et al. Bimodal multicast. ACM Transactions on Computer Systems 17(2):41\u201388 (May 1999).","journal-title":"ACM Transactions on Computer Systems"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"M. Clegg and K. Marzullo. A Low-cost processor group membership protocol for a hard real-time distributed system. In Proceedings of the 18th IEEE Real-Time Systems Symposium, 1997, pp. 90\u201398.","DOI":"10.1109\/REAL.1997.641272"},{"key":"17_CR6","unstructured":"C. J. Colbourn. The combinatorics of network reliability, Oxford University Press, 1987."},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF00365327","volume":"2","author":"F. Cristian","year":"1990","unstructured":"F. Cristian. Synchronous atomic broadcast for redundant broadcast channels. Real-Time Systems 2(3):195\u2013212 (September 1990).","journal-title":"Real-Time Systems"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/71.774912","volume":"10","author":"F. Cristian","year":"1999","unstructured":"F. Cristian and C. Fetzer. The timed asynchronous distributed system model. IEEE Transactions on Parallel and Distributed Systems 10(6):642\u2013657 (June 1999).","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"A. Demers et al. Epidemic algorithms for replicated database maintenance. In Proceedings of 6th ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 10-12 August 1987, pp. 1\u201312.","DOI":"10.1145\/41840.41841"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/90.650139","volume":"5","author":"S. Floyd","year":"1997","unstructured":"S. Floyd et al. A reliable multicast framework for light-weight sessions and application level framing. IEEE\/ACM Transactions on Networking 5(6):784\u2013803 (December 1997).","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"17_CR11","unstructured":"R. Friedman, S. Manor and K. Guo. Scalable stability detection using logical hypercube. Technion Department of Computer Science Technical Report 0960, May 1999."},{"key":"17_CR12","unstructured":"R. A. Golding and D. E. Long. The performance of weak-consistency replication protocols. University of California Santa Cruz, Computer Research Laboratory Technical Report UCSC-CRL-92-30, July 1992."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"K. Guo et al. GSGC: an efficient gossip-style garbage collection scheme for scalable reliable multicast. Cornell University, Department of Computer Science Technical Report TR-97-1656, December 3 1997.","DOI":"10.21236\/ADA542422"},{"key":"17_CR14","unstructured":"V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In Distributed Systems (S. Mullender, ed.), ACM Press, 1993."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","volume":"48","author":"F. Harary","year":"1962","unstructured":"F. Harary. The maximum connectivity of a graph. In Proceedings of the National Academy of Sciences, 48:1142\u20131146 (1962).","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"17_CR16","unstructured":"M. G. Hayden and K. P. Birman. Probabilistic broadcast. Cornell University, Department of Computer Science Technical Report TR-96-1606, September 1996."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"T. Abdelzaher, A. Shaikh, F. Jahanian and K. Shin. RTCAST: Lightweight multicast for real-time process groups. In Proceedings of the Second IEEE Real-Time Technology and Applications Symposium, 1996, pp.250\u2013259.","DOI":"10.1109\/RTTAS.1996.509542"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"A. Liestman. Fault-tolerant broadcast graphs. Networks 15(2): 159-171 (Summer 1985).","DOI":"10.1002\/net.3230150203"},{"key":"17_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-48254-7_25","volume-title":"Proceedings of the Third European Dependable Computing Conference","author":"M. J. Lin","year":"1999","unstructured":"M. J. Lin and K. Marzullo. Directional gossip: gossip in a wide area network. In Proceedings of the Third European Dependable Computing Conference, Prague, Czech Republic, September 1999 (Springer-Verlag LNCS 1667), pp. 364\u2013379."},{"key":"17_CR20","unstructured":"M. J. Lin, K. Marzullo and S. Masini. Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small network. University of California San Diego Department of Computer Science Technical Report CS99-0637, November 1999."},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","volume":"28","author":"A. Pelc","year":"1996","unstructured":"A. Pelc. Fault-tolerant broadcast and gossiping in communication networks. Networks 28(3):143\u2013156 (October 1996).","journal-title":"Networks"},{"issue":"l","key":"17_CR22","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"B. Pittel. On spreading a rumor. SI AM Journal on Applied Mathematics, 47(l):213\u2013223 (February 1987).","journal-title":"SI AM Journal on Applied Mathematics"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing (Middleware \u201998), The Lake District, England, September 1998, pp. 55\u201370.","DOI":"10.1007\/978-1-4471-1283-9_4"},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/190.357399","volume":"2","author":"F. B. Schneider","year":"1984","unstructured":"Fred B. Schneider. Byzantine generals in action: implementing fail-stop processors. ACM Transactions on Computer Systems 2(2):145\u2013154 (May 1984).","journal-title":"ACM Transactions on Computer Systems"},{"key":"17_CR25","unstructured":"Amitabh Shah. Exploring Trade-offs in the Design of Fault-Tolerant Distributed Databases. Ph.D. dissertation, Cornell University Department of Computer Science, August 1990."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"D. B. Terry et al. Managing update conflicts in Bayou, a weakly connected replicated storage system. In Proceedings of the 15th Symposium on Operating System Principles, 1995, pp. 3\u20136.","DOI":"10.1145\/224056.224070"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T22:08:13Z","timestamp":1556489293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}