Distance vector routing

In this project, you will implement a distance-vector routing protocol called RIP. Each router on the network executes RIP to exchange routing information with its neighbors, and based on this information, the router computes the shortest paths from itself to all the other routers. You will implement this routing protocol in Java. The network will consist of virtual routers, each of which is a separate process on one or more computers. Since a process represents a router, two routers can communicate via sockets. The number of neighbors for each router is limited up to three, and the cost of each link is given arbitrarily as user input. You create only a router, not a host, where RIP will run.