1. Link State Routing ?

Link-state routing protocols are one of the two main classes of routing protocols used in packet
switching networks for computer communications, the other being distance-vector routing protocols.
Examples of link-state routing protocols include Open Shortest Path First (OSPF) and intermediate
system to intermediate system (IS-IS).
The link-state protocol is performed by every switching node in the network (i.e., nodes that are
prepared to forward packets; in the Internet, these are called routers). The basic concept of link-state
routing is that every node constructs a map of the connectivity to the network, in the form of a graph,
showing which nodes are connected to which other nodes. Each node then independently calculates
the next best logical path from it to every possible destination in the network. Each collection of best
paths will then form each node's routing table.
This contrasts with distance-vector routing protocols, which work by having each node share its
routing table with its neighbours. In a link-state protocol the only information passed between nodes
is connectivity related. Link-state algorithms are sometimes characterized informally as each router,
"telling the world about its neighbours.

2. Distance Vector Routing ?

A distance-vector routing protocol in data networks determines the best route for data packets
based on distance. Distance-vector routing protocols measure the distance by the number
of routers a packet has to pass, one router counts as one hop. Some distance-vector protocols also
take into account network latency and other factors that influence traffic on a given route. To
determine the best route across a network routers on which a distance-vector protocol is
implemented exchange information with one another, usually routing tables plus hop counts for
destination networks and possibly other traffic information. Distance-vector routing protocols also
require that a router informs its neighbours of network topology changes periodically.
Distance-vector routing protocols use the Bellman–Ford algorithm and Ford–Fulkerson algorithm to
calculate the best route. Another way of calculating the best route across a network is based on link
cost, and is implemented through link-state routing protocols.
The term distance vector refers to the fact that the protocol manipulates vectors (arrays) of distances
to other nodes in the network. The distance vector algorithm was the original ARPANET routing
algorithm and was implemented more widely in local area networks with the Routing Information
Protocol (RIP).

3. Difference Between RIP V1 and V2 ?

RIP v1 uses what is known classful routing. Classful addressing is the use of Class A, Class B, and Class
C addresses. (Class D is reserved for multicasts, and Class E is reserved for future use.)
Class A, B, and C addresses define a set number of binary bits for the subnet portion. For example, a
Class A network ranges from 1–127 and uses a subnet mask of 255.0.0.0.

A Class B network uses the mask 255.255.0.0, and Class C uses 255.255.255.0. RIP v1 does not
support authentication of update messages (plain-text or MD5). RIP v1 is an older, no longer much used
routing protocol.
 RIP v2 is a classless protocol and it supports classful, variable-length subnet masking (VLSM), CIDR, and
route summarization.
RIPv2 supports authentication of RIPv2 update messages (MD5 or plain-text). Authentication helps in
confirming that the updates are coming from authorized sources. It also supports multicast routing
updates to reduce resource consumption (as opposed to using broadcasting in RIP v1).

RIP v2 can be useful in small, flat networks or at the edge of larger networks because of its simplicity in
configuration and usage.

4. OSPF ?

Open Shortest Path First (OSPF) is a routing protocol for Internet Protocol (IP) networks. It uses
a link state routing (LSR) algorithm and falls into the group of interior gateway protocols (IGPs),
operating within a single autonomous system (AS). It is defined as OSPF Version 2 in RFC
2328 (1998) for IPv4.[1] The updates for IPv6 are specified as OSPF Version 3 in RFC
5340 (2008).[2] OSPF supports the Classless Inter-Domain Routing (CIDR) addressing model.
OSPF is a widely used IGP in large enterprise networks. IS-IS, another LSR-based protocol, is more
common in large service provider networks.

a. Area

An OSPF network can be divided into sub-domains called areas. An area is a logical collection of
OSPF networks, routers, and links that have the same area identification. A router within an area
must maintain a topological database for the area to which it belongs. The router does not have
detailed information about network topology outside of its area, which thereby reduces the size of its
database.
Areas limit the scope of route information distribution. It is not possible to do route update filtering
within an area. The link-state database (LSDB) of routers within the same area must be
synchronized and be exactly the same; however, route summarization and filtering is possible
between different areas. The main benefit of creating areas is a reduction in the number of routes to
propagate - by the filtering and the summarization of routes.
Each OSPF network that is divided into different areas must follow these rules:
 A backbone area - which combines a set of independent areas into a single domain - must exist.
 Each non-backbone area must be directly connected to the backbone area (though this connection
might be a simple logical connection through a virtual link).
 The backbone area must not be partitioned - divided into smaller pieces - under any failure
conditions, such as link or router down events.

b. DR and BDR

