Category Archives: Routing

Distance Vector and Link State Routing Protocol

There are two major differences between Distance Vector routing protocols and Link State routing protocols. Distance Vector exchanges the routing updates periodically whether the topology is change or not, this will maximize the convergence time which increases the chance of routing loops while the Link State routing protocols send triggered change based updates when there is a topology change. After initial flood, pass small event based triggered link state updates to all other routers. This will minimize the convergence time that’s why there is no chance of routing loops. Secondly, the Distance Vector routing protocols rely on the information from their directly connected neighbours in order to calculate and accumulate route information. Distance Vector routing protocols require very little overhead as compared to Link State routing protocols as measured by memory and processor power while the Link State routing protocols do not rely solely on the information from the neighbours or adjacent router in order to calculate route information. Instead, Link State routing protocols have a system of databases that they use in order to calculate the best route to destinations in the network. An extra feature of Link State routing protocol is that they can detect media types along with other factors. This could increase the overhead as compare to Distance Vector routing protocols in order to measure by processor power and memory. Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP) are the examples of Distance Vector routing protocols while the Open Shortest Path First (OSPF) is a classic example of Link State routing protocols.

Read more »

Tags: compare distance vector and link state routing, distance vector routing vs link state routing, difference between distance vector routing and link state routing, difference between link state routing and distance vector routing, distance vector routing and link state routing, compare and contrast link-state and distance-vector routing, link state vs distance vector, compare and contrast link state and distance vector routing algorithms, compare and contrast link-state and distance-vector routing algorithms, link state vector routing protocol by Cisco packet tracer

Static Routing Tutorial

In studying for your CCNA exam and preparing to earn this valuable certification, you may be tempted to spend little time studying static routing and head right for the more exciting dynamic routing protocols like RIP, EIGRP, and OSPF.

This is an understandable mistake, but still a mistake. Static routing is not complicated, but it’s an important topic on the CCNA exam and a valuable skill for real-world networking.

To create static routes on a Cisco router, you use the ip route command followed by the destination network, network mask, and either the next-hop IP address or the local exit interface. It’s vital to keep that last part in mind – you’re either configuring the IP address of the downstream router, or the interface on the local router that will serve as the exit interface.

Read more »

Static Routing

Static Routing
Static routing is the term used to refer to a manual method that is used to set up routing between networks. The network administrator configures static routes in a router by entering routes directly into the routing table of a router. Static routing has the advantage of being predictable and simple to set up. It is easy to manage in small networks but does not scale well. Compare this with dynamic routing. Read more »
Tags: static routing in cisco packet tracer