{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:53Z","timestamp":1725455393228},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019805","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:25:50Z","timestamp":1131841550000},"page":"197-211","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local fail-safe network reset procedure"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Baruch","family":"Awerbuch","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \u201cComplexity of Network Synchronization,\u201d Journal of the ACM\n32(4), pp.804\u2013823 (October 1985).","journal-title":"Journal of the ACM"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and R. Gallager, \u201cDistributed BFS algorithms,\u201d Proceedings of IEEE conference on Foundations of Computer Science (October 1985).","DOI":"10.1109\/SFCS.1985.20"},{"key":"16_CR3","unstructured":"A. E. Baratz and A. Segall, \u201cReliable Link Initialization Procedures,\u201d IFIP 3rd Workshop on Protocol Specification, Testing and Verification, III (May 1983)."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"K. A. Bartlett","year":"1969","unstructured":"K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson, \u201cA note on reliable full-duplex transmission over half-duplex links,\u201d Comm of the ACM\n12, pp.260\u2013261 (1969).","journal-title":"Comm of the ACM"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"K. M. Chandy and L. Lamport, \u201cDistributed Snapshots: Determining Global States of Distributed Systems,\u201d ACM TOCS 3(1), pp.63\u201375 (January 1985).","journal-title":"ACM TOCS"},{"key":"16_CR6","unstructured":"E. J. Chang, \u201cDecentralized Algorithms in Distributed Systems,\u201d CSRG-103, University of Toronto, Toronto, Canada (October 1979). Ph.D. Thesis."},{"key":"16_CR7","unstructured":"I. Cidon and A. Segall, \u201cNetwork Resynch Protocols,\u201d unpubliched manuscript, Technion 1982."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/TCOM.1979.1094473","volume":"COM-27","author":"S. G. Finn","year":"1979","unstructured":"S. G. Finn, \u201cResynch Procedures and Fail-Safe Network Protocol,\u201d IEEE Tranc. on Comm.\nCOM-27, pp.840\u2013845 (June 1979).","journal-title":"IEEE Tranc. on Comm."},{"key":"16_CR9","unstructured":"R. G. Gallager, A Shortest Path Routing Algorithm with Automatic Resynch, M.I.T. (March 1976). Unpublished note."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"R. G. Gallager, \u201cDistributed Minimum Hop Algorithms,\u201d LIDS-P-1175, M.I.T. Lab for Information and Decision Systems (January, 1982).","DOI":"10.21236\/ADA117808"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallager","year":"1983","unstructured":"R. G. Gallager, P. A. Humblet, and P. M. Spira, \u201cA Distributed Algorithm for Minimum Weight Spanning Trees,\u201d ACM Trans. Program. Lang. Syst.\n5, pp.66\u201377 (Jan 1983).","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"7","key":"16_CR12","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, \u201cTime, Clocks, and the Ordering of Events in a Distributed System,\u201d CACM\n21(7), pp.558\u2013565 (July 1978).","journal-title":"CACM"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"A. Segall, \u201cDistributed Network Protocols,\u201d IEEE Transactions on Information Theory\nIT-29(1) (January 1983).","DOI":"10.1109\/TIT.1983.1056620"},{"key":"16_CR14","unstructured":"A. Segall, I. S. Gopal, and A. E. Baratz, \u201cQuery Algorithms in Computer Networks,\u201d 2nd International Workshop on Distributed Algorithms (July 1987)."},{"key":"16_CR15","unstructured":"F. R. Soloway and P. A. Humblet, On distributed network protocols for changing topologies, May 1986. Report LIDC-P-1564 MIT Laboratory for Inf. and Dec. Sys."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:58:27Z","timestamp":1558256307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0019805","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"16 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}