13
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2002. A note on the use of these ppt slides: We’re making these slides freely available to all (faculty, students, readers). They’re in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following: If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we’d like people to use our book!) If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK/KWR All material copyright 1996-2002 J.F Kurose and K.W. Ross, All Rights Reserved Routing Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links link cost: delay, $ cost, or congestion level ! " ! # $ % & ( ) * + , + , “good” path: typically means minimum cost path other def’s possible + Routing Algorithm classification Global or decentralized information? Global: all routers have complete topology, link cost info “link state” algorithms 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 A Link-State Routing Algorithm Dijkstra’s algorithm net topology, link costs known to all nodes accomplished via “link state broadcast” 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 v N: set of nodes whose least cost path definitively known

Chapter 4 Routing Network Layer - University of Windsorweb2.uwindsor.ca/courses/engineering/ktepe/compnets/routing.pdf · BGP routes to networks (ASs), not individual hosts E.g.,

  • Upload
    others

  • View
    14

  • Download
    0

Embed Size (px)

Citation preview

� ���������� ��

Chapter 4Network Layer

Computer Networking: A Top Down Approach Featuring the Internet, 2nd edition. Jim Kurose, Keith RossAddison-Wesley, July 2002.

A note on the use of these ppt slides:We’re making these slides freely available to all (faculty, students, readers). They’re in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following:� If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we’d like people to use our book!)� If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material.

Thanks and enjoy! JFK/KWR

All material copyright 1996-2002J.F Kurose and K.W. Ross, All Rights Reserved

� ���������� ��

Routing

Graph abstraction for routing algorithms:

❒ graph nodes are routers❒ graph edges are

physical links❍ link cost: delay, $ cost, or

congestion level

� ���������� �������������������� ��!�������"����

�������!��� ���� �������#

$����������� ��

%

&'

()

*

�+

,+

,

❒ “good” path:❍ typically means minimum

cost path❍ other def’s possible

� ���������� �+

Routing Algorithm classification

Global or decentralized information?

Global:❒ all routers have complete

topology, link cost info❒ “link state” algorithmsDecentralized:❒ 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 timeDynamic:❒ routes change more

quickly❍ periodic update❍ in response to link

cost changes

� ���������� �

A Link-State Routing Algorithm

Dijkstra’s algorithm❒ net topology, link costs

known to all nodes❍ accomplished via “link

state broadcast” ❍ 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 v

❒ N: set of nodes whose least cost path definitively known

� ���������� �,

Dijsktra’s Algorithm

1 Initialization:2 N = {A} 3 for all nodes v 4 if v adjacent to A 5 then D(v) = c(A,v) 6 else D(v) = infinity 7 8 Loop9 find w not in N such that D(w) is a minimum 10 add w to N 11 update D(v) for all v adjacent to w and not in N: 12 D(v) = min( D(v), D(w) + c(w,v) ) 13 /* new cost to v is either old cost to v or known 14 shortest path cost to w plus cost from w to v */ 15 until all nodes in N

� ���������� �-

Dijkstra’s algorithm: example

Step012345

start NA

ADADE

ADEBADEBC

ADEBCF

D(B),p(B)2,A2,A2,A

D(C),p(C)5,A4,D3,E3,E

D(D),p(D)1,A

D(E),p(E)infinity

2,D

D(F),p(F)infinityinfinity

4,E4,E4,E

%

&'

()

*

�+

,+

,

� ���������� �.

Dijkstra’s algorithm, discussion

Algorithm complexity: n nodes❒ each iteration: need to check all nodes, w, not in N❒ n*(n+1)/2 comparisons: O(n**2)❒ more efficient implementations possible: O(nlogn)

Oscillations possible:❒ e.g., link cost = amount of carried traffic

%

'

(

)� �/�

�0

� �

0 0

%

'

(

)�/� 0

00�/� �

%

'

(

)0 �/�

�/��0 0

%

'

(

)�/� 0

�0�/� �

���������1 �� �� ����

�������1 �� �� ���� 1 �� �� ����

� ���������� �2

Distance Vector Routing Algorithm

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:

D (Y,Z)X

distance from X toY, via Z as next hop

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

w

=

=

+

� ���������� �3

Distance Table: example

%

& '

().

2

D ()

A

B

C

D

A

1

7

6

4

B

14

8

9

11

D

5

5

4

2

Ecost to destination via

dest

ina t

ion

D (C,D)E

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

w== 2+2 = 4

D (A,D)E

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

w== 2+3 = 5

D (A,B)E

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

w== 8+6 = 14

����4

����4� ���������� ��0

Distance Vector Algorithm: example

5 6

��

.

7

� ���������� ���

Distance Vector Algorithm: example

5 6

��

.

