the last procedure before first functional prototype n.
Skip this Video
Loading SlideShow in 5 Seconds..
The Last Procedure Before First Functional Prototype PowerPoint Presentation
Download Presentation
The Last Procedure Before First Functional Prototype

Loading in 2 Seconds...

  share
play fullscreen
1 / 13
Download Presentation

The Last Procedure Before First Functional Prototype - PowerPoint PPT Presentation

bevis
83 Views
Download Presentation

The Last Procedure Before First Functional Prototype

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. CS 383 The Last ProcedureBefore First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez, ArchanaShrestha

  2. What is VMWare • Virtual Network Emulator • Can support hundreds of machines • Abstract and geographic network architecture. • Can be accessed through various scripting APIs • Pearl

  3. Customer Interaction

  4. Project scope • Application Requirements • A tool to extract information about the entire virtual network at a given state • A Graphical User Interface (GUI) • Interactive tools to filter the information displayed • A conversion that produces a document of information taken from VMWare to be displayed by the program

  5. Broader Scope • Potential features • Further filtering tools and display tools to accommodate new information • The ability to create an animation of the network over a period of time • Ability to make changes to the network in the GUI and have those changes reflected on the virtual network • Real time interaction between the application and the virtual network

  6. Design Prototype 1 • General Data Structure Outline • Encapsulation • Largest risk in project is VMWare • Goal was to be able to design each part separately. • Each section able to function independently from the other components.

  7. Design 1 Visualized

  8. Data Format • Header • Defines what fields will be present • Node Info • Node name • Node attributes • Edge Info • Edge name • Edge attributes

  9. Data Structures Nodes are connected to each other through an edge node. Ability to navigate through the list of Nodes and Edges, as well as view relationships.

  10. Design Prototype 2 • Graphical User Interface Emphasis • Static interface layout • Mutable field of view • Processing Language • Sits on top of Java™ • Easy implementation of GUI features

  11. Design 2 Visualized

  12. Different Types of algorithms to find the path Depth first search Stack Implementation Low memory constraint, not complete Dijkstra’s Algorithm Solves single shortest path problem Breadth-first search Queue implementation Costly, but complete A* search algorithm

  13. Thank You