{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:38:29Z","timestamp":1729625909965,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/infocom.2015.7218566","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T21:33:36Z","timestamp":1440452016000},"page":"1840-1848","source":"Crossref","is-referenced-by-count":2,"title":["On the efficiency-optimal Markov chains for distributed networking applications"],"prefix":"10.1109","author":[{"given":"Chul-Ho","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Young","family":"Eun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Practical characterization of large networks using neighborhood infor-mation","year":"2013","author":"wang","key":"ref38"},{"journal-title":"Data Networks","year":"1992","author":"bertsekas","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061992"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/3072398"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339572"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"article-title":"CVX: Matlab software for disciplined convex programming","year":"0","author":"grant","key":"ref35"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3124-8","author":"br\u00e9maud","year":"1999","journal-title":"Markov Chains Gibbs Fields Monte Carlo Simulation and Queues"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1142\/S0219199707002551"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537885.001.0001","author":"hughes","year":"1995","journal-title":"Random Walks and Random Environments I"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2006.126"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5963203"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514206"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2012.6275826"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036144503423264","article-title":"Fastest mixing markov chain on a graph","volume":"46","author":"boyd","year":"2004","journal-title":"SIAM Review"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1145\/301250.301315","article-title":"Lifiting markov chains to speed up mixing","author":"chen","year":"1999","journal-title":"ACM STOC"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1019487508"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.194"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1015346319"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1145\/2318857.2254795","article-title":"Beyond random walk and metropolis-hastings samplers: Why you should not backtrack for unbiased graph sampling","author":"lee","year":"2012","journal-title":"ACM SIGMETRICS"},{"key":"ref6","article-title":"On distributed optimization using peer-to-peer communications in wireless sensor net-works","author":"johansson","year":"2008","journal-title":"IEEE SECON"},{"journal-title":"Reversible Markov Chains and Random Walks on Graphs","year":"0","author":"aldous","key":"ref29"},{"key":"ref5","first-page":"1169","article-title":"Rateless packet approach for data gathering in wireless sensor net-works","volume":"28","author":"vukobratovi?","year":"2010","journal-title":"IEEE JSAC"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70837"},{"key":"ref7","article-title":"Popularity-biased random walks for peer-to-peer search under the square-root principle","author":"zhong","year":"2006","journal-title":"IPTPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.115"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2001730"},{"key":"ref20","article-title":"Fast gossip via nonreversible random walk","author":"jung","year":"2006","journal-title":"IEEE Information Theory Workshop (ITW)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/60.3.607"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557655"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1214\/154957804100000024","article-title":"General state space Markov chains and MCMC algorithms","volume":"1","author":"roberts","year":"2004","journal-title":"Probability Surveys"},{"journal-title":"Markov Chains and Mixing Times","year":"2009","author":"levin","key":"ref25"}],"event":{"name":"IEEE INFOCOM 2015 - IEEE Conference on Computer Communications","start":{"date-parts":[[2015,4,26]]},"location":"Kowloon, Hong Kong","end":{"date-parts":[[2015,5,1]]}},"container-title":["2015 IEEE Conference on Computer Communications (INFOCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172813\/7218353\/07218566.pdf?arnumber=7218566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T18:28:16Z","timestamp":1718044096000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7218566\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/infocom.2015.7218566","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}