Network Layer: Understanding Datagram and Virtual Circuit Packet Switching - Prof. Tarek , Study notes of Computer Systems Networking and Telecommunications

An in-depth analysis of the network layer, focusing on datagram and virtual circuit packet switching. Topics include addressing, switching, routing, traffic control, connectionless vs. Connection-oriented services, and forwarding tables. It also covers the differences between ip and atm models.

Typology: Study notes

Pre 2010

Uploaded on 03/09/2009

koofers-user-jn4
koofers-user-jn4 🇺🇸

5

(1)

9 documents

1 / 14

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Network Layer
Introduction
Datagrams and Virtual Circuits
Routing
Traffic Control
Main Objective
nData delivery from source to destination
Transport
Session
Presentation
Application Transport
Session
Presentation
Application
Physical
Data Link
Network
Physical
Data Link
Network
Physical
Data Link
Network
Physical
Data Link
Network
Physical
Data Link
Network
Physical
Data Link
Network
Station (Host)
Node (Router)
Copyright by Jorg Liebeherr 98,99
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe

Partial preview of the text

Download Network Layer: Understanding Datagram and Virtual Circuit Packet Switching - Prof. Tarek and more Study notes Computer Systems Networking and Telecommunications in PDF only on Docsity!

Network Layer

Introduction Datagrams and Virtual Circuits Routing Traffic Control

Main Objective

n Data delivery from source to destination

Transport Session

Presentation Application (^) TransportSession

Presentation

Application

Physical

Data Link Network

Physical

Data Link

Network

Physical Data Link

Network

Physical

Data Link

Network

Physical

Data Link

Network

Physical

Data Link

Network

Station (Host)

Node (Router)

Copyright by Jorg Liebeherr 98,

Issues at the Network Layer

n Addressing

n IP addresses on the Internet

n Switching

n Datagram packet switching

n Virtual circuit packet switching

n Routing

n How to calculate a path from source to

destination?

Models of the Network Service

n The “post office” model (IP)

n Simple, unreliable, unordered delivery service n Different letters between the same parties are handled independently (connectionless model) n Stateless (no record of who’s corresponding with whom) n Intelligent end-user

n The “phone service” model (ATM)

n Concept of “connections” between conversing users n Reliable delivery (of voice) n State is maintained regarding active connections n Dumb end-device (phone)

Connection-oriented Service

n Logical connection is established

Packet-switched network

1.3 1.2 1. 2.3 2.2 2.

1.^ 1.^

1.

**2.

2.**

A

B

C Copyright by Jorg Liebeherr 98,

Datagram Packet-Switching

n Unreliable, connectionless service

n Each packet is routed independently

A 1

2 3

6

4 5

B

C

2 1

2

1

3 3

Copyright by Jorg Liebeherr 98,

Virtual-Circuit Packet

Switching

n Connection-oriented service

n All packets of a VC follow the same route

A 1

B

C

VC

Copyright by Jorg Liebeherr 98,99VC #

Network Switches

n A network switch (or router) is a device

that forwards data in the direction of

the destination

Ethernet Switch (Link layer device) Cisco Router (Network layer device)

Forwarding Tables

n Virtual circuit packet switching

A

C

D

E

B

Port 0 Port 1

In Port In VCI Out Port Out VCI

Port 2

Packet Forwarding of Virtual

Circuits

n When a packet with VCin in header arrives from

router nin, ...

  1. The router looks up the routing table for an entry with (VCin, nin)
  2. The routing table lookup yields (VCout, nout) 3.The router updates the VC# of the header to VCout and transmits the packet to nout

Good: Routing table is small (how small?)

Bad: Changing the route is complicated.

Routing table changes for each virtual circuit

Copyright by Jorg Liebeherr 98,

VCI Establishment in Virtual

Circuit Packet Switching

A B

C

D

0

1

2 0 1

2

(Port0,VCI1)‡ Port

3

(Port3,VCI5)‡ Port

4 (Port4,VCI7)

VCI

,VCI

VCI

,VCI

VCI

A establishes connection to D

Source Routing

n Source determines the entire route of

the packet

n Packet header carries complete route

information

n Switches follow directions in packet

header

n Problems?

Application TCP IP Network Access

Application TCP

IP NetworkAccess

Application protocol TCP protocol IP protocol IP protocol DataLink NetworkAccess

IP NetworkAccess NetworkAccess

IP Data^ NetworkAccess Link DataLink

IP protocol

Host Router Router Host

IP Overview

n IP is the highest layer protocol that is implemented

at both routers and hosts

n Offers unreliable connectionless service (send and

deliver primitives)

Copyright by Jorg Liebeherr 98,

IP Addresses

n Each router or host on the Internet has a unique

global address, called the IP address

n An IP address

n is 32 bits long. n encodes a network number and a host number

n IP addresses are written in a dotted decimal

notation:

n 128.238.42.112 means 10000000 in 1st Byte 11101110 in 2nd Byte 00101010 in 3rd Byte 01110000 in 4th Byte Copyright by Jorg Liebeherr 98,

IP Datagrams

n IP breaks data up into Datagrams limited to 64K

bytes each

n Datagrams prevent long flows from monopolizing

the network for a long time

n In future gigabit networks the 64K limit can be

increased

n Example: For how long will a 1M byte datagram tie up a T1 line (1.5Mbps)? n How about a 1 Gbps optical fiber?

n Datagrams can further be fragmented depending on

packet size of the data link layer (e.g., Ethernet)

Copyright by Jorg Liebeherr 98,

IP Datagram Format

version (4 bits) header length Type of Service/TOS (8 bits) Total Length (in bytes) (16 bits) Identification (16 bits) (^) (3 bits)f l a g s Fragment Offset (13 bits)

Source IP address (32 bits) Destination IP address (32 bits) Options (if any, <40 bytes)

DATA

>= five 32-bit words

32-bit word

0 31

TTL Time-to-Live (8 bits)

Protocol (8 bits) Header Checksum (16 bits)

Copyright by Jorg Liebeherr 98,

IP Header (Continued)

n Options:

n Security restrictions n Record Route: each router that processes the packet adds its IP address to the header. n Timestamp: each router that processes the packet adds its IP address and time to the header. n (loose) Source Routing: specifies a list of routers that must be traversed. n (strict) Source Routing: specifies a list of the only routers that can be traversed.

n Padding: ensures that header ends on a

4-byte boundary

Copyright by Jorg Liebeherr 98,

IP Fragmentation

n Host A sends large IP datagram to host B

n Datagram traverses multiple networks

with different MTUs

n Problem?

n IP Router performs fragmentation

FDDI Ring (^) Router Host A (^) Host B

Ethernet

MTUs: FDDI: 4352 Ethernet: 1500

Copyright by Jorg Liebeherr 98,

What’s involved in

Fragmentation?

n The following fields in the IP header are involved:

version (4 bits)

header length

Type of Service/TOS Total Length (in bytes) Identification f l a g s^ Fragment Offset

......

TTL Time-to-Live (8 bits) Protocol (8 bits) Header Checksum (16 bits)

Identification is the same in all fragments. Flags contains a “more fragments” bit (There is also a “don’t fragment bit” that can be set) Fragment offset contains the offset of current fragment in the original datagram Total length is changed by fragmentation Copyright by Jorg Liebeherr 98,