{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T05:03:59Z","timestamp":1748063039715,"version":"3.30.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/s004460050016","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T08:52:48Z","timestamp":1030265568000},"page":"147-156","source":"Crossref","is-referenced-by-count":22,"title":["Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links"],"prefix":"10.1007","volume":"9","author":[{"given":"Hasan M.","family":"Sayeed","sequence":"first","affiliation":[]},{"given":"Marwan","family":"Abu-Amara","sequence":"additional","affiliation":[]},{"given":"Hosame","family":"Abu-Amara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"50090147446_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/12.2189","volume":"37","author":"HH Abu-Amara","year":"1988","unstructured":"Abu-Amara HH: Fault-tolerant distributed algorithm for election in complete networks. IEEE Trans Comput 37(4): 449\u2013453 (1988)","journal-title":"IEEE Trans Comput"},{"issue":"7","key":"50090147446_CR2","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1109\/12.293257","volume":"43","author":"HH Abu-Amara","year":"1994","unstructured":"Abu-Amara HH, Lokre J: Election in asynchronous complete networks with intermittent link failures. IEEE Trans Comput 43(7): 778\u2013788 (1994)","journal-title":"IEEE Trans Comput"},{"key":"50090147446_CR3","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/0220023","volume":"20","author":"Y Afek","year":"1991","unstructured":"Afek Y, Gafni E: Time and message bounds for election in synchronous and asynchronous complete networks. SIAM J Comput 20: 376\u2013394 (1991)","journal-title":"SIAM J Comput"},{"key":"50090147446_CR4","unstructured":"Alsberg PA, Day JD: A principle for resilient sharing of distributed resources. Proc 2nd International Conference on Software Engineering, San Francisco, CA, pp 562\u2013570, October 1976"},{"key":"50090147446_CR5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/0196-6774(88)90017-X","volume":"9","author":"R Bar-Yehuda","year":"1988","unstructured":"Bar-Yehuda R, Kutten S: Fault-tolerant distributed majority commitment. J Algorithms 9: 569\u2013582 (1988)","journal-title":"J Algorithms"},{"key":"50090147446_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or M: Another advantage of free choice: completely asynchronous agreement protocols. Proc 2nd ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, pp 27\u201330, August 1983","DOI":"10.1145\/800221.806707"},{"key":"50090147446_CR7","unstructured":"Cristian F, Aghili H, Strong R, Dolev D: Atomic broadcasts from simple message diffusion to Byzantine agreement. Proc 15th International Symposium on Fault-Tolerant Computing, Ann Arbor, Michigan, pp 200\u2013206, June 1985. A revised version appears as IBM Tech Rep RJ5244"},{"key":"50090147446_CR8","doi-asserted-by":"crossref","unstructured":"Cimet IA, Kumar PRS: A resilient distributed protocol for network synchronization. ACM SIGCOMM Symposium on Communications, Architecture, and Protocols, Stowe, VT, August 1986, pp 358\u2013376","DOI":"10.1145\/18172.18212"},{"issue":"1","key":"50090147446_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0890-5401(92)90004-Y","volume":"97","author":"BA Coan","year":"1992","unstructured":"Coan BA, Welch JL: Modular construction of a Byzantine-agreement protocol with optimal message bit complexity. Inf Computation 97(1): 61\u201385 (1992)","journal-title":"Inf Computation"},{"issue":"1","key":"50090147446_CR10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev D: The Byzantine generals strike again. J Algorithms 3(1): 14\u201330 (1982)","journal-title":"J Algorithms"},{"key":"50090147446_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev D, Dwork C, Stockmeyer L: On the minimal synchronism needed for distributed consensus. J Assoc Comput Machinery 34: 77\u201397 (1987)","journal-title":"J Assoc Comput Machinery"},{"key":"50090147446_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"MJ Fischer","year":"1986","unstructured":"Fischer MJ, Lynch NA, Merritt M: Easy impossibility proofs for distributed consensus problems. Distrib Comput 1: 26\u201339 (1986)","journal-title":"Distrib Comput"},{"key":"50090147446_CR13","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J Assoc Comput Machinery 32: 374\u2013382 (1985)","journal-title":"J Assoc Comput Machinery"},{"key":"50090147446_CR14","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"GN Frederickson","year":"1987","unstructured":"Frederickson GN, Lynch NA: Electing a leader in a synchronous ring. J Assoc Comput Machinery 34: 98\u2013115 (1987)","journal-title":"J Assoc Comput Machinery"},{"key":"50090147446_CR15","doi-asserted-by":"crossref","unstructured":"Gafni E: Improvements in the complexity of two message-optimal election algorithms. Proc 4th ACM Symposium on Principles of Distributed Computing, Minacki, Ontario, Canada, August 1985, pp 175\u2013185","DOI":"10.1145\/323596.323612"},{"key":"50090147446_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00290707","volume":"24","author":"O Goldreich","year":"1987","unstructured":"Goldreich O, Shrira L: Electing a leader in a ring with link failures. Acta Inf 24: 79\u201391 (1987)","journal-title":"Acta Inf"},{"key":"50090147446_CR17","doi-asserted-by":"crossref","unstructured":"Korach E, Moran S, Zaks S: Tighter lower and upper bounds for some distributed algorithms for a complete networks of processors. Proc 3rd ACM Symposium on Principles of Distributed Computing, Vancouver, B.C., Canada, August 1984, pp 199\u2013207","DOI":"10.1145\/800222.806747"},{"issue":"3","key":"50090147446_CR18","doi-asserted-by":"crossref","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 Trans Program Lang Syst 4(3): 382\u2013401 (1982)","journal-title":"ACM Trans Program Lang Syst"},{"key":"50090147446_CR19","doi-asserted-by":"crossref","unstructured":"Lynch N, Fischer M, Fowler R: A simple and efficient Byzantine Generals algorithm. Proc IEEE 2nd Symposium on Reliability in Distributed Software and Database Systems, Pittsburgh, PA, pp 46\u201352, July 1982","DOI":"10.21236\/ADA113241"},{"key":"50090147446_CR20","doi-asserted-by":"crossref","unstructured":"Masuzawa T, Nishikawa N, Hagihara K, Tokura N: Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction. Proc 3rd International Workshop on Distributed Algorithms, Nice, France, September 1989. Also in: Distributed algorithms Lect Notes Comput Sci, Vol 392, pp 171\u2013182. Berlin Heidelberg New York: Springer, 1989","DOI":"10.1007\/3-540-51687-5_41"},{"key":"50090147446_CR21","doi-asserted-by":"crossref","unstructured":"Mattern F: Message complexity of simple ring-based election algorithms\u2014an empirical analysis (extended abstract). Proc IEEE 9th International Conference On Distributed Computing Systems, pp 94\u2013100, 1989","DOI":"10.1109\/ICDCS.1989.37935"},{"key":"50090147446_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/320141.320143","volume":"5","author":"DA Menasce","year":"1980","unstructured":"Menasce DA, Popek GJ, Muntz RR: A locking protocol for resource coordination in distributed databases. ACM Trans Database Syst 5: 103\u2013138 (1980)","journal-title":"ACM Trans Database Syst"},{"key":"50090147446_CR23","doi-asserted-by":"crossref","unstructured":"Mohan C, Strong R, Finkelstein S: Method for distributed commit and recovery using Byzantine agreement within clusters of processors. Proc 2nd ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, pp 89\u2013103, August 1983","DOI":"10.1145\/800221.806712"},{"key":"50090147446_CR24","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L: Reaching agreement in the presence of faults. J Assoc Comput Machinery 27: 228\u2013234 (1980)","journal-title":"J Assoc Comput Machinery"},{"key":"50090147446_CR25","doi-asserted-by":"crossref","unstructured":"Singh G: Efficient distributed algorithms for leader election in complete networks. Proc 11th IEEE International Conference on Distributed Computing Systems, pp 472\u2013479, 1991","DOI":"10.1109\/ICDCS.1991.148712"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050016.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s004460050016\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:55:53Z","timestamp":1733187353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s004460050016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["50090147446"],"URL":"https:\/\/doi.org\/10.1007\/s004460050016","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}