{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/42428"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/42428","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Making short flows finish faster with TCP","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Mussmann, Samuel"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Godfrey, Philip B."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-02-03T19:38:10Z","date_published":"2013-02-03T19:38:10Z","updated_at":"2026-07-22T22:25:33Z","subjects":["Computer Science","Networking","Random Early Detection","Fair Queueing","Flow Completion Time","Rate Control Protocol","Transmission Control Protocol (TCP)"],"languages":["en"],"rights":["Copyright 2012 by Samuel D Mussmann. All rights reserved."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/42428","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Godfrey, Philip B."]},{"key":"dc:creator","label":"Author","values":["Mussmann, Samuel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-02-03T19:38:10Z","2012-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science","Networking","Random Early Detection","Fair Queueing","Flow Completion Time","Rate Control Protocol","Transmission Control Protocol (TCP)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2012 by Samuel D Mussmann. All rights reserved."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/42428"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)"]},{"key":"dc:title","label":"Title","values":["Making short flows finish faster with TCP"]}]}],"canonical_facts":{"dc:contributor":["Godfrey, Philip B."],"dc:creator":["Mussmann, Samuel"],"dc:date":["2013-02-03T19:38:10Z","2012-12"],"dc:description":["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)"],"dc:identifier":["http://hdl.handle.net/2142/42428"],"dc:language":["en"],"dc:rights":["Copyright 2012 by Samuel D Mussmann. All rights reserved."],"dc:subject":["Computer Science","Networking","Random Early Detection","Fair Queueing","Flow Completion Time","Rate Control Protocol","Transmission Control Protocol (TCP)"],"dc:title":["Making short flows finish faster with TCP"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:33Z"}