检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东师范大学计算机系
出 处:《计算机研究与发展》2003年第10期1470-1475,共6页Journal of Computer Research and Development
基 金:山东省中青年科学家奖励基金 ( 2 0 0 2 )
摘 要:TCP拥塞控制机制在Internet中的执行有效地避免了拥塞崩溃现象的发生 ,但是慢启动算法作为TCP拥塞控制的重要阶段 ,在Internet的主流应用 (如WWW)中常表现出较差的性能 为此 ,提出一种结合使用历史连接参数和令牌技术的改进算法 ,该算法在建立新连接时通过查找缓存的历史记录初始化拥塞参数 ,使用令牌技术将数据包在第 1个RTT时间内均匀发送 ,并在传输过程的适当时刻将连接的拥塞参数保存在缓存中 仿真实验表明 ,与传统TCP算法及大初始窗口相比较 ,该算法能够显著减少数据 (特别是短连接 )的平均传输时间 。It is well known that the end to end congestion control mechanism embedded in TCP has important contribution to the success of the Internet It ensures the stability of network, and prevents the congestion from collapsing The slow start is a vital phase in TCP congestion control, but its performance is usually not good for the major applications on Internet, such as the World Wide Web In order to solve the problem, an improved algorithm is proposed, which makes use of recent history information to initialize the parameters of new connections, and paces the packets by using the token technique during the first RTT The performance of the algorithm has been tested and evaluated on NS simulator The simulation results demonstrate that the proposed algorithm performs better in average transmitting time than traditional TCP employing the large initial window, especially for short connections, and it could also coexist with TCP flows friendly
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.224.59.3