{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:48:50Z","timestamp":1761580130413},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s1389-1286(03)00303-7","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:15:45Z","timestamp":1054595745000},"page":"619-631","source":"Crossref","is-referenced-by-count":5,"title":["Queue delay estimation and its application to TCP Vegas"],"prefix":"10.1016","volume":"43","author":[{"given":"Kyungsup","family":"Kim","sequence":"first","affiliation":[]},{"given":"Chong-Ho","family":"Choi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(03)00303-7_BIB1","doi-asserted-by":"crossref","unstructured":"V. Jacobson, Congestion avoidance and control, in: ACM SIGCOMM\u201988, Stanford, CA, 1988, pp. 314\u2013329","DOI":"10.1145\/52324.52356"},{"issue":"8","key":"10.1016\/S1389-1286(03)00303-7_BIB2","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1109\/49.464716","article-title":"TCP Vegas: end to end congestion avoidance on a global Internet","volume":"13","author":"Brakmo","year":"1995","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/S1389-1286(03)00303-7_BIB3","unstructured":"T. Bonald,Comparison of TCP Reno and TCP Vegas via fluid approximation, Tech. Rep. RR, 3563, 1998"},{"key":"10.1016\/S1389-1286(03)00303-7_BIB4","doi-asserted-by":"crossref","unstructured":"J. Mo, R.J. La, V. Anantharam, J.C. Walrand, Analysis and comparison of TCP Reno and Vegas, in: INFOCOM, vol. 3, 1999, pp. 1556\u20131563","DOI":"10.1109\/INFCOM.1999.752178"},{"key":"10.1016\/S1389-1286(03)00303-7_BIB5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/506147.506152","article-title":"Understanding Vegas: a duality model","volume":"49","author":"Low","year":"2002","journal-title":"J. ACM"},{"key":"10.1016\/S1389-1286(03)00303-7_BIB6","first-page":"29","article-title":"A study on high speed packet scheduling method for achieving fairness among TCP connections","volume":"12","author":"Hasegawa","year":"2002","journal-title":"J. High Speed Network"},{"issue":"4","key":"10.1016\/S1389-1286(03)00303-7_BIB7","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/90.251892","article-title":"Random early detection gateways for congestion avoidance","volume":"1","author":"Floyd","year":"1993","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/S1389-1286(03)00303-7_BIB8","doi-asserted-by":"crossref","unstructured":"K. Ramakrishnan, S. Floyd, A proposal to add explicit congestion notification, Tech. Rep. RFC, 2481, 1998","DOI":"10.17487\/rfc2481"},{"issue":"3","key":"10.1016\/S1389-1286(03)00303-7_BIB9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/79.295229","article-title":"A state-space approach to adaptive RLS filtering","volume":"11","author":"Sayed","year":"1994","journal-title":"IEEE Signal Process. Mag."},{"key":"10.1016\/S1389-1286(03)00303-7_BIB10","series-title":"Tracking and Data association","author":"Bar-Shalom","year":"1988"},{"key":"10.1016\/S1389-1286(03)00303-7_BIB11","doi-asserted-by":"crossref","unstructured":"S. Keshav, A control-theoretic approach to flow control, in: Proceedings of SIGCOMM, 1993, pp. 3\u201315","DOI":"10.1145\/115994.115995"},{"issue":"6","key":"10.1016\/S1389-1286(03)00303-7_BIB12","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/TAC.1971.1099836","article-title":"Divergence of the Kalman filter","volume":"16","author":"Ritzgerald","year":"1971","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S1389-1286(03)00303-7_BIB13","unstructured":"J. Fall, K. Varadhan, The ns manual, 2001. Available from <http:\/\/www.isi.du\/nsnam\/ns\/ns-documentation>"},{"key":"10.1016\/S1389-1286(03)00303-7_BIB14","unstructured":"J.-Y. Boudec, Rate adaptation, congestion control and fairness: A tutorial, Tech. rep. EPFL, 2000"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603003037?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603003037?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T16:33:30Z","timestamp":1584722010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603003037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S1389128603003037"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00303-7","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}