Enhanced IGRP Operation

gascitytankΔίκτυα και Επικοινωνίες

28 Οκτ 2013 (πριν από 3 χρόνια και 11 μήνες)

101 εμφανίσεις

Enhanced IGRP
Operation

What Is in a Neighbor Table?

p2r2

p2r2#show ip eigrp neighbors

IP
-
EIGRP neighbors for process 400

H Address Interface Hold Uptime SRTT RTO Q Seq


(sec) (ms) Cnt Num

1 172.68.2.2 To0 13 02:15:30 8 200 0 9

0 172.68.16.2 Se1 10 02:38:29 29 200 0 6


Discovering Routes

I am router A, who is on the link?

Hello

A

B

1

Discovering Routes

Update

Here is my routing information.

I am router A, who is on the link?

Hello

A

B

1

2

3

Discovering Routes

Update

Here is my routing information.

I am router A, who is on the link?

Hello

A

B

1

2

Thanks for the information!

Ack

3

5

Discovering Routes

Update

Here is my routing information.

I am router A, who is on the link?

Hello

A

B

1

2

Thanks for the information!

Ack

Topology

Table


3

4

5

Discovering Routes

Update

Here is my routing information.

I am router A, who is on the link?

Hello

A

B

1

2

Thanks for the information!

Ack

Here is my route information.

Update

Topology

Table


3

4

5

6

Discovering Routes

Update

Here is my routing information.

I am router A, who is on the link?

Hello

A

B

1

2

Thanks for the information!

Ack

Here is my route information.

Update

Topology

Table


3

4

5

Converged

Thanks for the information!

Ack

6


EIGRP uses a composite metric to pick the
best path

Choosing Routes

IPX

19.2

T1

T1

T1

IPX

AppleTalk

IP

AppleTalk

IP

A

B

D

C

Choosing Routes (cont.)

7

Destination

Advert. Dist.

7

7

H

B

30

21

220

Topology

Table

Network

7

(10)

(10)

(20)

(100)

(100)

(10)

C

E

F

G

(1)

Neighbor

D

7

A

D

B

H

Choosing Routes (cont.)

7

Destination

Feasible. Dist.

Advert. Dist.

7

7

H

B

40

30

31

21

230

220

Topology

Table

Network

7

(10)

(10)

(20)

(100)

(100)

(10)

C

E

F

G

(1)

Neighbor

D

7

A

D

B

H

Choosing Routes (cont.)


B is current successor


H is the feasible successor

7

Destination

Feasible. Dist.

Advert. Dist.

7

7

H

B

40

30

31

21

230

220

Topology

Table

Network

7

(10)

(10)

(20)

(100)

(100)

(10)

C

E

F

G

(1)

Routing Table

Neighbor

D

31

7

7

B

A

D

B

H

Router A’s

Maintaining Routes

Net 7

(10)

(10)

(20)

(100)

(100)

(10)

C

E

F

G

(1)

Destination

Feasible Dist.

Advert. Dist.

7

H

40

30

Topology

Table

Neighbor

State

A

A

1

D

H

B

Maintaining Routes

Do you have feasible

successor to network 7?

Query

Here is a
successor to
network 7.

Reply

Net 7

(10)

(10)

(20)

(100)

(100)

(10)

C

E

F

G

(1)

Destination

Feasible Dist.

Advert. Dist.

7

H

40

30

Topology

Table

Neighbor

State

A

A

1

2

D

H

B

Maintaining Routes (cont.)

Do you have feasible

successor to network 7?

Query

I have no route

to network 7.

Reply

Do you have feasible

successor to network 7?

Query

I have no route

to network 7.

Reply

3

A

B

C

Maintaining Routes (cont.)

Do you have feasible

successor to network 7?

Query

I have no route

to network 7.

Reply

Do you have feasible

successor to network 7?

Query

I have no route

to network 7.

Reply

3

Destination

Advert. Distance

Feasible Dist.

Topology Table

Neighbor

State

4

A

B

C