A Network of routers have been configured for the purposes of handling data traffic within your company. You would like to have an application that does a network trace on the length of time it takes to traverse routers between workstation nodes using an open shortest path first (OSPF) algorithm as a variation (i) A* functionality (ii) best first search (iii) greedy search. Your application should simulate a total of up to 14 network nodes with the routing features between these nodes. The network tracer application program is to be updated with all the legitimate travel paths to move between node locations. This travel path data is stored in a mathematical analysis application called a djistrika matrix which can be represented programmatically as set of multidimensional arrays or files/link list structures. Whenever a path becomes inaccessible for a chosen network destination path , the graph path and nodes are colored in red( i.e. graph coloring technique). Paths with the higher f(n) values are ranked and colored orange , to signal to the network tracer of impending delays on a given path. The nodes on a tracer path are used to recognize distinct network nodes . Start and End nodes are uniquely colored on the graph paths. Each router in your network node has it’s own computable heuristic or Time Series value as in the case of say cisco router.
The automated network tracer should also have the extended programming simulated functionalities of using a menu selection of a (i) Depth First Search Traversal (ii) And a Breadth First Search Traversal , to select travel paths between a start and end network nodes. Within each search technique , the tracer may chose to take a Euler or Hamiltonian circuit to complete the traversal of the arterial network graph.
On each travel path(i.e. graph edge) and at each vertex, a hop count of all nodes visited is stored in a routing database server configuration table as managed by the network tracer application. Lets assume that the hop counter path is determined by simulated data of the total node traversals or an approximate estimate thereof. Hence the Tracer should be able to make the decision to send data over the network node based on statistical preferences of the size of the hop counts and/or heuristics on those portions of the network graph. Rules for node traversals and what constitute a node route with high traffic versus low traffic would have to be provided by your programming assumptions.

SOME ASSUMPTIONS

1. Do you believe that weight values on the edges of the network node, could be used to extend the network tracer , as a data mining application . ? Explain with example your answer.[Hint : For e.g. can your network tracer keep track of how many times a particular network node was visited , as a set of high ,low , and median frequency values . This concept turns the network tracer into an application that can affect behavioral patterns within network nodes). Make your assumptions very clear. A creativity bonus of (20%) on marks can be awarded if the data mining design concern can be integrated into the existing application

Code Assumptions to Note
1. Ensure your application supports useful data structures in the forms of binary trees, and binary search trees. Use of breadth first, depth first, Euler and Hamiltonian cycles.
2. You must choose the programming based language of your choice that adequately achieves the assignment outcomes with great user interface functionality as best as possible.
3. Review of discrete mathematic concepts and techniques are assumed to be well understood for your applied solutions.
4. Choose any programming language suitable to achieve the desired outcomes.

Posted Date: 3/29/2013 10:44:21 AM | Location :

Ask an Expert

Related Discussions:- Mr. D. Mclean, Assignment Help, Ask Question on Mr. D. Mclean, Get Answer, Expert's Help, Mr. D. Mclean Discussions

Write discussion on Mr. D. Mclean
Your posts are moderated

Write your message here..

Related Questions

Loops, how do i print out invalid input? how do i print out invalid input?

Vision based simultaneous mapping and localization, Project Description: ... Project Description: Design and prepare software that can navigate a mobile robot using SLAM technique using vision sensor (camera). Skills required are C Programming, Engine

Some of the basic rules of cpp program, Ba s i c r u l e s o f C... Ba s i c r u l e s o f C + + p r o g r a m : ·     I t m u s t h a v e o n l y o n e m a i n f u n c ti o n ·

Define polymorphism?, Define Polymorphism? A: Polymorphism let a client ... Define Polymorphism? A: Polymorphism let a client to treat di_erent objects in the simialr way even if they were developed from di_erent classes and exhibit di_erent behaviors.

Program for vovals, i need short program i need short program

Define passing structure to a function, Define Passing Structure to a Funct... Define Passing Structure to a Function? A structure is able to be passed as a function argument identical to any other variable. If we are merely interested in one member of a

What is the difference among malloc/free and new/delete?, What is the diffe... What is the difference among malloc/free and new/delete? A: Malloc/free do not know about destructors and constructors. New & delete create and destroy objects, whereas malloc &

Need discrete math tutor, Project Description: I will need a tutor that ... Project Description: I will need a tutor that would help me out in Data Structure and learning Algorithm more at the mathematical/algorithmic level. The book is written by "by T

Sp, Write a program to find the area under the curve y = f(x) between x = a... Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Class and object, write a class player that contain attributes for the play... write a class player that contain attributes for the player,s name,average and team