首页 | 官方网站   微博 | 高级检索  
     

一种内容分发网络中的快速复制方案
引用本文:赵进,张福炎.一种内容分发网络中的快速复制方案[J].计算机科学,2006,33(12):114-116.
作者姓名:赵进  张福炎
作者单位:南京大学计算机科学与技术系,南京,210093
摘    要:由于在内容分发网络中.将大文件从一台服务器复制到其他服务器需要耗费大量的时间。本文首先对内容分发网络中的复制问题进行了形式化描述,然后提出了一种分布式的方案NCOM,用于减小复制时间。方案的创新性在于,NCOM在CDN中构建一个Mesh结构,利用多路径传输数据块,提高速率;同时也利用Network Coding技术来避免需要从不同路径调度不同数据块所带来的协调开销。实验结果表明,与现有方案相比,NCOM可以显著减小复制时间。

关 键 词:内容分发网络  复制  Network  coding

Achieving Fast Data Replication in Content Distribution Networks
ZHAO Jin,ZHANG Fu-Yan.Achieving Fast Data Replication in Content Distribution Networks[J].Computer Science,2006,33(12):114-116.
Authors:ZHAO Jin  ZHANG Fu-Yan
Affiliation:Department of Computer Science and Technology. Nanjing University, Nanjing 210093
Abstract:It is time-consuming to replicate large-size files to a large number of edge servers in content distribution network. In this paper, a distributed scheme NCOM is proposed to provide fast data replication. Starting from problem formulation, NCOM is designed to organize the edge servers into an overlay mesh and propagate the packetized data blocks in the mesh. The novelty of this scheme lies in that network coding is introduced to alleviate the block coordination between edge servers during data propagation. NCOM is evaluated by simulations, which shows that the introduction of network coding to content distribution brings significant benefits in reducing replication time.
Keywords:Network coding
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号