0% found this document useful (0 votes)
15 views23 pages

21CS52 CN Module 3

The document covers the network layer of computer networks, detailing design issues, routing and congestion control algorithms, and quality of service (QoS). It includes laboratory components for practical implementation, such as ping message transmission and the Bellman-Ford algorithm for shortest path finding. Additionally, it discusses the interplay between routing and forwarding, connection setup, and the differences between connection-oriented and connectionless services.

Uploaded by

Antheesh R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
15 views23 pages

21CS52 CN Module 3

The document covers the network layer of computer networks, detailing design issues, routing and congestion control algorithms, and quality of service (QoS). It includes laboratory components for practical implementation, such as ping message transmission and the Bellman-Ford algorithm for shortest path finding. Additionally, it discusses the interplay between routing and forwarding, connection setup, and the differences between connection-oriented and connectionless services.

Uploaded by

Antheesh R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

COMPUTER NETWORKS

Subject Code: 21CS52


MODULE- 2
• The Network Layer: Network Layer
Design Issues, Routing Algorithms,
Congestion Control Algorithms, QoS.

Laboratory Component :
1. Implement transmission of ping messages/trace route
over a network topology consisting of 6 nodes and find
the number of packets dropped due to congestion in
the network.
2. Write a program to find the shortest path between
vertices using bellman-ford algorithm.
Network layer
• On Sending side encapsulates
segments into datagrams applicatio
n
• on Receiving side, delivers network
transport
network
segments to transport layer data link
physical
network
data link
data link
physical
network
data link

• network layer protocols in every physical

network
physical

host, router data link


physical network
data link
physical

network
• Router examines header fields in network
data link
data link
physical
physical
all IP datagrams passing through network
data link applicatio
it physical n
transport
network
data link
physical
Key Network-Layer Functions

• Forwarding: move Analogy:


packets from router’s
input to appropriate  Routing: process of
router output planning trip from
• Routing: determine source to dest
route taken by packets  Forwarding: process
from source to dest.
of correct left turns,
• Routing algorithms right turns, exits, etc.
Interplay between routing and
forwarding
routing algorithm

local forwarding table


header value output link
0100 3
0101 2
0111 2
1001 1

value in arriving
packet’s header

0111 1

3 2
Connection setup
• Important function in some network architectures:
• ATM, frame relay, X.25

• Before datagrams flow, two hosts and intervening


routers establish virtual connection
• Routers get involved

• Network and transport layer connecting service:


• Network: between two hosts
• Transport: between two processes
Network service model
Q: What service model for “channel” transporting datagrams
from sender to receiver?
Example services for Example services for a
individual datagrams: flow of datagrams:
• Guaranteed delivery • In-order datagram
• Guaranteed delivery delivery
with less than 40 • Guaranteed minimum
msec delay bandwidth to flow
• Restrictions on
changes in inter-
packet spacing
Network Layer Design
Issues
Goal of layer: get packets from source host to destination
host
1. Routing: should know about topology of subnet
2. Congestion: should avoid overloading some
communication lines and routers
3. Quality of service: offer the appropriate service
4. Internetworking: deal with network differences, if
source and destination are connected to different
networks
Network Layer Design
Issues
• Store-and-forward packet switching
• Equipment of: carrier <> customer
• Algorithm at router
• Receive packet
• Check packet (e.g. checksum)
• Forward packet
Design issues: services
• Interface
• Important: = interface between carrier and customer
• Designed with following goals in mind:
• Services should be independent of the subnet
technology
• Transport layer should be shielded from the
number, type, topology of the subnets
• Network addresses should use a uniform
numbering plan, even across LANs and WANs
• Connections?
• Connection-oriented <> Connectionless!
Design issues: services
• Connection-oriented <> Connectionless
• PTTs: connection-oriented
• 100 years of experience with the world-wide
telephone system
• Connection time  billing!
• Internet
• Subnets are inherently unreliable
• Real issue: where to put the complexity as
some/many applications require reliable transfer (~
connection-oriented service)
• Network layer
• Transport layer
Design issues: services
• Connection-oriented <> Connectionless (cont.)
• In favour of connectionless service
• Computing power is cheap: hosts can handle the complexity
• Subnet is a large, long lasting investment: keep it simple
• For some applications speedy delivery (low, constant delay)
is important
• In favour of connection-oriented service
• Users want a reliable trouble-free service
• Some services are easier to provide on top of connection-
oriented service
• Examples
• ATM: connection oriented
• IP: connection-less
• IP on top of ATM
Design issues: services

Network
Layer
Design: internal organisation
• Virtual circuits
• Routes chosen at connection time
• Connection identified by a virtual circuit number (VCn)
• Primary service of subnet is connection-oriented

4
Transport 7 Transport
Network Network
Data Link Data Link
Physical Physical
Routing problem: map
[Incoming line, VCn]
[outgoing line, VCn]
Design: internal
organisation
• Virtual circuits
Design: internal
organisation
• Datagram subnet
• Each packet is routed independently
• Subnet has more work to do
• More robust, easier to adapt to failures and congestion

Transport Transport
Network Network
Data Link Data Link
Physical Physical

Routing problem: map


Destination address
 Outgoing line
Design: internal
organisation
• Datagram subnet
Design: internal
• organisation
Datagram subnet

Change of routing table


Design: internal
organisation
Issue Datagram subnet VC subnet

Circuit setup Not needed required

Addressing Full addresses (source + Short VC number in each


destination) in each packet packet
State information No state held in subnet State held for each VC

Routing Done for each packet Route chosen at connection


independently setup
Effect of router None, except for packet All VCs passing failed router
failures losses are terminated
Congestion control difficult Easy if enough buffers can
be allocated in advance
Design: internal
organisation
Type of subnet
Service to upper Datagram Virtual Circuit
layer
Connectionless UDP UDP
IP IP
ATM
Connection-oriented TCP ATM AAL1
IP ATM
Textbooks
1. Computer-Networks- Andrew S. Tanenbaum
and David J. Wetherall, Pearson Education,
5th Edition.
(www.pearsonhighered.com/tanenbaum)

Reference Books
2. Behrouz A Forouzan, Data and Communications and
Networking, Fifth Edition, McGraw Hill, Indian Edition
3. Larry L Peterson and Brusce S Davie, Computer
Networks, fifth edition, ELSEVIER
Thank you

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy