Path Vector Routing
Path Vector Routing
Path Vector Routing
Dest Path
AS 1 AS 3
A2 A3
C2 C3
2
2
Dest . Path
A1 D1 AS4
A4
C1 D2 AS4
A5
D3 AS4
D4 AS4
B1 Table
Dest . Path
B1 AS2 B3 D1 D4
B2 AS2 2 2
B1 B4
B3 AS2 2
B4 AS2
B2 D2 D3
2 2 2
B1
B1 Table
Table
AS 2 AS 4
Initial routing tables in path vector routine
It is the initial table for each speaker node in a system made four ASs. Here Node A1
is the speaker node for AS1, B1 for AS2, C1 for AS3 and D1 for AS4, Node A1 creates an
initial table that shows A1 to A5 and these are located in AS1, it can be reached through it
A speaker in an autonomous system shares its table with
immediate neighbours ,here Node A1 share its table with nodes B1 and C1 , Node C1 share
its table with nodes A1,B1 and D1 , Node B1 share its table with nodes A1 and C1 , Node D1
share its table with node C1
FUNCTIONS
PREVENTION OF LOOP
POLICY ROUTING
OPTIMUM PATH
A path to a destination that is the best for the organization that runs
the autonomous system
1. STUB AS
2. MULTHIHOMED AS
3. TRANSIT AS