提出自适应带宽分配策略((Flexible Bandwidth Allocation for Big Data Transfer,FBA-BDT)。FBA-BDT给传输大数据的请求提供动态带宽分配,在满足数据有效期的条件下,最大化数据传输率。首先,构建优化规划目标函数,然后再用启发式算法...提出自适应带宽分配策略((Flexible Bandwidth Allocation for Big Data Transfer,FBA-BDT)。FBA-BDT给传输大数据的请求提供动态带宽分配,在满足数据有效期的条件下,最大化数据传输率。首先,构建优化规划目标函数,然后再用启发式算法求解目标函数,进而优化带宽的分配。实验数据表明,与最小带宽分配相比,提出的FBA-BDT算法的数据传输请求拒绝率下降40%、一天内传输的数据量提高至21 TB。展开更多
In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P stre...In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P streaming system,a peer priority based scheduling algorithm is proposed.The algorithm calculates neighbors' priority based on peers' historical service evaluation as well as how many wanted data that the neighbor has.The data request allocated to each neighbor is adjusted dynamically according to the priority when scheduling.Peers with high priority are preferred to allocate more data request.Experiment shows the algorithm can make full use of neighbors' bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.展开更多
文摘提出自适应带宽分配策略((Flexible Bandwidth Allocation for Big Data Transfer,FBA-BDT)。FBA-BDT给传输大数据的请求提供动态带宽分配,在满足数据有效期的条件下,最大化数据传输率。首先,构建优化规划目标函数,然后再用启发式算法求解目标函数,进而优化带宽的分配。实验数据表明,与最小带宽分配相比,提出的FBA-BDT算法的数据传输请求拒绝率下降40%、一天内传输的数据量提高至21 TB。
基金Supported by the National High Technology Research and Development Program of China(No.2009AA01A339,2008AA01A317)the National Natural Science Foundation of China for Distinguished Young Scholars(No.60903218F0208)the Science and Technology Support Plan of China(No.2008BAH28B04)
文摘In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P streaming system,a peer priority based scheduling algorithm is proposed.The algorithm calculates neighbors' priority based on peers' historical service evaluation as well as how many wanted data that the neighbor has.The data request allocated to each neighbor is adjusted dynamically according to the priority when scheduling.Peers with high priority are preferred to allocate more data request.Experiment shows the algorithm can make full use of neighbors' bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.
