Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am developing a network protocol In which I have following requirement
each node have information only about its neighbor. one of neighbor(j) of node i want to check if it can reach all other neighbors of node i without using node i. (if possible path should not be more than k links).
please suggest me if you have any idea to solve this problem
thanks.
Since you can’t store anything but a node’s neighbor, it sounds like you will need to run a routing protocol whenever the node needs to perform this check (and then throw away the results), like RIP. With RIP you could poison the immediate path to i. You can then examine the routing table to determine what paths are available (those that have less than k links). There are many more protocols to choose from, but RIP has the benefit of being straightforward and has little overhead vs something like OSPF.