1 / 12

Enhancing Access Link Management for Efficient Data Transmission

This paper explores receiver-based management strategies for low-bandwidth access links, prioritizing interactive connections over background transfers to improve overall performance. Using a unique conceptual model and design approach, the system categorizes flows and adjusts throughput share based on real-time parameters. Implementations do not require changes to applications or servers, resulting in faster web downloads and fair distribution of resources among different types of flows like FTP and Telnet. The mechanism leverages TCP's window size to control traffic flow and optimize receiver acceptance, demonstrating significant performance gains that offer insights for future challenges with shared links and non-TCP flows.

taro
Download Presentation

Enhancing Access Link Management for Efficient Data Transmission

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Receiver-based Management of Low-bandwidth Access Links INFOCOM 2000 March 28, 2000 Neil Spring, Maureen Chesire, Mark Berryman, Vivek Sahasranaman, Thomas Anderson, and Brian Bershad

  2. The Problem • While downloading • Large software or email attachment • Try • Checking your mail or surfing the Web • Interactive performance is abysmal during background transfers

  3. The Conceptual Model

  4. Telnet vs. FTP

  5. Why does this happen? • Queue length increases effective latency of new or interactive connections • Existing connections dominate throughput consumption, new connections face an entrenched enemy

  6. Our Approach • Control the queue at the bottleneck link • Queue composition implies throughput share • Long queue length implies delay • From the receiver • Unique knowledge determines priorities • Solution is deployed here

  7. Our Design • Categorize flows automatically • Idle: long time since last activity • Long transfer: many bytes received since last send • Short transfer: few bytes received since last send • Interactive: single, short packets exchanged • Determine link parameters • Relate throughput share to window size • Estimate RTT: receiversender receiver • Wndc = Queued packetsc + Throughputc * RTTc • Constraints:

  8. Our Mechanism • TCP’s advertised window • Ordinarily used for flow control • How much traffic the receiver will accept from the sender • Linux 2.2 kernel module • No application, network, or server changes

  9. Faster Web Downloads Web Background FTP Before After

  10. Fair division between FTP flows Before After

  11. Better telnet performance Telnet Background FTP Before After

  12. Conclusions • Significant performance advantage • Future challenges: • Shared links (e.g. cable modems) • Non-TCP flows (e.g. Real Audio)

More Related