ctrlTCP: Reducing latency through coupled, heterogeneous multi-flow TCP congestion control


Conference paper


S. Islam, M. Welzl, K. A. Hiorth, D. A. Hayes, G. Armitage, S. Gjessing
Proceedings of IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2018 Apr, pp. 214--219


View PDF Semantic Scholar DBLP DOI
Cite

Cite

APA   Click to copy
Islam, S., Welzl, M., Hiorth, K. A., Hayes, D. A., Armitage, G., & Gjessing, S. (2018). ctrlTCP: Reducing latency through coupled, heterogeneous multi-flow TCP congestion control. In Proceedings of IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) (pp. 214–219). https://doi.org/10.1109/INFCOMW.2018.8406887


Chicago/Turabian   Click to copy
Islam, S., M. Welzl, K. A. Hiorth, D. A. Hayes, G. Armitage, and S. Gjessing. “CtrlTCP: Reducing Latency through Coupled, Heterogeneous Multi-Flow TCP Congestion Control.” In Proceedings of IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 214–219, 2018.


MLA   Click to copy
Islam, S., et al. “CtrlTCP: Reducing Latency through Coupled, Heterogeneous Multi-Flow TCP Congestion Control.” Proceedings of IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2018, pp. 214–19, doi:10.1109/INFCOMW.2018.8406887.


BibTeX   Click to copy

@inproceedings{s2018a,
  title = {ctrlTCP: Reducing latency through coupled, heterogeneous multi-flow TCP congestion control},
  year = {2018},
  month = apr,
  pages = {214--219},
  doi = {10.1109/INFCOMW.2018.8406887},
  author = {Islam, S. and Welzl, M. and Hiorth, K. A. and Hayes, D. A. and Armitage, G. and Gjessing, S.},
  booktitle = {Proceedings of IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)},
  month_numeric = {4}
}

Abstract

We present ctrlTCP, a method to combine the congestion controls of multiple TCP connections. In contrast to the previous methods such as the Congestion Manager, ctrlTCP can couple all TCP flows that leave one sender, traverse a common bottleneck (e.g., a home user's thin uplink) and arrive at different destinations. Using ns-2 simulations and an implementation in the FreeBSD kernel, we show that our mechanism reduces queuing delay, packet loss, and short flow completion times while enabling precise allocation of the share of the available bandwidth between the connections according to the needs of the applications.


Share


Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in