1 / 37

# Chapter 4 roadmap - PowerPoint PPT Presentation

Chapter 4 roadmap. 4.1 Introduction and Network Service Models 4.2 Routing Principles Link state routing Distance vector routing 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol 4.5 Routing in the Internet 4.6 What’s Inside a Router 4.7 IPv6 4.8 Multicast Routing

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

4.1 Introduction and Network Service Models

4.2 Routing Principles

• Distance vector routing

4.3 Hierarchical Routing

4.4 The Internet (IP) Protocol

4.5 Routing in the Internet

4.6 What’s Inside a Router

4.7 IPv6

4.8 Multicast Routing

4.9 Mobility

Network Layer

Global or decentralized information?

Global:

all routers have complete topology, link cost info

Decentralized:

router knows physically-connected neighbors, link costs to neighbors

iterative process of computation, exchange of info with neighbors

“distance vector” algorithms

Static or dynamic?

Static:

routes change slowly over time

Dynamic:

routes change more quickly

periodic update

in response to link cost changes

Routing Algorithm classification

Network Layer

Dijkstra’s algorithm

net topology, link costs known to all nodes

all nodes have same info

computes least cost paths from one node (‘source”) to all other nodes

gives routing table for that node

iterative: after k iterations, know least cost path to k dest.’s

Notation:

c(i,j): link cost from node i to j. cost infinite if not direct neighbors

D(v): current value of cost of path from source to dest. v

p(v): predecessor node along path from source to v, that is next to v

N: set of nodes whose least cost path definitively known

Network Layer

A

D

E

B

F

C

Dijkstra’s algorithm: example

D(B),p(B)

2,A

2,A

2,A

D(D),p(D)

1,A

D(C),p(C)

5,A

4,D

3,E

3,E

D(E),p(E)

infinity

2,D

Step

0

1

2

3

4

5

start N

A

D(F),p(F)

infinity

infinity

4,E

4,E

4,E

5

3

5

2

2

1

3

1

2

1

Network Layer

iterative:

continues until no nodes exchange info.

self-terminating: no “signal” to stop

asynchronous:

nodes need not exchange info/iterate in lock step!

distributed:

each node communicates only with directly-attached neighbors

Distance Table data structure

each node has its own

row for each possible destination

column for each directly-attached neighbor to node

example: in node X, for dest. Y via neighbor Z:

distance from X to

Y, via Z as next hop

X

=

D (Y,Z)

Z

c(X,Z) + min {D (Y,w)}

=

w

Distance Vector Routing Algorithm

Network Layer

cost to destination via

E

D ()

A

B

C

D

A

1

7

6

4

B

14

8

9

11

D

5

5

4

2

destination

A

D

B

E

C

E

E

E

D (C,D)

D (A,D)

D (A,B)

D

D

B

c(E,D) + min {D (C,w)}

c(E,D) + min {D (A,w)}

c(E,B) + min {D (A,w)}

=

=

=

w

w

w

=

=

=

8+6 = 14

2+2 = 4

2+3 = 5

Distance Table: example

1

7

2

8

1

2

loop!

loop!

Network Layer

Iterative, asynchronous: each local iteration caused by:

message from neighbor: its least cost path change from neighbor

Distributed:

each node notifies neighbors only when its least cost path to any destination changes

neighbors then notify their neighbors if necessary

wait for (change in local link cost of msg from neighbor)

recompute distance table

if least cost path to any dest has changed, notify neighbors

Distance Vector Routing: overview

Each node:

Network Layer

2

1

7

Y

Z

X

X

c(X,Y) + min {D (Z,w)}

c(X,Z) + min {D (Y,w)}

D (Y,Z)

D (Z,Y)

=

=

w

w

=

=

2+1 = 3

7+1 = 8

X

Z

Y

Distance Vector Algorithm: example

Network Layer

X

Z

Y

• node detects local link cost change
• updates distance table (line 15)
• if cost change in least cost path, notify neighbors (lines 23,24)

