{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:41:04Z","timestamp":1725493264237},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727088"},{"type":"electronic","value":"9783540727095"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72709-5_5","type":"book-chapter","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T09:10:28Z","timestamp":1193044228000},"page":"43-53","source":"Crossref","is-referenced-by-count":5,"title":["Beyond CHOKe: Stateless Fair Queueing"],"prefix":"10.1007","author":[{"given":"Rade","family":"Stanojevi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Shorten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Altman, E., Avrachenkov, K., Barakat, C.: A stochastic model of TCP\/IP with stationary random losses. IEEE\/ACM Transactions on Networking (TON) 13(2) (2005)","DOI":"10.1109\/TNET.2005.845536"},{"key":"5_CR2","unstructured":"Abouzeid, A., Roy, S.: Analytic understanding of RED gateways with. multiple competing TCP flows. In: Proc. of IEEE GLOBECOM (2000)"},{"key":"5_CR3","unstructured":"Athuraliya, S., Lapsley, D., Low, S.: Enhanced Random Early Marking algorithm for Internet flow control. In: Proc. of IEEE INFOCOM, Tel Aviv, Israel (2000)"},{"key":"5_CR4","unstructured":"Das, A., Dutta, D., Goel, A., Helmy, A., Heidemann, J.: Low State Fairness: Lower Bounds and Practical Enforcement. In: Proc. of the IEEE INFOCOM, Miami, FL, USA (March 2005)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: Proc. of ACM SIGCOMM, Austin, TX (1989)","DOI":"10.1145\/75246.75248"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1239\/aap\/1019160951","volume":"34","author":"V. Dumas","year":"2002","unstructured":"Dumas, V., Guillemin, F., Robert, P.: A Markovian analysis of additive-increase multiplicative-decrease algorithms. Adv. in Appl. Probab.\u00a034(1), 85\u2013111 (2002)","journal-title":"Adv. in Appl. Probab."},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/TNET.2002.801399","volume":"10","author":"W. Feng","year":"2002","unstructured":"Feng, W., Shin, K.G., Kandlur, D.D., Saha, D.: The BLUE active queue management algorithms. IEEE ACM Transactions on Networking\u00a010(4), 513\u2013528 (2002)","journal-title":"IEEE ACM Transactions on Networking"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Floyd, S.: HighSpeed TCP for Large Congestion Windows. RFC 3649, Experimental (December 2003)","DOI":"10.17487\/rfc3649"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/122431.122434","volume":"21","author":"S. Floyd","year":"1991","unstructured":"Floyd, S.: Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1: Oneway Traffic. ACM Computer Communication Review\u00a021(5), 30\u201347 (1991)","journal-title":"ACM Computer Communication Review"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/90.251892","volume":"1","author":"S. Floyd","year":"1993","unstructured":"Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE\/ACM Transactions on Networking\u00a01, 397\u2013413 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Katabi, D., Handley, M., Rohr, C.: Internet Congestion Control for Future High Bandwidth-Delay Product Environments. In: Proc. of ACM SIGCOMM, Pittsburgh, PA, USA (2002)","DOI":"10.1145\/633034.633035"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kelly, T.: Scalable TCP: Improving Performance in Highspeed Wide Area Networks. ACM SIGCOMM Computer Communication Review 33(2) (April 2003)","DOI":"10.1145\/956981.956989"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kodialam, M., Lakshman, T.V., Mohanty, S.: Runs based Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation. In: Proc. of IEEE INFOCOM, Hong Kong (March 2004)","DOI":"10.1109\/INFCOM.2004.1354591"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/90.611099","volume":"5","author":"T.V. Lakshman","year":"1997","unstructured":"Lakshman, T.V., Madhow, U.: The performance of TCP\/IP for networks with high bandwidth-delay products and random loss. IEEE ACM Transactions on Networking\u00a05(3), 336\u2013350 (1997)","journal-title":"IEEE ACM Transactions on Networking"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Lin, D., Morris, R.: Dynamics of random early detection. In: Proc. of ACM SIGCOMM, Cannes, France (1997)","DOI":"10.1145\/263105.263154"},{"key":"5_CR16","unstructured":"Low, S., Andrew, L., Wydrowski, B.: Understanding XCP: Equilibrium and Fairness. In: Proc. of IEEE Infocom, Miami, FL (March 2005)"},{"key":"5_CR17","unstructured":"Mahajan, R., Floyd, S., Wetherall, D.: Controlling high-bandwidth flows at the congested router. In: Proc. of IEEE ICNP, Riverside, CA, USA (2001)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE\/ACM Transactions on Networking 8(5) (October 2000)","DOI":"10.1109\/90.879343"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Ott, T.J., Lakshman, T.V., Wong, L.H.: SRED: Stabilized RED. In: Proc. IEEE INFOCOM, New York (March 1999)","DOI":"10.1109\/INFCOM.1999.752153"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Pan, R., Breslau, L., Prabhakar, B., Shenker, S.: Approximate Fairness through Differential Dropping. ACM SIGCOMM Computer Communication Review 33(2) (April 2003)","DOI":"10.1145\/956981.956985"},{"key":"5_CR21","unstructured":"Pan, R., Prabhakar, B., Psounis, K.: CHOKe: A stateless AQM scheme for approximating fair bandwidth allocation. In: Proc. of IEEE INFOCOM, Tel Aviv, Israel (2000)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round-robin. IEEE\/ACM Transactions on Networking 4(3) (June 1996)","DOI":"10.1109\/90.502236"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Srikant, R.: The Mathematics of Internet Congestion Control. Birkhauser (2004)","DOI":"10.1007\/978-0-8176-8216-3"},{"key":"5_CR24","unstructured":"Stanojevic, R., Shorten, R.: AQM\u2019s for achieving fairness between competing TCP flows. Technical report, available online: www.hamilton.ie\/person\/rade\/trm.pdf"},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TNET.2002.808414","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Shenker, S., Zhang, H.: Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks. IEEE ACM Transactions on Networking\u00a011(1), 33\u201346 (2003)","journal-title":"IEEE ACM Transactions on Networking"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Tang, A., Wang, J., Low, S.H.: Understanding CHOKe: throughput and spatial characteristics. IEEE\/ACM Transactions on Networking 12(4) (2004)","DOI":"10.1109\/TNET.2004.833162"},{"issue":"11","key":"5_CR27","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1109\/LCOMM.2002.805519","volume":"6","author":"B. Wydrowski","year":"2002","unstructured":"Wydrowski, B., Zukerman, M.: MaxNet: A congestion control architecture for maxmin fairness. IEEE Communications Letters\u00a06(11), 512\u2013514 (2002)","journal-title":"IEEE Communications Letters"},{"key":"5_CR28","unstructured":"Yang, Y., Lam, S.: General AIMD Congestion Control. In: Proc. ICNP 2000, Osaka, Japan (2000)"}],"container-title":["Lecture Notes in Computer Science","Network Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72709-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T09:16:07Z","timestamp":1587978967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72709-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727088","9783540727095"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72709-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}