English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62379/95055 (66%)
Visitors : 2295924      Online Users : 17
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/104269

    Title: The k-Set Consensus Problem with Weight Consideration
    Authors: Cheng, Chien-Fu;Liao, Hsien-Chun
    Keywords: Distributed system;Malicious fault;Fault-tolerant;K-Set consensus problem;Weight
    Date: 2015-01
    Issue Date: 2016-01-06 10:53:33 (UTC+8)
    Abstract: 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.
    Relation: The Journal of Supercomputing 71(1), pp.144-161
    DOI: 10.1007/s11227-014-1291-x
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    The k-Set Consensus Problem with Weight Consideration.pdf1989KbAdobe PDF3View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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