1

4

1

50

algorithm

terminates

“good

news

travels

fast”

Network Layer

X

Z

Y

• good news travels fast
• bad news travels slow - “count to infinity” problem!

60

4

1

50

algorithm

continues

on!

Network Layer

X

Z

Y

Distance Vector: poisoned reverse

If Z routes through Y to get to X :

• Z tells Y its (Z’s) distance to X is infinite (so Y won’t route to X via Z)
• Will this completely solve the count to infinity problem?

60

4

1

50

algorithm

terminates

Network Layer

Message complexity

LS: with n nodes, E links, O(nE) msgs sent each

DV: exchange between neighbors only

convergence time varies

Speed of Convergence

LS: O(n2) algorithm requires O(nE) msgs

may have oscillations

DV: convergence time varies

may be routing loops

count-to-infinity problem

Robustness: what happens if router malfunctions?

LS:

each node computes only its own table

DV:

DV node can advertise incorrect path cost

each node’s table used by others

error propagate thru network

Comparison of LS and DV algorithms

Network Layer

4.1 Introduction and Network Service Models

4.2 Routing Principles

4.3 Hierarchical Routing

4.4 The Internet (IP) Protocol

4.5 Routing in the Internet

4.6 What’s Inside a Router

4.7 IPv6

4.8 Multicast Routing

4.9 Mobility

Network Layer

scale: with 200 million destinations:

can’t store all dest’s in routing tables!

routing table exchange would swamp links!

internet = network of networks

each network admin may want to control routing in its own network

Hierarchical Routing

Our routing study thus far - idealization

• all routers identical
• network “flat”

… not true in practice

Network Layer

routers in same AS run same routing protocol

“intra-AS” routing protocol

routers in different AS can run different intra-AS routing protocol

special routers in AS

run intra-AS routing protocol with all other routers in AS

also responsible for routing to destinations outside AS

run inter-AS routing protocol with other gateway routers

gateway routers

Hierarchical Routing

Network Layer

c

b

b

c

a

A.c

A.a

C.b

B.a

Intra-AS and Inter-AS routing
• Gateways:
• perform inter-AS routing amongst themselves
• perform intra-AS routers with other routers in their AS

b

a

a

C

B

d

A

network layer

inter-AS, intra-AS routing in

gateway A.c

physical layer

Network Layer

Inter-AS

routing

between

A and B

b

c

a

a

C

b

B

b

c

a

d

Host

h1

A

A.a

A.c

C.b

B.a

Intra-AS and Inter-AS routing

Host

h2

Intra-AS routing

within AS B

Intra-AS routing

within AS A

• We’ll examine specific inter-AS and intra-AS Internet routing protocols shortly

Network Layer

4.1 Introduction and Network Service Models

4.2 Routing Principles

4.3 Hierarchical Routing

4.4 The Internet (IP) Protocol

• 4.4.2 Moving a datagram from source to destination
• 4.4.3 Datagram format
• 4.4.4 IP fragmentation
• 4.4.5 ICMP: Internet Control Message Protocol
• 4.4.6 DHCP: Dynamic Host Configuration Protocol
• 4.4.7 NAT: Network Address Translation

4.5 Routing in the Internet

4.6 What’s Inside a Router

4.7 IPv6

4.8 Multicast Routing

4.9 Mobility

Network Layer

Host, router network layer functions:
• ICMP protocol
• error reporting
• router “signaling”
• IP protocol
• datagram format
• packet handling conventions
• Routing protocols
• path selection
• RIP, OSPF, BGP

forwarding

table

The Internet Network layer

Transport layer: TCP, UDP

Network

layer

physical layer

Network Layer

IP address: 32-bit identifier for host, router interface

interface: connection between host/router and physical link

router’s typically have multiple interfaces

host may have multiple interfaces

IP addresses associated with each interface

223.1.1.2

223.1.2.2

223.1.2.1

223.1.3.2

223.1.3.1

