Introduction - If you have any usage issues, please Google them yourself
This is a parody routing algorithm java program.
Achieve a simple function on the router.
Implement distance vector routing algorithm.
Internet router simulation achieved the IP router. It can determine the shortest route network, and in these transmission packet utilization
Achieve Features
A) preparation of a group called "Router" program
2) the use of distance vector algorithm updates the routing table
3) multiple instances of the program (processes or threads) can be run on a single machine
4) between instances using UDP exchange routing table
5) Assuming that node and its neighbor nodes are distance of 1.
6) In order to specify the instance and its neighbors, the program must be able to start receiving the following parameters:
7) router ID, myport, port1, port2, port3 ...
8) program must be able to deal with the following command:
a) N-printing activities neighbor list.
b) T-output routing table.
c) 0,1, ... 9- to send the packet
9) About Time Timing
a) given eve