Professional Documents
Culture Documents
Network Layer
Network Layer
PAWA N K U M A R
A S S I STA NT P R O F ES SOR
G J U S &T, H I S A R
Contents
Introduction to Network Layer
Functionalities
Design Issues
Service Type
Routing Algorithms
Congestion Control Algorithms
Admission Control
Internetworking
IPv4, IPv6
IP Addressing- Classful addressing classless addressing, Public and Private IP addresses
Routing Algorithms
Adaptive Non-Adaptive
Less bandwidth needed due to local sharing, small High bandwidth needed due to flooding and
1
packets and no flooding sending of large link state packets
It have local knowledge and updates table based on It have global knowledge and keeps
2
information from neighbors information about whole network
3 Uses Bellman ford algorithm Uses Dijkistra’s algorithm
4 Less traffic More traffic
Converges slowly i.e. good news spread fast and
5 Converges faster
bad news spread slowly
6 It has Count to infinity problem No issue of count to infinity problem
Persistent looping problem i.e., loop will be there
7 No Persistent looping only transient loops
forever
8 Implemented in – RIP, IGRP Implemented in- OSPF, ISIS
5/11/2020 NETWORK LAYER 35
Count to Infinity Problem
Problem with distance vector routing is whenever a link is broken, other routers unknowingly
gives information that they know how to reach a disconnected node. This false information will
propagate to all routers. This problem is known as count to infinity.
One of the important issue in Distance Vector Routing is Count to Infinity Problem.
Counting to infinity is just another name for a routing loop.
In distance vector routing, routing loops usually occur when an interface goes down.
It can also occur when two routers send updates to each other at the same time.
Each block is then converted into Hexadecimal and separated by ‘:’ symbol:
2001:0000:3238:DFE1:0063:0000:0000:FEFB
Rule.2: If two of more blocks contain consecutive zeroes, omit them all and replace with double
colon sign ::, such as (6th and 7th block):
2001:0000:3238:DFE1:63::FEFB
Consecutive blocks of zeroes can be replaced only once by :: so if there are still blocks of zeroes
in the address, they can be shrunk down to a single zero, such as (2nd block):
2001:0:3238:DFE1:63::FEFB
FF02::5 OSPF v3
FF02::9 RIPng
FF02::A EIGRP