Computational Effort Reduction Of Fault Tolerance In Scalable Agent Support Systems

Computer Science Project Topics

Get the Complete Project Materials Now! ยป

Distributed systems are characterized by partial failures. These partial failures might prohibit the application from performing a system-wide computation and reaching consensus among its components (probably agents). Partial failure might happen due to several reasons, but one of the reasons is the Byzantines failure.rnMany researches have dealt with Byzantine failure by proposing different algorithms to solve the problem. Most of the algorithms focus on how to reach on agreement and tolerate fault, while Query/Update (Q/U) protocol discusses the problem of fault tolerance with respect to scalability.rnHowever, these algorithms do not take into account the computational effort it requires, thus making it unattractive for practical use. These techniques do not address the fault scalability of Byzantine faults thoroughly. Hence in this research we looked for better technique to address fault-scalability of Byzantine failures.rnTo address the Byzantine failure two approaches have been used: the agreement protocol and the quorum protocol. The quorum protocol has been proven to be fault scalable and efficient. The protocol has used the combination of the agreement based and quorum based approaches for the agreement sub-protocol. The agreement sub-protocol focuses on how to achieve a common value from quorums and between quorums. The election sub-protocol has to conduct election of a primary among the existing replicas.rnThe integration of AgentScape/DARX has been used in the experiment to test the fault tolerance in scalable agent support systems. Performance evaluation through experimentation has been done to assess the scalability fault tolerance support system.rnxirnThe protocol executes requests in three one-way message delays, which is acceptable latency for agreement on a client request. The protocol is robust to increasing the number of tolerated Byzantine faults and continues to provide significantly higher throughput, achieving scalability feature of the fault tolerant multi-agent support system.rnKeywords: Multi-agent support system, Scalable fault tolerance, Byzantine faults

Get Full Work

Report copyright infringement or plagiarism

Be the First to Share On Social



1GB data
1GB data

RELATED TOPICS

1GB data
1GB data
Computational Effort Reduction Of Fault Tolerance In Scalable Agent Support Systems

171