{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T02:38:26Z","timestamp":1772851106018,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"a seed grant from IIT Bombay"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tcomm.2019.2962038","type":"journal-article","created":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T00:15:12Z","timestamp":1577232912000},"page":"1593-1603","source":"Crossref","is-referenced-by-count":5,"title":["Optimal AoI-Aware Scheduling and Cycles in Graphs"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1574-6206","authenticated-orcid":false,"given":"Prakirt Raj","family":"Jhunjhunwala","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3195-8241","authenticated-orcid":false,"given":"Bejjipuram","family":"Sombabu","sequence":"additional","affiliation":[]},{"given":"Sharayu","family":"Moharir","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.05.010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2660129.2660148"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555364"},{"key":"ref30","author":"goemans","year":"2009","journal-title":"Linear Programming and Polyhedral Combinatorics"},{"key":"ref35","author":"bang-jensen","year":"2008","journal-title":"Digraphs Theory Algorithms and Applications"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006544"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006504"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283009"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308962"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006541"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2016.7492912"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875100"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006590"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335391"},{"key":"ref18","first-page":"1681","article-title":"Optimizing age-of-information in a multi-class queueing system","author":"huang","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541765"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524524"},{"key":"ref27","first-page":"696","article-title":"Age-of-information aware scheduling for heterogeneous sources","author":"sombabu","year":"2018","journal-title":"Proc 24th Annu Int Conf Mobile Comput Netw"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310931"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006593"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541763"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006542"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541764"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2018.8724448"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006543"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SARNOF.2016.7846775"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.202"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90011-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254578"},{"key":"ref26","first-page":"37","article-title":"Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems","author":"dasdan","year":"1999","journal-title":"Proc Des Automat Conf"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/43.728912"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9039763\/08941120.pdf?arnumber=8941120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:46:56Z","timestamp":1651067216000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8941120\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":35,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2019.2962038","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}