期刊文献+

P2P存储系统中基于用户体验的可用性模型与应用 被引量:3

User-experience-based availability analysis model and its application in P2P storage systems
原文传递
导出
摘要 保证数据的可用性是Peer-to-Peer(P2P)存储系统最重要的属性之一.可用性分析模型和数据的放置是P2P存储系统设计的两个关键问题.由于用户在P2P存储系统中同时作为服务节点和访问节点,决定了可用性分析必须以用户为中心,从而提高服务质量,并降低系统开销.目前广泛使用的可用性分析模型以及随机放置方法存在以下缺点:1.忽视了节点在线时间的模式,会在不同时间段高估或低估节点的可用性;2.忽视了节点对数据的访问规律,不能准确评估用户体验到的可用性;3.忽视了节点可用性差异,缺乏激励机制.本文提出了一个新的基于用户体验的可用性模型,它能够从用户体验的角度,评价P2P存储系统的可用性,同时它也可以兼容传统的可用性分析模型.在新模型的基础上,本文针对两种典型的P2P存储应用:数据共享和个人备份,提出了相应的分布式数据分发算法.通过真实日志驱动实验证明,新的算法在数据共享应用中能大大降低可用性方差,减少低可用性数据;同时,在个人备份应用中能针对不同用户的贡献提供不同层次的服务,起到有效的激励作用. Data availability is one of the most important properties of peer-to-peer(P2P) storage systems.Availability analysis model and data placement are two key design choices.Users in P2P storage system are both providers and customers.This characteristic determines that the availability analysis must be user-centric,and thereby enhance the quality of service and decrease the system cost.The popular approach in recent studies is simple random placement with steady-state model,which has the following drawbacks:1) It ignores the up/down patterns of nodes,whose availability is over-estimated or under-estimated at di?erent periods of time.2) It ignores the access patterns of users,so the availability perceived by users is hard to evaluate precisely.3) It ignores the huge di?erence of nodes’ availability,thus leading to the absence of incentive.This paper proposes a novel user-experience-based availability model,which evaluates the availability of P2P storage system in terms of user experience,which can degenerate to traditional availability analysis model.Based on the new model,this paper proposes decentralized data placement algorithms for two typical P2P storage applications:"data sharing" and "personal backup".By the trace-driven simulation,we prove that our methods can enhance the availability perceived by users greatly,reduce the variance of the availability dramatically and eliminate the nodes with low availability in data-sharing applications;meanwhile,it can provide different-level service to encourage users according to their contributions.
出处 《中国科学:信息科学》 CSCD 2011年第9期1089-1100,共12页 Scientia Sinica(Informationis)
基金 国家自然科学基金(批准号:60873051 61073015) 国家重点基础研究发展计划(批准号:2011CB302305) MoE-Intel合作研究基金(批准号:MOE-INTEL-09-06)资助项目
关键词 对等网络存储 用户体验 可用性 数据放置算法 P2P storage; user experience; availability; data replacement;
  • 相关文献

参考文献14

  • 1高乾,杨智,田敬,代亚非.一种分层次的差异型P2P存储体系[J].软件学报,2007,18(10):2481-2494. 被引量:3
  • 2http://maze.pku.edu.cn .
  • 3Blake C,Rodrigues R.High availability,scalable storage,dynamic peer networks:pick two. Proceedings of the9thWorkshop on Hot Topics in Operating Systems . 2003
  • 4Lin W K,Ye C,Chiu D M.Decentralized replication algorithms for improving file availability in P2P networks. Quality of Service,15th IEEE International Workshop . 2007
  • 5Kim K.Time-related replication for P2P storage system. Proceedings of the7th International Conference onNetworking . 2008
  • 6Tian J,Yang Z,Dai Y F.A data placement scheme with time-related model for P2P storages. Proceedings of the7th IEEE International Conference on Peer-to-Peer Computing . 2007
  • 7Lian Q,Peng Y,Yang M,et al.Robust incentives via multi-level Tit-for-Tat. Int J Concurr Comp . 2008
  • 8CHUN B G,DABEKF,HAEBERLENA,et al.Efficient replica ma-intenance for distributed storage systems. Proc of the 3rd Sympo-sium on Networked Systems Design and Implementation . 2006
  • 9Bhagwan R,Tati K,Cheng Y,Savage S,Voelker G.Total recall:System support for automated availability management. Proc. of the 1st ACM/Usenix Symp. on Networked Systems Design and Implementation(NSDI 2004) . 2004
  • 10Liu HY.Analysis of resource characteristics and user behavior in P2P file sharing system maze. . 2005

