0% found this document useful (0 votes)
6 views16 pages

3.6 -Path Vector Routing

Uploaded by

SUDHAN R CSE
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
0% found this document useful (0 votes)
6 views16 pages

3.6 -Path Vector Routing

Uploaded by

SUDHAN R CSE
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/ 16

Path Vector Routing

 It maintains path information that gets updated dynamically.


 Updates which have looped through network and returned to same
node are easily detected and discarded.
 This algorithm is sometimes used in Bellman–Ford routing
algorithms to avoid "Count to Infinity" problems.
 It is different from distance vector routing and link state
routing.
 Each entry in routing table contains destination network, next
router and path to reach the destination.
1 Example: Border Gateway Protocol (BGP)
Border Gateway Protocol
 BGP4 is the only interdomain routing protocol used in Internet.
 BGP4 is based on the path-vector algorithm.
 BGP - Complex protocol.
 Figure 20.24 shows an example of an internet with four autonomous
systems.
AS2,AS3, and AS4 are stub autonomous systems;
AS1 is a transient (temporary)one.
 Example- data exchange between AS2, AS3, and AS4 should pass
through AS1.
 Each autonomous system uses one of two common intradomain
protocols, (RIP or
OSPF )
 Each router in each AS knows how to reach a network in its own AS,
2
but it does not
Figure 20.24: A sample internet with four ASs

20.3
To enable each router to route a packet to any network in internet
 First install a variation of BGP4, called external BGP (eBGP), on each
border
router (the one at the edge of each AS which is connected to a
router at another AS).
 Second , install second variation of BGP, called internal BGP (iBGP),
on all routers.
 Border routers will be running three routing protocols (intradomain,
eBGP, and
iBGP), but other routers are running two protocols (intradomain and
20.4
Figure 20.25: eBGP operation

5
Operation of External BGP (eBGP)

 The eBGP variation of BGP allows two physically connected border routers in two different ASs to
form pairs of eBGP
speakers and exchange messages.
 Routers in Figure 20.24 form three pairs: R1-R5, R2-R6, and R4-R9.
 The connection between these pairs is established over three physical WANs (N5,N6, and N7).
 There is a need for logical TCP connection to be created over physical connection to make the
exchange of information.
 Each logical connection in BGP - referred to as a session.
 Three sessions are shown in Figure 20.25. circled number defines the sending router in each
case.
Example –
 Message number 1 sent by router R1 and tells router R5 that N1, N2, N3,N4 can be reached
through router R1
(R1 gets this information from the corresponding intradomain forwarding table).
 Router
6
R5 can now add these pieces of information at the end of its forwarding table.
There are two problems that need to be addressed:
1. Some border routers do not know how to route a packet destined for non

neighbor ASs.
Example - R5 does not know how to route packets destined for networks in
AS3 and AS4.
Routers R6 and R9 are in the same situation as R5:
R6 does not know about networks in AS2 and AS4;
R9 does not know about networks in AS2 and AS3.

2. None of non-border routers know how to route a packet destined for any
networks in other
ASs.
7
Combination of eBGP and iBGP sessions in the
internet

8
Operation of Internal BGP (iBGP)

 iBGP protocol - similar to the eBGP protocol - uses the service of TCP, but it creates a
session between
any possible pair of routers inside an autonomous system.

 If an AS has only one router, there cannot be an iBGP session.

 Example, we cannot create an iBGP session inside AS2 or AS4 in internet.

 Second, if there are n routers in an autonomous system, there should be [n × (n − 1)


/ 2] iBGP sessions I
in that autonomous system (a fully connected mesh) to prevent loops in the system.

Each router needs to advertise its own reachability to the peer in the session

 figure
9 above shows the combination of eBGP and iBGP sessions in the internet.
Finalized BGP path tables (Part I)

10
Finalized BGP path tables (Part II)

11
Finalized BGP path tables (Part III)

12
Forwarding tables after injection from BGP (Part I)

13
Forwarding tables after injection from BGP (Part II)

14
Format of path attribute

15
Session Handler Details

16

You might also like