ACN M3
ACN M3
Network Layer
Dr Suriya Prakash J
Static and Dynamic IP Addressing
• The connectivity of devices to the internet, or communication within a
network, an IP address is taken as a basic understanding. There are two main
types of IP addresses: Static and Dynamic. The purpose of this article is to
describe what IP addresses are and the difference between static and
dynamic IPs.
• IP stands for Internet Protocol. An IP address is a unique identifier assigned
to every device on a network. The difference between a Static and Dynamic
IP address lies in how long the assigned address remains the same. A Static
IP address is a fixed address that is manually assigned to a device for a long
period of time, where as a Dynamic IP address changes frequently, usually
each time the device is restarted, and is automatically assigned.
Static and Dynamic IP address
• Network Part: The network part indicates the distinctive variety that’s
appointed to the network. The network part conjointly identifies the
category of the network that’s assigned.
• Host Part: The host part uniquely identifies the machine on your network.
This part of the IPv4 address is assigned to every host.
For each host on the network, the network part is the same, however, the
host half must vary.
• Subnet Number: This is the nonobligatory part of IPv4. Local networks
that have massive numbers of hosts are divided into subnets
and subnet numbers are appointed to that
Limitations of IPv4
•
• Advantages of Static Routing
• No routing overhead for the router CPU which means a cheaper router
can be used to do routing.
• It adds security because only an only administrator can allow routing
to particular networks only.
• No bandwidth usage between routers.
Introduction to Dynamic Routing Protocols
• Distance Vector Routing Protocol:
• Distance Vector Routing (DVR) Protocol is a method used by routers
to find the best path for data to travel across a network. Each router
keeps a table that shows the shortest distance to every other router,
based on the number of hops (or steps) needed to reach them. Routers
share this information with their neighbors, allowing them to update
their tables and find the most efficient routes. This protocol helps
ensure that data moves quickly and smoothly through the network.
How Distance Vector Algorithm works?
• A router transmits its distance vector to each of its neighbors in a
routing packet.
• Each router receives and saves the most recently received distance
vector from each of its neighbors.
• A router recalculates its distance vector when:
• It receives a distance vector from a neighbor containing different
information than before.
• It discovers that a link to a neighbor has gone down.
• The DV calculation is based on minimizing the cost to each
destination
Dx(y) = Estimate of least cost from x to y
C(x,v) = Node x knows cost to each neighbor v
Dx = [Dx(y): y ? N ] = Node x maintains distance vector
Node x also maintains its neighbors' distance vectors
– For each neighbor v, x maintains Dv = [Dv(y): y ? N ]
RIPv1:
• RIPv1 uses classful routing. The periodic routing updates do not carry
subnet information, lacking support for variable length subnet masks
(VLSM). This limitation makes it impossible to have different-sized subnets
inside of the same network class. In other words, all subnets in a network
class must have the same size. There is also no support for router
authentication, making RIP vulnerable to various attacks.
• RIPv1 is a Distance-Vector Routing protocol. The standard used RFC 1058.
It can supports class full network only. It does not support for
authentications. It hop count limit is 15. It does not support for VLSM and
discontinuous networks. It is less secure. RIPv1 uses Broadcast traffic for
updates. The routing update address used for Broadcast is 255.255.255.255.
RIPV1 does not provide trigger updates.
Variable length sub-netmask
• Variable Length Subnet Mask (VLSM) is a technique used in IP network design to create subnets with different subnet masks.
VLSM allows network administrators to allocate IP addresses more efficiently and effectively, by using smaller subnet masks
for subnets with fewer hosts and larger subnet masks for subnets with more hosts.
• In a traditional subnetting scheme, a fixed subnet mask is applied to all subnets in the network, which can lead to inefficient use
of IP addresses. For example, if a network has two subnets, one with 10 hosts and another with 50 hosts, a traditional subnet
mask of 255.255.255.0 would be used for both subnets, which means that each subnet would have 254 available IP addresses.
This would result in wasted IP addresses for the smaller subnet.
• VLSM allows network administrators to create subnets with different subnet masks to more effectively utilize IP addresses.
Using the example above, VLSM could be used to assign a subnet mask of 255.255.255.128 to the smaller subnet with 10 hosts,
which would provide 126 available IP addresses, and a subnet mask of 255.255.255.192 to the larger subnet with 50 hosts,
which would provide 62 available IP addresses.
• VLSM is widely used in modern networks to create subnets of different sizes and to optimize the use of IP addresses.
• VLSM stands for Variable Length Subnet Mask where the subnet design uses more than one mask in the same network which
means more than one mask is used for different subnets of a single class A, B, C or a network. It is used to increase the usability
of subnets as they can be of variable size. It is also defined as the process of subnetting of a subnet. Procedure of implementing
VLSM – In VLSM, subnets use block size based on requirement so subnetting is required multiple times. Suppose there is an
administrator that has four departments to manage. These are sales and purchase department with 120 computers, development
department with 50 computers, accounts department with 26 computers and management department with 5 computers.
Classless Inter Domain Routing (CIDR)
1. Hello message-These messages are kept alive messages which are exchanged between two devices operating EIGRP.
These messages are used for neighbour discovery/recovery, if there is any device operating EIGRP or if any
device(operating EIGRP) coming up again.
These messages are used for neighbor discovery if multicast at 224.0.0.10. It contains values like AS number, k
values, etc.
These messages are used as acknowledgement when unicast. A hello with no data is used as the acknowledgement.
2. NULL update-It is used to calculate SRTT(Smooth Round Trip Timer) and RTO(Retransmission Time Out).
SRTT: The time is taken by a packet to reach the neighboring router and the acknowledgement of the packet to reach
the local router. RTO: If a multicast fails then unicast is being sent to that router. RTO is the time for which the local
router waits for an acknowledgement of the packet.
3. Full Update – After exchanging hello messages or after the neighbourship is formed, these messages are exchanged.
This message contains all the best routes.
4. Partial update-These messages are exchanged when there is a topology change and new links are added. It contains
only the new routes, not all the routes. These messages are multicast.
5. Query message-These messages are multicast when the device is declared dead and it has no routes to it in its
topology table.
6. Reply message – These messages are the acknowledgment of the query message sent to the originator of the query
message stating the route to the network which has been asked in the query message.
7. Acknowledgement message
It is used to acknowledge EIGRP updates, queries, and replies. Acks are hello packets that contain no
data. Note:-Hello and acknowledgment packets do not require any acknowledgment.
Reply, query, update messages are reliable messages i.e require acknowledgement.
Link State Routing
Link state routing is the second family of routing protocols. While
distance-vector routers use a distributed algorithm to compute their
routing tables, link-state routing uses link-state routers to exchange
messages that allow each router to learn the entire network topology.
Based on this learned topology, each router is then able to compute its
routing table by using the shortest path computation.
Link state routing is a popular algorithm used in unicast routing to
determine the shortest path in a network. Understanding how link state
protocols work is key to mastering routing algorithms.
• Link state routing is a technique in which each router shares the knowledge
of its neighborhood with every other router i.e. the internet work. The three
keys to understand the link state routing algorithm.
1. Knowledge about the neighborhood : Instead of sending its routing table,
a router sends the information about its neighborhood only. A router
broadcast its identities and cost of the directly attached links to other routers.
2. Flooding: Each router sends the information to every other router on the
internetwork except its neighbors. This process is known as flooding. Every
router that receives the packet sends the copies to all the neighbors. Finally
each and every router receives a copy of the same information.
3. Information Sharing : A router send the information to every other router
only when the change occurs in the information.
OSPF
• Open Shortest Path First (OSPF) is a link-state routing protocol that is
used to find the best path between the source and the destination
router using its own Shortest Path First). OSPF is developed by
Internet Engineering Task Force (IETF) as one of the Interior Gateway
Protocol (IGP), i.e, the protocol which aims at moving the packet
within a large autonomous system or routing domain. It is a network
layer protocol which works on protocol number 89 and uses AD value
110. OSPF uses multicast address 224.0.0.5 for normal
communication and 224.0.0.6 for update to designated
router(DR)/Backup Designated Router (BDR).
1. Router Id – It is the highest active IP address present on the router. First, the highest
loopback address is considered. If no loopback is configured then the highest active IP
address on the interface of the router is considered.
2. Router priority – It is an 8-bit value assigned to a router operating OSPF, used to elect DR
and BDR in a broadcast network.
3. Designated Router (DR) – It is elected to minimize the number of adjacencies formed.
DR distributes the LSAs to all the other routers. DR is elected in a broadcast network to
which all the other routers share their DBD. In a broadcast network, the router requests for
an update to DR, and DR will respond to that request with an update.
4. Backup Designated Router (BDR) – BDR is a backup to DR in a broadcast network.
When DR goes down, BDR becomes DR and performs its functions.
5. DR and BDR election – DR and BDR election takes place in the broadcast network or
multi-access network. Here are the criteria for the election:
5. The router having the highest router priority will be declared as DR.
6. If there is a tie in router priority then the highest router I’d be considered. First, the highest loopback
address is considered. If no loopback is configured then the highest active IP address on the interface
of the router is considered.
Overview of BGP
• The protocol can connect any internetwork of the autonomous system
using an arbitrary topology. The only requirement is that each AS have
at least one router that can run BGP and that is the router connected to
at least one other AS’s BGP router. BGP’s main function is to
exchange network reachability information with other BGP systems.
Border Gateway Protocol constructs an autonomous systems graph
based on the information exchanged between BGP routers.
Characteristics of Border Gateway Protocol
(BGP)
• Inter-Autonomous System Configuration: The main role of BGP is to provide communication
between two autonomous systems.
• BGP supports the Next-Hop Paradigm.
• Coordination among multiple BGP speakers within the AS (Autonomous System).
• Path Information: BGP advertisements also include path information, along with the reachable
destination and next destination pair.
• Policy Support: BGP can implement policies that can be configured by the administrator. For ex:- a
router running BGP can be configured to distinguish between the routes that are known within the
AS and that which are known from outside the AS.
• Runs Over TCP.
• BGP conserves network Bandwidth.
• BGP supports CIDR.
• BGP also supports Security.
Functionality of Border Gateway Protocol
(BGP)
• BGP peers perform 3 functions, which are given below.
• The first function consists of initial peer acquisition and
authentication. both the peers established a TCP connection and
performed message exchange that guarantees both sides have agreed
to communicate.
• The second function mainly focuses on sending negative or positive
reach-ability information.
• The third function verifies that the peers and the network connection
between them are functioning correctly.
Types of Border Gateway Protocol
External BGP: It is used to interchange routing information between
the routers in different autonomous systems, it is also known as
eBGP(External Border Gateway Protocol). The below image shows how
eBGP interchange routing information.
• Internal BGP: It is used to interchange routing information between
the routers in the same autonomous system, it is also known as
iBGP(Internal Border Gateway Protocol). Internal routers also ensure
consistency among routers for sharing routing information. The below
image shows how iBGP interchange routing information.
Elements of BGP
• Some elements of BGP are assigned to each path and these elements help routers to
select a path from multiple paths. Here below are some elements of BGP:
• Weight: Weight is defined as a Cisco-specific attribute that tells a router which
path is preferred. The weight having a higher value is preferred.
• Originate: This tells how a router choose routes and adds to BGP itself.
• Local Preference: Local Preference is an element used to select the outbound
routing path. Greater local preference is preferred.
• Autonomous System Path: This element tells the router to select a path having a
shorter length.
• Next Hop: To reach the destination the next hop elements specify the IP address
that should be used as the next hop.