DIFF-SERV-MIB Table View

The 'Aggregate' Table  enumerates Behavior Aggregate
classifiers (DSCPs) that a system may identify traffic
using.

A table of MF  (IP 6-tuple multi-field) classifier
entries that a system may use to identify traffic.

The classifier table enumerates specific classifiers
that a system may apply, including Differentiated
Services Code Points (DSCPs) and Multi-field
discriminators such as {Source IP Address, Destination
IP Address, IP Protocol, Source TCP/UDP Port,
Destination TCP/UDP Port).

The Meter Table enumerates specific token bucket
meters that a system may use to police a stream of
classified traffic. Such a stream may include a single
micro-flow, all traffic from a given source to a given
destination, all traffic conforming to a single
classifier, or any other cut of the traffic, including
all of it.
Note that the conceptual model requires all traffic to
pass through one or more meters, and that the last
meter configured in such a sequence must always
conform.
Counters in this table start counting on creation of
the meter that specifies their existence.

The Action Table enumerates specific apply to  a stream
of classified traffic. Such a stream may include a
single micro-flow, all traffic from a given source to a
given destination, all traffic conforming to a single
classifier, or any other cut of the traffic, including
all of it.
Counters in this table start counting on creation of
the action that specifies their existence.

The Queue Table enumerates the queues  on an interface.
Queues are used to store traffic during intervals when
the arrival rate exceeds the departure rate for a class
of traffic. Because some PHBs indicate that the use of
a priority queue may be advisable, each queue in this
system is seen as having a priority. Those queues that
share the same priority operate in what may externally
appear to be a Weighted Round Robin manner, and preempt
the traffic belonging to any lower priority. For this
reason, it is strongly urged that traffic placed into
prioritized queues be strongly policed to avoid traffic
lockout.
Queues in this table also have a minimum and a maximum
rate.  When a maximum rate is specified, the queue acts
as a shaper if it has sufficient traffic and capacity
is available.  If it is a minimum rate, then the weight
in the WRR is effectively set to this rate divided by
the sum of the rates of queues on the interface,
guaranteeing it at least that throughput rate. If it is
a maximum rate, the queue operates as a shaper. A
shaper potentially reduces the rate of traffic through
it to the indicated rate, and minimizes variations in
rate.