Routing is a term used in reference to the practice of controlling as well as moving a given packet of data across a desirable network. There are two forms of algorithms that find use in routing: dynamic and static routing. A routing table is a file or database that stores a list of the routing table is referred to to find the best possible route for the transfer of information. The routing table is sustained manually via the route command in Static routing. For a single network communicating with other networks, static routing is applied.
On the contrary, during dynamic routing, dynamic protocols are employed to update the routing table automatically while finding the finest path connecting the source to the destination computers. Through the application of a dynamic routing algorithm, an operator enables the router to send the necessary data across another route based on the prevailing communications circuits’ conditions. There are several benefits associated with static routing. To start with, the various routers and routing devices give support to static routing. Secondly, it is easier to configure static routes. Finally, it is easier to understand and predict static routes, especially where small networks are concerned.
Some of the limitations of static routing are as follows; Static routing does not balance properly in large networks; its routed systems have high administration overheads, and the routes fail to acclimatize to equipment failures as well as network topology adjustments dynamically. The advantages of dynamic routing include it provides better scalability (the ability to take on more workload without diminished performance). It also provides better adaptability that is, it can adapt to changes in the network topology brought about by growth or by the failure of one or more network components. The protocols used in dynamic routing include:
- Distance Vector Routing Protocols;
- Link State Routing Protocols.