English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 56848/90584 (63%)
造访人次 : 12156843      在线人数 : 84
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/104269

    题名: The k-Set Consensus Problem with Weight Consideration
    作者: Cheng, Chien-Fu;Liao, Hsien-Chun
    关键词: Distributed system;Malicious fault;Fault-tolerant;K-Set consensus problem;Weight
    日期: 2015-01
    上传时间: 2016-01-06 10:53:33 (UTC+8)
    摘要: In the cloud computing environment, files are duplicated into several copies for storage at different locations to increase their access efficiency and fault tolerance. However, there may exist malicious processors in the cloud computing environment. How to ensure that fault-free processors coordinate to find appropriate locations to store these duplicated files without influence from malicious processors is an important issue. In this paper, we propose a consensus algorithm to assist fault-free processors in reaching a consensus on where to store the duplicated files in the presence of malicious processors. In this paper, we will extend the classical consensus problem to a new type of consensus problem called the k-Set consensus problem with weight consideration (k-SetW problem). This problem is integrated with the concepts of weight and k-Set. In other words, each processor in this problem is allowed to have multiple initial values (i.e., the expected locations for the duplicated files) and set the weight for each initial value. The weighted value shows the processor’s preference for an initial value. Regarding the consensus, this problem does not require agreement among all fault-free processors on a single consensus value. It allows coexistence of multiple consensus values as long as the number of consensus values is not greater than k (i.e., the maximum number of duplicated files). By solving the k-SetW problem, we can help fault-free processors determine the locations for storing the duplicates of at most k copies based on their preferences in the presence of malicious processors.
    關聯: The Journal of Supercomputing 71(1), pp.144-161
    DOI: 10.1007/s11227-014-1291-x
    显示于类别:[資訊工程學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数
    The k-Set Consensus Problem with Weight Consideration.pdf1989KbAdobe PDF1检视/开启



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