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

Concurrent programming task ydetailsmany banking systems

CONCURRENT PROGRAMMING TASK YDETAILS Many banking systems allow multiple cardholders access a single account (e.g. a business account). The consequence of this is that is possible for more than one person to attempt to w ...

Programming assignment 1 grocery storethis assignment

Programming Assignment #1: Grocery Store This assignment attempts to serve as a refresher for concepts that I hope you learned in CS 122. In this assignment, you will be building a simple storefront for a small grocery s ...

1 tic tac toein a tic tac toe game two players x and o take

1 TIC TAC TOE In a Tic Tac Toe game two players, X and O, take turns to mark the spaces in a 3X3 grid. The winner will be the player who first succeeds in placing three of his/her marks in a horizontal, vertical, or diag ...

Electrical engineering computer methods assignmentq1 write

Electrical Engineering Computer Methods Assignment Q1. Write a program that given the following array, reverses all array elements and then prints them. int x[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; Q2. Write a program to d ...

Add a swift class file to the project that illustrates and

Add a SWIFT class file to the project that illustrates and contains the following: • The class name is 'Calculator' • Has public variables of the type float called numerator, denominator and total. • Has a method called ...

Complete the attached code and do junit testing can you

Complete the attached code and do junit testing. Can you help with this? Testing class tests Check Date methods serves as a "test plan" for developer's testing. Complete/correct and test/demonstrate using Junit with test ...

Questioncomplete tutorial 10 case problem 2 - ridgewood

Question: Complete Tutorial 10 Case Problem 2 - Ridgewood Herald Tribune found on pages 734-736 of your textbook. Complete the entire website assignment and upload your files to your 000WebHost account. After uploading t ...

1 construct a markov algorithm that will reverse the order

1) Construct a Markov Algorithm that will reverse the order of an input string that consists of zero or more upper case letters. ABCDE should become EDCBA, AB should become BA, A should stay A, and A should stay A. NOTE: ...

Write a program to test for the case of a math equation

Write a program to test for the case of a math equation entered via the keyboard using the SWITCH-CASE operator. Types of equations to test for: x + y  x / y   x * y and x - y. The program is to ask for the following: 1. ...

Engineering programmingi need this now please accurate

Engineering programming I need this now please accurate answers and must be high rated Problem #1 Write a program that asks the user to input the number of miles and convert the miles to kilometers, and then print the ou ...

  • 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

A cola-dispensing machine is set to dispense 9 ounces of

A cola-dispensing machine is set to dispense 9 ounces of cola per cup, with a standard deviation of 1.0 ounce. The manuf

What is marketingbullwhat is marketing think back to your

What is Marketing? • "What is marketing"? Think back to your impressions before you started this class versus how you

Question -your client david smith runs a small it

QUESTION - Your client, David Smith runs a small IT consulting business specialising in computer software and techno

Inspection of a random sample of 22 aircraft showed that 15

Inspection of a random sample of 22 aircraft showed that 15 needed repairs to fix a wiring problem that might compromise

Effective hrmquestionhow can an effective hrm system help

Effective HRM Question How can an effective HRM system help facilitate the achievement of an organization's strate