From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: From: Marek Lindner Date: Fri, 4 Feb 2011 15:21:33 +0100 References: <4D12694F.8020102@tiwoc.de> <201012231322.49591.lindner_marek@yahoo.de> In-Reply-To: MIME-Version: 1.0 Content-Type: Text/Plain; charset="iso-8859-15" Content-Transfer-Encoding: 7bit Message-Id: <201102041521.33908.lindner_marek@yahoo.de> Subject: Re: [B.A.T.M.A.N.] Weighting the local packet count; Optimizations for multi-interface nodes Reply-To: The list for a Better Approach To Mobile Ad-hoc Networking List-Id: The list for a Better Approach To Mobile Ad-hoc Networking List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , To: The list for a Better Approach To Mobile Ad-hoc Networking Hi, > I'm an author of "Routing Protocols for Mesh Networks > with Mobility Support" and "Assessing Mobility Support in Mesh > Networks". > I'm very happy to hear that someone is reading these papers and I'm > glad to discuss with you about them. welcome on our list! :-) > Indeed, in our comparison with the "Draft" BATMAN, we explicitly introduced > a timer to force the old route to be dropped out of the window. Please note > that this timer is just two times the originator time interval (i.e., 2 > seconds using the value in the draft) and it does not depend on the > PURGE_TIMEOUT. We could call it NEIGHBOR_TIMEOUT. Thanks for the clarifications. Please note that it does not matter how long a certain timeout is - every timeout which influences routing decisions is a potential risk for routing loops. We, the people behind batman, are very well aware that a timeout free routing algorithm does not converge as fast as one with timeouts but also is less susceptible to routing loops. Your tests / paper demonstrated this fact once more. Of course, we are interested in improving the algorithm as long as it does not happen on the expense of stability. We are going to study your paper at the coming WirelessBattleMesh in Barcelona to give you detailed feedback regarding your ideas. Regards, Marek