用于不可靠单播流的拥塞控制算法  

Congestion control algorithm for unreliable unicast traffic

作　　者：宋丽华[1] 陈鸣[1] 王海涛[2] 熊焕[1] 

机构地区：[1]解放军理工大学指挥自动化学院,江苏南京210007 [2]解放军理工大学通信工程学院,江苏南京210007

出　　处：《通信学报》2008年第2期37-44,共8页Journal on Communications

基　　金：国家自然科学基金重大研究计划项目(90304016)~~

摘　　要：为在兼顾公平性的同时改善高速网络环境中的性能,提出了一种基于速率的不可靠单播流拥塞控制算法RAUU(rate adaptation for unreliable unicast traffic)。该算法以保存一定数量的冗余分组为控制目标,根据实际与期望冗余分组数量的差值按比例调节发送速率,控制中综合考虑了时延和丢包,并为避免速率控制的固有缺点作了针对性的设计。理论分析表明,在理想网络条件下RAUU存在并将收敛于惟一的平衡点;仿真实验显示一方面RAUU的性能与FAST相似,其吞吐率平滑性接近TFRC(TCP-friendly rate control),另一方面RAUU算法对TCP流量相对公平。To improve performance in high bandwidth networks when trying to retain fairness, a rate-based congestion control algorithm was proposed for unreliable unicast traffic. Named rate adaptation for unreliable unicast traffic （RAUU）, this algorithm aims to preserve appropriate amount of extra packets in networks and to that end it regulates the sending rate in proportion to the difference between actual and expected extra packet quantities. It combines loss and delay signals, and made several special design choices to avoid rate control＇s inherent weakness. Theoretical analysis shows that in ideal network conditions, RAUU has and will converge to its one and only equilibrium point. Simulation experiments indicate that RAUU can achieve similar performance as FAST and smooth throughput as TFRC while holding reasonable fairness to TCP.

关 键 词：计算机网络 拥塞控制 基于速率 不可靠单播流 冗余分组 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]