{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T09:45:55Z","timestamp":1725443155672},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lcn.2002.1181822","type":"proceedings-article","created":{"date-parts":[[2003,8,27]],"date-time":"2003-08-27T11:03:45Z","timestamp":1061982225000},"page":"495-501","source":"Crossref","is-referenced-by-count":0,"title":["Core-stateless labeling fairness: an integrated architecture to approximate fair bandwidth allocations in high speed networks"],"prefix":"10.1109","author":[{"family":"Jung-Shian Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Cheng-Pong Lo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/INFCOM.1999.752153"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1145\/285237.285291","article-title":"Modeling tcp throughput: A simple model and its empirical validation","author":"padhye","year":"1998","journal-title":"Proc ACM SIGCOMM 98"},{"key":"ref12","first-page":"231","article-title":"Efficient Fair Queuing using Deficit Round Robin","author":"shreedhar","year":"1995","journal-title":"Proceedings of ACM SIGCOMM'95"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1145\/285243.285273","article-title":"Core-Stateless Fair Queuing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks","author":"stoica","year":"1998","journal-title":"Proceedings of ACM SIGCOMM'98"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/65.923938"},{"year":"0","key":"ref15"},{"year":"0","key":"ref16"},{"key":"ref4","article-title":"Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness","author":"feng","year":"2001","journal-title":"Proc of INFOCOM 2001"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/90.793002"},{"key":"ref6","first-page":"127","article-title":"Dynamic of Random Early Detection","author":"lin","year":"1997","journal-title":"Proceedings of ACM SIGCOMM '97"},{"key":"ref5","article-title":"Fair Bandwidth Share Using Flow Number Estimation","author":"li","year":"2002","journal-title":"Proc IEEE ICC 2002"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.17487\/rfc1254"},{"key":"ref7","first-page":"127","article-title":"Dynamics of Random Early Detection","author":"lin","year":"1997","journal-title":"Proceedings of ACM SIGCOMM'97"},{"key":"ref2","article-title":"Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State","author":"cao","year":"0","journal-title":"Proceedings of IEEE INFOCOM '2000"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/INFCOM.2001.916752"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/IWQOS.2000.847933"}],"event":{"acronym":"LCN-02","name":"LCN 2002. 27th Annual IEEE Conference on Local Computer Networks","location":"Tampa, FL, USA"},"container-title":["27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8410\/26516\/01181822.pdf?arnumber=1181822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T07:02:03Z","timestamp":1623308523000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181822\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/lcn.2002.1181822","relation":{},"subject":[]}}