检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Computer Science and Technology,Huazhong University of Science and Technology
出 处:《Journal of Southwest Jiaotong University(English Edition)》2009年第3期177-184,共8页西南交通大学学报(英文版)
基 金:The National Natural Science Foundationof China (Nos.60403027, 60773191,and 60873225) ;the National High Technology Research and Development Program of China (863 Program) (No.2007AA01Z403)
摘 要:In order to reduce the traffic load and improve the availability of the shared resources in unstructured P2P networks, a caching scheme combining alternative index and adaptive replication (AIAR) is presented. AIAR uses random walk mechanism to disperse the caching information of resources in the network based on its power-law characteristic, and dynamically adjusts replicas according to the visit frequency on resources and the degree information of peers. Subsequent experimental results show that the proposed AIAR scheme is beneficial to improve the search performance of success rate and respond speed. In addition, compared to some existing caching scheme, AIAR can perform much better in success rate, especially in a dynamic environment.In order to reduce the traffic load and improve the availability of the shared resources in unstructured P2P networks, a caching scheme combining alternative index and adaptive replication (AIAR) is presented. AIAR uses random walk mechanism to disperse the caching information of resources in the network based on its power-law characteristic, and dynamically adjusts replicas according to the visit frequency on resources and the degree information of peers. Subsequent experimental results show that the proposed AIAR scheme is beneficial to improve the search performance of success rate and respond speed. In addition, compared to some existing caching scheme, AIAR can perform much better in success rate, especially in a dynamic environment.
关 键 词:P2P (peer-to-peer) Caching scheme REPLICATION Random walk Power law
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7