{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:12:07Z","timestamp":1648933927317},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319125671","type":"print"},{"value":"9783319125688","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45355-1_17","type":"book-chapter","created":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T13:55:29Z","timestamp":1412949329000},"page":"263-276","source":"Crossref","is-referenced-by-count":0,"title":["Asynchronous Binary Byzantine Consensus over Graphs with Power-Law Degree Sequence"],"prefix":"10.1007","author":[{"given":"Goitom","family":"Weldehawaryat","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Wolthusen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"17_CR1","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00446-012-0162-z","volume":"25","author":"M. Aguilera","year":"2012","unstructured":"M. Aguilera and S. Toueg, The correctness proof of Ben-Or\u2019s randomized consensus algorithm, Distributed Computing, vol. 25(5), pp. 371\u2013381, 2012.","journal-title":"Distributed Computing"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W. Aiello","year":"2001","unstructured":"W. Aiello, F. Chung and L. Lu, A random graph model for power-law graphs, Experimental Mathematics, vol. 10(1), pp. 53\u201366, 2001.","journal-title":"Experimental Mathematics"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"R. Albert and A. Barabasi, Statistical mechanics of complex networks, Reviews of Modern Physics, vol. 74(1), pp. 47\u201397, 2002.","journal-title":"Reviews of Modern Physics"},{"issue":"2\/3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-002-0081-5","volume":"16","author":"J. Aspnes","year":"2003","unstructured":"J. Aspnes, Randomized protocols for asynchronous consensus, Distributed Computing, vol. 16(2\/3), pp. 165\u2013175, 2003.","journal-title":"Distributed Computing"},{"issue":"5439","key":"17_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. Barabasi","year":"1999","unstructured":"A. Barabasi and R. Albert, Emergence of scaling in random networks, Science, vol. 286(5439), pp. 509\u2013512, 1999.","journal-title":"Science"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/800221.806707","volume-title":"Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing","author":"M. Ben-Or","year":"1983","unstructured":"M. Ben-Or, Another advantage of free choice: Completely asynchronous agreement protocols, Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330, 1983."},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B. Bollobas","year":"2001","unstructured":"B. Bollobas, O. Riordan, J. Spencer and G. Tusnady, The degree sequence of a scale-free random graph process, Random Structures and Algorithms, vol. 18(3), pp. 279\u2013290, 2001.","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M. Castro","year":"2002","unstructured":"M. Castro and B. Liskov, Practical Byzantine fault tolerance and proactive recovery, ACM Transactions on Computer Systems, vol. 20(4), pp. 398\u2013461, 2002.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/1323293.1294280","volume":"41","author":"B. Chun","year":"2007","unstructured":"B. Chun, P. Maniatis, S. Shenker and J. Kubiatowicz, Attested append-only memory: Making adversaries stick to their word, ACM SIGOPS Operating Systems Review, vol. 41(6), pp. 189\u2013207, 2007.","journal-title":"ACM SIGOPS Operating Systems Review"},{"key":"17_CR10","doi-asserted-by":"crossref","volume-title":"Complex Graphs and Networks","author":"F. Chung","year":"2006","unstructured":"F. Chung and L. Lu, Complex Graphs and Networks, American Mathematical Society, Providence, Rhode Island, 2006.","DOI":"10.1090\/cbms\/107"},{"issue":"21","key":"17_CR11","doi-asserted-by":"publisher","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R. Cohen","year":"2000","unstructured":"R. Cohen, K. Erez, D. ben-Avraham and S. Havlin, Resilience of the Internet to random breakdowns, Physical Review Letters, vol. 85(21), pp. 4626\u20134628, 2000.","journal-title":"Physical Review Letters"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"58701","DOI":"10.1103\/PhysRevLett.90.058701","volume":"90","author":"R. Cohen","year":"2003","unstructured":"R. Cohen and S. Havlin, Scale-free networks are ultrasmall, Physical Review Letters, vol. 90(5), pp. 058701-1\u20134, 2003.","journal-title":"Physical Review Letters"},{"key":"17_CR13","first-page":"475","volume-title":"Proceedings of the ACM Symposium on Applied Computing","author":"M. Correia","year":"2010","unstructured":"M. Correia, G. Veronese and C. Lung, Asynchronous Byzantine consensus with 2f\u2009+\u20091 processes, Proceedings of the ACM Symposium on Applied Computing, pp. 475\u2013480, 2010."},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1504\/IJCCBS.2011.041257","volume":"2","author":"M. Correia","year":"2011","unstructured":"M. Correia, G. Veronese, N. Neves and P. Verissimo, Byzantine consensus in asynchronous message passing systems: A survey, International Journal of Critical Computer-Based Systems, vol. 2(2), pp. 141\u2013161, 2011.","journal-title":"International Journal of Critical Computer-Based Systems"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/S0378-4371(02)01545-5","volume":"320","author":"P. Crucitti","year":"2003","unstructured":"P. Crucitti, V. Latora, M. Marchiori and A. Rapisarda, Efficiency of scale-free networks: Error and attack tolerance, Physica A: Statistical Mechanics and its Applications, vol. 320, pp. 622\u2013642, 2003.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"17_CR16","first-page":"27","volume-title":"Dependable Computing Systems: Paradigms, Performance Issues and Applications","author":"A. Doudou","year":"2005","unstructured":"A. Doudou, B. Garbinato and R. Guerraoui, Tolerating arbitrary failures with state machine replication, in Dependable Computing Systems: Paradigms, Performance Issues and Applications, H. Diab and A. Zomaya (Eds.), Wiley-Interscience, Hoboken, New Jersey, pp. 27\u201356. 2005."},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol. 32(2), pp. 374\u2013382, 1985.","journal-title":"Journal of the ACM"},{"issue":"1\/2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJCIS.2008.016088","volume":"4","author":"C. Hauser","year":"2008","unstructured":"C. Hauser, D. Bakken, I. Dionysiou, K. Gjermundrod, V. Irava, J. Helkey and A. Bose, Security, trust and QoS in next-generation control and communication for large power systems, International Journal of Critical Infrastructures, vol. 4(1\/2), pp. 3\u201316, 2008.","journal-title":"International Journal of Critical Infrastructures"},{"key":"17_CR19","first-page":"310","volume-title":"Proceedings of the Forty-Second International Conference on Parallel Processing","author":"R. Hu","year":"2013","unstructured":"R. Hu, J. Sopena, L. Arantes, P. Sens and I. Demeure, Efficient dissemination algorithm for scale-free topologies, Proceedings of the Forty-Second International Conference on Parallel Processing, pp. 310\u2013319, 2013."},{"issue":"2\/3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M. Molloy","year":"1995","unstructured":"M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures and Algorithms, vol. 6(2\/3), pp. 161\u2013179, 1995.","journal-title":"Random Structures and Algorithms"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"M. Newman","year":"2005","unstructured":"M. Newman, Power laws, Pareto distributions and Zipf\u2019s law, Contemporary Physics, vol. 46, pp. 323\u2013351, 2005.","journal-title":"Contemporary Physics"},{"issue":"11","key":"17_CR22","doi-asserted-by":"publisher","first-page":"2688","DOI":"10.1016\/j.physa.2013.01.023","volume":"392","author":"G. Pagani","year":"2013","unstructured":"G. Pagani and M. Aiello, The power grid as a complex network: A survey, Physica A: Statistical Mechanics and its Applications, vol. 392(11), pp. 2688\u20132700, 2013.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"17_CR23","first-page":"2","volume-title":"Proceedings of the Fourth International Conference on Peer-to-Peer Computing","author":"N. Sarshar","year":"2004","unstructured":"N. Sarshar, P. Boykin and V. Roychowdhury, Percolation search in power-law networks: Making unstructured peer-to-peer networks scalable, Proceedings of the Fourth International Conference on Peer-to-Peer Computing, pp. 2\u20139, 2004."},{"key":"17_CR24","volume-title":"Finite Percolation at a Multiple of the Threshold","author":"N. Sarshar","year":"2006","unstructured":"N. Sarshar, P. Boykin and V. Roychowdhury, Finite Percolation at a Multiple of the Threshold ( http:\/\/arxiv.org\/pdf\/cond-mat\/0601211v2.pdf ), 2006."},{"key":"17_CR25","volume-title":"Analysis of Biological Networks: Random Models","author":"R. Sharan","year":"2009","unstructured":"R. Sharan, Analysis of Biological Networks: Random Models, School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel, 2009."},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85571-2_1","volume-title":"Architecting Dependable Systems V","author":"P. Ver\u00edssimo","year":"2008","unstructured":"P. Verissimo, N. Neves, M. Correia, Y. Deswarte, A. Abou Kalam, A. Bondavalli and A. Daidone, The CRUTIAL architecture for critical information infrastructures, in Architecting Dependable Systems V, R. Lemos, F. Giandomenico, C. Gacek, H. Muccini and M. Viera (Eds.), Springer-Verlag, Berlin Heidelberg, Germany, pp. 1\u201327, 2008."},{"key":"17_CR27","volume-title":"Proceedings of the Workshop on Embedded Systems and Communications Security","author":"G. Veronese","year":"2009","unstructured":"G. Veronese, M. Correia, A. Bessani and L. Lung, Highly-resilient services for critical infrastructures, Proceedings of the Workshop on Embedded Systems and Communications Security, 2009."},{"issue":"1","key":"17_CR28","doi-asserted-by":"crossref","first-page":"137","DOI":"10.15388\/Informatica.2006.129","volume":"17","author":"S. Wang","year":"2006","unstructured":"S. Wang, K. Yan and M. Chiang, Optimal agreement in a scale-free network environment, Informatica, vol. 17(1), pp. 137\u2013150, 2006.","journal-title":"Informatica"},{"key":"17_CR29","first-page":"9","volume-title":"Proceedings of the Second IEEE Workshop on Network Science","author":"G. Weldehawaryat","year":"2013","unstructured":"G. Weldehawaryat and S. Wolthusen, Asynchronous message-passing binary consensus over non-complete graphs, Proceedings of the Second IEEE Workshop on Network Science, pp. 9\u201315, 2013."}],"container-title":["Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45355-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T18:00:42Z","timestamp":1598378442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45355-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":29,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-662-45355-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[2014]]}}}