English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49433/84396 (59%)
Visitors : 7463863      Online Users : 46
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: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/78769

    Title: A Simple and Efficient Signature-Based Consensus Protocol in the Asynchronous Distributed System
    Authors: Cheng, Chien-fu;Tsai, Kuo-tang;Liao, Hsien-chun
    Contributors: 淡江大學資訊工程學系
    Keywords: distributed consensus problem;oral message;signed message;dormant fault;malicious fault and grouping
    Date: 2012-01-01
    Issue Date: 2012-10-22 10:20:38 (UTC+8)
    Publisher: Kaunas: Kauno Technologijos Universitetas
    Abstract: The consensus problem in distributed systems is mainly solved by message exchange. Most of past consensus algorithms rely on exchange of oral messages to achieve consensus among processors. As oral messages are susceptible to influences from malicious attackers, this type of consensus protocols usually requires a large number of rounds of message exchange, and the complexity of message exchange is also excessively high. In light of this drawback of oral message-based consensus algorithms, some scholars proposed signed message-based consensus algorithm to reduce the number of rounds of message exchange required. However, some signed message-based consensus algorithms still have certain drawbacks which make them ineffective in some conditions. To address this issue, we propose a new signed message-based consensus algorithm in this paper. We integrate the concept of grouping into the proposed algorithm and find the best number of groups through mathematical analysis to further reduce the rounds of message exchange required. In other words, the proposed algorithm makes use of digital signature and the concept of grouping to solve the consensus problem. This algorithm can not only increase the fault-tolerance of distributed systems but also significantly reduce the rounds of message exchange required to achieve consensus.
    Relation: Information Technology and Control 41(2), pp.183-198
    DOI: 10.5755/j01.itc.41.2.931
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    There are no files associated with this item.

    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