结合中间节点的TFRC改进协议  

Improve TFRC mechanism with intermediate node

作　　者：胡忠胜[1] 陈元琰[1] 黄精籼[1] 王娟[1] 

机构地区：[1]广西师范大学计算机科学与信息工程学院,广西桂林541004

出　　处：《计算机工程与设计》2012年第7期2570-2574,共5页Computer Engineering and Design

基　　金：广西研究生教育创新计划基金项目(2010106020821M61)

摘　　要：针对TCP friendly rate control(TFRC)不能正确区分丢包原因,带宽利用率不高,网络状态变化响应迟钝的问题,本文提出了一个TFRC协议的改进算法TFRC BMN。该算法结合中间节点队列长度划分当前网络状态,由网络状态判断区分无线丢包与拥塞丢包,根据不同的丢包原因采取不同速率调节机制。此外该算法还引用积式增加积式减少(MIMD)的思想,当网络进入或退出拥塞状态时进行快速的响应。仿真实验结果表明,改进后的算法在高误码率的无线网络中性能有明显的改善与保持,同时提高了对网络拥塞变化的响应速度。TCP friendly rate control （for short TFRC） can not differentiate the reason of packet losses, has low bandwidth utili- zation rate, and has slow reaction to the state change of network TFRC BMN. The algorithm is presented combineing the queue length of middle node to divided among the current network state, it differentiates the wireless packet losses from the congestion packet losses by the network state, and take different rate adjustment mechanism according to different lost package reason. In addition, because the thought of multiplicative increase multiplicative decrease （for short MIMD） is quoted, the algorithm can fast response when the network into or out of eongestion state. Experiments show that the algorithm＇ s performance are im- proved in wireless network, meanwhile response speed of network congestion is improved.

关 键 词：TCP友好 快速响应 积式增加积式减少 无线网络 队列长度 

分 类 号：TN915.04[电子电信—通信与信息系统]