区间微调分支界定混合P2P云存储喷泉编码优化  

Hybrid P2P storage and cloud storage fountain coding optimization based on branch definition of interval point micro adjustment

作　　者：安进[1] 季一木[2] An Jin;Ji Yimu(Dept.of Information Engineering,Jiangsu Food&Pharmaceutical Science College,Huai’an Jiangsu 223003,China;College of Computer Science&Technology,Nanjing University of Posts&Telecommunications,Nanjing 210023,China)

机构地区：[1]江苏食品药品职业技术学院信息工程系,江苏淮安223003 [2]南京邮电大学计算机学院,南京210023

出　　处：《计算机应用研究》2018年第1期232-236,共5页Application Research of Computers

基　　金：江苏省政策引导类计划(产学研合作)项目(BY2015054-02)

摘　　要：针对传统对等存储系统中存在数据上载时间长、带宽控制不理想的问题,提出动态步长分支界定P2P存储及云存储混合喷泉编码优化算法。根据P2P存储及云存储各自的特点,构建混合式P2P存储及云存储网络系统,该系统通过喷泉编码、参数控制单元、节点管理器及上传调度程序构建;针对存储编码符号上传过程中,存在参数控制不理想、数据传输效果差的问题,在分支界定算法基础上设计区间点微调的动态分支界定算法,实现计算复杂度降低,并可有效对上载时间长和网络带宽显著下降的问题进行处理。利用对比仿真显示,算法在数据上载时间及数据冗余度降低等指标上优于对比算法,验证了算法的有效性。In the traditional cloud storage system,the data upload time is long and the bandwidth control is also not ideal.Therefore,this paper proposed a P2P storage and cloud fountain coding optimization algorithm based on dynamic step size to solve the above problems.First,it designed a hybrid peer-to-peer network cloud storage system,which constructed by the fountain code,the parameter control unit,the node manager and the upload scheduling program.Secondly,according to the problem of non-ideal in parameter control,and poor effect of data transmission,based on the branch defined algorithm,it designed the dynamic step branch bound algorithm,which could reduce the computational complexity,and could effective deal with the problem of long time uploading and network bandwidth decreased.Finally,the algorithm is better than the contrast algorithm in the data uploading time and data redundancy by simulation,which verifies the effective of the proposed algorithm.

关 键 词：动态步长 喷泉编码 分支界定 对等网络 云存储 

分 类 号：TP393.06[自动化与计算机技术—计算机应用技术]