7

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

= 7+1 = 8

Z

D (Z,Y)X

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

= 2+1 = 3

Y

� ���������� ���

Distance Vector: link cost changes

Link cost changes:❒ node detects local link cost change ❒ updates distance table (line 15)❒ if cost change in least cost path, notify

neighbors (lines 23,24)

5 6

,0

7�

������������� �����������

�������8���!����

� ���������� ��+

Distance Vector: link cost changes

Link cost changes:❒ good news travels fast ❒ bad news travels slow -

“count to infinity” problem!5 6

,0

7-0

��������� ��������

��4

� ���������� ��

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 count to infinity

problem?

5 6

,0

7-0

������������� ������

� ���������� ��,

Comparison of LS and DV algorithms

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:❍ node can advertise

incorrect link cost❍ 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

� ���������� ��-

Hierarchical Routing

scale: with 200 million destinations:

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

❒ routing table exchange would swamp links!

administrative autonomy❒ internet = network of networks❒ each network admin may want

to control routing in its own network

Our routing study thus far - idealization ❒ all routers identical❒ network “flat”… not true in practice

,

� ���������� ��.

Hierarchical Routing

❒ aggregate routers into regions, “autonomous systems” (AS)

❒ routers in same AS run same routing protocol

❍ “intra-AS” routingprotocol

❍ 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 routingprotocol with other gateway routers

��������������

� ���������� ��2

Intra-AS and Inter-AS routing

� ��������9���!��� ������%: ��������� ��������� ���8��9���!��� ������%: ������������������������������%:

������%: ;������%: ���������

�������%#

������������

���������

����� �������

<

<

��(

%

)

%#�

%#

(#<)#�

<

� ���������� ��3

Intra-AS and Inter-AS routing

= �����

<

<

��(

%

)�

%#�

%#

(#<)#�

<

= �����

>�����%: �������������%: %

>�����%:�������<������%���)

>�����%: �������������%: )

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

� ���������� ��0

Routing in the Internet

❒ The Global Internet consists of Autonomous Systems (AS) interconnected with each other:❍ Stub AS: small corporation: one connection to other

AS’s❍ Multihomed AS: large corporation (no transit):

multiple connections to other AS’s❍ Transit AS: provider, hooking many AS’s together

❒ Two-level routing: ❍ Intra-AS: administrator responsible for choice of

routing algorithm within network❍ Inter-AS: unique standard for inter-AS routing: BGP

-

� ���������� ���

Internet AS Hierarchy>�����%: <�������?�������������"�������

>�����%: ����������������"�������

� ���������� ���

Intra-AS Routing

❒ Also known as Interior Gateway Protocols (IGP)❒ Most common Intra-AS routing protocols:

❍ RIP: Routing Information Protocol

❍ OSPF: Open Shortest Path First

❍ IGRP: Interior Gateway Routing Protocol (Cisco proprietary)

� ���������� ��+

RIP ( Routing Information Protocol)

❒ Distance vector algorithm❒ Included in BSD-UNIX Distribution in 1982❒ Distance metric: # of hops (max = 15 hops)

❍ Can you guess why?

❒ Distance vectors: exchanged among neighbors every 30 sec via Response Message (also called advertisement)

❒ Each advertisement: list of up to 25 destination nets within AS

� ���������� ��

RIP: Example

���������������� ����������� ��������������

� � �� � �� � �� �� �� � � � ����

� ? �

@

%