223.1.3.27

223.1.1.1

223.1.2.9

223.1.1.4

223.1.1.3

223.1.1.1 = 11011111 00000001 00000001 00000001

223

1

1

1

Network Layer

network part (high order bits)

host part (low order bits)

What’s a network ? (from IP address perspective)

device interfaces with same network part of IP address

can physically reach each other without intervening router

223.1.1.1

223.1.2.1

223.1.1.2

223.1.2.9

223.1.1.4

223.1.2.2

223.1.1.3

223.1.3.27

LAN

223.1.3.2

223.1.3.1

network consisting of 3 IP networks

(for IP addresses starting with 223,

first 24 bits are network address)

Network Layer

How to find the networks?

Detach each interface from router, host

create “islands of isolated networks

223.1.1.2

223.1.1.1

223.1.1.4

223.1.1.3

223.1.7.0

223.1.9.2

223.1.9.1

223.1.7.1

223.1.8.1

223.1.8.0

223.1.2.6

223.1.3.27

Interconnected

system consisting

of six networks

223.1.2.1

223.1.2.2

223.1.3.1

223.1.3.2

Network Layer

1110

network

host

110

network

10

host

given notion of “network”, let’s re-examine IP addresses:

class

1.0.0.0 to

127.255.255.255

A

network

0

host

128.0.0.0 to

191.255.255.255

B

192.0.0.0 to

223.255.255.255

C

224.0.0.0 to

239.255.255.255

D

32 bits

Network Layer

host

part

network

part

11001000 0001011100010000 00000000

200.23.16.0/23

• e.g., class B net allocated enough addresses for 65K hosts, even if only 2K hosts in that network
• CIDR:Classless InterDomain Routing
• network portion of address of arbitrary length
• address format: a.b.c.d/x, where x is # bits in network portion of address

Network Layer

IP addresses: how to get one?

Q: How does host get IP address?

• hard-coded by system admin in a file
• Wintel: control-panel->network->configuration->tcp/ip->properties
• UNIX: /etc/rc.config
• DHCP:Dynamic Host Configuration Protocol: dynamically get address from as server
• “plug-and-play”

(more shortly)

Network Layer

IP addresses: how to get one?

Q: How does network get network part of IP addr?

A: gets allocated portion of its provider ISP’s address space

ISP's block 11001000 00010111 00010000 00000000 200.23.16.0/20

Organization 0 11001000 00010111 00010000 00000000 200.23.16.0/23

Organization 1 11001000 00010111 00010010 00000000 200.23.18.0/23

Organization 2 11001000 00010111 00010100 00000000 200.23.20.0/23

... ….. …. ….

Organization 7 11001000 00010111 00011110 00000000 200.23.30.0/23

Network Layer

200.23.16.0/23

200.23.18.0/23

200.23.30.0/23

200.23.20.0/23

.

.

.

.

.

.

information:

Organization 0

Organization 1

“Send me anything

beginning

200.23.16.0/20”

Organization 2

Fly-By-Night-ISP

Internet

Organization 7

“Send me anything

beginning

199.31.0.0/16”

ISPs-R-Us

Network Layer

200.23.16.0/23

200.23.18.0/23

200.23.30.0/23

200.23.20.0/23

.

.

.

.

.

.

ISPs-R-Us has a more specific route to Organization 1

Organization 0

“Send me anything

beginning

200.23.16.0/20”

Organization 2

Fly-By-Night-ISP

Internet

Organization 7

“Send me anything

beginning 199.31.0.0/16

or 200.23.18.0/23”

ISPs-R-Us

Organization 1

Network Layer

Q: How does an ISP get block of addresses?

A: ICANN: Internet Corporation for Assigned

Names and Numbers

• manages DNS
• assigns domain names, resolves disputes

Network Layer

IP datagram:

B

E

A

source

misc

fields

dest

data

223.1.1.1

223.1.2.1

223.1.1.2

223.1.2.9

223.1.1.4

