{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:15:15Z","timestamp":1762521315447,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T00:00:00Z","timestamp":1246320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2009,6,30]]},"abstract":"<jats:p>When data transfers to or from a host happen in parallel, users do not always consider them to have the same importance. Ideally, a transport protocol should therefore allow its users to manipulate the fairness among flows in an almost arbitrary fashion. Since data transfers can also include real-time media streams which need to keep delay | and hence buffers | small, the protocol should also have a smooth sending rate. In an effort to satisfy the above requirements, we present MulTFRC, a congestion control mechanism which is based on the TCP-friendly Rate Control (TFRC) protocol. It emulates the behavior of a number of TFRC flows while maintaining a smooth sending rate. Our simulations and a real-life test demonstrate that MulTFRC performs significantly better than its competitors, potentially making it applicable in a broader range of settings than what TFRC is normally associated with.<\/jats:p>","DOI":"10.1145\/1568613.1568615","type":"journal-article","created":{"date-parts":[[2009,7,15]],"date-time":"2009-07-15T13:51:27Z","timestamp":1247665887000},"page":"5-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["MulTFRC"],"prefix":"10.1145","volume":"39","author":[{"given":"Dragana","family":"Damjanovic","sequence":"first","affiliation":[{"name":"University of Innsbruck, Innsbruck, Austria"}]},{"given":"Michael","family":"Welzl","sequence":"additional","affiliation":[{"name":"University of Oslo, Oslo, Norway"}]}],"member":"320","published-online":{"date-parts":[[2009,6,30]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"RED parameters: http:\/\/icir.org\/floyd\/red.html#parameters.  RED parameters: http:\/\/icir.org\/floyd\/red.html#parameters."},{"volume-title":"Open Grid Forum","year":"2003","author":"Allcock W.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/190314.190317"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/293927.293930"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347397"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"S. Floyd M. Handley J. Padhye and J. Widmer. TCP Friendly Rate Control (TFRC): Protocol Specification. RFC 5348 (Proposed Standard) Sept. 2008.   S. Floyd M. Handley J. Padhye and J. Widmer. TCP Friendly Rate Control (TFRC): Protocol Specification. RFC 5348 (Proposed Standard) Sept. 2008.","DOI":"10.17487\/rfc5348"},{"volume-title":"PFLDnet","year":"2008","author":"Hacker T.J.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341431.1341434"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.879702"},{"key":"e_1_2_1_11_1","unstructured":"D.E. Ott T. Sparks and K. Mayer-Patel. Aggregate Congestion Control for Distributed Multimedia Applications. In IEEE Infocom 2004 Hong Kong.  D.E. Ott T. Sparks and K. Mayer-Patel. Aggregate Congestion Control for Distributed Multimedia Applications. In IEEE Infocom 2004 Hong Kong."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285291"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080099"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025124.1025887"},{"volume-title":"NSDI'04","author":"Subramanian L.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/844128.844159"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1568613.1568615","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1568613.1568615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:48Z","timestamp":1750249068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1568613.1568615"}},"subtitle":["providing weighted fairness for multimediaapplications (and others too!)"],"short-title":[],"issued":{"date-parts":[[2009,6,30]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6,30]]}},"alternative-id":["10.1145\/1568613.1568615"],"URL":"https:\/\/doi.org\/10.1145\/1568613.1568615","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2009,6,30]]},"assertion":[{"value":"2009-06-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}