8 research outputs found
On The Existence Of Optimal LEDBAT Parameters
The Low Extra Delay Background Transport (LEDBAT) protocol is a recently standardized protocol that aims to offer a scavenger service (i.e. the goal is to exploit the remaining and unused capacity of a link). LEDBAT is a delay-based protocol mainly defined by two parameters: a target queuing delay and a gain. The RFC 6817 provides guidelines to configure both parameters that strongly impact on the LEDBAT behavior in terms of fairness with other protocols. However, these guidelines are questioned by several studies as they might lead to the generation of a non-LBE (Less-than-Best-Effort) traffic. This paper explores the set of optimal parameters allowing LEDBAT protocol to effectively perform as an LBE traffic. We conclude that the optimal couple of target and decrease gain is (5ms; 10). However, we observe that the aggregated use of optimized LEDBAT sources still disturb the overall traffic performance and that the exponential backoff is not an answer to this issue. As a result, we believe that additional strategies to limit the number of LEDBAT flows are required for integrating this protocol at a large scale
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