Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

16
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18 Omar Meqdadi Department of Computer Science and Software Engineering University of Wisconsin-Platteville

description

Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18. Omar Meqdadi Department of Computer Science and Software Engineering University of Wisconsin-Platteville. Chapter 4: Network Layer. Chapter goals: understand principles behind network layer services: - PowerPoint PPT Presentation

Transcript of Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Page 1: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Data Communications and Computer Networks

Chapter 4CS 3830 Lecture 18

Omar Meqdadi

Department of Computer Science and Software Engineering University of Wisconsin-Platteville

Page 2: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-2

Chapter 4: Network Layer

Chapter goals: understand principles behind network

layer services: network layer service models forwarding versus routing routing (path selection) dealing with scale advanced topics: IPv6, mobility

instantiation, implementation in the Internet

Page 3: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-3

Chapter 4: Network Layer

4. 1 Introduction 4.2 Virtual circuit

and datagram networks

4.4 IP: Internet Protocol Datagram format IPv4 addressing IPv6

4.5 Routing algorithms Link state Distance Vector Hierarchical routing

4.6 Routing in the Internet RIP OSPF BGP

4.7 Broadcast and multicast routing

Page 4: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-4

Network layer transport segment from sending to receiving

host on sending side encapsulates segments into

datagrams on rcving side, delivers segments to transport

layer network layer protocols in every host, router router examines header fields in all IP

datagrams passing through it

application

transportnetworkdata linkphysical

application

transportnetworkdata linkphysical

networkdata linkphysical network

data linkphysical

networkdata linkphysical

networkdata linkphysical

networkdata linkphysical

networkdata linkphysical

networkdata linkphysical

networkdata linkphysical

networkdata linkphysical

networkdata linkphysicalnetwork

data linkphysical

Page 5: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-5

Two Key Network-Layer Functions

forwarding: move packets from router’s input to appropriate router output

routing: determine route taken by packets from source to dest.

routing algorithms

analogy:

routing: process of planning trip from source to dest

forwarding: process of getting through single interchange

Page 6: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-6

123

0111

value in arrivingpacket’s header

routing algorithm

local forwarding tableheader value output link

0100010101111001

3221

Interplay between routing and forwarding

Page 7: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-7

Connection setup

3rd important function in some network architectures: ATM, frame relay, X.25

before datagrams flow, two end hosts and intervening routers establish virtual connection routers get involved

network vs transport layer connection service: network: between two hosts (may also involve

intervening routers in case of VCs) transport: between two processes

Page 8: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-8

Chapter 4: Network Layer

4. 1 Introduction 4.2 Virtual circuit

and datagram networks

4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6

4.5 Routing algorithms Link state Distance Vector Hierarchical routing

4.6 Routing in the Internet RIP OSPF BGP

4.7 Broadcast and multicast routing

Page 9: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-9

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

Page 10: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-10

Virtual circuits

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)

“source-to-dest path behaves much like telephone circuit” performance-wise

Page 11: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-11

VC implementation

a VC consists of:1. path from source to destination2. VC numbers, one number for each link along

path3. 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

Page 12: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-12

Forwarding table

12 22 32

1 23

VC number

interfacenumber

Incoming interface Incoming VC # Outgoing interface Outgoing VC #

1 12 3 222 63 1 18 3 7 2 171 97 3 87… … … …

Forwarding table innorthwest router:

Routers maintain connection state information!

Page 13: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-13

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

transportnetworkdata linkphysical

application

transportnetworkdata linkphysical

1. Send data 2. Receive data

Page 14: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-14

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

4 billion possible entries

Page 15: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-15

Longest prefix matching

Prefix Match Link Interface 11001000 00010111 00010 0 11001000 00010111 00011000 1 11001000 00010111 00011 2 otherwise 3

DA: 11001000 00010111 00011000 10101010

Examples

DA: 11001000 00010111 00010110 10100001 Which interface?

Which interface?

Page 16: Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 18

Network Layer 4-16

Datagram or VC network: why?

Datagram (Internet) data exchange among

computers “elastic” service, no

strict timing req. “smart” end systems

(computers) can adapt, perform

control, error recovery simple inside network,

complexity at “edge” many link types

different characteristics uniform service difficult

VC (ATM) evolved from telephony human conversation:

strict timing, reliability requirements

need for guaranteed service

“dumb” end systems telephones complexity inside

network