How Many Types Of Routing Algorithms Can Be Divided Into?
Routing algorithms can be defined as a mechanism that tells the router how to process. All these algorithms are different from others regarding their design and efficiency and type. Routing algorithms can broadly be divided into following categories; Static versus dynamic, Single-path versus multipath, Flat versus hierarchical, Host-intelligent versus router-intelligent, Interadomain versus interdomain, Link-state versus distance vector. All these algorithms have different design, different working and different metrics to measure the best paths for routing. Static algorithms are actually the tables that are created by the network administrator before the beginning of routing; they will not be updated till an administrator does it manually. While the dynamic routing algorithms are updated as they find any sort of change in routing paths. The single path routing algorithms have a single path to the destination while multipath algorithms allow traffic to route over multiple lines in orde
