implementing Byzantine protocol for fault-tolerance distributed system

CLOSED
Bids
4
Avg Bid (INR)
31250
Project Budget (INR)
₹12500 - ₹37500

Project Description:
Implementing Byzantine protocol for fault-tolerance distributed system with the use of a Quorum.
A 2D array will be used to create graph. The array is an adjacency matrix of some graph. Each index contains a value of 0 or 1. Each index with a value of 1 indicates there is an edge between two nodes. A node class must be used. Each node object contains data members that store a node Id and a data field.
At any given time a node may broadcast this data to all other nodes on the network. I propose using DFS algorithm to achieve this task. There is more that is required but this is the basics of what must be done. If you are able to complete this project please reply.

Skills required:
Algorithm, C++ Programming, Software Architecture
About the employer:
Verified
Public Clarification Board
Bids are hidden by the project creator. Log in as the employer to view bids or to bid on this project.
You will not be able to bid on this project if you are not qualified in one of the job categories. To see your qualifications click here.


₹ 37500
in 30 days
Hire techlegends786
₹ 20000
in 10 days
Hire aadhirasharma
₹ 30000
in 20 days
₹ 37500
in 25 days