• Article
  • | |
  • Metrics
  • |
  • Reference [13]
  • |
  • Related [20]
  • |
  • Cited by [2]
  • | |
  • Comments
    Abstract:

    According to the requirement of network massive storage applications, this paper puts forward a P2P based objects distribution and location model, supporting the logic network dynamically composed by a large number of voluntary nodes. The model is discussed in detail as follows: global mapping relation, routing table, object locating and routing algorithm, object indices distribution scheme, and maintenance algorithm when nodes join and leave the network. In particular, a novel scheme for distributing objects indices is provided to improve the average success rate of objects access, and each part of the model is improved. Through analysis, the model fulfills the five objectives given in the introduction. Finally, a simulation program built on this model verifies the expected abilities for balancing the load distribution and improving the objects access efficiency.

    Reference
    [1]Plaxton CG, Rajaraman R, Richa AW. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 1999,32(3):241-280.
    [2]Hildrum K, Kubiatowicz JD, Rao S, Zhao BY. Distributed object locationin in a dynamic network. Theory of Computing Systems,2004,37:405-440.
    [3]Rowstron A, Druschel P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc.of the 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms (Middleware). 2001. 329-350.
    [4]Rhea S, Geels D, Roscoe T, Kubiatowicz J. Handling churn in a DHT. In: Proc. of the USENIX Annual Technical Conf. 2004.127-140.
    [5]Albert R, Barabasi AL. Statistical mechanics of complex networks. Review of Modern Physics, 2002,74(1):47-97.
    [6]Iamnitchi A, Ripeanu M, Foster I. Locating data in (Small-World?) peer-to-peer scientific collaborations. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. Cambridge: Springer-Verlag, 2002. 232-241.
    [7]Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Intemet applications. In: Proc. of the ACM SIGCOMM 2001. San Diego, 2001. 149-160.
    [8]Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proc. of the ACM SIGCOMM2001. San Diego, 2001. 161-172.
    [9]Rhea S, Eaton P, Geels D, Weatherspoon H, Zhao B, Kubiatowicz J. Pond: the OceanStore prototype. In: Proc. of the 2nd USENIX Conf. on File and Storage Technologies (FAST 2003). San Francisco, 2003.
    [10]Rowstron A, Druschel P. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proc.of the 18th ACM SOSP. Chateau Lake Louise: ACM, 2001. 188-201.
    [11]Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I. Wide-Area cooperative storage with CFS. In: Proc. of the 18th ACM SOSP2001. Chateau Lake Louise: ACM, 2001. 202-215.
    [12]Hah H. Studies on Internet oriented distributed massive file storage system [Ph.D. Thesis]. Beijing: Department of Computer Science and Technology, Peking University, 2002 (in Chinese with English abstract).
    [13]韩华.面向Internet的分布式海量文件存储系统研究[博士学位论文].北京:北京大学计算机科学技术系,2002.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

綦宏伟,代亚非,李晓明.针对访问成功率的P2P动态网络对象定位模型.软件学报,2005,16(5):894-902

Copy
Share
Article Metrics
  • Abstract:3837
  • PDF: 5362
  • HTML: 0
  • Cited by: 0
History
  • Received:March 06,2004
  • Revised:November 03,2004
You are the first2038652Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063