Skip to content

Commit

Permalink
---
Browse files Browse the repository at this point in the history
yaml
---
r: 134657
b: refs/heads/master
c: a6e8f27
h: refs/heads/master
i:
  134655: a27a407
v: v3
  • Loading branch information
Jesper Dangaard Brouer authored and David S. Miller committed Feb 23, 2009
1 parent f5b2811 commit 1f80266
Show file tree
Hide file tree
Showing 2 changed files with 24 additions and 22 deletions.
2 changes: 1 addition & 1 deletion [refs]
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
---
refs/heads/master: b2cc46a8ee905d1d642e01761939879c495e3e3a
refs/heads/master: a6e8f27f3c02b0c0d0c45d14b2f4a8810c9a7dc7
44 changes: 23 additions & 21 deletions trunk/net/ipv4/Kconfig
Original file line number Diff line number Diff line change
Expand Up @@ -53,35 +53,37 @@ config IP_ADVANCED_ROUTER

If unsure, say N here.

choice
choice
prompt "Choose IP: FIB lookup algorithm (choose FIB_HASH if unsure)"
depends on IP_ADVANCED_ROUTER
default ASK_IP_FIB_HASH

config ASK_IP_FIB_HASH
bool "FIB_HASH"
---help---
Current FIB is very proven and good enough for most users.
Current FIB is very proven and good enough for most users.

config IP_FIB_TRIE
bool "FIB_TRIE"
---help---
Use new experimental LC-trie as FIB lookup algorithm.
This improves lookup performance if you have a large
number of routes.

LC-trie is a longest matching prefix lookup algorithm which
performs better than FIB_HASH for large routing tables.
But, it consumes more memory and is more complex.

LC-trie is described in:

IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson
IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999
An experimental study of compression methods for dynamic tries
Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002.
http://www.nada.kth.se/~snilsson/public/papers/dyntrie2/

Use new experimental LC-trie as FIB lookup algorithm.
This improves lookup performance if you have a large
number of routes.

LC-trie is a longest matching prefix lookup algorithm which
performs better than FIB_HASH for large routing tables.
But, it consumes more memory and is more complex.

LC-trie is described in:

IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson
IEEE Journal on Selected Areas in Communications, 17(6):1083-1092,
June 1999

An experimental study of compression methods for dynamic tries
Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002.
http://www.nada.kth.se/~snilsson/public/papers/dyntrie2/

endchoice

config IP_FIB_HASH
Expand Down Expand Up @@ -193,7 +195,7 @@ config IP_PNP_RARP
<file:Documentation/filesystems/nfsroot.txt> for details.

# not yet ready..
# bool ' IP: ARP support' CONFIG_IP_PNP_ARP
# bool ' IP: ARP support' CONFIG_IP_PNP_ARP
config NET_IPIP
tristate "IP: tunneling"
select INET_TUNNEL
Expand Down Expand Up @@ -363,7 +365,7 @@ config INET_IPCOMP
---help---
Support for IP Payload Compression Protocol (IPComp) (RFC3173),
typically needed for IPsec.

If unsure, say Y.

config INET_XFRM_TUNNEL
Expand Down Expand Up @@ -417,7 +419,7 @@ config INET_DIAG
Support for INET (TCP, DCCP, etc) socket monitoring interface used by
native Linux tools such as ss. ss is included in iproute2, currently
downloadable at <http://linux-net.osdl.org/index.php/Iproute2>.

If unsure, say Y.

config INET_TCP_DIAG
Expand Down

0 comments on commit 1f80266

Please sign in to comment.