{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:29:07Z","timestamp":1742797747575},"reference-count":11,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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 Communications"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0140-3664(01)00403-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:03:16Z","timestamp":1027612996000},"page":"756-771","source":"Crossref","is-referenced-by-count":3,"title":["Multi-level active queue management with dynamic thresholds"],"prefix":"10.1016","volume":"25","author":[{"given":"James","family":"Aweya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Ouellette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Delfin Y.","family":"Montuno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(01)00403-0_BIB1","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TCOM.1983.1095819","article-title":"Sharing memory optimally","volume":"3","author":"Foschini","year":"1983","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0140-3664(01)00403-0_BIB2","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TCOM.1980.1094756","article-title":"Analysis of shared finite storage in a computer network node environment under general traffic conditions","volume":"28","author":"Kamoun","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0140-3664(01)00403-0_BIB3","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TCOM.1980.1094731","article-title":"Exponential servers sharing a finite storage: comparison of space allocation policies","volume":"28","author":"Latouche","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0140-3664(01)00403-0_BIB4","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/INFCOM.1996.493364","article-title":"Dynamic queue length thresholds in a shared memory ATM switch","volume":"2","author":"Choudhury","year":"1996","journal-title":"Proc. IEEE INFOCOM'96"},{"key":"10.1016\/S0140-3664(01)00403-0_BIB5","first-page":"631","article-title":"An optimal buffer management scheme with dynamic thresholds","author":"Fan","year":"1999","journal-title":"Proc. IEEE GLOBECOM'99"},{"key":"10.1016\/S0140-3664(01)00403-0_BIB6","doi-asserted-by":"crossref","unstructured":"V. Jacobson, Congestion avoidance and control, Proc. ACM SIGCOMM'88 (1988) pp. 314\u2013329.","DOI":"10.1145\/52324.52356"},{"key":"10.1016\/S0140-3664(01)00403-0_BIB7","doi-asserted-by":"crossref","unstructured":"W. Stevens, TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms, IETF RFC 2001, Januaruy 1997.","DOI":"10.17487\/rfc2001"},{"key":"10.1016\/S0140-3664(01)00403-0_BIB8","doi-asserted-by":"crossref","unstructured":"B. Braden, et al., Recommendation on queue management and congestion avoidance in the internet, IETF RFC 2309, April 1998.","DOI":"10.17487\/rfc2309"},{"issue":"4","key":"10.1016\/S0140-3664(01)00403-0_BIB9","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. Networking"},{"issue":"2\u20133","key":"10.1016\/S0140-3664(01)00403-0_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S1389-1286(00)00206-1","article-title":"A control theoretic approach to active queue management","volume":"36","author":"Aweya","year":"2001","journal-title":"Comput. Networks"},{"issue":"5","key":"10.1016\/S0140-3664(01)00403-0_BIB11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/205511.205512","article-title":"TCP and explicit congestion notification","volume":"24","author":"Floyd","year":"1994","journal-title":"ACM Comput. Commun. Rev."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401004030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401004030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:50:47Z","timestamp":1578700247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366401004030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":11,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0140366401004030"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(01)00403-0","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}