Delay-based congestion control: Flow vs. BitTorrent swarm perspectives

被引:4
|
作者
Testa, Claudio [1 ]
Rossi, Dario [1 ]
机构
[1] Telecom ParisTech, F-75013 Paris, France
关键词
Bit Torrent; Congestion control; Lower-than best effort congestion control; LEDBAT; TCP-LP; NICE;
D O I
10.1016/j.bjp.2013.12.018
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
BitTorrent, one of the most widespread file-sharing P2P applications, recently introduced LEDBAT, a novel congestion control protocol aiming at (i) limiting the additional delay due to queuing, to reduce interference with the rest of user traffic (e.g., Web, VoIP and gaming) sharing the same access bottleneck, and (ii) efficiently using the available link capacity, to provide users with good BitTorrent performance at the same time. In this work, we adopt two complementary perspectives: namely, a flow viewpoint to assess the Quality of Service (QoS) as in classic congestion control studies, and a BitTorrent swarm viewpoint to assess peer-to-peer users Quality of Experience (QoE). We additionally point out that congestion control literature is rich of protocols, such as VEGAS, LP, and NICE sharing similarities with LEDBAT, that is therefore mandatory to consider in the analysis. Hence, adopting the above viewpoints we both (i) contrast LEDBAT to the other protocols and (ii) provide deep understanding of the novel protocol and its implication on QoS and QoE. Our simulation based investigation yields several insights. At flow-level, we gather LEDBAT to be lowest priority among all protocols, which follows from its design that strives to explicitly bound the queuing delay at the bottleneck link to a maximum target value. At the same time, we see that this very same protocol parameter can be exploited by adversaries, that can set a higher target to gain an unfair advantage over competitors. Interestingly, swarm-level performance exhibit an opposite trade-off, with smaller targets being more advantageous for QoE of BitTorrent users. This can be explained with the fact that larger delay targets slow down BitTorrent signaling task, with possibly negative effect on the swarming protocol efficiency. Additionally, we see that for the above reason, in heterogeneous swarms, any delay-based protocol (i.e., not only LEDBAT but also VEGAS or NICE) can yield a competitive QoE advantage over loss-based TCP. Overall this tension between swarm and flow-levels suggests that, at least in current ADSL/cable access bottleneck scenarios, a safe LEDBAT operational point may be used in practice. At the same time, our results also point out that benefits similar to LEDBAT can also be gathered with other delay-based protocols such as VEGAS or NICE. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:115 / 128
页数:14
相关论文
共 50 条
  • [21] Achieving fair network equilibria with delay-based congestion control algorithms
    Rodriguez-Perez, Miguel
    Herreria-Alonso, Sergio
    Fernandez-Veiga, Manuel
    Suarez-Gonzalez, Andres
    Lopez-Garcia, Candido
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (07) : 535 - 537
  • [22] A Strategy for Fair Coexistence of Loss and Delay-Based Congestion Control Algorithms
    Budzisz, Lukasz
    Stanojevic, Rade
    Shorten, Robert
    Baker, Fred
    IEEE COMMUNICATIONS LETTERS, 2009, 13 (07) : 555 - 557
  • [23] Rate-based vs Delay-based Control for DVFS in NoC
    Casu, Mario R.
    Giaccone, Paolo
    2015 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2015, : 1096 - 1101
  • [24] Adaptive time window improving convergence of practical delay-based congestion control
    Ishikura, Shotaro
    Yamamoto, Miki
    IEICE COMMUNICATIONS EXPRESS, 2021, 10 (08): : 533 - 537
  • [25] A Delay-Based Congestion-Control Protocol for Information-Centric Networks
    Albalawi, Abdulazaz Ali
    Garcia-Luna-Aceves, J. J.
    2019 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2019, : 809 - 815
  • [26] The case for model-driven interpretability of delay-based congestion control protocols
    Khan, Muhammad
    Zaki, Yasir
    Iyer, Shiva
    Ahamd, Talal
    Poetsch, Thomas
    Chen, Jay
    Sivaraman, Anirudh
    Subramanian, Lakshmi
    Computer Communication Review, 2021, 51 (01): : 19 - 25
  • [27] The Case for Model-Driven Interpretability of Delay-based Congestion Control Protocols
    Khan, Muhammad
    Zaki, Yasir
    Iyer, Shiva
    Ahamd, Talal
    Poetsch, Thomas
    Chen, Jay
    Sivaraman, Anirudh
    Subramanian, Lakshmi
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2021, 51 (01) : 19 - 25
  • [28] Copa plus : Analysis and Improvement of the Delay-based Congestion Control Algorithm Copa
    Jiang, Wanchun
    Li, Haoyang
    Liu, Zheyuan
    Wu, Jia
    Huang, Jiawei
    Shan, Danfeng
    Wang, Jianxin
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 920 - 929
  • [29] Delay-Based End-to-End Congestion Control for Wireless Sensor Networks
    Montes, Isabel
    Tiglao, Nestor
    Ocampo, Roel
    Festin, Cedric
    2015 SEVENTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS, 2015, : 497 - 502
  • [30] Timer-Based Increase and Delay-Based Decrease Algorithm for RDMA Congestion Control
    Noguchi, Masahiro
    Sugahara, Daisuke
    Yamamoto, Miki
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2022, E105B (04) : 421 - 431