netdev - Regarding Routing table in Linux kernel

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [thread-next>] [day] [month] [year] [list]

Message-ID: <CADAe=+J-yjh-GujhVY58qKirGNANQ6fUnPdzvoQzQSxMDv7VPw@mail.gmail.com>
Date:	Sun, 6 Nov 2011 12:43:22 +0530
From:	Ajith Adapa <adapa.ajith@...il.com>
To:	netdev@...r.kernel.org
Subject: Regarding Routing table in Linux kernel

Hi,

I have few doubts regarding the routing table in linux kernel.

1. Why does the linux kernel use hashing table for storing routing
entries when there is patricia trie or radix tree which is more faster
than Hash table ?

2. Is there any way we can test the performance of an routing
algorithm before deploying in a real time scenario to check its
performance ? I would like to test one of my implementations to check
if there are any performance gains or not ?

Regards,
Ajith
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html