{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:29:46Z","timestamp":1648726186558},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":[[2002,11]]},"DOI":"10.1016\/s1389-1286(02)00292-x","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T19:05:42Z","timestamp":1038855942000},"page":"499-513","source":"Crossref","is-referenced-by-count":0,"title":["An incrementally deployable approach for achieving fair rate allocations"],"prefix":"10.1016","volume":"40","author":[{"given":"Yannick","family":"Blanpain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghupathy","family":"Sivakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(02)00292-X_BIB1","doi-asserted-by":"crossref","unstructured":"A. Demers, S. Keshav, S. Shenker, Analysis and simulation of a fair queueing algorithm, in: Proceedings of ACM SIGCOMM Comput. Comm. Rev. 19(4) (1989) 1-12","DOI":"10.1145\/75246.75248"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB2","unstructured":"A. Greenberg, N. Madras, How fair is fair queueing, in: Proceedings of Performance 90"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB3","unstructured":"H. Stoica, S. Shenker, H. Zhang, Core-stateless fair queuing: achieving approximately fair bandwidth allocations in high speed networks, in: Proceedings of ACM SIGCOMM"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB4","doi-asserted-by":"crossref","unstructured":"R. Sivakumar, T.-E. Kim, N. Ventitaraman, V. Bharghavan, Achieving per-flow weighted rate fairness in a core-stateless network, in: Proceedings of ICDCS","DOI":"10.1109\/ICDCS.2000.840929"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB5","unstructured":"K. Fall, K. Vardhan, ns notes and documentation, 1999. Available from <http:\/\/www-mash.cs.berkeley.edu\/ns\/>"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB6","unstructured":"R. Jain, A. Durresi, G. Babic, Throughput fairness index: an explanation, in: ATM Forum Document Number: ATMForum\/99-0045"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB7","unstructured":"R. Blum, J.M. Kaplan, Network quality of service, in: Network Industry Survey, Lucent Technologies, May 2001"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB8","doi-asserted-by":"crossref","unstructured":"V. Paxson, End-to-end routing behavior Internet, in: Proceedings of the ACM SIGCOMM, 1996","DOI":"10.1145\/248156.248160"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB9","doi-asserted-by":"crossref","unstructured":"S. Lu, T. Nandagopal, V. Bharghavan, A wireless fair service algorithm for packet cellular networks, in: Proceedings of ACM MOBICOM, 1998","DOI":"10.1145\/288235.288242"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB10","unstructured":"http:\/\/www.cybergeography.com\/atlas"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB11","unstructured":"Telia Networks Inc"},{"key":"10.1016\/S1389-1286(02)00292-X_BIB12","doi-asserted-by":"crossref","unstructured":"Y. Blanpain, A scalable and deployable approach for achieving fair rate allocations in high speed networks, in: Master\u2019s Thesis, Georgia Institute of Technology, 2001","DOI":"10.1109\/ICCCN.2001.956304"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860200292X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860200292X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T21:22:20Z","timestamp":1554412940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S138912860200292X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S138912860200292X"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(02)00292-x","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}