223.1.2.2

223.1.1.3

223.1.3.27

Dest. Net. next router Nhops

223.1.1 1

223.1.3.2

223.1.3.1

223.1.2 223.1.1.4 2

223.1.3 223.1.1.4 2

Getting a datagram from source to dest.

forwarding table in A

• datagram remains unchanged, as it travels source to destination
• addr fields of interest here

Network Layer

E

B

A

223.1.1.1

223.1.2.1

223.1.1.2

223.1.2.9

223.1.1.4

223.1.2.2

223.1.1.3

223.1.3.27

Dest. Net. next router Nhops

223.1.1 1

223.1.3.2

223.1.3.1

223.1.2 223.1.1.4 2

223.1.3 223.1.1.4 2

Getting a datagram from source to dest.

forwarding table in A

misc

fields

data

223.1.1.1

223.1.1.3

Starting at A, send IP datagram addressed to B:

• look up net. address of B in forwarding table
• find B is on same net. as A
• link layer will send datagram directly to B inside link-layer frame
• B and A are directly connected

Network Layer

E

A

B

223.1.1.1

223.1.2.1

223.1.1.2

223.1.2.9

223.1.1.4

223.1.2.2

223.1.1.3

223.1.3.27

Dest. Net. next router Nhops

223.1.1 1

223.1.3.2

223.1.3.1

223.1.2 223.1.1.4 2

223.1.3 223.1.1.4 2

Getting a datagram from source to dest.

forwarding table in A

misc

fields

data

223.1.1.1

223.1.2.3

Starting at A, dest. E:

• look up network address of E in forwarding table
• E on different network
• A, E not directly attached
• routing table: next hop router to E is 223.1.1.4
• datagram arrives at 223.1.1.4
• continued…..

Network Layer

Dest. Net router Nhops interface

E

B

A

223.1.1 - 1 223.1.1.4

223.1.2 - 1 223.1.2.9

223.1.3 - 1 223.1.3.27

223.1.1.1

223.1.2.1

223.1.1.2

223.1.2.9

223.1.1.4

223.1.2.2

223.1.1.3

223.1.3.27

223.1.3.2

223.1.3.1

Getting a datagram from source to dest.

forwarding table in router

misc

fields

data

223.1.1.1

223.1.2.3

Arriving at 223.1.4, destined for 223.1.2.2

• look up network address of E in router’s forwarding table
• E on same network as router’s interface 223.1.2.9
• router, E directly attached
• link layer sends datagram to 223.1.2.2 inside link-layer frame via interface 223.1.2.9
• datagram arrives at 223.1.2.2!!! (hooray!)

Network Layer

IP protocol version

number

32 bits

total datagram

length (bytes)

(bytes)

type of

service

len

ver

length

for

fragmentation/

reassembly

fragment

offset

“type” of data

flgs

16-bit identifier

max number

remaining hops

(decremented at

each router)

upper

layer

time to

live

Internet

checksum

upper layer protocol

E.g. timestamp,

record route

taken, specify

list of routers

to visit.

Options (if any)

data

(variable length,

typically a TCP

or UDP segment)

IP datagram format

• 20 bytes of TCP
• 20 bytes of IP
• = 40 bytes + app layer overhead

Network Layer

large IP datagram divided (“fragmented”) within net

one datagram becomes several datagrams

“reassembled” only at final destination

IP header bits used to identify, order related fragments

IP Fragmentation & Reassembly

fragmentation:

in: one large datagram

out: 3 smaller datagrams

reassembly

Network Layer

length

=1500

length

=1500

length

=4000

length

=1040

ID

=x

ID

=x

ID

=x

ID

=x

fragflag

=1

fragflag

=1

fragflag

=0

fragflag

=0

offset

=0

offset

=1480

offset

=2960

offset

=0

One large datagram becomes

several smaller datagrams

IP Fragmentation and Reassembly

Example

• 4000 byte datagram
• MTU = 1500 bytes

Network Layer