{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:01Z","timestamp":1772164021578,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,17]]},"DOI":"10.1145\/2465529.2465542","type":"proceedings-article","created":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T08:36:08Z","timestamp":1371544568000},"page":"353-354","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting the past to reduce delay in CSMA scheduling"],"prefix":"10.1145","author":[{"given":"Jaewook","family":"Kwak","sequence":"first","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chul-Ho","family":"Lee","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Young","family":"Eun","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"On the design of efficient CSMA algorithms for wireless networks. arXiv report http:\/\/arxiv.org\/abs\/1003.1364, arXiv","author":"Ghaderi J.","year":"2010","unstructured":"J. Ghaderi and R. Srikant . On the design of efficient CSMA algorithms for wireless networks. arXiv report http:\/\/arxiv.org\/abs\/1003.1364, arXiv , 2010 . J. Ghaderi and R. Srikant. On the design of efficient CSMA algorithms for wireless networks. arXiv report http:\/\/arxiv.org\/abs\/1003.1364, arXiv, 2010."},{"key":"e_1_3_2_1_2_1","author":"Jiang L.","year":"2012","unstructured":"L. Jiang , M. Leconte , J. Ni , R. Srikant , and J. Walrand . Fast mixing of parallel glauber dynamics and low-delay csma scheduling. IEEE Trans. on Information Theory} , 2012 . L. Jiang, M. Leconte, J. Ni, R. Srikant, and J. Walrand. Fast mixing of parallel glauber dynamics and low-delay csma scheduling. IEEE Trans. on Information Theory}, 2012.","journal-title":"IEEE Trans. on Information Theory}"},{"key":"e_1_3_2_1_3_1","volume-title":"Exploiting the past to reduce delay in csma scheduling: A high-order markov chain approach. arXiv report http:\/\/arxiv.org\/abs\/1302.3250, arXiv","author":"Kwak J.","year":"2013","unstructured":"J. Kwak , C.-H. Lee , and D. Y. Eun . Exploiting the past to reduce delay in csma scheduling: A high-order markov chain approach. arXiv report http:\/\/arxiv.org\/abs\/1302.3250, arXiv , 2013 . J. Kwak, C.-H. Lee, and D. Y. Eun. Exploiting the past to reduce delay in csma scheduling: A high-order markov chain approach. arXiv report http:\/\/arxiv.org\/abs\/1302.3250, arXiv, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2177101"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555365"},{"key":"e_1_3_2_1_6_1","author":"Shah D.","year":"2012","unstructured":"D. Shah and J. Shin . Randomized scheduling algorithm for queueing networks. Annals of Applied Probability , 2012 . D. Shah and J. Shin. Randomized scheduling algorithm for queueing networks. Annals of Applied Probability, 2012.","journal-title":"Randomized scheduling algorithm for queueing networks. Annals of Applied Probability"}],"event":{"name":"SIGMETRICS '13: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","location":"Pittsburgh PA USA","acronym":"SIGMETRICS '13","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Proceedings of the ACM SIGMETRICS\/international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465529.2465542","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465529.2465542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:36Z","timestamp":1750220316000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465529.2465542"}},"subtitle":["a high-order markov chain approach"],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":6,"alternative-id":["10.1145\/2465529.2465542","10.1145\/2465529"],"URL":"https:\/\/doi.org\/10.1145\/2465529.2465542","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2494232.2465542","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,6,17]]},"assertion":[{"value":"2013-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}