Balancing Loss Discrimination and Congestion Control in a Rate-Based Protocol
Submitted by crepric on Fri, 09/25/2009 - 20:01
Title | Balancing Loss Discrimination and Congestion Control in a Rate-Based Protocol |
Publication Type | Thesis |
Year of Publication | 2003 |
Authors | Gaonkar, S. |
Advisor | Kravets, R. |
Academic Department | Computer Science |
Degree | MS |
University | University of Illinois at Urbana Champaign |
Abstract | The stability of the Internet depends on the presence of well-behaved ows. While TCP forms the majority of the traffic over the Internet, the Internet user community is also dedicated to supporting mobile devices over wireless networks. However, TCP-like be- havior is not well suited to support applications over lossy wireless networks. Ideally, these applications require a protocol that adapts to network conditions with the ability to discriminate congestion-based and transmission-based losses. In this thesis, we present a rate-based transport protocol that is designed to support Internet-based communication for mobile nodes using infrastructure-based wireless net- works. We propose an end-to-end approach to loss discrimination based on network state estimation at the receiver. Discrimination is achieved by correlating short-term history of packet inter-arrival times with the loss. Simulations of our protocol prototype show that rate-based protocols can provide better correlation to network conditions than ACK-based protocols. We present an analytical model of XRTP's congestion control that enabled us to detect the reasons for XRTP's aggresive behavior. We provide exten- sions to XRTP's congestion control and by extensive evaluation through simulations, we demonstrate that our protocol is well-behaved over a wide range of scenarios. |
Full Text |
|
Attachment | Size |
---|---|
399.53 KB |
- Login to post comments
- Tagged
- XML
- BibTex
- Google Scholar