Skip to content

Calculates the distance vectors for routers in a network, based upon link costs. The algorithm allows you to change a link cost and then updates the distance vector table.

Notifications You must be signed in to change notification settings

JacobAWilkins/Distance-Vector-Routing

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

Distance-Vector-Routing

Author: Jacob Wilkins

Language: Java

Compilation:

javac DistV ec.java

Run:

Format: java DistV ec [input file]

Example: java DistV ec input.txt

Instructions

First, you will be prompted to pick the mode. You can choose 1 for “Step by Step” or 2 for “Without Intervention.” Enter the number and press ENTER.

  • In “Step by Step” mode, you must press ENTER to progress through each step of the algorithm until the distance vector table is stable. Once stable, the number of steps taken will be displayed.

  • In “Without Intervention” mode, the algorithm will run through without stops and display the elapsed time and number of steps taken.

Next, you will be given prompts to change the cost of a link. First, you must enter the source router, then the destination router, and finally the changed cost of the link. After all of this information is gathered, the program will update the distance vector table from its previous state.

About

Calculates the distance vectors for routers in a network, based upon link costs. The algorithm allows you to change a link cost and then updates the distance vector table.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages