Assumed that you’ve been working in one of the software development company in Putrajaya, Kuala Lumpur.

You have been asked by your superior to design and build a web application that able to generate routing table

for the organization’s network using:

 v     Link State Algorithm

v     Distance Vector Algorithm.

You can use any type of scripts (web programming language) for the application.

Your application should involve with dynamic input output.

• A global routing algorithm computes the least-cost path between a source and destination using complete, global knowledge about the network. That is, the algorithm takes the connectivity between all nodes and all links costs as inputs. This the requires that the algorithm somehow obtain this information before actually performing the calculation. The calculation itself can be run at one site ( a centralized global routing algorithm ) or replicated at multiple sites. The key distinguishing feature here, however, is that a global algorithm has complete information about connectivity and link costs. In practice, algorithm with global state information are often referred to as link state algorithms, since the algorithm must be aware of the cost of each link in the network.

• In a decentralized routing algorithm, the calculation of the least-cost path is carried out in an iterative, distributed manner. No node has complete information about the costs of all network links. Instead, each node begins with only the knowledge of the cost of its own directly attached links. Then, through an iterative process of calculation and exchange of information with is neighboring nodes ( that is, nodes that are at the  "other end"  of links to which it itself is attached ), a node gradually calculates the least-cost path to a destination or set of destinations.  In practice, algorithm with decentralized information are often referred to as Distance vector, because a node never actually knows a complete path from source to destination. Instead it  only knows the neighbor to which it should forward a packet in order to reach a given destination along the least cost path; it also knows the cost of that least-cost path.