请输入您要查询的百科知识:

 

词条 Draft:Poison reverse
释义

  1. References

{{AFC submission|d|mergeto|Split horizon route advertisement|u=Asidas|ns=118|decliner=AngusWOOF|declinets=20190315154027|ts=20190315143910}} {{AFC comment|1=This should be merged to the Split horizon route advertisement article and expanded upon there. AngusWOOF (barksniff) 15:40, 15 March 2019 (UTC)}}

Poison Reverse is an implemented algorithm that is often used within Distance vector routing. The use of poison reverse is to solve the count-to-infinity problem (more about the count to infinity problem can be found in distance vector routing).

The basic idea of poison reverse is to make sure that a path does not turn back into the same node if a cost has changed within the network. An example of this would be:

Node Z routes via node Y to destination X. If the cost between Z and Y increases the count to infinity problem will occur and here we implement the use of poison reverse.

As long as Z routes via node Y to get to X, Z will broadcast an infinite cost to the destination X, to the node which Z routes via (Y).


| Z |
        1 /======== \\ 5  ====== /           \\=======

| Y |___________| X |
  • the numbers between nodes is the cost of the links.

Following this topology and we assume this distance vector table of Z:

Destination Z Y X

  Z             0    1   3  Y             1    0   2  X             3    2   0

As Z routes via Y to get to X and because of that have the cost 3.

The poison reverse kicks in when we broadcast our distance vector to our neighbors:

The distance tables we broadcast is:

To Y:

[0, 1, ∞]

To X:

[0, 1, 3]

As we see in the distance vector that is broadcast to node Y the end destination X has an infinity value. This solves the count-to-infinity problem since if the link between Y and Z will not bounce between each other and instead directly try another path.

Although poison reverse is not always working. If there's a topology like this:


| A |
| \\======= =====
| B |______/======= =====

If the link between C and D would fail node C can still try to go through B to get to the destination. This will cause B to route through A and from there we have an loop we can not solve with poison reverse.[1]

This can though be completed with an implementation of a distance vector protocol called RIP.

References

{{cite book
|title= Compputer Networking: A top-Down Approach, Seventh Edition
|location= Harlow, England
|publisher= Pearson
|page= 418
|authors= James F.Kurose, Keith W. Ross
|year= 2017
}}
1. ^ https://people.mpi-sws.org/~gummadi/teaching/sp07/datanets/homework/homework2solution.pdf
Category:Internet StandardsCategory:Internet protocolsCategory:Routing protocols
随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/12 12:23:45