Ask Question, Ask an Expert


Ask Programming Language Expert

A   Network  of  routers  have  been  configured  for  the  purposes  of  handling  data traffic within your company. You  will  like  to have an application which  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 must 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 that  can  be  represented programmatically  as  set of  multidimensional arrays or  files/link list  structures. Every time a path becomes  unreachable 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  identify distinct  network  nodes  . Start and End nodes are uniquely colored on the graph paths. Each  router  in your network  node  has  its own  computable  heuristic or Time  Series  value  as  in the  case  of  say  cisco router.

The  automated network tracer  must  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  choose  travel  paths  between  a  start  and  end  network  nodes.  Within  each  search  technique , the tracer  may  choose  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.  Let’s  suppose that  the hop  counter  path is  determined  by  simulated data of the total  node traversals  or an  approximate estimate thereof.  Therefore  the Tracer  must  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.       


 1. Do  you  believe that  weight values  on  the edges of  the  network node, can be  used  to  extend  the network  tracer , as  a data  mining  application?  Describe  with  ex  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 behavioural patterns within network nodes). Make your assumptions very clear.

Code Assumptions to Note     

1. Make sure  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  should  select  the   programming  based  language  of  your  choice  which  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. Select any programming language appropriate to achieve the desired outcomes.

Programming Language, Programming

  • Category:- Programming Language
  • Reference No.:- M91037

Have any Question? 

Related Questions in Programming Language

Assignmentafter informing the user what the program does

Assignment After informing the user what the program does, prompt the user for the number of darts to throw. Also, prompt for a number of simulations (why not have the program simulate this dart throwing more than once). ...

1 write a program that reads input as a stream of

1. Write a program that reads input as a stream of characters until encountering EOF. Have the program report the number of uppercase characters, the number of lowercase characters, and the number of other characters rea ...

Complete the below two problems each problem is a separate

Complete the below two problems. Each problem is a separate program (project). Question 1 Write a program that calculates and prints the monthly paycheck for an employee. The net pay is calculated after taking the follow ...

Sum of digits in a string design a program that asks the

Sum of Digits in a String Design a program that asks the user to enter a string containing a series of single digit numbers with nothing seperating them. The program should display the sum of all the single digit numbers ...

Assignment lispoverviewthe purpose of this assignment is

ASSIGNMENT: LISP Overview The purpose of this assignment is for you to gain some experience designing and implementing LISP programs. This assignment explores only a few of the many interesting LISP features. This assign ...

Suppose the heap consists of exactly the nine cars on three

Suppose the heap consists of exactly the nine cars on three trains shown in given figure (i.e., ignore the ellipses). Object o in car 11 has references from cars 12, 23, and 32. When we garbage collect car 11, where migh ...

Question 1what is overriding please use code to explain it

Question 1: What is overriding? Please use code to explain it. (Cannot use the same code in class) Question 2: What are the benefits when inheritance is used if multiple classes share the same fields and methods? Questio ...

The concepts discussed in this section can also be applied

The concepts discussed in this section can also be applied to eliminate partially dead code. A definition of a variable is partial ly dead if the variable is live on some paths and not others. We can optimize the program ...

Resources appendices a amp dexamine the following

Resources: Appendices A & D Examine the following situation: Your company, Datamax, Inc., is in the process of automating its payroll systems. Your manager has asked you to create a program that calculates overtime pay f ...

Programming assignmentdescription your algorithm first

Programming Assignment Description: Your algorithm first takes an input size (N) from the user and generates a random sequence of N integers ranging from -99999 to 99999. If N is less than 50, your program must print the ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro

Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen