可用带宽的变时隙探测算法研究  

Study on Varible Time-slot Probing Algorithm of Available Bandwidth

作　　者：黄文[1] 文春生[1] 欧红星[1] 

机构地区：[1]湖南科技学院网络中心,湖南永州425100

出　　处：《通信技术》2010年第10期95-97,100,共4页Communications Technology

摘　　要：目前基于自拥塞理论的网络可用带宽主动探测方法,一般都要发送大量的探测包串,在对网络可用带宽进行探测的同时,可能会干扰网络的正常通信。这一方面增加了网络负载,另一方面也增加了算法的复杂性。针对此问题,提出使用幂级数变时隙探测包替代等时隙探测包,期望通过新的探测方法在不失估测精度的前提下,用更少的探测流量获得更快的自拥塞集聚时间,从而提高可用带宽的探测效率。实验表明新的探测算法可以达到比传统算法更好的效率。The probing algorithm for available bandwidth based on the concept of ＂self-induced congestion＂ usually sends large number of probing packet trains,this may disturb the normal communication of the work while probing the available bandwidth of the network,thus increasing the network traffic load and raising the algorithm complexity.Aim at these problems,a scheme with exponential send-slot probing packet in place of send-slot probing packet is proposed.It is expected that,with less probing traffic while maintaining estimation precison,this new probe scheme could quickly obtain the centralized time of self-induced congestions and raise the efficiency in probing the available bandwidth.Simulation results show that the new probe scheme could achieve much higher efficiency than the traditional scheme.

关 键 词：可用带宽 自拥塞 探测方法 均方差 

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