Mr. D. Mclean, C/C++ Programming

Assignment Help:
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.

Related Discussions:- Mr. D. Mclean

Plz reply on [email protected], You are to implement a code cracking ...

You are to implement a code cracking system. The system will deploy four processes (p1,p2,p3 & p4) to try to guess the password of an encrypted code. For encryption, we consider th

C++ , a program to find the area under the curve y = f(x) between x = a and...

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 tw

Caesar cipher, This task involves char arrays and pointer based string hand...

This task involves char arrays and pointer based string handling. Which we use to make a simple encryption program, using a Caesar Cipher, Write a program that: a. Asks

Write a program to add co-ordinates of the plane, Write a program to add co...

Write a program to add co-ordinates of the plane The class having x and y co-ordinates. Create three objects. Use a constructor to pass one pair of co-ordinates and a funct

Program of binary tree, Program of Binary tree: Btree::Btree(int O) : ...

Program of Binary tree: Btree::Btree(int O) : itemsInContainer(0) {     finishInit(O); }   Btree::~Btree(void) {     if( root != 0 )         delete roo

Recursive function, Binomial coefficients are the numeric factors of the pr...

Binomial coefficients are the numeric factors of the products in a power of a binomial such as (x + y)n. For example, (x + y)2 = x2 + 2 x y + y2 has the coefficients 1 2 1. Binomia

LOOP, DIFFERENCE BETWEEN WHILE AND DO WHILE LOOP?

DIFFERENCE BETWEEN WHILE AND DO WHILE LOOP?

Explain manipulators, Manipulators There are several classes in the ios...

Manipulators There are several classes in the iostream.h header file. One of them is ios class. This class stores the format state. For example, some bits explain the base in w

Develop a .net wrapper for a c++ dll, Develop a .NET wrapper for a C++ Dll ...

Develop a .NET wrapper for a C++ Dll Project Description: We have a classic VC++ Dll that requires a .NET wrapper built by you. Use latest Visual Studio and .Net framework sh

Program to calculate pie, This problem familiarizes you with using random n...

This problem familiarizes you with using random numbers in C++. The program is to compute a good approximation of p using a simulation method called "Monte Carlo". The following fi

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd