{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:52Z","timestamp":1759639072487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319095806"},{"type":"electronic","value":"9783319095813"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09581-3_7","type":"book-chapter","created":{"date-parts":[[2014,8,2]],"date-time":"2014-08-02T11:20:14Z","timestamp":1406978414000},"page":"84-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Iterative Approximate Consensus in the Presence of Byzantine Link Failures"],"prefix":"10.1007","author":[{"given":"Lewis","family":"Tseng","sequence":"first","affiliation":[]},{"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,3]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11516798_17","volume-title":"Principles of Distributed Systems","author":"I Abraham","year":"2005","unstructured":"Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 229\u2013239. Springer, Heidelberg (2005)"},{"issue":"40","key":"7_CR2","doi-asserted-by":"publisher","first-page":"5602","DOI":"10.1016\/j.tcs.2010.09.032","volume":"412","author":"M Biely","year":"2011","unstructured":"Biely, M., Schmid, U., Weiss, B.: Synchronous consensus under hybrid process and link failures. Theor. Comput. Sci. 412(40), 5602\u20135630 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR3","series-title":"Optimization and Neural Computation Series","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Optimization and Neural Computation Series. Athena Scientific, Belmont (1997)"},{"issue":"1","key":"7_CR4","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. 22(1), 49\u201371 (2009)","journal-title":"Distrib. Comput."},{"key":"7_CR5","volume-title":"Algorithms","author":"S Dasgupta","year":"2006","unstructured":"Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill Higher Education, Boston (2006)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. In: PODC \u201985. ACM (1985)","DOI":"10.1145\/323596.323602"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0305004100033399","volume":"54","author":"J Hajnal","year":"1958","unstructured":"Hajnal, J.: Weak Ergodicity in non-homogeneous Markov chains. Proc. Cambridge Philos. Soc. 54, 233\u2013246 (1958)","journal-title":"Proc. Cambridge Philos. Soc."},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1109\/TAC.2003.812781","volume":"48","author":"A Jadbabaie","year":"2003","unstructured":"Jadbabaie, A., Lin, J., Morse, A.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 988\u20131001 (2003)","journal-title":"IEEE Trans. Autom. Control"},{"key":"7_CR10","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: IEEE Symposium on Foundations of Computer Science, October 2003"},{"issue":"3","key":"7_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 Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/JSAC.2013.130413","volume":"31","author":"HJ LeBlanc","year":"2013","unstructured":"LeBlanc, H.J., Zhang, H., Koutsoukos, X., Sundaram, S.: Resilient asymptotic consensus in robust networks. IEEE J. Sel. Areas Commun. 31(4), 766\u2013781 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.phycom.2008.01.006","volume":"1","author":"DS Lun","year":"2008","unstructured":"Lun, D.S., M\u00e9dard, M., Koetter, R., Effros, M.: On coding for reliable communication over packet networks. Phys. Commun. 1(1), 3\u201320 (2008)","journal-title":"Phys. Commun."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Pajic, M., Sundaram, S., Le Ny, J., Pappas, G.J., Mangharam, R.: Closing the loop: A simple distributed method for control over wireless networks. In: International Conference on Information Processing in Sensor Networks (2012)","DOI":"10.1145\/2185677.2185681"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0028994","volume-title":"STACS 89","author":"N Santoro","year":"1989","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Monien, B., Cori, R. (eds.) STACS 89. LNCS, vol. 349, pp. 304\u2013313. Springer, Heidelberg (1989)"},{"issue":"2\u20133","key":"7_CR16","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.tcs.2007.04.036","volume":"384","author":"N Santoro","year":"2007","unstructured":"Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2\u20133), 232\u2013249 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/TSP.2007.906734","volume":"56","author":"ID Schizas","year":"2008","unstructured":"Schizas, I.D., Ribeiro, A., Giannakis, G.B.: Consensus in ad hoc WSNs with noisy links- Part I: distributed estimation of deterministic signals. IEEE Trans. Sig. Process. 56(1), 350\u2013364 (2008)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"5","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1137\/S009753970443999X","volume":"38","author":"U Schmid","year":"2009","unstructured":"Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM J. Comput. 38(5), 1912\u20131951 (2009)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"7_CR19","first-page":"2308","volume":"57","author":"S Sundaram","year":"2012","unstructured":"Sundaram, S., Revzen, S., Pappas, G.: A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks. Automatica 57(9), 2308\u20132311 (2012)","journal-title":"Automatica"},{"issue":"7","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1109\/TAC.2010.2088690","volume":"56","author":"S Sundaram","year":"2011","unstructured":"Sundaram, S., Hadjicostis, C.N.: Distributed function calculation via linear iterative strategies in the presence of malicious agent. IEEE Trans. Autom. Control 56(7), 1495\u20131508 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-35668-1_6","volume-title":"Distributed Computing and Networking","author":"L Tseng","year":"2013","unstructured":"Tseng, L., Vaidya, N.: Iterative approximate Byzantine consensus under a generalized fault model. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 72\u201386. Springer, Heidelberg (2013)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H.: Iterative approximate consensus in the presence of Byzantine link failures. Technical report, UIUC (2014). http:\/\/www.crhc.illinois.edu\/wireless\/papers\/ByzantineLink.pdf","DOI":"10.1007\/978-3-319-09581-3_7"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate Byzantine consensus in arbitrary directed graphs. In: PODC \u201912. ACM (2012)","DOI":"10.21236\/ADA558910"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-45249-9_2","volume-title":"Distributed Computing and Networking","author":"NH Vaidya","year":"2014","unstructured":"Vaidya, N.H.: Iterative Byzantine vector consensus in incomplete graphs. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 14\u201328. Springer, Heidelberg (2014)"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1090\/S0002-9939-1963-0154756-3","volume":"14","author":"J Wolfowitz","year":"1963","unstructured":"Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. Proc. Am. Math. Soc. 14, 733\u2013737 (1963)","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09581-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T08:49:32Z","timestamp":1675241372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09581-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095806","9783319095813"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09581-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}