Table of Content

Open Access iconOpen Access

ARTICLE

A MPTCP Scheduler for Web Transfer

Wenjun Yang1, Pingping Dong1,2,*, Wensheng Tang1, Xiaoping Lou1, Hangjun Zhou3, Kai Gao4, Haodong Wang5

College of Information Science and Engineering, Hunan Normal University, Changsha, 410081, Hunan, China.
University of Science and Technology of China, Hefei, 230026, Anhui, China.
Hunan University of Finance and Economy, Changsha, 410205, Hunan, China.
Changsha University of Science & Technology, Changsha, 410114, Hunan, China.
Department of Electrical Engineering and Computer Science, Cleveland State University, Cleveland, OH 44115, USA.

* Corresponding Author: Pingping Dong. Email: email.

Computers, Materials & Continua 2018, 57(2), 205-222. https://doi.org/10.32604/cmc.2018.03726

Abstract

Multipath TCP (MPTCP) is the most significant extension of TCP that enables transmission via multiple paths concurrently to improve the resource usage and throughput of long flows. However, due to the concurrent multiple transfer (CMT) in short flow trans-mission, the congestion window (cwnd) of each MPTCP subflow is too small and it may lead to timeout when a single lost packet cannot be recovered through fast retransmission. As a result, MPTCP has even worse performance for short flows compared to regular TCP. In this paper, we take the first step to analyze the main reason why MPTCP has the diminished performance for short flows, and then we propose MPTCP-SF, which dynamically adjusts the number of subflows for each flow . In particular, MPTCP-SF firstly analyzes the distribution characteristics of the web objects to extract two thresholds to be used for classifying each flow. After eceiving each new ACK, MPTCP-SF periodically counts the data being sent based on per-flow and uses the threshold to classify the we blows. Finally, MPTCP-SF dynamically switches path scheduling model for different classification flows. We conduct extensive experiments in NS3 to evaluate its e fficiency. Our evaluation proves that MPTCP-SF decreases the completion time of short flows by over 42.64% com-pared to MPTCP, and the throughput achieved by MPTCP-SF in transmitting long flows is about 11.11% higher than that of MPTCP in a WLAN/LTE wireless network. The results successfully validate the improved performance of MPTCP-SF.

Keywords


Cite This Article

APA Style
Yang, W., Dong, P., Tang, W., Lou, X., Zhou, H. et al. (2018). A MPTCP scheduler for web transfer. Computers, Materials & Continua, 57(2), 205-222. https://doi.org/10.32604/cmc.2018.03726
Vancouver Style
Yang W, Dong P, Tang W, Lou X, Zhou H, Gao K, et al. A MPTCP scheduler for web transfer. Comput Mater Contin. 2018;57(2):205-222 https://doi.org/10.32604/cmc.2018.03726
IEEE Style
W. Yang et al., "A MPTCP Scheduler for Web Transfer," Comput. Mater. Contin., vol. 57, no. 2, pp. 205-222. 2018. https://doi.org/10.32604/cmc.2018.03726

Citations




cc Copyright © 2018 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 4026

    View

  • 1772

    Download

  • 0

    Like

Related articles

Share Link