14 research outputs found
Less-than-Best-Effort capacity sharing over high BDP networks with LEDBAT
There has been a renewed interest at the Internet Engineering Task Force (IETF) in using Less-than-Best Effort (LBE) methods for background applications. IETF recently published a RFC for Low Extra Delay Background Transport (LEDBAT), a congestion control algorithm for LBE transmissions. This paper provides an analysis of LEDBAT performance over congested large bandwidth X delay product (LBDP) networks, and assesses the validity of having a fixed target queuing time. In particular, we lead a study of the impact of this target queuing delay when LEDBAT is used over 4G satellite networks. The rationale is to explore the possibility to grab the unused 4G satellite links' capacity to carry non-commercial traffic. We show that this is achievable with LEDBAT. However, depending on the fluctuation of the load, performance improvements could be obtained by properly setting the target value. We generalize this evaluation over different congested LBDP networks and confirm that the target value might need to be adjusted to networks' and traffic's characteristics. Further work will study whether and how this parameter should be dynamically adapted, and LEDBAT's congestion control improved
FLOWER - Fuzzy lower than-best effort transport protocol
We present a new delay-based transport protocol named FLOWER, that aims at providing a Lower-than-Best-Effort (LBE) service. The objective is to propose an alternative to the Low Extra Delay Background Transport (LEDBAT) widely deployed within the official BitTorrent client. Indeed, besides its intra-fairness problem, known as latecomer unfairness, LEDBAT can be too aggressive against TCP, making it ill suited for providing LBE services over certain networks such as constrained wireless networks. By using a fuzzy controller to modulate the sending rate, FLOWER aims to solve LEDBAT issues while fulfilling the role of a LBE protocol. Our simulation results show that FLOWER can carry LBE traffic in network scenarios where LEDBAT cannot while solving the latecomer unfairness problem. Finally, the presented algorithm is simple to implement and does not require complex computation that would prevent its deployment
Experimental Assessment of BitTorrent Completion Time in Heterogeneous TCP/uTP swarms
BitTorrent, one of the most widespread used P2P application for file-sharing,
recently got rid of TCP by introducing an application-level congestion control
protocol named uTP. The aim of this new protocol is to efficiently use the
available link capacity, while minimizing its interference with the rest of
user traffic (e.g., Web, VoIP and gaming) sharing the same access bottleneck.
In this paper we perform an experimental study of the impact of uTP on the
torrent completion time, the metric that better captures the user experience.
We run BitTorrent applications in a flash crowd scenario over a dedicated
cluster platform, under both homogeneous and heterogeneous swarm population.
Experiments show that an all-uTP swarms have shorter torrent download time with
respect to all-TCP swarms. Interestingly, at the same time, we observe that
even shorter completion times can be achieved under careful mixtures of TCP and
uTP traffic.Comment: 14 pages, under submissio
Modeling the interdependency of low-priority congestion control and active queue management
Recently, a negative interplay has been shown to arise when scheduling/AQM
techniques and low-priority congestion control protocols are used together:
namely, AQM resets the relative level of priority among congestion control
protocols. This work explores this issue by (i) studying a fluid model that
describes system dynamics of heterogeneous congestion control protocols
competing on a bottleneck link governed by AQM and (ii) proposing a system
level solution able to reinstate priorities among protocols.Comment: 9 page
An experimental evaluation of LEDBAT++
LEDBAT++ is the evolution of LEDBAT, a congestion control algorithm originally designed to provide lessthan-
best-effort transport on the Internet. LEDBAT++ aims to address a number of shortcomings present in
LEDBAT, including late-comer advantage, latency drift, competition on equal grounds with best effort traffic
in the presence of small buffers and difficulties experienced while measuring the variations on the delay.
In this paper, we perform an experimental evaluation of LEDBAT++ using the Windows Serverâs LEDBAT++
implementation. We find that while LEDBAT++ overcomes all the limitations identified in LEDBAT, the change
introduced in LEDBAT++ to do so results in a performance penalty that prevents LEDBAT++ flows to seize
all the available capacity when there is no competing traffic. We propose two simple modifications to the
LEDBAT++ algorithm that would address the identified issues and reduce the penalty.This work has been partially supported by the EU EC through the NGI Pointer RIM project, Grant 871528 , and the Madrid Government (Comunidad de Madrid-Spain) under the Multiannual Agreement with UC3M in the line of Excellence of University Professors (EPUC3M21), and in the context of the V PRICIT (Regional Programme of Research and Technological Innovation)
Design, implementation and validation of a receiver-driven less-than-best-effort transport
LEDBAT++ is a congestion-control algorithm that implements a less-than-best-effort transport service. In this paper we present rLEDBAT, a purely receiver-based mechanism to implement LEDBAT++ for TCP. rLEDBAT enables a receiver to select some incoming traffic as less-than-best-effort, managing the capacity of the downlink. We describe the different mechanisms composing rLEDBAT that enable the execution of the LEDBAT++ congestion control algorithm at the receiver. We have implemented and experimentally tested rLEDBAT. We validate that the mechanisms incorporated by rLEDBAT at the receiver are indeed effective to implement a less-than-best-effort transport service at the receiver, as it performs similarly to the original sender-based LEDBAT++