QQ客服 官方微博 反馈留言

	ACB-R: An adaptive clustering-based data replication algorithm on a P2P data-store
	Zhang, Junhu ; Yang, Dongqing ; Tang, Shiwei
	2005
英文摘要	Replication on geographically distributed, unreliable, P2P interconnecting nodes can offer high data availability and low network latency for replica access. The challenge is how to take good control of the number of replicas and their distribution over well-chosen nodes to get a good replica access performance. We observe that, there exists such a logical node cluster overlay over any P2P data-store's underlying network topology that the replica transmission delay of inter-cluster is much greater than that of intra-cluster because of geographical distance or bandwidth sharing between nodes in different clusters. Based on nodes-clustering, we propose a decentralized algorithm ACB-R to direct the data replication, which can adapt dynamically to the changing replica access patterns or network topologies. The experiment shows that ACB-R can benefit much of the access requests at the price of negligible intra-cluster replica transmission and consequently achieves a good average replica access performance. ? Springer-Verlag Berlin Heidelberg 2005.; EI; 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/328921]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zhang, Junhu,Yang, Dongqing,Tang, Shiwei. ACB-R: An adaptive clustering-based data replication algorithm on a P2P data-store. 2005-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。