(

' )

$��������<����'

.

� ���������� ��,

RIP: Example

���������������� ����������� ��������������

� � �� � �� �� � � �� �� � � � ����

$��������<����'

� ? �

@

%

(

' )

������������ � �� � �� !"� � � ���

��#������� ������� ����

� ���������� ��-

RIP: Link Failure and Recovery

If no advertisement heard after 180 sec --> neighbor/link declared dead❍ routes via neighbor invalidated❍ new advertisements sent to neighbors❍ neighbors in turn send out new advertisements (if

tables changed)❍ link failure info quickly propagates to entire net❍ poison reverse used to prevent ping-pong loops

(infinite distance = 16 hops)

� ���������� ��.

RIP Table processing

❒ RIP routing tables managed by application-levelprocess called route-d (daemon)

❒ advertisements sent in UDP packets, periodically repeated

����� ��

����

�������!����������>A"��<��

B ��������C 'A"

������

����� ��

����

��������>A"

B ��������C 'A"

������

!�����������<��

� ���������� ��2

RIP Table example (continued)

Router: giroflee.eurocom.fr

❒ Three attached class C networks (LANs)❒ Router only knows routes to attached LANs❒ Default router used to “go up”❒ Route multicast address: 224.0.0.0❒ Loopback interface (for debugging)

Destination Gateway Flags Ref Use Interface -------------------- -------------------- ----- ----- ------ ---------127.0.0.1 127.0.0.1 UH 0 26492 lo0 192.168.2. 192.168.2.5 U 2 13 fa0 193.55.114. 193.55.114.6 U 3 58503 le0 192.168.3. 192.168.3.5 U 2 25 qaa0 224.0.0.0 193.55.114.6 U 3 0 le0 default 193.55.114.129 UG 0 143454

2

� ���������� ��3

OSPF (Open Shortest Path First)

❒ “open”: publicly available❒ Uses Link State algorithm

❍ LS packet dissemination❍ Topology map at each node❍ Route computation using Dijkstra’s algorithm

❒ OSPF advertisement carries one entry per neighbor router

❒ Advertisements disseminated to entire AS (via flooding)❍ Carried in OSPF messages directly over IP (rather than TCP or

UDP

� ���������� �+0

OSPF “advanced” features (not in RIP)

❒ Security: all OSPF messages authenticated (to prevent malicious intrusion)

❒ Multiple same-cost paths allowed (only one path in RIP)❒ For each link, multiple cost metrics for different TOS

(e.g., satellite link cost set “low” for best effort; high for real time)

❒ Integrated uni- and multicast support: ❍ Multicast OSPF (MOSPF) uses same topology data

base as OSPF❒ Hierarchical OSPF in large domains.

� ���������� �+�

Hierarchical OSPF

� ���������� �+�

Hierarchical OSPF

❒ Two-level hierarchy: local area, backbone.❍ Link-state advertisements only in area ❍ each nodes has detailed area topology; only know

direction (shortest path) to nets in other areas.❒ Area border routers: “summarize” distances to nets in

own area, advertise to other Area Border routers.❒ Backbone routers: run OSPF routing limited to

backbone.❒ Boundary routers: connect to other AS’s.

3

� ���������� �++

Inter-AS routing in the Internet: BGP

Figure 4.5.2-new2: BGP use for inter-domain routing

%: ��D : A*

������%:

�������"

%: ��$>A������%:

�������" )� A

%: +�D : A*������%:

�������"

)� A

$ � $�

$+

$

$,

� ���������� �+

Internet inter-AS routing: BGP

❒ BGP (Border Gateway Protocol): the de facto standard

❒ Path Vector protocol:❍ similar to Distance Vector protocol❍ each Border Gateway broadcast to neighbors

(peers) entire path (i.e., sequence of AS’s) to destination

❍ BGP routes to networks (ASs), not individual hosts❍ E.g., Gateway X may send its path to dest. Z:

Path (X,Z) = X,Y1,Y2,Y3,…,Z

� ���������� �+,

Internet inter-AS routing: BGP

Suppose: gateway X send its path to peer gateway W❒ W may or may not select path offered by X

❍ cost, policy (don’t route via competitors AS), loop prevention reasons.

❒ If W selects path advertised by X, then:Path (W,Z) = w, Path (X,Z)

❒ Note: X can control incoming traffic by controlling it route advertisements to peers:❍ e.g., don’t want to route traffic to Z -> don’t advertise

any routes to Z

� ���������� �+-

BGP: controlling who routes to you

Figure 4.5-BGPnew: a simple BGP scenario

%

)

(

E5

7

legend:

customer network:

provider network

❒ A,B,C are provider networks❒ X,W,Y are customer (of provider networks)❒ X is dual-homed: attached to two networks

❍ X does not want to route from B via X to C❍ .. so X will not advertise to B a route to C

�0

� ���������� �+.

BGP: controlling who routes to you

Figure 4.5-BGPnew: a simple BGP scenario

%

)

(

E5

7

legend:

customer network:

provider network

❒ A advertises to B the path AW ❒ B advertises to X the path BAW ❒ Should B advertise to C the path BAW?

❍ No way! B gets no “revenue” for routing CBAW since neither W nor C are B’s customers

❍ B wants to force C to route to w via A❍ B wants to route only to/from its customers!

� ���������� �+2

BGP operation

Q: What does a BGP router do?❒ Receiving and filtering route advertisements from

directly attached neighbor(s). ❒ Route selection.

❍ To route to destination X, which path )of several advertised) will be taken?

❒ Sending route advertisements to neighbors.

� ���������� �+3

BGP messages

❒ BGP messages exchanged using TCP.❒ BGP messages:

❍ OPEN: opens TCP connection to peer and authenticates sender

❍ UPDATE: advertises new path (or withdraws old)❍ KEEPALIVE keeps connection alive in absence of

UPDATES; also ACKs OPEN request❍ NOTIFICATION: reports errors in previous msg; also

used to close connection

� ���������� � 0

Mobility: approaches

