Making short flows finish faster with TCP

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.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2013

Author dc:creator

• Mussmann, Samuel

Contributors dc:contributor

• Godfrey, Philip B.

• Computer Science
• Networking
• Random Early Detection
• Fair Queueing
• Flow Completion Time
• Rate Control Protocol
• Transmission Control Protocol (TCP)

Statement dc:rights

• Copyright 2012 by Samuel D Mussmann. All rights reserved.

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/42428

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/42428