Lines Matching full:packet
93 pass one packet, and throttle again. Due to timer resolution constraints,
103 When enqueueing a packet, CBQ starts at the root and uses various methods to
109 children), we enqueue the packet there. If it is not yet a leaf node, we do
120 Consult the defmap for the priority assigned to this packet, which depends
130 This algorithm makes sure that a packet always ends up somewhere, even while
164 This allotment is the 'chunkiness' of link sharing and is used for determining packet
169 The average size of a packet is needed for calculating maxidle, and is also used
178 The cell size determines he granularity of packet transmission time calculations. Has a sensible default.
181 A zero sized packet may still take time to transmit. This value is the lower
182 cap for packet transmission time calculations - packets smaller than this value
252 idle time, and pass 1 packet. However, Unix kernels generally have a
264 avgidle will be big enough to send one packet. To prevent a sudden
281 CBQ can also classify based on the packet's priority. There are 16
327 Management Models for Packet Networks",
