@article {26427,
	title = {Low-Latency Scheduling in MPTCP},
	journal = {IEEE Transactions on Networking},
	volume = {27},
	year = {2019},
	month = {02/2019},
	publisher = {ACM IEEE},
	author = {Hurtig, Per and karl johan {grinnemo} and Brunstr{\"o}m, Anna and Ferlin, Simone and Alay, {\"O}zg{\"u} and Kuhn, Nicolas}
}
@article {24987,
	title = {Operating ranges, tunability and performance of CoDel and PIE},
	journal = {Computer Communications},
	volume = {103},
	year = {2017},
	month = {05/2017},
	pages = {74-82},
	publisher = {Elsevier},
	abstract = {Bufferbloat is excessive delay due to the accumulation of packets in a router\&rsquo;s oversized queues. CoDel and PIE are two recent Active Queue Management (AQM) algorithms that have been proposed to address bufferbloat by reducing the queuing delay while trying to maintain a high bottleneck utilization. This paper fills a gap by outlining what are the operating ranges, that is the network characteristics (in terms of round-trip times and bottleneck capacity), for which these algorithms achieve their design goals. This new approach to the problem lets us identify deployment scenarios where both AQM schemes result in poor performance when used with default parameters. Because PIE and CoDel have been proposed with RED\&rsquo;s deployment issues in mind, it was essential to evaluate to what extent we can tune them to achieve various trade-offs and let them control the queuing delay outside their default operating range. We find that, by appropriate tuning (1) the amount of buffering can easily be controlled with PIE, (2) the Round Trip Time (RTT) sensitivity of CoDel can be reduced. Also, we observe there is more correlation between the congestion level, the achieved queuing delay and the targeted delay with CoDel than with PIE. This paper therefore concludes there is no single overall best AQM scheme, as each scheme proposes a specific trade-off.},
	keywords = {AQM, Bufferbloat, CoDel, congestion control, PIE},
	doi = {http://dx.doi.org/10.1016/j.comcom.2016.07.013},
	author = {Kuhn, Nicolas and Ros, David and Amadou Baba {Bagayoko} and Kulatunga, Chamil and Fairhurst, Gorry and Khademi, Naeem}
}
@techreport {aqm-eval-draft,
	title = {AQM Characterization Guidelines},
	year = {2016},
	month = {07/2016},
	publisher = {IETF},
	abstract = {Unmanaged large buffers in today\&$\#$39;s networks have given rise to a slew\&nbsp;of performance issues. \&nbsp;These performance issues can be addressed by\&nbsp;some form of Active Queue Management (AQM) mechanism, optionally in\&nbsp;combination with a packet scheduling scheme such as fair queuing.\&nbsp;The IETF Active Queue Management and Packet Scheduling working group\&nbsp;was formed to standardize AQM schemes that are robust, easily\&nbsp;implementable, and successfully deployable in today\&$\#$39;s networks. \&nbsp;This\&nbsp;document describes various criteria for performing precautionary\&nbsp;characterizations of AQM proposals. \&nbsp;This document also helps in\&nbsp;ascertaining whether any given AQM proposal should be taken up for\&nbsp;standardization by the AQM WG.},
	keywords = {Active Queue Management},
	issn = {2070-1721},
	url = {https://tools.ietf.org/html/rfc7928},
	author = {Kuhn, Nicolas and Natarajan, Preethi and Khademi, Naeem and Ros, David}
}
@misc {madpie-arxiv,
	title = {Improving PIE{\textquoteright}s performance over high-delay paths},
	year = {2016},
	month = {02/2016},
	abstract = {Bufferbloat is excessive latency due to over- provisioned network buffers. PIE and CoDel are two recently proposed Active Queue Management (AQM) algorithms, designed to tackle bufferbloat by lowering the queuing delay without degrading the bottleneck utilization. PIE uses a proportional integral controller to maintain the average queuing delay at a desired level; however, large Round Trip Times (RTT) result in large spikes in queuing delays, which induce high dropping probability and low utilization. To deal with this problem, we propose Maximum and Average queuing Delay with PIE (MADPIE). Loosely based on the drop policy used by CoDel to keep queuing delay bounded, MADPIE is a simple extension to PIE that adds deterministic packet drops at controlled intervals. By means of simulations, we observe that our proposed change does not affect PIE{\textquoteright}s performance when RTT \&lt; 100 ms. The deterministic drops are more dominant when the RTT increases, which results in lower maximum queuing delays and better performance for VoIP traffic and small file downloads, with no major impact on bulk transfers.},
	keywords = {Active Queue Management, Internet latency, PIE},
	url = {http://arxiv.org/abs/1602.00569},
	author = {Kuhn, Nicolas}
}
@article {24302,
	title = {Is Multi-Path Transport Suitable for Latency Sensitive Traffic?},
	journal = {Computer Networks (COMNET)},
	volume = {105},
	year = {2016},
	month = {08/2016},
	pages = {1-21},
	publisher = {Elsevier},
	abstract = {This paper assesses whether multi-path communication can help latency-sensitive applications to satisfy the requirements of their users.\&nbsp; We consider Concurrent Multi-path Transfer for SCTP (CMT-SCTP) and Multi-path TCP (MPTCP) and evaluate their proficiency in transporting video, gaming, and web traffic over combinations of WLAN and 3G interfaces. To ensure the validity of our evaluation, several experimental approaches were used including simulation, emulation and live experiments. When paths are symmetric in terms of capacity, delay and loss rate, we find that the experienced latency is significantly reduced, compared to using a single path. Using multiple asymmetric paths does not affect latency -- applications do not experience any increase or decrease, but might benefit from other advantages of multi-path communication. In the light of our conclusions, multi-path transport is suitable for latency-sensitive traffic and mature enough to be widely deployed.},
	keywords = {CMT-SCTP, Internet, latency, MPTCP, Multi-Path Communication, transport protocols},
	doi = {10.1016/j.comnet.2016.05.008},
	author = {Yedugundla, Kiran and Ferlin, Simone and Dreibholz, Thomas and Alay, {\"O}zg{\"u} and Kuhn, Nicolas and Hurtig, Per and Brunstr{\"o}m, Anna}
}
@inproceedings {bufferbloat-eucnc,
	title = {Tackling Bufferbloat in Capacity-limited Networks},
	journal = {Proceedings of EuCNC 2015},
	year = {2015},
	address = {Paris},
	abstract = {Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have difficulty controlling the buffering level, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if the methods are claimed to be insensitive to link rates and round-trip delays. We explore this issue and show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We present experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the download time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.},
	keywords = {AQM, Bufferbloat, CoDel, Rural Broadband},
	author = {Kulatunga, Chamil and Kuhn, Nicolas and Fairhurst, Gorry and Ros, David}
}