❒ Let routing handle it: routers advertise permanent address of mobile-nodes-in-residence via usual routing table exchange.❍ routing tables indicate where each mobile located❍ no changes to end-systems

❒ Let end-systems handle it: ❍ indirect routing: communication from correspondent

to mobile goes through home agent, then forwarded to remote

❍ direct routing: correspondent gets foreign address of mobile, sends directly to mobile

��

� ���������� � �

Mobility: approaches

❒ Let routing handle it: routers advertise permanent address of mobile-nodes-in-residence via usual routing table exchange.❍ routing tables indicate where each mobile located❍ no changes to end-systems

❒ let end-systems handle it: ❍ indirect routing: communication from correspondent

to mobile goes through home agent, then forwarded to remote

❍ direct routing: correspondent gets foreign address of mobile, sends directly to mobile

���� ���<��

��� ��������!� �<����

� ���������� � �

Mobility: registration

End result:❒ Foreign agent knows about mobile❒ Home agent knows location of mobile

���������������

��� ��������8�������������

� �<��� ���� ��!���������������������8�������������

!����������� ���� ����� ��������� �������� �<���������������� ���������

� ���������� � +

Mobility via Indirect Routing

���������������

��� ��������

8�������������

+

����������������������� ������������ ���������!� �<���

��� ����������� ������ ����;!���������!�����������

!������������� ��8���� ����;!���������� �<���

� �<�������������� ����� ������������

� ���������� �

Indirect Routing: comments

❒ Mobile uses two addresses:❍ permanent address: used by correspondent (hence

mobile location is transparent to correspondent)❍ care-of-address: used by home agent to forward

datagrams to mobile❒ foreign agent functions may be done by mobile itself❒ triangle routing: correspondent-home-network-mobile

❍ inefficient when correspondent, mobile are in same network

��

� ���������� � ,

Forwarding datagrams to remote mobile

A��� ���������������2#��3# 0#�2-

(�����!��������.3#��3#�+#�

�������2#��3# 0#�2-

�� �������<� ������������

�����.3#��3#�+#� �������2#��3# 0#�2-

�� �������<���� ��������!��������������� ������������ ���

�������2#��3# 0#�2-

!����������������� �<����� ���

� ���������� � -

Indirect Routing: moving between networks

❒ suppose mobile user moves to another network❍ registers with new foreign agent❍ new foreign agent registers with home agent❍ home agent update care-of-address for mobile❍ packets continue to be forwarded to mobile (but with

new care-of-address)

❒ Mobility, changing foreign networks transparent: on going connections can be maintained!

� ���������� � .

Mobility via Direct Routing

���������������

��� ��������

8�������������

� ��������������������;�� ��8��!��������������!� �<���

������������!���������!�����������

!������������� ��8���� ����;!���������� �<���

� �<�������������� ����� ������������

+

� ���������� � 2

Mobility via Direct Routing: comments

❒ overcome triangle routing problem

❒ non-transparent to correspondent:correspondent must get care-of-address from home agent❍ What happens if mobile changes networks?

�+

� ���������� � 3

Mobile IP

❒ RFC 3220❒ has many features we’ve seen:

❍ home agents, foreign agents, foreign-agent registration, care-of-addresses, encapsulation (packet-within-a-packet)

❒ three components to standard:❍ agent discovery❍ registration with home agent❍ indirect routing of datagrams

� ���������� �,0

Mobile IP: agent discovery

❒ agent advertisement: foreign/home agents advertise service by broadcasting ICMP messages (typefield = 9)

RBHFMGV bits reserved

type = 16

type = 9 code = 0 = 9

checksum = 9

router address

standard ICMP fields

mobility agent advertisement

extension

length sequence #

registration lifetime

0 or more care-of-addresses

0 8 16 24

$ <�����������������������

= ;*<������� ����F��!�����������

� ���������� �,�

Mobile IP: registration example

8��������������.3#��3#�+F� ��� ������

= %���2#��3# 0#.!�����������

(D %�.3#��3#�+#�

COA: 79.129.13.2 ….

>(G A�������8#G �<��������

G %���2#��3# 0#�2-

���������������#

COA: 79.129.13.2 HA: 128.119.40.7 MA: 128.119.40.186 Lifetime: 9999 identification:714 ….

���������������#

COA: 79.129.13.2 HA: 128.119.40.7 MA: 128.119.40.186 Lifetime: 9999 identification: 714 encapsulation format ….

�����������������

HA: 128.119.40.7 MA: 128.119.40.186 Lifetime: 4999 Identification: 714 encapsulation format ….

�����������������

HA: 128.119.40.7 MA: 128.119.40.186 Lifetime: 4999 Identification: 714 ….

��� �