Tunghai University Institutional Repository:Item 310901/21494
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 21921/27947 (78%)
Visitors : 4250797      Online Users : 398
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://140.128.103.80:8080/handle/310901/21494


    Title: Regenerating code based P2P storage scheme with caching
    Authors: Chen, Y.-L., Li, G.-M., Tsai, C.-T., Yuan, S.-M., Chiao, H.-T.
    Contributors: Department of Computer Science, Tunghai University
    Keywords: Erasure coding;LRU cache;p2p;Regenerating code;Simulation
    Date: 2009-11-24
    Issue Date: 2013-05-14T09:07:33Z (UTC)
    Publisher: ; Kuala Lumpur; Malaysia
    Abstract: High data availability is an important feature of P2P storage system. Erasure coding is a common method employed to support the property. But the technique requires an original file to produce redundant data. On the contrary Regenerating Code, without maintaining the original file, solves the problem through collecting encoded information in a distributed way. However, there is a drawback in this method; that is, encoding needs more peers to get involved in order to obtain good information, which is a harsh condition in a P2P environment due to the requirement of keeping more peers alive simultaneously to hold the file blocks. On the condition that the system did not need to store a replica, we recorded the information of peers which have accessed files recently and utilized the data which have been accessed last in the LRU cache of the peer to improve the access performance and reduce the encoding cost. Through simulation, we experimented with different cache sizes under various peer availability. The results showed that our scheme can successfully improve at least 83 percent of the access performance and lower the cost of Regenerating Code when a file is divided into 7 blocks and the cache size is 64 file blocks. ? 2009 IEEE.
    Relation: ICCIT 2009 - 4th International Conference on Computer Sciences and Convergence Information Technology , art. no. 5368781 , pp. 927-932
    Appears in Collections:[Department of Computer Science and Information ] Conference Papers

    Files in This Item:

    File SizeFormat
    index.html0KbHTML184View/Open


    All items in THUIR are protected by copyright, with all rights reserved.


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback