{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:54:35Z","timestamp":1725684875621},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1109\/wcnc.2012.6214229","type":"proceedings-article","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T09:34:54Z","timestamp":1340184894000},"page":"2554-2559","source":"Crossref","is-referenced-by-count":1,"title":["Minimum-cost First-Push-Then-Pull gossip algorithm"],"prefix":"10.1109","author":[{"given":"Ali","family":"Saidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mojdeh","family":"Mohtashemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2003.1233531"},{"journal-title":"A New Algorithm for Computing Logarithm","year":"2011","author":"saidi","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208967"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1038\/261459a0"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.303"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2009.38"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1297243"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876186"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2009.5270330"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892324"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874532"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/945506.945507"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762485"},{"key":"6","first-page":"55","article-title":"A gossip-style failure detection service","author":"van renesse","year":"1998","journal-title":"Proc of IFIP Int-l Conference on Distributed Systems Platforms and Open Distributed Processing"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263680"},{"key":"9","first-page":"340","article-title":"On randomized broadcasting and gossiping in radio networks","author":"ding","year":"2002","journal-title":"Proceedings of the 8th Annual International Conference on Computing and Combinatorics"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498511"}],"event":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","start":{"date-parts":[[2012,4,1]]},"location":"Paris, France","end":{"date-parts":[[2012,4,4]]}},"container-title":["2012 IEEE Wireless Communications and Networking Conference (WCNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6209058\/6213907\/06214229.pdf?arnumber=6214229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T12:32:12Z","timestamp":1490099532000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6214229\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2012.6214229","relation":{},"subject":[],"published":{"date-parts":[[2012,4]]}}}