{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:17:57Z","timestamp":1779380277903,"version":"3.53.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1618335"],"award-info":[{"award-number":["CNS-1618335"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cisco"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1109\/tsc.2020.2978063","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T21:18:27Z","timestamp":1583270307000},"page":"1118-1129","source":"Crossref","is-referenced-by-count":34,"title":["Joint Information Freshness and Completion Time Optimization for Vehicular Networks"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9223-2073","authenticated-orcid":false,"given":"Abubakr","family":"Alabbasi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9131-4723","authenticated-orcid":false,"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541763"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/WETICE.2010.14"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2235473"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2011.5984917"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735804"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282742"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541765"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620189"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2017545"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5501783"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282877"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2018.8362818"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057197"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006505"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310931"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"2016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2466453"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1421789"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2851379"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1416944.1416949"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14445\/22312803\/IJCTT-V19P103"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2481403"},{"key":"ref24","article-title":"Bigger, longer, fewer: What do cluster jobs look like outside Google?","author":"Amvrosiadis","year":"2017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2749879"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848034"},{"key":"ref27","volume-title":"Introduction to Probability Models","author":"Ross","year":"2014"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/9781118445112.stat01100.pub2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2916877"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4629386\/9751117\/9023385-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4629386\/9751117\/09023385.pdf?arnumber=9023385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:19:07Z","timestamp":1704838747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9023385\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2020.2978063","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"value":"1939-1374","type":"electronic"},{"value":"2372-0204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]}}}