加入收藏
协同高校
浙江大学 清华大学 上海交通大学

Fast file dissemination in peer-to-peer networks with upstream bandwidth constraint

编辑:admin日期:2012-12-20 访问次数:816

 
Fast file dissemination in peer-to-peer networks with upstream bandwidth constraint
来源:FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING-THEORY METHODS AND APPLICATIONS  : 26   : 7   : 986-1002 2010
如何最小化大文件从一个源点传播到大量用户的时间是对等网应用中的一个基本问题。该文分析如何通过有效利用节点的上行带宽来降低传播时间。在给出传播时间紧下界和充分利用节点上行带宽的等价且有效条件基础上,提出了快速传播算法“Receiver-schedule”。仿真结果表明,在具有上行带宽约束的网络环境中,许多情况下该算法的传播时间最多高于传播时间下界4个百分点。
How to minimize the time of disseminating a large file from a single source to a large number of users is a fundamental question in peer-to-peer applications. In this paper, we analyze how to decrease the dissemination time by efficiently utilizing the upstream bandwidths of nodes. Based on a tight lower bound on the dissemination time and an equivalent condition along with a sufficient condition for fully utilizing the upstream bandwidths of nodes, an algorithm called Receiver-schedule for fast dissemination is proposed. The simulation results show that, by using the algorithm the dissemination time is more than the lower bound by at most four percent in many cases in the networks with the upstream bandwidth constraint.