检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河北大学电子信息工程学院,保定071002 [2]河北省数字医疗工程重点实验室,保定071002
出 处:《计算机科学》2016年第6期97-101,共5页Computer Science
基 金:河北省自然基金资助项目(F2014201168);保定市科学技术研究与发展指导计划项目(14ZG036)资助
摘 要:提出了一种基于MPTCP的协作拥塞控制方案。在拥塞避免阶段,该方案首次以马尔科夫链模型为基础,对异构网络中各条路径上未被确认的数据包个数进行预测,进而计算出各条路径所能承载的最大数据量。若网络拥塞窗口值大于各条路径所能承载的最大数据量中最小值的2倍,则启动协作拥塞控制机制。在协作拥塞控制机制下,根据AIMD算法的加性增加准则调整拥塞窗口,若网络拥塞窗口值大于各条路径所能承载数据量之和,则结束协作拥塞控制机制,执行传统的TCP慢启动算法。为了提高慢启动阶段的带宽利用率,对TCPW(TCP Westwood)带宽估计算法进行改进,使路径可用带宽的估计更准确,从而提高慢启动阈值设置的合理性。仿真结果表明,在保证异构网络负载均衡及单条TCP流公平性的前提下,该方案能够增加成功传输数据包的数量。A cooperative congestion control scheme based on MPTCP was proposed. At the stage of avoiding congestion, the unconfirmed data packets transferred in each route in heterogeneous network are predicted based on the Markov Model,and then the sender calculates the maximum amount of data that each route can carry. If the network con- gestion window is more than two times higher than the minimum of the maximum amount of data that every path can carry, the mechanism of cooperative congestion control will be started. Under the cooperative congestion control mechanism, the network congestion window should be adjusted according to the norm of additive increase of AIMD algorithm. If the sum of the carrying capacity of each path is less than the network congestion window,the cooperative congestion control mechanism should be ended, and then traditional slow start of TCP algorithm is implemented. To enhance broad- band utilization at the slow start stage, this paper modified the broadband estimation algorithm of TCPW(TCP West-wood) to make the estimation of available broadband in each path more accurate and improve the reasonability of slow start threshold setting. Simulation results demonstrate that the proposed scheme can increase the number of successful transmission data packets while guaranteeing the load balance and fairness between single TCP flow and MPTCP flow.
关 键 词:协作拥塞控制 多径并行数据传输 异构网络 马尔可夫模型 TCPW带宽估测算法
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200