CAJ | 학술논문

　　针对数据中心链路上存在时间窗不重叠的空闲带宽的情况，提出了利用该带宽分发容迟数据的基本思路,进而设计了一种分布式可扩展的空闲带宽感知的节点选择算法LBAPS，该算法避免了集中优化，适合目标节点较多的情况。为了匹配最优的带宽空闲节点，LBAPS按综合度量进行节点选择；为了优先把文件块上传到空闲带宽大的节点以及尽早把不同的块分布到更多节点，LBAPS按阈值预留资源以及按时间片退出上传。基于LBAPS实现了内容云原型系统P2PStitcher。PlanetLab上的实验表明，LBAPS算法所提出的策略可以有效地减少平均分发时间。
　　침대수거중심련로상존재시간창불중첩적공한대관적정황，제출료이용해대관분발용지수거적기본사로,진이설계료일충분포식가확전적공한대관감지적절점선택산법LBAPS，해산법피면료집중우화，괄합목표절점교다적정황。위료필배최우적대관공한절점，LBAPS안종합도량진행절점선택；위료우선파문건괴상전도공한대관대적절점이급진조파불동적괴분포도경다절점，LBAPS안역치예류자원이급안시간편퇴출상전。기우LBAPS실현료내용운원형계통P2PStitcher。PlanetLab상적실험표명，LBAPS산법소제출적책략가이유효지감소평균분발시간。
Due to the fact that leftover bandwidth appears during non-overlapping time intervals, an approach of using such bandwidth to distribute delay tolerant data was proposed, and then a distributs and scalable leftover band-width-aware peer selection algorithm named LBAPS was designed. LBAPS avoids centralized optimization method that fails to effectively utilize leftover bandwidth when multiple destinations occur. In LBAPS, a node selection strategy based on synthetical evaluation was presented in order to find appropriate nodes with leftover bandwidth currently. In addition, two other strategies, i.e., resource reservation based on threshold and exiting upload upon the length of time slice, were put forward. With these two strategies, nodes with more leftover bandwidth get higher priority to obtain file blocks; be-sides, different file blocks can be delivered to different nodes as soon as possible. On the basis of LBAPS, a content cloud prototype, P2PStitcher was implemented. Experimental results on PlanetlLab show that the strategies proposed in LBAPS are effective to decrease the average delivery time.