2026-09-19T22:49:19Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/42428 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Godfrey, Philip B. Mussmann, Samuel 2013-02-03T19:38:10Z 2013-02-03T19:38:10Z 2012-12 2013-02-03T19:38:10Z 2012-12 Users want web pages to load quickly. Because modern web pages make connections to many hosts, this requires that small flows complete quickly at high percentiles. We explore how to achieve this goal with protocols that do not require modifications to all the routers and agents transmitting the flow. Our simulations indicate that both Random Early Detection and Fair Queuing can significantly reduce flow completion times at both the median and the 99th percentile. Fair Queueing provides more consistent reductions across varying bandwidth-delay products and background traffic. Item withdrawn by Katherine Eriksen (eriksen3@illinois.edu) on 2012-12-07T15:23:40Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Mussmann_Samuel.pdf: 478152 bytes, checksum: 15480035360227b966eae18153888e18 (MD5) Made available in DSpace on 2013-02-03T19:38:10Z (GMT). No. of bitstreams: 2 Samuel_Mussmann.pdf: 478152 bytes, checksum: 15480035360227b966eae18153888e18 (MD5) license.txt: 4065 bytes, checksum: 0a9a26d23c5074e8efbc95daf9e9cca1 (MD5) http://hdl.handle.net/2142/42428 en Copyright 2012 by Samuel D Mussmann. All rights reserved. Computer Science Networking Random Early Detection Fair Queueing Flow Completion Time Rate Control Protocol Transmission Control Protocol (TCP) Making short flows finish faster with TCP text Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Thesis M.S. MS:Computer Science -UIUC 10KS0112MS