User Account

All Pages

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

Functions and stack frame, Each function has its own stack frame between %f...

Each function has its own stack frame between %fp and %sp. Let Caller calls Callee. Then Caller's %sp becomes callee's %fp, and callee's %sp set to be a new value (a smaller one be

Fibonacci series, draw the flow chart to print the fibonacci series upto n ...

draw the flow chart to print the fibonacci series upto n th terms

ASCII, A string S is said to be "Super ASCII", if it contains the character...

A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''a''-''z'') and the asci

Write function that take array as argument, Write a function that takes an ...

Write a function that takes an array as the argument and returns the second largest element. Bonus (+5): Write a function that takes an array and a number n as arguments and return

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

Illustrate the example of constructor, A Constructive Example Consider ...

A Constructive Example Consider an example , to model a user-defined data type for  strings. The object simulates a character array ( string ) using a character pointer and an

Queue - c++ program, Queue - C++ program: Write a program to show the ...

Queue - C++ program: Write a program to show the basic operations on queue. namespace stack {  const int max_size = 200;  char v(max_size);  int top=0;  void pu

Object oriented programming, implementation of the power and factorial in p...

implementation of the power and factorial in programs

How do you connect a c++ program to c functions?, A: Using the extern "C" l...

A: Using the extern "C" linkage specification around the C function declarations. Programmers must know about mangled function names and type-safe linkages. After that they must

Pebble merchant, having 2 arrays and 3killograms of pebbles are needed conv...

having 2 arrays and 3killograms of pebbles are needed converting an area of 1 square meter the rate of pebble is $5 per killograms

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +91-977-207-8620

Phone: +91-977-207-8620

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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