|
@@ -53,7 +53,7 @@ config IP_ADVANCED_ROUTER
|
|
|
|
|
|
If unsure, say N here.
|
|
If unsure, say N here.
|
|
|
|
|
|
-choice
|
|
|
|
|
|
+choice
|
|
prompt "Choose IP: FIB lookup algorithm (choose FIB_HASH if unsure)"
|
|
prompt "Choose IP: FIB lookup algorithm (choose FIB_HASH if unsure)"
|
|
depends on IP_ADVANCED_ROUTER
|
|
depends on IP_ADVANCED_ROUTER
|
|
default ASK_IP_FIB_HASH
|
|
default ASK_IP_FIB_HASH
|
|
@@ -61,27 +61,29 @@ choice
|
|
config ASK_IP_FIB_HASH
|
|
config ASK_IP_FIB_HASH
|
|
bool "FIB_HASH"
|
|
bool "FIB_HASH"
|
|
---help---
|
|
---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
|
|
config IP_FIB_TRIE
|
|
bool "FIB_TRIE"
|
|
bool "FIB_TRIE"
|
|
---help---
|
|
---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
|
|
endchoice
|
|
|
|
|
|
config IP_FIB_HASH
|
|
config IP_FIB_HASH
|
|
@@ -193,7 +195,7 @@ config IP_PNP_RARP
|
|
<file:Documentation/filesystems/nfsroot.txt> for details.
|
|
<file:Documentation/filesystems/nfsroot.txt> for details.
|
|
|
|
|
|
# not yet ready..
|
|
# not yet ready..
|
|
-# bool ' IP: ARP support' CONFIG_IP_PNP_ARP
|
|
|
|
|
|
+# bool ' IP: ARP support' CONFIG_IP_PNP_ARP
|
|
config NET_IPIP
|
|
config NET_IPIP
|
|
tristate "IP: tunneling"
|
|
tristate "IP: tunneling"
|
|
select INET_TUNNEL
|
|
select INET_TUNNEL
|
|
@@ -363,7 +365,7 @@ config INET_IPCOMP
|
|
---help---
|
|
---help---
|
|
Support for IP Payload Compression Protocol (IPComp) (RFC3173),
|
|
Support for IP Payload Compression Protocol (IPComp) (RFC3173),
|
|
typically needed for IPsec.
|
|
typically needed for IPsec.
|
|
-
|
|
|
|
|
|
+
|
|
If unsure, say Y.
|
|
If unsure, say Y.
|
|
|
|
|
|
config INET_XFRM_TUNNEL
|
|
config INET_XFRM_TUNNEL
|
|
@@ -417,7 +419,7 @@ config INET_DIAG
|
|
Support for INET (TCP, DCCP, etc) socket monitoring interface used by
|
|
Support for INET (TCP, DCCP, etc) socket monitoring interface used by
|
|
native Linux tools such as ss. ss is included in iproute2, currently
|
|
native Linux tools such as ss. ss is included in iproute2, currently
|
|
downloadable at <http://linux-net.osdl.org/index.php/Iproute2>.
|
|
downloadable at <http://linux-net.osdl.org/index.php/Iproute2>.
|
|
-
|
|
|
|
|
|
+
|
|
If unsure, say Y.
|
|
If unsure, say Y.
|
|
|
|
|
|
config INET_TCP_DIAG
|
|
config INET_TCP_DIAG
|