Scribd
Upload
51 views12 pages

Virtual Circuit and Datagram Networks

The document provides an overview of the Network Layer, detailing concepts such as Virtual Circuits (VC) and Datagram Networks, along with their respective forwarding mechanisms and service models. It discusses the differences between connection-oriented and connectionless services, the structure of forwarding tables, and routing algorithms. Additionally, it highlights the significance of signaling protocols in VC and the absence of call setup in Datagram Networks.

Uploaded by

dileepvarma2004
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
51 views12 pages

Virtual Circuit and Datagram Networks

The document provides an overview of the Network Layer, detailing concepts such as Virtual Circuits (VC) and Datagram Networks, along with their respective forwarding mechanisms and service models. It discusses the differences between connection-oriented and connectionless services, the structure of forwarding tables, and routing algorithms. Additionally, it highlights the significance of signaling protocols in VC and the absence of call setup in Datagram Networks.

Uploaded by

dileepvarma2004
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/ 12

Module IV

The Network Layer


P. Rama Devi
Assistant Professor
Department of CSE
GITAM School of Technology (GST)
Visakhapatnam – 530045
The Network Layer
• Introduction • The Internet Protocol (IP):
 Forwarding and Routing Forwarding and Addressing in the
 Network Service Models Internet
 Datagram Format
• Virtual Circuit and Datagram
Networks  IPv4 Addressing
 Virtual-Circuit Networks  ICMP
 Datagram Networks  IPv6
 Origins of VC and Datagram  A Brief Foray into IP Security
Networks • Routing Algorithms
• Inside a Router  The Link-State (LS) Routing
 Input Processing Algorithm
 Switching  The Distance-Vector (DV)
 Output Processing Routing Algorithm
 Where Does Queuing Occur  Hierarchical Routing
 The Routing Control Plane
Connection, connection-less service
Datagram network provides network-layer
connectionless service
Virtual-circuit network provides network-layer
connection service
Analogous to TCP/UDP connection-oriented /
connectionless transport-layer services, but:
 Service: host-to-host
 No choice: network provides one or the other
 Implementation: in network core
Virtual Circuits(VC)
“source-to-destination path behaves much
like telephone circuit”
• performance-wise
• network actions along source-to-destination
path teardown for each call before data can flow
• Call setup,
• Each packet carries VC identifier (not destination host
address)
• Every router on source-destination path maintains “state” for
each passing connection
• Link, router resources (bandwidth, buffers) may be
allocated to VC (dedicated resources = predictable service)
VC implementation
VC consists of:
1. Path from source to destination
2. VC numbers, one number for each link along path
3. Entries in forwarding tables in routers along path
 packet belonging to VC carries VC number
(rather than destination address)
 VC number can be changed on each link.
 New VC number comes from forwarding table
VC forwarding table
12 22 32

1 3
2
VC number
interface
forwarding table in number
northwest router:
Incoming interface Incoming VC # Outgoing interface Outgoing VC #

1 12 3 22
2 63 1 18
3 7 2 17
1 97 3 87
… … … …

C routers maintain connection state informatio


Virtual circuits: signaling protocols
• Used to setup, maintain teardown VC
• Used in ATM, frame-relay, X.25
• Not used in today’s Internet

application
6. receive data application
transport 5. data flow begins transport
network 4. call connected 3. accept call
network
data link 1. initiate call 2. incoming call
data link
physical physical
Datagram Networks
• No call setup at network layer
• Routers: no state about end-to-end
connections
 No network-level concept of “connection”
• Packets forwarded using destination host
application
address
transport
application
transport
network 1. send datagrams 2. receive datagrams network
data link data link
physical physical
Datagram forwarding table
4 billion IP
routing algorithm addresses, so rather
than list individual
local forwarding table
destination address
dest address output list range of
address-range 1 3 link
addresses
address-range 2 2 (aggregate table
address-range 3
address-range 4
2
1
entries)

IP destination address in
arriving packet’s header
1
3 2
Datagram forwarding table
Destination Address Range Link Interface

11001000 00010111 00010000 00000000


through 0
11001000 00010111 00010111 11111111

11001000 00010111 00011000 00000000


through 1
11001000 00010111 00011000 11111111

11001000 00010111 00011001 00000000


through 2
11001000 00010111 00011111 11111111

otherwise 3
Longest prefix matching
longest prefix matching
when looking for forwarding table entry
for given destination address, use longest
address prefix that matches destination
address.
Destination Address Range Link interface
11001000 00010111 00010*** ********* 0
11001000 00010111 00011000 ********* 1
11001000 00010111 00011*** ********* 2
otherwise 3

examples:
DA: 11001000 00010111 00010110 10100001 which interface?
DA: 11001000 00010111 00011000 10101010 which interface?
Datagram or VC network: why?
Internet (datagram) ATM (VC)
• data exchange among • evolved from telephony
computers • human conversation:
– strict timing, reliability
– “elastic” service, no strict timing
requirements
req. – need for guaranteed
• many link types service
– different characteristics
• “dumb” end systems
– telephones
– uniform service difficult – complexity inside network
• “smart” end systems
(computers)
– can adapt, perform control, error
recovery
– simple inside network,
complexity at “edge”

You might also like