二级参考文献14

  • 1Bhagwan R. Automated availability management in large-scale storage systems [Ph.D. Thesis]. San Diego: University of California, 2004.
  • 2Adya A, Bolosky WJ, Castro M, Cermak G, Chaiken R, Douce:ur JR, Howell J, Lorch JR, Theimer M, Wattenhofer RP. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In: Proc. of the OSDI. 2002. http://www. usenix.org/event s/osdi02/
  • 3Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, Eaton P, Geels D, Gummadi R, Rhea S, Weatherspoon H, Weimer W, Wells C, Zhao B. OceanStore: An architecture for global-scale persistent storage. In: Proc. of the ASPLOS. 2000. http://foothill.lcs.mit. edu/asplos2k/
  • 4The Overnet/eDonkey Web site. 2000. http://www.edonkey2000.com
  • 5The maze Web site. 2002. http://maze.pku.edu.cn
  • 6Tati K, Voelker GM. On object maintenance in peer-to-peer systems. In: Proc. of the Int'l Workshop on Peer-to-Peer Systems. 2006. http://iptps06.c s.ucsb.edu/
  • 7Douceur JR, Wattenhofer RP. Competitive hill-climbing strategies for replica placement in a distributed file system. In: Proc. of the 15th Int'l Symp. on Distributed Computing. 2001. http:llwww.informatik.uni-trier.de/-ley/db/conf/icdcs/
  • 8Schwarz TJE, Qin X, Miller EL. Availability in global peer-to-peer storage systems. In: Proc. of the 6th Workshop on Distributed Data and Structures. 2004. http://lsirwww.epfl.ch/wdas2004/
  • 9Weatherspoon H, Kubiatowicz J. Erasure coding vs. replication: A quantitative comparison. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002. http://www.cs.rice.edu/Conferences/IPTPS02/
  • 10Lin WK, Chiu DM, Lee YB. Erasure code replication revisited. In: Proc. of the 4th Int'l Conf. on Peer-to-Peer Computing. 2004. http://www.informatik.uni-trier.de/-ley/db/conf/p2p/p2p2004.html

共引文献2

同被引文献37

  • 1刘慧,孔凡岳,林之湄.基于动态特征和同类竞争的手机APP推荐算法研究[J].信息与管理研究,2019,0(4):25-32. 被引量:1
  • 2崔立新,何桢.人与技术融合模式对顾客沉浸体验的影响机制[J].信息与管理研究,2019,4(4):1-11. 被引量:2
  • 3罗桂兰,赵海,张文波,赵明,张浩华.论CSMA/CD协议的数学原理[J].自动化学报,2007,33(5):500-505. 被引量:8
  • 4ANDERA P. A Survey on Content-Centric Technologies for the Current Internet: CDN and P2P Solutions[J]. Computer Communications, 2012, 1(1): 1-32.
  • 5KARTHICK R, HANAN L, MARK P. Decentralized Approach to Resource Availability Prediction Using Group Avail ability in a P2P Desktop Grid [J]. Future Generation Computer Systems, 2012, 28(6): 854-860.
  • 6MARCO G, MANUEL U, ISAIAS M Y. Off Line Incentive Mechanism for I.ong-Term P2P Backup Storage [J]. Computer Communications, 2012, 35(12): 1516-1526.
  • 7JOUNG Y J, CHIU T H, CHEN S M. Cooperating with Free Riders in Unstructured P2P Networks[J]. Computer Networks, 2012, 56(6): 1731-1744.
  • 8LI Xiao-yong, ZHOU Feng, YANG Xu dong. A Multi Dimensional Trust Evaluation Model for Large Scale P2P Com- puting [J]. Journal of Parallel and Distributed Computing, 2011, 71(6) : 837-847.
  • 9KIM K. Dynamic NodelD Based Heterogeneity Aware P2P System [J]. Computer Communications, 2009, 32(6): 1062-1071.
  • 10MARC S A, BIAS H. Understanding the Effects of P2P Dynamic on Trust Bootstrapping[J]. Information Sciences, 2013, 236(1): 33-55.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部