Based on the network type, OSPF router can elect one router to be a Designated Ruter
(DR) and one router to be a Backup Designated Router (BDR). For example, on
multiaccess broadcast networks (such as LANs) routers defaults to elect a DR and
BDR. DR and BDR serve as the central point for exchanging OSPF routing information.
Each non-DR or non-BDR router will exchange routing information only with the DR and
BDR, instead of exchanging updates with every router on the network segment. DR will
then distribute topology information to every other router inside the same area. This
greatly reduces OSPF traffic.

To send routing information to a DR or BDR the multicast address of 224.0.0.6 is used.

DR sends routing updates to the multicast address of 224.0.0.5. If DR fails, BDR takes
over its role of redistributing routing information.

Every router on a network segment establish a full neighbor relationship with the DR
and BDR. Non-DR and non-BDR routers establish a two way neighbor relationship
between themselves.

c. Router ID

Each Router in an OSPF network needs a unique OSPF Router ID. The OSPF Router ID is used to provide a
unique identity to the OSPF Router.

OSPF Router ID is an IPv4 address (32-bit binary number) assigned to each router running the OSPF
protocol.

OSPF Router ID should not be changed after the OSPF process has been started and the ospf neighborships
are established. If you change the OSPF router ID, we need to either reload the IOS or use "clear ip ospf
process" command, for OSPF Router ID change to take effect. Reloading the IOS or using "clear ip ospf
process" commad can cause temporary network outage.
 5. Access List

Access lists filter network traffic by controlling whether routed packets are forwarded or blocked at
the router's interfaces. Your router examines each packet to determine whether to forward or drop
the packet, on the basis of the criteria you specified within the access lists.

Access list criteria could be the source address of the traffic, the destination address of the traffic,
the upper-layer protocol, or other information. Note that sophisticated users can sometimes
successfully evade or fool basic access lists because no authentication is required.

a. Standard ACL

Standard ACL
 Checks ACL source address
 Permits or denies entire protocol suite

b. Extended ACL

Extended ACL
 Checks source and destination address
 Generally permits or denies specific protocols and applications
o Source and destination TCP and UDP ports
o Protocol type (IP, ICMP, UDP, TCP or protocol number)

IPv4 ACL Type Number Range / Identifier

Numbered Standard 1-99, 1300-1999

Numbered Extended 100-199, 2000-2699

c. Named ACl

Named Access Control Lists (ACLs) allows standard and extended ACLs to be given names instead of
numbers. Unlike in numbered Access Control Lists (ACLs), we can edit Named Access Control Lists.
 6. NAT

Network address translation (NAT) is a method of remapping one IP address space into another
by modifying network address information in the IP header of packets while they are in transit across
a traffic routing device.[1] The technique was originally used as a shortcut to avoid the need to
readdress every host when a network was moved. It has become a popular and essential tool in
conserving global address space in the face of IPv4 address exhaustion. One Internet-routable IP
address of a NAT gateway can be used for an entire private network.
IP masquerading is a technique that hides an entire IP address space, usually consisting of private
IP addresses, behind a single IP address in another, usually public address space. The address that
has to be hidden is changed into a single (public) IP address as "new" source address of the
outgoing IP packet so it appears as originating not from the hidden host but from the routing device
itself. Because of the popularity of this technique to conserve IPv4 address space, the term NAT has
become virtually synonymous with IP masquerading.
As network address translation modifies the IP address information in packets, it has serious
consequences on the quality of Internet connectivity and requires careful attention to the details of its
implementation. NAT implementations vary widely in their specific behavior in various addressing
cases and their effect on network traffic. The specifics of NAT behavior are not commonly
documented by vendors of equipment containing NAT implementations.

a. Static NAT
Static NAT is used to do a one-to-one mapping between an inside address and an outside address. Static
NAT also allows connections from an outside host to an inside host. Usually, static NAT is used for servers
inside your network. For example, you may have a web server with the inside IP address 192.168.0.10 and
you want it to be accessible when a remote host makes a request to 209.165.200.10. For this to work, you
must do a static NAT mapping between those to IPs. In this example, we will use the FastEthernet 0/1 as
the inside NAT interface, the interface connecting to our network, and the Serial 0/0/0 interface as the
outside NAT interface, the one connecting to our service provider.

b. Dynamic NAT
Dynamic NAT is used when you have a “pool” of public IP addresses that you want to assign to your
internal hosts dynamically. Don’t use dynamic NAT for servers or other devices that need to be accessible
from the Internet.

In this example, we will define our internal network as 192.168.0.0/24. We also have the pool of public IP
addresses from 209.165.200.226 to 209.165.200.240 and our assigned netmask is 255.255.255.224. When
you configure dynamic NAT, you have to define an ACL to permit only those addresses that are allowed to
be translated.