The Last Procedure Before First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez,...

13
The Last Procedure Before First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez, Archana Shrestha CS 383

Transcript of The Last Procedure Before First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez,...

The Last ProcedureBefore First Functional Prototype

Grant Boomer, Brett Papineau, Tanis Lopez, Archana Shrestha

CS 383

What is VMWare

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

Customer Interaction

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

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

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.

Design 1 Visualized

Data Format

• Header– Defines what fields will be present

• Node Info– Node name– Node attributes

• Edge Info– Edge name– Edge attributes

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.

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

Design 2 Visualized

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

Thank You