Status in source: current.
Technical details
{
"smi_kind": "OBJECT-TYPE",
"definition": [
"fsQoSQTemplateDropType",
"OBJECT-TYPE",
"SYNTAX",
"INTEGER",
"{",
"other",
"(",
"1",
")",
",",
"tailDrop",
"(",
"2",
")",
",",
"headDrop",
"(",
"3",
")",
",",
"red",
"(",
"4",
")",
",",
"alwaysDrop",
"(",
"5",
")",
",",
"wred",
"(",
"6",
")",
"}",
"MAX-ACCESS",
"read-write",
"STATUS",
"current",
"DESCRIPTION",
"\"The type of drop algorithm used by this queue template. The value other(1)requires further specification in some other MIB module. In the tailDrop(2) algorithm, fsQoSQTemplateSize represents the maximum depth of the queue, beyond which all newly arriving packets will be dropped. In the headDrop(3) algorithm, if a packet arrives when the current depth of the queue, is at fsQoSQTemplateSize , packets currently at the head of the queue are dropped to make room for the new packet to be enqueued at the tail of the queue. In the random Drop(4) and (6) algorithms, on packet arrival, an Active Queue Management algorithm is executed which may randomly drop a packet. This algorithm may be proprietary, and it may drop either the arriving packet or another packet in the queue. For this algorithm, fsQoSQTemplateSize is understood to be the absolute maximum size of the queue and additional parameters are described in fsQoSRandomDetectCfgTable. The alwaysDrop(5) algorithm is as its name specifies; always drop. In this case, the other configuration values in this Entry are not meaningful\"",
"::=",
"{",
"fsQoSQTemplateEntry",
"3",
"}"
],
"syntax_tree": [
[
"SimpleSyntax",
"INTEGER",
[
"enumSpec",
[
[
"other",
1
],
[
"tailDrop",
2
],
[
"headDrop",
3
],
[
"red",
4
],
[
"alwaysDrop",
5
],
[
"wred",
6
]
]
]
],
null,
[
"MaxAccessPart",
"read-write"
],
[
"Status",
"current"
],
[
"DESCRIPTION",
"The type of drop algorithm used by this queue template. The value other(1)requires further specification in some other MIB module. In the tailDrop(2) algorithm, fsQoSQTemplateSize represents the maximum depth of the queue, beyond which all newly arriving packets will be dropped. In the headDrop(3) algorithm, if a packet arrives when the current depth of the queue, is at fsQoSQTemplateSize , packets currently at the head of the queue are dropped to make room for the new packet to be enqueued at the tail of the queue. In the random Drop(4) and (6) algorithms, on packet arrival, an Active Queue Management algorithm is executed which may randomly drop a packet. This algorithm may be proprietary, and it may drop either the arriving packet or another packet in the queue. For this algorithm, fsQoSQTemplateSize is understood to be the absolute maximum size of the queue and additional parameters are described in fsQoSRandomDetectCfgTable. The alwaysDrop(5) algorithm is as its name specifies; always drop. In this case, the other configuration values in this Entry are not meaningful"
],
null,
null,
null,
null
]
}