1 / 10

Team C: Tom Leavey Harry Groover Keith Istler

Byzantine Detection and Routing. Team C: Tom Leavey Harry Groover Keith Istler. Overview. Design Sequence of Actions GUI Critical Components Possible Add-ons Timeline. UML. Sequence Diagram. GUI. Critical Components. Node interaction

hfelix
Télécharger la présentation

Team C: Tom Leavey Harry Groover Keith Istler

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Byzantine Detection and Routing Team C: Tom Leavey Harry Groover Keith Istler

  2. Overview • Design • Sequence of Actions • GUI • Critical Components • Possible Add-ons • Timeline

  3. UML

  4. Sequence Diagram

  5. GUI

  6. Critical Components • Node interaction • Visual representation of nodes, network communication, and adversaries • Adversarial detection • Preset node placements

  7. Add-ons • Pause button on GUI • Multiple adversarial techniques • Save/Load Network State • Add/Remove Nodes during communication

  8. Timeline • Week 3: • Finalize design, complete class diagrams, split up the work • Week 4: • Partition components between group members • Begin code implementation of system • Class skeletons • Helper methods • Constructors • Basic GUI layout • Week 5: • Have basic model of communication working • Nodes should be able to relay messages • Basic functionality of NetworkGrid • Begin developing probing logic • Simple display of message transport functional

  9. Timeline (continued) • Week 6: • Successfully detect Byzantine failures • Successfully be able to probe nodes • Begin implementation of path finding algorithm • Begin merging separate entities • Week 7: • Route around adversarial nodes • Week 8: • Testing / Bug tracking begins • Finalize GUI • Split up the work for the report among group members • Week 9: • Continue testing • Documentation of code • Begin writing final report • Week 10: • Deliver finished program • Finish and revise the final report

  10. Questions?

More Related