一種基于RED分組丟棄歷史的帶寬均衡分配算法
A Balanced bandwidth-allocation algorithm based on the packet drop history in red
-
摘要: 針對(duì)目前Internet中的響應(yīng)流和非響應(yīng)流帶寬分配不均衡的問題,該文提出了一種基于RED分組丟棄歷史的算法,該算法可以發(fā)現(xiàn)高速率的數(shù)據(jù)流并對(duì)其到達(dá)分組按概率作優(yōu)先丟棄,以避免這些流對(duì)帶寬的過度占用,多個(gè)仿真實(shí)驗(yàn)從不同的角度驗(yàn)證了該算法的有效性。Abstract: In this paper, an algorithm based on the packet drop history in RED is presented, aimed at solving the problem that the bandwidth is not balancedly allocated to responsive and unresponsive flows in today s Internet. This algorithm is able to detect high sending-rate flows and to drop the arriving packets from them with a calculated probability, hence to prevent the bandwidth from being occupied excessively by these flows. The effect of this algorithm has been proven in different scenarios by simulations.
-
計(jì)量
- 文章訪問數(shù): 2245
- HTML全文瀏覽量: 75
- PDF下載量: 441
- 被引次數(shù): 0
下載:
