Ren Xunyi, Wang Ruchuan, Kong Qiang, Chen Danwei. Degree-Based Replica Placement Algorithms for P2P Data Grids[J]. Chinese Journal of Electronics, 2010, 19(3): 486-490.
Citation: Ren Xunyi, Wang Ruchuan, Kong Qiang, Chen Danwei. Degree-Based Replica Placement Algorithms for P2P Data Grids[J]. Chinese Journal of Electronics, 2010, 19(3): 486-490.

Degree-Based Replica Placement Algorithms for P2P Data Grids

  • Received Date: 1900-01-01
  • Rev Recd Date: 1900-01-01
  • Publish Date: 2010-07-05
  • Replica placement, which decides when and where to create replicas, is an important technique for improving the efficiency of data grids. In this paper, degree is employed for replica replacement in P2P data grids. Two replica placement algorithms, Degree-based algorithm (DA) and Degree-frequency-based algorithm (DFA), are proposed. In DA and DFA we set a degree threshold p and a frequency threshold v to choose the candidate replica locations and a replica is placed in the candidate node which gives the minimum access cost. Simulation results showed that DA and DFA both can keep smaller Makespan and reduce the number of replicas compared with Simple, AlwaysReplica, and Ecomodel-Zipf. DFA proves to be superior to Frequency algorithms in reducing replica numbers, but DA can reduce Makespan more. In addition, we have studied the optimal parameters for the proposed algorithms.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (649) PDF downloads(627) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return