{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:10:40Z","timestamp":1767337840058,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,16]]},"DOI":"10.1109\/icc45855.2022.9838730","type":"proceedings-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T19:37:11Z","timestamp":1660246631000},"page":"2720-2725","source":"Crossref","is-referenced-by-count":4,"title":["A Machine Learning Approach to Estimating Queuing Delay on a Router over a Single-Hop Path"],"prefix":"10.1109","author":[{"given":"Travis","family":"Ricker","sequence":"first","affiliation":[{"name":"California State University,Dominguez Hills,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khondaker","family":"Salehin","sequence":"additional","affiliation":[{"name":"California State University,Dominguez Hills,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[{"name":"California State University,Dominguez Hills,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Chen","sequence":"additional","affiliation":[{"name":"California State University,Dominguez Hills,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Oki","sequence":"additional","affiliation":[{"name":"Kyoto University,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Rojas-Cessa","sequence":"additional","affiliation":[{"name":"NJIT,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1797","article-title":"Analysis of Point-to-Point Packet Delay in an Operational Network","volume":"3","author":"choi","year":"2004","journal-title":"Proc of IEEE International Conference on Computer Communications"},{"article-title":"Pathchar – A Tool to Infer Characteristics of Internet Paths","year":"0","author":"jacobson","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209232"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.814520"},{"key":"ref14","first-page":"281","article-title":"Some Methods for Classification and Analysis of Multivariate Observations","author":"macqueen","year":"1967","journal-title":"Proc of Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00592-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbz170"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/316194.316228","article-title":"Using Pathchar to Estimate Internet Link Characteristics","author":"downey","year":"1999","journal-title":"Proc of ACM SIGCOMM"},{"year":"0","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2019.8685606"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2375213"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.030114.132775"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/OJCS.2020.2978231"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2006.876542"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.814410"},{"key":"ref2","first-page":"473","article-title":"Measuring Latency Variation in the Internet","author":"j\u00f8rgensen","year":"2016","journal-title":"Proc of ACM CoNEXT"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2899402"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2016.7445500"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209230"},{"key":"ref21","first-page":"1027","article-title":"k-means++: The Advantages of Careful Seeding","author":"arthur","year":"2007","journal-title":"Proc of ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2830125"}],"event":{"name":"ICC 2022 - IEEE International Conference on Communications","start":{"date-parts":[[2022,5,16]]},"location":"Seoul, Korea, Republic of","end":{"date-parts":[[2022,5,20]]}},"container-title":["ICC 2022 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9837954\/9838246\/09838730.pdf?arnumber=9838730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T20:05:37Z","timestamp":1663013137000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9838730\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/icc45855.2022.9838730","relation":{},"subject":[],"published":{"date-parts":[[2022,5,16]]}}}