Date: Fri, 13 Feb 1998 10:12:10 -0800 (PST) From: Julian Elischer <julian@whistle.com> To: hackers@FreeBSD.ORG Subject: Re: fast router code. (fwd) Message-ID: <Pine.BSF.3.95.980213101032.18313B-100000@current1.whistle.com>
next in thread | raw e-mail | index | archive | help
I thought I would forward a comment from the author of the fast router code mentionned here a few days ago. julian ---------- Forwarded message ---------- Date: Fri, 13 Feb 1998 14:45:53 +0200 (EET) From: Stefan Nilsson <sni@cs.hut.fi> To: Julian Elischer <julian@whistle.com> Cc: Gunnar Karlsson <gunnar@tcm.hut.fi> Subject: Re: fast router code. On Thu, 12 Feb 1998, Julian Elischer wrote: > your project was recently publicised in the FreeBSD forums. > > Do you have any comparative speed numbers comparing the > speed of your trie based system with the radix-tree > based system used in BSD4.4 based systems? No, we haven't done such a comparison yet and I just realize that we faile to give a reference to this implementation. We'll certainly fix that in the final version of the paper. I haven't looked at the code for the BSD algorithm and don't know how hard it would be do to an actual experimental comparison. However, from what I've read about the BSD algorithm it should be very similar to ours. It's also based on a trie (Patricia tree), it uses path compression but not level compression. In fact, if you turn off the level compression from our implementation you loose a factor 5 in speed and the depth of the structure increases from 2 to 20. Hence my guess is that, using level compression as suggested in our paper, it possible to improve the BSD algorithm by a factor of at least 5. Stefan -- Stefan Nilsson Department of Computer Science +358 9 4514850 tel Helsinki University of Technology +358 9 4513293 fax P.O. Box 1100, FIN-02015 HUT www.cs.hut.fi/~sni Finland To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.BSF.3.95.980213101032.18313B-100000>