| 2/2018 - 6 |
An Efficient MPTCP-Based Congestion Control Scheme for HBDP NetworksCHUNG, K.   , OH, J. |
Extra paper information in    |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (1,658 KB) | Citation | Downloads: 1,151 | Views: 3,283 |
Author keywords
data transfer, packet loss, quality of service, TCPIP, transport protocols
References keywords
congestion(17), control(15), multipath(9), networks(6), multi(6), delay(6), path(5), infocom(5), netw(4), high(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2018-05-31
Volume 18, Issue 2, Year 2018, On page(s): 41 - 50
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2018.02006
Web of Science Accession Number: 000434245000006
SCOPUS ID: 85047859931
Abstract
With the widespread distribution of devices with multiple network interfaces, interest in multi-path transmission techniques has increased. The Internet Engineering Task Force (IETF) published Multi-path TCP (MPTCP) as a standard for multi-path transmission techniques and many researchers have studied multipath means of transmitting data efficiently, with each path having different characteristics. However, today's networks have been shown to exhibit high bandwidth-delay product (HBDP) characteristics but MPTCP does not match the requirements of HBDP networks. Many researchers have proposed solutions to overcome this problem, but the solutions have had the drawbacks of ineffective load balancing mechanisms and a trade-off problem between improving throughput and preventing loss events. In this paper, we propose an efficient MPTCP-based congestion control scheme in HBDP networks. Our scheme consists of two main mechanisms. One is to mitigate trade-off problems observed in previous works and the other is to enhance traffic migration according to the conditions of each path. Simulation results have shown that our scheme achieves those goals and enhance performance in HBDP networks. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] R. Stewart, "Stream control transmission protocol," IETF RFC 4960, Sept. 2007.
[2] J. Iyengar, P. D. Amer, and R. Stewart, "Concurrent multipath transfer using SCTP multi-homing over independent end-to-end paths," IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 951-964, Oct. 2006. [CrossRef] [Web of Science Times Cited 383] [SCOPUS Times Cited 574] [3] P. Vo, T. Le, S. Lee, C. Hong, B. Kim, and H. Song, "mReno: A Practical Multipath Congestion Control for Communication Networks," Computing, vol. 96, no. 3, pp. 189-205, Mar. 2014. [CrossRef] [Web of Science Times Cited 11] [SCOPUS Times Cited 11] [4] A. Ford, C. Raiciu, M. Handley, and O. Bonaventure, "TCP extensions for multipath operation with multiple addresses," IETF RFC 6824, Jan. 2013. [5] M. Honda, Y. Nishida, L. Eggert, P. Sarolahti, and H. Tokuda, "Multi-path congestion control for shared bottleneck," Proc. 7th PFLDNet Workshop, 2009. [6] C. Raiciu, M. Handley, and D. Wischik, "Coupled congestion control for multi-path transport protocols," IETF RFC 6356, Oct. 2011. [7] D. Wischik, C. Raiciu, A. Greenhalgh, M. Handley, "Design, implementation and evaluation of congestion control for multi-path TCP," Proc. 8th USENIX NSDI Conf., vol.11, pp.8-22, Mar. 2011. [8] J. Zhao, C. Xu, J. Guan, H. Zhang, "A fluid model of multipath TCP algorithm: Fairness design with congestion balancing," Proc. IEEE Int. Conf. on Commun., London, 2015, pp. 6965-6970. [CrossRef] [SCOPUS Times Cited 20] [9] C. Xu, J. Zhao, G. Muntean, "Congestion Control Design for Multipath Transport Protocols: A Survey," IEEE Commun. Surveys & Tutorials, vol. 18, no. 4, pp. 2948-2969, Apr. 2016. [CrossRef] [Web of Science Times Cited 97] [SCOPUS Times Cited 110] [10] R. Gonzalez, J. Pradilla, M. Esteve, C. E. Palau, "Hybrid delay-based congestion control for multipath TCP," Proc. IEEE Mediterranean Electrotechnical Conf., Limassol, 2016, pp. 1-6. [CrossRef] [SCOPUS Times Cited 7] [11] T. Le, C. Hong, and S. Lee, "Multi-path binomial congestion control algorithms," IEICE Trans. Commun., vol. E95-B, no. 6, pp. 1934-1943, Jun. 2012. [CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 8] [12] T. Le, C. Hong, and S. Lee, "MPCubic: an extended Cubic TCP for multiple paths over high bandwidth-delay networks," Proc. Int. Conf. on ICT Convergence, Seoul, 2011, pp. 34-39. [CrossRef] [SCOPUS Times Cited 11] [13] B. P. Ha, B. Y. Tran, T. A. Le, C. H. Tran, "A hybrid multi-path congestion control algorithm for high speed and/or long delay networks," Proc. 2014 Advanced Tech. Commun., Hanoi, 2014, pp. 452-456. [CrossRef] [SCOPUS Times Cited 5] [14] S. Ferlin, O. Alay, T. Dreibholz, D. A. Hayes , M. Welzl, "Revisiting congestion control for multipath TCP with shared bottleneck detection," Proc. IEEE INFOCOM, San Francisco, 2016, pp. 1-9. [CrossRef] [SCOPUS Times Cited 82] [15] R. Khalili, N. Gast, M. Popovic, U. Upadhyay, J.-Y. Le Boudec, "MPTCP is not pareto-optimal: performance issues and a possible solution," Proc. 8th Int. Conf. on Emerging Netw. Experiments and Technologies, Nice, 2012, pp. 1-12. [CrossRef] [SCOPUS Times Cited 105] [16] Q. Peng, A. Walid, J. Hwang, S. Low, "Multipath TCP: analysis, design, and implementation," IEEE/ACM Trans. Netw., vol. 24, no. 1, pp. 596-609, Feb. 2015. [CrossRef] [SCOPUS Times Cited 105] [17] Y. Cao, M. Xu, X. Fu, "Delay-based congestion control for Multipath TCP," Proc. 20th IEEE Int. Conf. on Network Protocols, Austin, 2012, pp. 1-10. [18] S. Ha, I. Rhee, and L. Xu, "CUBIC: a new TCP-friendly high-speed TCP variant," ACM SIGOPS Operating System Review, vol. 42, no. 5, pp. 64-74, Jul. 2008. [CrossRef] [SCOPUS Times Cited 1535] [19] V. Konda and J. Kaur, "RAPID: shrinking the congestion control timescale," Proc. IEEE INFOCOM, Rio de Janeiro, 2009, pp. 1-9. [CrossRef] [Web of Science Times Cited 20] [SCOPUS Times Cited 40] [20] J. Gettys and K. Nichols, "Bufferbloat: dark buffers in the Internet," Commun. ACM, vol. 55, no. 1, pp. 57-65, Jan. 2012. [CrossRef] [Web of Science Times Cited 170] [SCOPUS Times Cited 207] [21] L. S. Brakmo, S. W. O'Malley, and L. L. Peterson, "TCP Vegas: new techniques for congestion detection and avoidance," Proc. ACM SIGCOMM Symposium, vol. 24, no. 4, pp. 24-35, Oct. 1994. [CrossRef] [SCOPUS Times Cited 1031] [22] H. Jung, S. Kim, and S. Kang, "Adaptive delay-based congestion control for high bandwidth-delay product networks," Proc. IEEE INFOCOM, Shanghai, 2011, pp. 2885-2893. [CrossRef] [SCOPUS Times Cited 21] [23] S. Floyd, M. Handley, and J. Padhye, "A comparison of equalion-based and AIMD congestion control," AT&T Center for Internet Research, 2000. [24] L. Xu, K. Harfoush and I. Rhee, "Binary increase congestion control (BIC) for fast long-distance networks," Proc. IEEE INFOCOM, vol. 4, pp.2514-2524, Mar. 2004. [25] D. Chiu and R. Jain, "Analysis of the increase and decrease algorithms for congestion avoidance in computer networks,"Comput. Netw., ISDN Syst., vol. 17, no. 1, pp. 1-14, Jun. 1989. [CrossRef] [Web of Science Times Cited 984] [SCOPUS Times Cited 1475] Web of Science® Citations for all references: 1,670 TCR SCOPUS® Citations for all references: 5,347 TCR Web of Science® Average Citations per reference: 64 ACR SCOPUS® Average Citations per reference: 206 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2025-01-23 21:53 in 121 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2025
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
