Received: with ECARTIS (v1.0.0; list netdev); Thu, 18 Sep 2003 10:29:19 -0700 (PDT) Received: from rigel.cs.pdx.edu (root@rigel.cs.pdx.edu [131.252.208.59]) by oss.sgi.com (8.12.10/8.12.10) with SMTP id h8IHTEFx017102 for ; Thu, 18 Sep 2003 10:29:14 -0700 Received: from sirius.cs.pdx.edu (root@sirius.cs.pdx.edu [131.252.208.57]) by rigel.cs.pdx.edu (8.12.8/8.12.8) with ESMTP id h8IHTAZx012323 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Thu, 18 Sep 2003 10:29:11 -0700 (PDT) Received: from sirius.cs.pdx.edu (kristenc@localhost [127.0.0.1]) by sirius.cs.pdx.edu (8.12.8/8.12.8) with ESMTP id h8IHTAYk023626 for ; Thu, 18 Sep 2003 10:29:10 -0700 (PDT) Received: (from kristenc@localhost) by sirius.cs.pdx.edu (8.12.8/8.12.8/Submit) id h8IHTAoe023625 for netdev@oss.sgi.com; Thu, 18 Sep 2003 10:29:10 -0700 (PDT) Date: Thu, 18 Sep 2003 10:29:10 -0700 From: Kristen Carlson To: netdev@oss.sgi.com Subject: patricia tries vs. hash for routing? Message-ID: <20030918172910.GA22091@sirius.cs.pdx.edu> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.4.1i X-Virus-Scanned: by amavisd-new X-archive-position: 42 X-ecartis-version: Ecartis v1.0.0 Sender: netdev-bounce@oss.sgi.com Errors-to: netdev-bounce@oss.sgi.com X-original-sender: kristenc@cs.pdx.edu Precedence: bulk X-list: netdev Status: RO Content-Length: 340 Lines: 11 Hi, I'm wondering if somebody has already written a patch that replaces the current routing algorithm (hash) with one that is based on a trie based algorithm? I'm also wondering if anybody has done any performance comparisons with very large route tables to see which one scales better? thanks, Kristen -- WWXD (What Would Xena Do?)