Approximate Agreement Problems in Distributed Systems, M.Sc. Thesis Sharif University of Technology ; Izadi, Mohammad (Supervisor)
Abstract
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...
Cataloging briefApproximate Agreement Problems in Distributed Systems, M.Sc. Thesis Sharif University of Technology ; Izadi, Mohammad (Supervisor)
Abstract
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...
Find in contentBookmark |
|