Loading...

Approximate Agreement Problems in Distributed Systems

Habibi, Kamal | 2013

518 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: English
  3. Document No: 45700 (52)
  4. University: Sharif University of Technology, International Campus, Kish Island
  5. Department: Science and Engineering
  6. Advisor(s): Izadi, Mohammad
  7. Abstract:
  8. Approximate Agreement (AA) is one of the most important issues in distributed networks in which non-faulty processes execute a voting algorithm to reach the values that are very close to each other. AA for Partially Connected Networks (PCNs) is very limited because a node may not have a complete view of the whole network which makes it difficult to reach the convergence. This research proposes a convergent Fuzzy algorithm for synchronous distributed networks in the presence of faulty or Byzantine processes. When each node receives a new value from its neighbors,it runs the convergent Fuzzy algorithm. If the received value is not in the expected range of values, the processor can discard the received value and replace it with its own value. Thus, we can remove the benign faults and selected values in multiset based on Fuzzy Logic that are not faulty. Using the kept historyof nodes,the proposed method can convergewhen the number of non-faulty nodes is the same asthe number of the faulty nodes.This methodcan also be considered for similar problems such as Data Aggregation (DA)in synchronous PCNs, assuming that thenetwork under consideration isfault free in which all non-faulty nodes are required to reach the same exact decision
  9. Keywords:
  10. Fuzzy Logic ; Fault Tolerance ; Approximate Algorithm ; Distributed System ; Approximate Agreement ; Byzantine Agreement

 Digital Object List

 Bookmark

No TOC