]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blob - Documentation/ABI/testing/sysfs-class-net-mesh
c2b956d44a9520d276b7f13ee3d2617991127a5a
[mirror_ubuntu-zesty-kernel.git] / Documentation / ABI / testing / sysfs-class-net-mesh
1
2 What: /sys/class/net/<mesh_iface>/mesh/aggregated_ogms
3 Date: May 2010
4 Contact: Marek Lindner <mareklindner@neomailbox.ch>
5 Description:
6 Indicates whether the batman protocol messages of the
7 mesh <mesh_iface> shall be aggregated or not.
8
9 What: /sys/class/net/<mesh_iface>/mesh/<vlan_subdir>/ap_isolation
10 Date: May 2011
11 Contact: Antonio Quartulli <a@unstable.cc>
12 Description:
13 Indicates whether the data traffic going from a
14 wireless client to another wireless client will be
15 silently dropped. <vlan_subdir> is empty when referring
16 to the untagged lan.
17
18 What: /sys/class/net/<mesh_iface>/mesh/bonding
19 Date: June 2010
20 Contact: Simon Wunderlich <sw@simonwunderlich.de>
21 Description:
22 Indicates whether the data traffic going through the
23 mesh will be sent using multiple interfaces at the
24 same time (if available).
25
26 What: /sys/class/net/<mesh_iface>/mesh/bridge_loop_avoidance
27 Date: November 2011
28 Contact: Simon Wunderlich <sw@simonwunderlich.de>
29 Description:
30 Indicates whether the bridge loop avoidance feature
31 is enabled. This feature detects and avoids loops
32 between the mesh and devices bridged with the soft
33 interface <mesh_iface>.
34
35 What: /sys/class/net/<mesh_iface>/mesh/fragmentation
36 Date: October 2010
37 Contact: Andreas Langer <an.langer@gmx.de>
38 Description:
39 Indicates whether the data traffic going through the
40 mesh will be fragmented or silently discarded if the
41 packet size exceeds the outgoing interface MTU.
42
43 What: /sys/class/net/<mesh_iface>/mesh/gw_bandwidth
44 Date: October 2010
45 Contact: Marek Lindner <mareklindner@neomailbox.ch>
46 Description:
47 Defines the bandwidth which is propagated by this
48 node if gw_mode was set to 'server'.
49
50 What: /sys/class/net/<mesh_iface>/mesh/gw_mode
51 Date: October 2010
52 Contact: Marek Lindner <mareklindner@neomailbox.ch>
53 Description:
54 Defines the state of the gateway features. Can be
55 either 'off', 'client' or 'server'.
56
57 What: /sys/class/net/<mesh_iface>/mesh/gw_sel_class
58 Date: October 2010
59 Contact: Marek Lindner <mareklindner@neomailbox.ch>
60 Description:
61 Defines the selection criteria this node will use
62 to choose a gateway if gw_mode was set to 'client'.
63
64 What: /sys/class/net/<mesh_iface>/mesh/hop_penalty
65 Date: Oct 2010
66 Contact: Linus Lüssing <linus.luessing@web.de>
67 Description:
68 Defines the penalty which will be applied to an
69 originator message's tq-field on every hop.
70
71 What: /sys/class/net/<mesh_iface>/mesh/isolation_mark
72 Date: Nov 2013
73 Contact: Antonio Quartulli <a@unstable.cc>
74 Description:
75 Defines the isolation mark (and its bitmask) which
76 is used to classify clients as "isolated" by the
77 Extended Isolation feature.
78
79 What: /sys/class/net/<mesh_iface>/mesh/multicast_mode
80 Date: Feb 2014
81 Contact: Linus Lüssing <linus.luessing@web.de>
82 Description:
83 Indicates whether multicast optimizations are enabled
84 or disabled. If set to zero then all nodes in the
85 mesh are going to use classic flooding for any
86 multicast packet with no optimizations.
87
88 What: /sys/class/net/<mesh_iface>/mesh/network_coding
89 Date: Nov 2012
90 Contact: Martin Hundeboll <martin@hundeboll.net>
91 Description:
92 Controls whether Network Coding (using some magic
93 to send fewer wifi packets but still the same
94 content) is enabled or not.
95
96 What: /sys/class/net/<mesh_iface>/mesh/orig_interval
97 Date: May 2010
98 Contact: Marek Lindner <mareklindner@neomailbox.ch>
99 Description:
100 Defines the interval in milliseconds in which batman
101 sends its protocol messages.
102
103 What: /sys/class/net/<mesh_iface>/mesh/routing_algo
104 Date: Dec 2011
105 Contact: Marek Lindner <mareklindner@neomailbox.ch>
106 Description:
107 Defines the routing procotol this mesh instance
108 uses to find the optimal paths through the mesh.