2013-06-21 18:56:12 +00:00
|
|
|
Documentation for /proc/sys/net/*
|
2009-04-02 23:57:20 +00:00
|
|
|
(c) 1999 Terrehon Bowden <terrehon@pacbell.net>
|
|
|
|
Bodo Bauer <bb@ricochet.net>
|
|
|
|
(c) 2000 Jorge Nerin <comandante@zaralinux.com>
|
|
|
|
(c) 2009 Shen Feng <shen@cn.fujitsu.com>
|
|
|
|
|
|
|
|
For general info and legal blurb, please look in README.
|
|
|
|
|
|
|
|
==============================================================
|
|
|
|
|
|
|
|
This file contains the documentation for the sysctl files in
|
2013-06-21 18:56:12 +00:00
|
|
|
/proc/sys/net
|
2009-04-02 23:57:20 +00:00
|
|
|
|
|
|
|
The interface to the networking parts of the kernel is located in
|
2013-06-21 18:56:12 +00:00
|
|
|
/proc/sys/net. The following table shows all possible subdirectories. You may
|
2009-04-02 23:57:20 +00:00
|
|
|
see only some of them, depending on your kernel's configuration.
|
|
|
|
|
|
|
|
|
|
|
|
Table : Subdirectories in /proc/sys/net
|
|
|
|
..............................................................................
|
|
|
|
Directory Content Directory Content
|
|
|
|
core General parameter appletalk Appletalk protocol
|
|
|
|
unix Unix domain sockets netrom NET/ROM
|
|
|
|
802 E802 protocol ax25 AX25
|
|
|
|
ethernet Ethernet protocol rose X.25 PLP layer
|
|
|
|
ipv4 IP version 4 x25 X.25 protocol
|
|
|
|
ipx IPX token-ring IBM token ring
|
|
|
|
bridge Bridging decnet DEC net
|
2013-06-17 14:54:37 +00:00
|
|
|
ipv6 IP version 6 tipc TIPC
|
2009-04-02 23:57:20 +00:00
|
|
|
..............................................................................
|
|
|
|
|
|
|
|
1. /proc/sys/net/core - Network core options
|
|
|
|
-------------------------------------------------------
|
|
|
|
|
2011-04-20 09:27:32 +00:00
|
|
|
bpf_jit_enable
|
|
|
|
--------------
|
|
|
|
|
|
|
|
This enables Berkeley Packet Filter Just in Time compiler.
|
|
|
|
Currently supported on x86_64 architecture, bpf_jit provides a framework
|
|
|
|
to speed packet filtering, the one used by tcpdump/libpcap for example.
|
|
|
|
Values :
|
|
|
|
0 - disable the JIT (default value)
|
|
|
|
1 - enable the JIT
|
|
|
|
2 - enable the JIT and ask the compiler to emit traces on kernel log.
|
|
|
|
|
2012-04-26 16:52:52 +00:00
|
|
|
dev_weight
|
|
|
|
--------------
|
|
|
|
|
|
|
|
The maximum number of packets that kernel can handle on a NAPI interrupt,
|
|
|
|
it's a Per-CPU variable.
|
|
|
|
Default: 64
|
|
|
|
|
2013-08-27 23:19:08 +00:00
|
|
|
default_qdisc
|
|
|
|
--------------
|
|
|
|
|
|
|
|
The default queuing discipline to use for network devices. This allows
|
|
|
|
overriding the default queue discipline of pfifo_fast with an
|
|
|
|
alternative. Since the default queuing discipline is created with the
|
|
|
|
no additional parameters so is best suited to queuing disciplines that
|
|
|
|
work well without configuration like stochastic fair queue (sfq),
|
|
|
|
CoDel (codel) or fair queue CoDel (fq_codel). Don't use queuing disciplines
|
|
|
|
like Hierarchical Token Bucket or Deficit Round Robin which require setting
|
|
|
|
up classes and bandwidths.
|
|
|
|
Default: pfifo_fast
|
|
|
|
|
2013-07-10 14:13:36 +00:00
|
|
|
busy_read
|
2013-06-10 08:39:50 +00:00
|
|
|
----------------
|
2013-08-01 03:10:25 +00:00
|
|
|
Low latency busy poll timeout for socket reads. (needs CONFIG_NET_RX_BUSY_POLL)
|
2013-07-08 13:20:34 +00:00
|
|
|
Approximate time in us to busy loop waiting for packets on the device queue.
|
2013-07-10 14:13:36 +00:00
|
|
|
This sets the default value of the SO_BUSY_POLL socket option.
|
|
|
|
Can be set or overridden per socket by setting socket option SO_BUSY_POLL,
|
|
|
|
which is the preferred method of enabling. If you need to enable the feature
|
|
|
|
globally via sysctl, a value of 50 is recommended.
|
2013-07-08 13:20:34 +00:00
|
|
|
Will increase power usage.
|
2013-06-10 08:39:50 +00:00
|
|
|
Default: 0 (off)
|
|
|
|
|
2013-07-10 14:13:36 +00:00
|
|
|
busy_poll
|
2013-06-24 07:28:03 +00:00
|
|
|
----------------
|
2013-08-01 03:10:25 +00:00
|
|
|
Low latency busy poll timeout for poll and select. (needs CONFIG_NET_RX_BUSY_POLL)
|
2013-07-08 13:20:34 +00:00
|
|
|
Approximate time in us to busy loop waiting for events.
|
2013-06-24 07:28:03 +00:00
|
|
|
Recommended value depends on the number of sockets you poll on.
|
|
|
|
For several sockets 50, for several hundreds 100.
|
|
|
|
For more than that you probably want to use epoll.
|
2013-07-10 14:13:36 +00:00
|
|
|
Note that only sockets with SO_BUSY_POLL set will be busy polled,
|
|
|
|
so you want to either selectively set SO_BUSY_POLL on those sockets or set
|
|
|
|
sysctl.net.busy_read globally.
|
2013-07-08 13:20:34 +00:00
|
|
|
Will increase power usage.
|
2013-06-24 07:28:03 +00:00
|
|
|
Default: 0 (off)
|
|
|
|
|
2009-04-02 23:57:20 +00:00
|
|
|
rmem_default
|
|
|
|
------------
|
|
|
|
|
|
|
|
The default setting of the socket receive buffer in bytes.
|
|
|
|
|
|
|
|
rmem_max
|
|
|
|
--------
|
|
|
|
|
|
|
|
The maximum receive socket buffer size in bytes.
|
|
|
|
|
|
|
|
wmem_default
|
|
|
|
------------
|
|
|
|
|
|
|
|
The default setting (in bytes) of the socket send buffer.
|
|
|
|
|
|
|
|
wmem_max
|
|
|
|
--------
|
|
|
|
|
|
|
|
The maximum send socket buffer size in bytes.
|
|
|
|
|
|
|
|
message_burst and message_cost
|
|
|
|
------------------------------
|
|
|
|
|
|
|
|
These parameters are used to limit the warning messages written to the kernel
|
|
|
|
log from the networking code. They enforce a rate limit to make a
|
|
|
|
denial-of-service attack impossible. A higher message_cost factor, results in
|
|
|
|
fewer messages that will be written. Message_burst controls when messages will
|
|
|
|
be dropped. The default settings limit warning messages to one every five
|
|
|
|
seconds.
|
|
|
|
|
|
|
|
warnings
|
|
|
|
--------
|
|
|
|
|
|
|
|
This controls console messages from the networking stack that can occur because
|
|
|
|
of problems on the network like duplicate address or bad checksums. Normally,
|
|
|
|
this should be enabled, but if the problem persists the messages can be
|
|
|
|
disabled.
|
|
|
|
|
|
|
|
netdev_budget
|
|
|
|
-------------
|
|
|
|
|
|
|
|
Maximum number of packets taken from all interfaces in one polling cycle (NAPI
|
|
|
|
poll). In one polling cycle interfaces which are registered to polling are
|
2013-05-17 09:10:34 +00:00
|
|
|
probed in a round-robin manner.
|
2009-04-02 23:57:20 +00:00
|
|
|
|
|
|
|
netdev_max_backlog
|
|
|
|
------------------
|
|
|
|
|
|
|
|
Maximum number of packets, queued on the INPUT side, when the interface
|
|
|
|
receives packets faster than kernel can process them.
|
|
|
|
|
net: Consistent skb timestamping
With RPS inclusion, skb timestamping is not consistent in RX path.
If netif_receive_skb() is used, its deferred after RPS dispatch.
If netif_rx() is used, its done before RPS dispatch.
This can give strange tcpdump timestamps results.
I think timestamping should be done as soon as possible in the receive
path, to get meaningful values (ie timestamps taken at the time packet
was delivered by NIC driver to our stack), even if NAPI already can
defer timestamping a bit (RPS can help to reduce the gap)
Tom Herbert prefer to sample timestamps after RPS dispatch. In case
sampling is expensive (HPET/acpi_pm on x86), this makes sense.
Let admins switch from one mode to another, using a new
sysctl, /proc/sys/net/core/netdev_tstamp_prequeue
Its default value (1), means timestamps are taken as soon as possible,
before backlog queueing, giving accurate timestamps.
Setting a 0 value permits to sample timestamps when processing backlog,
after RPS dispatch, to lower the load of the pre-RPS cpu.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2010-05-16 06:57:10 +00:00
|
|
|
netdev_tstamp_prequeue
|
|
|
|
----------------------
|
|
|
|
|
|
|
|
If set to 0, RX packet timestamps can be sampled after RPS processing, when
|
|
|
|
the target CPU processes packets. It might give some delay on timestamps, but
|
|
|
|
permit to distribute the load on several cpus.
|
|
|
|
|
|
|
|
If set to 1 (default), timestamps are sampled as soon as possible, before
|
|
|
|
queueing.
|
|
|
|
|
2009-04-02 23:57:20 +00:00
|
|
|
optmem_max
|
|
|
|
----------
|
|
|
|
|
|
|
|
Maximum ancillary buffer size allowed per socket. Ancillary data is a sequence
|
|
|
|
of struct cmsghdr structures with appended data.
|
|
|
|
|
|
|
|
2. /proc/sys/net/unix - Parameters for Unix domain sockets
|
|
|
|
-------------------------------------------------------
|
|
|
|
|
2009-04-02 23:57:21 +00:00
|
|
|
There is only one file in this directory.
|
|
|
|
unix_dgram_qlen limits the max number of datagrams queued in Unix domain
|
2009-04-13 21:39:36 +00:00
|
|
|
socket's buffer. It will not take effect unless PF_UNIX flag is specified.
|
2009-04-02 23:57:20 +00:00
|
|
|
|
|
|
|
|
|
|
|
3. /proc/sys/net/ipv4 - IPV4 settings
|
|
|
|
-------------------------------------------------------
|
|
|
|
Please see: Documentation/networking/ip-sysctl.txt and ipvs-sysctl.txt for
|
|
|
|
descriptions of these entries.
|
|
|
|
|
|
|
|
|
|
|
|
4. Appletalk
|
|
|
|
-------------------------------------------------------
|
|
|
|
|
|
|
|
The /proc/sys/net/appletalk directory holds the Appletalk configuration data
|
|
|
|
when Appletalk is loaded. The configurable parameters are:
|
|
|
|
|
|
|
|
aarp-expiry-time
|
|
|
|
----------------
|
|
|
|
|
|
|
|
The amount of time we keep an ARP entry before expiring it. Used to age out
|
|
|
|
old hosts.
|
|
|
|
|
|
|
|
aarp-resolve-time
|
|
|
|
-----------------
|
|
|
|
|
|
|
|
The amount of time we will spend trying to resolve an Appletalk address.
|
|
|
|
|
|
|
|
aarp-retransmit-limit
|
|
|
|
---------------------
|
|
|
|
|
|
|
|
The number of times we will retransmit a query before giving up.
|
|
|
|
|
|
|
|
aarp-tick-time
|
|
|
|
--------------
|
|
|
|
|
|
|
|
Controls the rate at which expires are checked.
|
|
|
|
|
|
|
|
The directory /proc/net/appletalk holds the list of active Appletalk sockets
|
|
|
|
on a machine.
|
|
|
|
|
|
|
|
The fields indicate the DDP type, the local address (in network:node format)
|
|
|
|
the remote address, the size of the transmit pending queue, the size of the
|
|
|
|
received queue (bytes waiting for applications to read) the state and the uid
|
|
|
|
owning the socket.
|
|
|
|
|
|
|
|
/proc/net/atalk_iface lists all the interfaces configured for appletalk.It
|
|
|
|
shows the name of the interface, its Appletalk address, the network range on
|
|
|
|
that address (or network number for phase 1 networks), and the status of the
|
|
|
|
interface.
|
|
|
|
|
|
|
|
/proc/net/atalk_route lists each known network route. It lists the target
|
|
|
|
(network) that the route leads to, the router (may be directly connected), the
|
|
|
|
route flags, and the device the route is using.
|
|
|
|
|
|
|
|
|
|
|
|
5. IPX
|
|
|
|
-------------------------------------------------------
|
|
|
|
|
|
|
|
The IPX protocol has no tunable values in proc/sys/net.
|
|
|
|
|
|
|
|
The IPX protocol does, however, provide proc/net/ipx. This lists each IPX
|
|
|
|
socket giving the local and remote addresses in Novell format (that is
|
|
|
|
network:node:port). In accordance with the strange Novell tradition,
|
|
|
|
everything but the port is in hex. Not_Connected is displayed for sockets that
|
|
|
|
are not tied to a specific remote address. The Tx and Rx queue sizes indicate
|
|
|
|
the number of bytes pending for transmission and reception. The state
|
|
|
|
indicates the state the socket is in and the uid is the owning uid of the
|
|
|
|
socket.
|
|
|
|
|
|
|
|
The /proc/net/ipx_interface file lists all IPX interfaces. For each interface
|
|
|
|
it gives the network number, the node number, and indicates if the network is
|
|
|
|
the primary network. It also indicates which device it is bound to (or
|
|
|
|
Internal for internal networks) and the Frame Type if appropriate. Linux
|
|
|
|
supports 802.3, 802.2, 802.2 SNAP and DIX (Blue Book) ethernet framing for
|
|
|
|
IPX.
|
|
|
|
|
|
|
|
The /proc/net/ipx_route table holds a list of IPX routes. For each route it
|
|
|
|
gives the destination network, the router node (or Directly) and the network
|
|
|
|
address of the router (or Connected) for internal networks.
|
2013-06-17 14:54:37 +00:00
|
|
|
|
|
|
|
6. TIPC
|
|
|
|
-------------------------------------------------------
|
|
|
|
|
tipc: add name distributor resiliency queue
TIPC name table updates are distributed asynchronously in a cluster,
entailing a risk of certain race conditions. E.g., if two nodes
simultaneously issue conflicting (overlapping) publications, this may
not be detected until both publications have reached a third node, in
which case one of the publications will be silently dropped on that
node. Hence, we end up with an inconsistent name table.
In most cases this conflict is just a temporary race, e.g., one
node is issuing a publication under the assumption that a previous,
conflicting, publication has already been withdrawn by the other node.
However, because of the (rtt related) distributed update delay, this
may not yet hold true on all nodes. The symptom of this failure is a
syslog message: "tipc: Cannot publish {%u,%u,%u}, overlap error".
In this commit we add a resiliency queue at the receiving end of
the name table distributor. When insertion of an arriving publication
fails, we retain it in this queue for a short amount of time, assuming
that another update will arrive very soon and clear the conflict. If so
happens, we insert the publication, otherwise we drop it.
The (configurable) retention value defaults to 2000 ms. Knowing from
experience that the situation described above is extremely rare, there
is no risk that the queue will accumulate any large number of items.
Signed-off-by: Erik Hugne <erik.hugne@ericsson.com>
Signed-off-by: Jon Maloy <jon.maloy@ericsson.com>
Acked-by: Ying Xue <ying.xue@windriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2014-08-28 07:08:47 +00:00
|
|
|
tipc_rmem
|
|
|
|
----------
|
|
|
|
|
2013-06-17 14:54:37 +00:00
|
|
|
The TIPC protocol now has a tunable for the receive memory, similar to the
|
|
|
|
tcp_rmem - i.e. a vector of 3 INTEGERs: (min, default, max)
|
|
|
|
|
|
|
|
# cat /proc/sys/net/tipc/tipc_rmem
|
|
|
|
4252725 34021800 68043600
|
|
|
|
#
|
|
|
|
|
|
|
|
The max value is set to CONN_OVERLOAD_LIMIT, and the default and min values
|
|
|
|
are scaled (shifted) versions of that same value. Note that the min value
|
|
|
|
is not at this point in time used in any meaningful way, but the triplet is
|
|
|
|
preserved in order to be consistent with things like tcp_rmem.
|
tipc: add name distributor resiliency queue
TIPC name table updates are distributed asynchronously in a cluster,
entailing a risk of certain race conditions. E.g., if two nodes
simultaneously issue conflicting (overlapping) publications, this may
not be detected until both publications have reached a third node, in
which case one of the publications will be silently dropped on that
node. Hence, we end up with an inconsistent name table.
In most cases this conflict is just a temporary race, e.g., one
node is issuing a publication under the assumption that a previous,
conflicting, publication has already been withdrawn by the other node.
However, because of the (rtt related) distributed update delay, this
may not yet hold true on all nodes. The symptom of this failure is a
syslog message: "tipc: Cannot publish {%u,%u,%u}, overlap error".
In this commit we add a resiliency queue at the receiving end of
the name table distributor. When insertion of an arriving publication
fails, we retain it in this queue for a short amount of time, assuming
that another update will arrive very soon and clear the conflict. If so
happens, we insert the publication, otherwise we drop it.
The (configurable) retention value defaults to 2000 ms. Knowing from
experience that the situation described above is extremely rare, there
is no risk that the queue will accumulate any large number of items.
Signed-off-by: Erik Hugne <erik.hugne@ericsson.com>
Signed-off-by: Jon Maloy <jon.maloy@ericsson.com>
Acked-by: Ying Xue <ying.xue@windriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2014-08-28 07:08:47 +00:00
|
|
|
|
|
|
|
named_timeout
|
|
|
|
--------------
|
|
|
|
|
|
|
|
TIPC name table updates are distributed asynchronously in a cluster, without
|
|
|
|
any form of transaction handling. This means that different race scenarios are
|
|
|
|
possible. One such is that a name withdrawal sent out by one node and received
|
|
|
|
by another node may arrive after a second, overlapping name publication already
|
|
|
|
has been accepted from a third node, although the conflicting updates
|
|
|
|
originally may have been issued in the correct sequential order.
|
|
|
|
If named_timeout is nonzero, failed topology updates will be placed on a defer
|
|
|
|
queue until another event arrives that clears the error, or until the timeout
|
|
|
|
expires. Value is in milliseconds.
|