摘要
BI-TCP(二元增加TCP)由两部分组成:二元搜索增加和加法增加。如果最大窗口已知,可实施二元搜索来确定目标窗口大小。当前最小值与中值之间的距离大于设定的最大步长时,按最大阈值增大窗口,将二元搜索增加和加法增加策略结合起来。本文在此基础上,用比例乘性增加与二元搜索增加结合,并通过比较得出结论,用比例乘性增加替代加法增加使得该协议减少了增大窗口需要的时间,加快了窗口探测的速度,在搜索TCP窗口大小上提高了效率。
BI-TCP consists of two parts： binary search increase and additive increase. Binary increase is the combination of binary search increase and additive increase. If the maximum window size is known, it can apply a binary search algorithm to set the target window size. When the distance to the midpoint from the current minimum is too large, even larger than a prescribed maximum step, it increases the window size by a maximum increment. This paper is based BI-TCP which substitutes proportional multiplicative increase for additive increase. The proportional multiplicative increase combines with binary search increase which makes the protocol more efficient in searching window size.
出处
《微计算机信息》
北大核心
2006年第05X期194-196,共3页
Control & Automation
基金
国家自然科学基金(60343010)
