{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:07:32Z","timestamp":1743127652223,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427865"},{"type":"electronic","value":"9783540455080"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45508-6_14","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T13:42:55Z","timestamp":1186407775000},"page":"193-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Queue Length Based Fair Queueing in Core-Stateless Networks"],"prefix":"10.1007","author":[{"given":"Mingyu","family":"Zhai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanqun","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,10]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Parekh, A. A generalized processor sharing approach to flow control-the single node case. In: Proceedings of the IEEE INFOCOM\u201992, 1992.","DOI":"10.1109\/INFCOM.1992.263509"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Lin, D. Dynamics of random early detection. In: Proceedings of ACM SIGCOMM\u2019 97, Cannes, France, October 1997, 127\u2013137","DOI":"10.1145\/263109.263154"},{"key":"14_CR3","unstructured":"Stoica, I. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high-speed networks. In: Proceeding of ACM SIGCOMM\u201998, 1998, 118\u2013130"},{"key":"14_CR4","unstructured":"Cao, Z. Rainbow fair queueing: Fair bandwidth sharing without per-flow state. In: Proceedings of IEEE Infocom\u2019 2000, March 2000"}],"container-title":["Lecture Notes in Computer Science","Management of Multimedia on the Internet"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45508-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:57:06Z","timestamp":1558259826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45508-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427865","9783540455080"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-45508-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"10 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}