Computer Science ›› 2018, Vol. 45 ›› Issue (4): 122-125.doi: 10.11896/j.issn.1002-137X.2018.04.019

Previous Articles     Next Articles

Path Optimization Scheme for Restraining Degree of Disorder in CMT

WANG Zhen-chao, HOU Huan-huan and LIAN Rui   

  • Online:2018-04-15 Published:2018-05-11

Abstract: In order to lighten the disorder degree at the receiving side in concurrent multipath transfer(CMT),a new path optimization scheme was proposed in this paper based on MPTCP protocol.In this scheme,a geometric path evaluation model is established based on path delay,packet loss rate and bandwidth in three-dimensional cartesian coordinate system(3D).In oder to select a set of active paths with large bandwidth,small packet loss rate and small delay-difference from the geometric path evaluation model according to the required number of paths,the dichotomy is combined with the improved density-based clustering analysis method.Simulation results demonstrate that the proposed scheme can reduce the disorder length and the number of retransmission packets,and can improve the throughput and packet transmission rate.

Key words: Heterogeneous network,CMT,Disorder,Dichotomy,Clustering analysis

[1] AGAPI M,FERRAN A,LUIS A,et al.Energy efficient user association in congnitive heterogeneous network [J].IEEE Communication Magazine,2014,52(7):22-29.
[2] WANG J,LIAO J X,LI T H.OSIA:Out-of-or-der Scheduling for In-order Arriving in concurrent multipath transfer [J].Journal of Network and Computer Application,2012,35(2):633-643.
[3] ZHAN X Y.A research on multipath communication in heterogeneous network[D].Beijing:Beijing University of Posts and Telecommunications,2013.(in Chinese) 战鑫洋.异构网络环境中的多路径通信研究[D].北京:北京邮电大学,2013.
[4] WANG J Y.Game-theoretic model of asymmetrical multipath selection in pervasive computing environment [J].Pervasive and Mobile Computing,2016,7(C):37-57.
[5] SHAILENDRA S,BHATTACHARJEE R,BOSE S K.A multipath variant of SCTP with optimized flow division extension [J].Computer Communications,2015,7:56-65.
[6] FORD A,RAICIU C,HANDLEY M,et al.ArchitecturalGuidelines for Multipath TCP Development [R].IETF:International,2011:1-28.
[7] NAKASAN C,ICHIKAWA K,UTHAYOPAS P.Performance Evaluation of MPTCP over Open Flow Network [J].IPSJ SIG Notes,2014,4(30):1-6.
[8] OH B H,LEE J Y.Constraint-based proactive scheduling forMPTCP in wireless networks [J].Computer Network,2015,91(14):548-563.
[9] LIU P.The Research of Path Management Based on MPTCP[D].Chongqing:Chongqing University of Posts and Telecommunications,2013.(in Chinese) 刘鹏.基于MPTCP的路径管理研究[D].重庆:重庆邮电大学.2013.
[10] DU W F,WU Z.Data Distribution Algorithm with Out-of-order Feedback for CMT over Diversity Network[J].Computer Scien-ce,2015,2(3):60-64.(in Chinese) 杜文峰,吴真.基于乱序反馈的差异化多路径并发传输模型数据分配算法[J].计算机科学,2015,42(3):60-64.
[11] LI X M.The Design and Implementation of an OptimizedMPTCP Data Scheduling Algorithm [J].Applied Mechanics and Materials,2014,9-520:170-176.
[12] SHENG H,ZHANG G Z.A clustering method combining K-means and fast search algorithm of density peaks[J].Computer Application and Software,2016,3(10):260-264.(in Chinese) 盛华,张桂柱.一种融合K-means和快速密度峰值搜索算法的聚类方法[J].计算机应用于软件,2016,3(10):260-264.
[13] XIE J Y,GAO H C,XIE W X.A fast search clustering algo-rithm with peak density based on K-neighborhood optimization[J].Scientia Sinica Informations,2016,6(2):258-280.(in Chinese) 谢娟英,高红超,谢淮信.K邻域优化的密度峰值快速搜索聚类算法[J].中国科学:信息科学,2016,6(2):258-280.
[14] WANG J Y,LIAO J,LI I,et al.Correlation-aware multipath selection to enhance path diversity in ubiquitous computing environment [J].International Journal of Ad Hoc and Ubiquitous Computing,2012,11(4):246-257.
[15] CHEN S,YUAN Z,MUNTEAN G M.An Energyaware Multi-path TCP-based Content Delivery Scheme in Heterogeneous Wireless Networks [C]∥Proceedings of 2013 IEEE Wireless Communications and Networking Conference(WCNC).Shanghai,China,2013:1291-1296.
[16] MPTCP implementation for NS-3.
[17] RFC4737.Packet Reordering Metrice[S].2006.

No related articles found!
Full text



[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .