| To: | netdev@xxxxxxxxxxx |
|---|---|
| Subject: | linux 2.4 routing algorithm? |
| From: | Kristen Carlson <kristenc@xxxxxxxxxx> |
| Date: | Wed, 17 Sep 2003 16:47:53 -0700 |
| Sender: | netdev-bounce@xxxxxxxxxxx |
| User-agent: | Mutt/1.4.1i |
Hello, I'm trying to understand the routing algorithm for linux 2.4. I thought it would use a longest prefix match due to some documentation I had googled, but the code in route.c looks like a hash. I probably just don't understand how lpm would be coded in practice. Am I looking in the right place? Can someone give me a clue about how this works? Thanks, Kristen -- WWXD (What Would Xena Do?) |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: [PATCH] janitor: remove (or add) unneeded includes (wireless), Jean Tourrilhes |
|---|---|
| Next by Date: | Present of new painters (0877230471)@dv -ERR, Gallery-a |
| Previous by Thread: | [PATCH] janitor: remove unneeded includes (tokenring), Randy.Dunlap |
| Next by Thread: | Re: linux 2.4 routing algorithm?, David S. Miller |
| Indexes: | [Date] [Thread] [Top] [All Lists] |