一种适用于无线网络的基于速率的端到端拥塞控制算法
收稿日期: 2009-05-20
网络出版日期: 2010-12-21
基金资助
上海市重点学科建设资助项目(S30108);上海市科委重点实验室资助项目(08DZ2231100);上海市教委创新基金资助项目(09YZ33);上海市科委重点资助项目(08220510900)
Rate-Based End-to-End Congestion Control in Wireless Networks
Received date: 2009-05-20
Online published: 2010-12-21
高丢包率和有限带宽是无线传输系统的主要特点,同时也是决定无线多媒体网络设计成败的关键因素.提出一种适用于无线网络的可扩展拥塞控制算法(scalable congestion control algorithm for wireless networks,SCCW),该算法可以在无线网络中使用多个业务流,且在拥塞丢包和随机丢包共存的情况下,具有很好的可扩展性.仿真结果表明,该算法比非可扩展性拥塞控制算法,如加法增加乘法减少(additive increase multiplicative decrease,AIMD)、平方根计算(square root calculations,SQRT)、倒数增减加性减小(inverse increase additive decrease, IIAD)等,具有更低的数据丢包率.
金彦亮 杨宇航 张珠明 王晖 . 一种适用于无线网络的基于速率的端到端拥塞控制算法[J]. 上海大学学报(自然科学版), 2010 , 16(6) : 597 -602 . DOI: 1007-2861.2010.06.009
High packet loss rate and limited bandwidth are two features that present the biggest challenges in successful design of multimedia wireless networks. A scalable congestion control algorithm for wireless networks (SCCW) is proposed in this paper. The technique has excellent scalability when a large number of flows are used, and when random and congestion losses coexist in a wireless network. Simulation results show that SCCW has better performance than additive increase multiplicative decrease (AIMD) algorithm, square root calculations (SQRT) algorithm, and inverse increase additive decrease (IIAD) algorithm.
/
| 〈 |
|
〉 |