![]() Num-servers: total number of servers in the network. The entries of a topology file are listed below: Each server can only read the topology file for itself. For all other servers in the network, the initial cost would be infinity. The topology file is local and contains the link cost to the neighbors. Each server is supplied with a topology file at startup that it uses to build its initial routing table. The four servers are required to form a network topology as shown in Fig. We will use four servers/computers/laptops. Please strictly adhere to the specifications. The various components of the protocol are explained step by step. ![]() This is a little different from the original algorithm which immediately sends out update routing information when routing table changes. A server should send out routing packets only in the following two conditions: a) periodic update and b) the user uses command asking for one. The servers should be able to output their forwarding tables along with the cost and should be robust to link changes. Each server runs on a machine at a pre-defined port number. The protocol will run on top of four servers/laptops (behaving as routers) using TCP or UDP. We will implement a simplified version of the Distance Vector Routing Protocol. Distance-Vector-Routing-Algorithm-using-Java
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |