Scribd
Upload
40 views10 pages

CPE 400 / 600 Computer Communication Networks: Network Layer

This document discusses network layer concepts in computer networks including: 1) Virtual circuit networks which require call setup and maintain connection state at routers, and datagram networks which do not require call setup or maintain connection state. 2) Routers in virtual circuit networks maintain forwarding tables with virtual circuit numbers to direct packets between links. 3) Datagram networks forward packets based on destination addresses without the need for call setup or maintaining connection state at routers. Routers use longest prefix matching on destination addresses to determine the outgoing link.

Uploaded by

zaid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
40 views10 pages

CPE 400 / 600 Computer Communication Networks: Network Layer

This document discusses network layer concepts in computer networks including: 1) Virtual circuit networks which require call setup and maintain connection state at routers, and datagram networks which do not require call setup or maintain connection state. 2) Routers in virtual circuit networks maintain forwarding tables with virtual circuit numbers to direct packets between links. 3) Datagram networks forward packets based on destination addresses without the need for call setup or maintaining connection state at routers. Routers use longest prefix matching on destination addresses to determine the outgoing link.

Uploaded by

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

CPE 400 / 600

Computer Communication Networks

Lecture 14

Chapter 4
Network Layer

slides are modified from J. Kurose & K. Ross


Lecture 14: Outline
 4. 1 Introduction
 4.2 Virtual circuit and datagram networks
 4.3 What’s inside a router

Network Layer 2
Network layer connection and
connection-less service
 datagram network provides network-layer
connectionless service

 VC network provides network-layer connection


service

 analogous to the transport-layer services, but:


 service: host-to-host
 no choice: network provides one or the other
 implementation: in network core

Network Layer 3
Virtual circuits
“source-to-dest path behaves much like telephone circuit”
 performance-wise
 network actions along source-to-dest path

 call setup, teardown for each call before data can flow
 each packet carries VC identifier
 not destination host address

 every router on source-dest path maintains “state” for


each passing connection
 link, router resources (bandwidth, buffers) may be
allocated to VC
 dedicated resources = predictable service
Network Layer 4
VC implementation
a 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 dest address)

 VC number can be changed on each link.


 New VC number comes from forwarding table
Network Layer 5
Forwarding table VC number

12 22 32

1 3
2

Forwarding table in interface


northwest router: number
Incoming interface Incoming VC # Outgoing interface Outgoing VC #

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

Routers maintain connection state information!


Network Layer 6
Virtual circuits: signaling protocols

 used to setup, maintain teardown VC


 used in ATM, frame-relay, X.25
 not used in today’s Internet

application
transport 5. Data flow begins 6. Receive data application
transport
network 4. Call connected 3. Accept call
network
data link 1. Initiate call 2. incoming call
data link
physical
physical

Network Layer 7
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 address


 packets between same source-dest pair may take
different paths

application
application
transport
transport
network
data link 1. Send data 2. Receive data network
data link
physical
physical

Network Layer 8
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 4 billion 3

possible entries Network Layer 9


Longest prefix matching

Prefix Match 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?

Network Layer 10

You might also like