Unit3 Computer Network
Unit3 Computer Network
Unit3 Computer Network
Network Layer
Unit: 3
Text books:
1. Behrouz Forouzan, “Data Communication and Networking” Fourth Edition-2006,
Tata McGraw Hill
2. Andrew Tanenbaum “Computer Networks”, Fifth Edition-2011, Prentice Hall.
3. William Stallings, “Data and Computer Communication”, Eighth Edition-2008,
Pearson.
Reference Books:
4. Kurose and Ross, “Computer Networking- A Top-Down Approach”, Eighth
Edition-2021, Pearson.
5. Peterson and Davie, “Computer Networks: A Systems Approach”, Fourth Edition-
1996, Morgan Kaufmann
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
KCS603.1 3 2 2 2 2 2 3
KCS603.2 3 3 2 3
KCS603.3 3 3 3 3 2 2 2 3
KCS603.4 3 2 2 2 3
KCS603.5 3 3 2 2 3 2 3
KCS603.6 3 2 2 2 2 2 2 2 2 3
12/17/2024 8
NISHA ACSE502 CN UNIT 3
PSO’s
PSO1: identify, analyze real world problems and design their ethical solutions using
artificial intelligence, robotics, virtual/augmented reality, data analytics, block chain
technology, and cloud computing.
PSO2: design and develop the hardware sensor devices and related interfacing software
systems for solving complex engineering problems.
PSO 4: conduct investigation of complex problem with the help of technical, managerial,
leadership qualities, and modern engineering tools provided by industry sponsored
laboratories.
KCS603.1 2 2 2 2
KCS603.2 2 2 2 2
KCS603.3 2 2 2 3
KCS603.4 2 2 2 2
KCS603.5 2 2 2 2
KCS606 2 2 2 2
PEO 3:To have an effective communication skills, professional attitude, ethical values and
a desire to learn specific knowledge in emerging trends, technologies for research,
innovation and product development and contribution to society.
PEO 4: To have life-long learning for up-skilling and re-skilling for successful
professional career as engineer, scientist, entrepreneur and bureaucrat for betterment of
society.
NISHA ACSE502 CN UNIT 3
12/17/2024 11
Result Analysis
• Networking components
• Concept of physical addressing
• Concept of OSI and TCP/IP model
In previous unit
Data link layer duties
Multi access protocol
Error control
Unit 3
• Point-to-point networks
• Logical addressing (IPv4)
• Basic internetworking (IP, CIDR
ARP, RARP, DHCP, ICMP)
• Routing, forwarding and delivery
• Static and dynamic routing
• Routing algorithms and protocols
• Congestion control algorithms
• IPv6.
Objective: Study about basic concept of Network layer and its function
• Getting packets from the source all the way to the destination
• May require many hops through intermediate routers.
• It must know about the topology of the communication subnet ( the
set of all routers) and choose appropriate paths through it.
• It must take care to choose routers to avoid overloading some of the
lines and routers while leaving others idle.
• When source and destination are in different networks, it has to deal
with the differences.
Solution
We replace each group of 8 bits with its equivalent decimal number (see
Appendix B) and add dots for separation.
Solution
We replace each decimal number with its binary equivalent
Solution
a. There must be no leading zero (045).
b. There can be no more than four numbers.
c. Each number needs to be less than or equal to 255.
d. A mixture of binary notation and dotted-decimal
notation is not allowed.
Solution
a. The first bit is 0. This is a class A address.
b. The first 2 bits are 1; the third bit is 0. This is a class C
address.
c. The first byte is 14; the class is A.
d. The first byte is 252; the class is E.
The first address in the block can be found by setting the rightmost
32 − n bits to 0s.
The last address in the block can be found by setting the rightmost
32 − n bits to 1s.
The number of addresses in the block can be found by using the formula
232−n.
12/17/2024 NISHA ACSE502 CN 31
UNIT 3
Example 19.6
IPv4 address : classless addressing
Classless
addressing
Solution
The binary representation of the given address is
11001101 00010000 00100101 00100111
b. The second group has 128 customers; each needs 128 addresses.
Design the sub blocks and find out how many addresses are still available
after these allocations.
Group 1
For this group, each customer needs 256 addresses. This means that 8
(log2 256) bits are needed to define each host. The prefix length is then 32
− 8 = 24. The addresses are
Group 2
For this group, each customer needs 128 addresses. This means that 7
(log2 128) bits are needed to define each host. The prefix length is then 32
− 7 = 25. The addresses are
Addresses in a NAT
• Periodic Update
– A node sends its routing table, normally 30
seconds, in a periodic update
• Triggered Update
– A node sends its routing table to its neighbors any
time when there is a change in its routing table
1. After updating its routing table, or
2. Detects some failure in the neighboring links
Figure shows the initial routing table for an AS. Note that the
figure does not mean that all routing tables have been created
at the same time; each router creates its own routing table
when it is booted.
Link state routing has a different philosophy from that of distance vector
routing. In link state routing, if each node in the domain has the entire
topology of the domain—the list of nodes and links, how they are
connected including the type, cost (metric), and the condition of the links
(up or down)—the node can use the Dijkstra algorithm to build a routing
table.
• Creation of the states of the links by each node, called the link
state packets (LSP)
• Dissemination of LSPs to every other routers, called flooding
(efficiently)
• Formation of a shortest path tree for each node
• Calculation of a routing table based on the shortest path tree
• LSP data: the node ID, the list of links, a sequence number, and
age.
• LSP Generation
– When there is a change in the topology of the domain
– On a periodic basis
• There is no actual need for this type of LSP, normally 60
minutes or 2 hours
To show that the shortest path tree for each node is different, we found
the shortest path tree as seen by node C.
Objective: Study about basic concept of congestion control and its type
Data traffic
The main focus of congestion control and quality of service is data
traffic. In congestion control we try to avoid traffic congestion. In
quality of service, we try to create an appropriate environment for the
traffic. So, before talking about congestion control and quality of
service, we discuss the data traffic itself.
Traffic descriptors
Choke packet
FIFO queue
Priority queuing
Leaky bucket
A leaky bucket
algorithm
shapes busty
traffic into
fixed-rate
traffic by
averaging the
data rate. It
Leaky bucket implementation
may drop the
packets if the
bucket is full.
Token bucket
• https://www.youtube.com/watch?v=aqtd8iZlSAA
• https://www.youtube.com/watch?v=JhBnOamc_8s
2. A subnet mask in class A has 14 1s. How many subnets does it define? (CO4)
A) 32
B) 8
C) 64
D) none of the above
3. Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224, what is the
subnet address? (CO4)
A) 201.14.78.32
B) 201.14.78.65
C) 201.14.78.64
D) none of the above
• http://www.ululu.in/computer-networks-solve
d-sample-papers-btech-6th-semester/
• Point-to-point networks
• Logical addressing (IPv4)
• Basic internetworking (IP, CIDR
ARP, RARP, DHCP, ICMP)
• Routing, forwarding and delivery
• Static and dynamic routing
• Routing algorithms and protocols
• Congestion control algorithms
• IPv6.
Books:
1. Forouzen, "Data Communication and Networking",TMH
Thank You