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

When is a template a better solution than a base class, When you are design...

When you are designing a generic class to have or otherwise manage objects of other types, when the format and behavior of those other types are unimportant to their containment or

What is an explicit constructor, A conversion constructor declared with the...

A conversion constructor declared with the explicit keyword. The compiler does not use an explicit constructor to execute an implied conversion of types. Its purpose is reserved ex

Source code on home stay, I am doing project on home stay which includes fe...

I am doing project on home stay which includes features like add homestay,search,book,delete homestay,

After p = new fred[n], After p = new Fred[n], how does the compiler know ab...

After p = new Fred[n], how does the compiler know about n objects to be destructed throughout delete[] p? A:  The run-time system hold the number of objects, n, somewhere where

Pointers, Pointers are just numbers, representing addresses in memory. You ...

Pointers are just numbers, representing addresses in memory. You can add to and subtract from pointers, for instance. It is pretty easy to make mistakes with pointer math, however,

#padovan string, program that counts the number of occurrences of the strin...

program that counts the number of occurrences of the string in the n-th padovan string p(n)

Program is to read the characters from keyboard, Program is to read the cha...

Program is to read the characters from keyboard: Program is to read the characters from keyboard one by one stored in different files as upper constants, lower constants, othe

Define the return statement in computer programming, Define The Return Stat...

Define The Return Statement in Computer Programming? The return statement is used for two purposes once the return statement is executed the program control will be immediately

Lexicographically preceding permutation, Given an integer n and a permutati...

Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the permutation that lexicographically precedes the given input permutation. If the given

Define difference among delete and delete[]?, when you allocate memory with...

when you allocate memory with new[], you ought to free the memory via delete[]. While you allocate memory along 'new', then use 'delete' with no the brackets. You employ new[] to a

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