Distance vector routing w/ poison reverse.

Hello /prog/

I want your help pleae. I am writing an implementation of distance vector routing with poison reverse, but I don't understand everything.

http://pastebin.com/cSCZFup0

What should be done in the recvUpdate and updateLinkCost procedures?

This code is run in a sort of simulator, so these functions are called from the simulator. Knowledge about the simulator itself shouldn't be very necessary.

I did not carefully look at your code, but the basic idea of a poison reverse is to help prevent routing loops. (It does not prevent, only helps).

When a node x receives an update from a node y about reaching node z in distance d, the following should happen:
  1) x updates its local routing tables, saying it can reach node z from node y with distance d+1
  2) x sends an update to y saying 'you cannot reach z through me' (poison reverse)
  3) x sends an update to all neighbours besides y saying 'you can reach z through me with distance d+1'.


If you want more information on the distance vector approach for routing, you can look up RFC1058: http://www.ietf.org/rfc/rfc1058.txt

4 Name: Anonymous 2011-02-03 5:28

5 Name: Anonymous 2011-02-18 20:30

---

Don't change these.

Name:		Email:
Entire Thread Thread List