I'm an BTech student developing a neural net algorithm to find optimum path to destination depending on the load(input buffer queue lengths) at adjacent nodes. It is a decentralized algorithm where each node(router) calculates the shortest path to the destination from each of the adjacent nodes and then finds a trade off between distance to destination and load at each of the nodes. I therefore need to dynamically find the queue lengths at adjacent nodes. I don't know how. Can I use ICMP. Please help. I'm using linux at the router. Regards, Roopa __________________________________________________ Do You Yahoo!? Talk to your friends online with Yahoo! Messenger. http://im.yahoo.com _______________________________________________ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
