earticle

논문검색

A Dynamic Weight Congestion Control Algorithm to Achieve Fairness in the MPTCP

원문정보

초록

영어

Nowadays, a growing number of mobile equipments have more than one single network interface. For instance, smart phones have 3G/4G and Wi-Fi interfaces at the same time. Regular TCP restricts communications to a single path per transport connection. MPTCP (Multipath TCP) is a set of extensions to traditional TCP to improve the robustness and performance of end-to-end transport layer connections using more than one interface simultaneously. A key issue in the design of MPTCP is the fairness to traditional TCP flows. In this paper, we do a research on the congestion control mechanism of MPTCP and propose a dynamic weighted congestion control algorithm, which can improve the fault of the congestion control algorithm in the RFC 6356 when the subflows have share bottleneck. When the subflow increases the window size, dynamic weight algorithm will increase weight of the congestion window by the size of the congestion window. A MPTCP flow with the dynamic weighted congestion algorithm can allocate their traffic by the throughput of the subflow and get more fairness to traditional TCP flows than the MPTCP in RFC 6356.

목차

Abstract
 1. Introduction
 2. MPTCP Architecture
 3. Problem Definition and Analysis
 4. Dynamic Weight Algorithm
 5. Simulation
 6. Conclusion
 Acknowledgements
 References

저자정보

  • Zun-liang Wang School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China
  • Yue Ma School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China
  • Jin-li Zhang School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.