公开(公告)号：US20090257365A1

公开(公告)日：2009-10-15

申请号：US12420899

申请日：2009-04-09

申请人： Tae In HWANG ,  Ho Jin PARK ,  Chunglae CHO ,  Ye XIA ,  Xiaoying ZHENG

发明人： Tae In HWANG ,  Ho Jin PARK ,  Chunglae CHO ,  Ye XIA ,  Xiaoying ZHENG

IPC分类号： H04L12/28

CPC分类号： H04L45/00 ,  H04L45/48 ,  H04L67/06 ,  H04L67/104 ,  H04L67/1085

摘要： The present invention discloses a method of distributing files over a network, which can attain a proper balance of transfer rates of active spanning trees used between a transmitting node and a receiving node and minimize the time taken for transferring a large file in a P2P (Peer-to-Peer) environment by forming an optimal set of distribution trees with reference to the link costs between the transmitting node and the receiving node and distributing chunk files through the optimal set of distribution trees. The method comprises the steps of: forming a set of spanning trees between a transmitting node and a receiving node and forming a minimum cost tree group by the sum of the link costs of links constituting each of the spanning trees; adjusting the transfer rate of each spanning tree belonging to the minimum cost tree group in accordance with the link cost of each spanning tree belonging to the minimum cost tree group; and transferring chunk files through the spanning trees whose transfer rate is adjusted.

摘要翻译： 本发明公开了一种通过网络分发文件的方法，可以实现在发送节点和接收节点之间使用的活动生成树的传输速率的适当平衡，并最大限度地减少在P2P中传送大文件所花费的时间（对等体 对等）环境，通过参照发送节点和接收节点之间的链路成本形成最佳分布树集合，并通过最优分布树集分发块文件。 该方法包括以下步骤：在发送节点和接收节点之间形成一组生成树，并通过构成每个生成树的链路的链路成本的总和形成最小成本树组; 根据属于最低成本树组的每个生成树的链路成本调整属于最小成本树组的每个生成树的传输速率; 并通过调整传输速率的生成树传输块文件。