{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:05:22Z","timestamp":1730268322147,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2005.1498529","type":"proceedings-article","created":{"date-parts":[[2005,8,24]],"date-time":"2005-08-24T14:00:58Z","timestamp":1124892058000},"page":"2436-2446","source":"Crossref","is-referenced-by-count":2,"title":["Low-state fairness: lower bounds and practical enforcement"],"prefix":"10.1109","volume":"4","author":[{"given":"A.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Helmy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Goel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Heidemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS.2000.847946"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"17","article-title":"An architecture for differentiated services","volume":"2475","author":"blake","year":"1998","journal-title":"RFC"},{"journal-title":"NS2 Network Simulator","year":"0","key":"36"},{"key":"18","article-title":"Adaptive marking for aggregated flows","author":"yeom","year":"2001","journal-title":"In GLOBECOM"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2001.992899"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882836"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/90.720870"},{"key":"13","first-page":"127","article-title":"Dynamics of random early detection","author":"lin","year":"1997","journal-title":"SIGCOMM 97"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752153"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808414"},{"key":"12","article-title":"A stateless active queue management scheme for approximating fair bandwidth allocation","author":"pan","year":"2000","journal-title":"IEEE INFOCOM 2000"},{"key":"21","article-title":"A two rate three color marker","volume":"2698","author":"heinanen","year":"1999","journal-title":"RFC"},{"key":"20","article-title":"A single rate three color marker","volume":"2697","author":"heinanen","year":"1999","journal-title":"RFC"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00237-2"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45812-3_17"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.524537"},{"key":"26","article-title":"E-fairness: A trade-off between overhead and max-min fairness","author":"bhatnagar","year":"2003","journal-title":"IEEE ICC"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/543614.543615"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/948224.948225"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/52324.52356"},{"key":"2","article-title":"Transmission control protocol","volume":"793","author":"postal","year":"1981","journal-title":"Internet Request for Comments RFC 793"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.833829"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/90.793002"},{"key":"30","article-title":"Counting distinct elements in a data stream","author":"bar-yossef","year":"2002","journal-title":"RANDOM 2002"},{"key":"7","article-title":"On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms","author":"kompella","year":"2004","journal-title":"NOSSDAV"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633052"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872790"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378826"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.17487\/rfc0896"},{"journal-title":"Data Networks","year":"1991","author":"bertsekas","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"}],"event":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","location":"Miami, FL, USA"},"container-title":["Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9990\/32102\/01498529.pdf?arnumber=1498529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T23:48:07Z","timestamp":1489535287000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1498529\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/infcom.2005.1498529","relation":{},"subject":[]}}