NETWORKING ROUTING-attached the ppt of topics about this

50

COSC 5350 COURSE ASSIGNMENT VIII

RAINWATER NETWORKING ROUTING

NAME:___________________________________ SCORE:_______________

ATTACH SOURCE PROGRAM LISTING, INPUT DATA SET AND OUTPUT INDICATIVE

OF PROGRAM RESULTS TO THIS COURSE ASSIGNMENT.

DUE DATE: Wednesday, 24 April 2013

Using the language of your choice, write a program which implements Dijkstra's

Shortest Path Algorithm as discussed in class. Your program should input the

network cost matrix and determine the shortest path length from each node to every

other node in the network. Use the following network to provide for input data to

your program (feel free to input additional networks for supplemental testing).

For the indicated network, your program's output for NODE 0 might appear as

follows:

FROM NODE 0

TO NODE LENGTH PATH

1 5 0-1

2 4 0-2

3 12 0-2-4-3

4 10 0-2-4

5 11 0-3-5

6 22 0-2-4-3-6

Your program would also output the routing table for the remaining nodes in the

network. You should, of course, work independently on this program and follow the

logical design previously discussed in class. Be sure to include descriptive

documentation to your source code and practice good programming techniques.