This queue is used to directly control that flow: Packets are entered into the queue as they arrive, equivalent to the water being added to the bucket. In the second version, the bucket is a queue in the flow of traffic. This version is referred to here as the leaky bucket as a meter. the bucket does not overflow, that indicates its conformance to the bandwidth and burstiness limits or the average and peak rate event limits. If the counter remains below a specified limit value when a packet arrives or an event occurs, i.e. As a result, the value in the counter represents the level of the water in the bucket. The counter is also decremented at a fixed rate, equivalent to the way the water leaks out of the bucket. This counter is used only to check that the traffic or events conform to the limits: The counter is incremented as each packet arrives at the point where the check is being made or an event occurs, which is equivalent to the way water is added intermittently to the bucket. In one version the bucket is a counter or variable separate from the flow of traffic or schedule of events. This has resulted in confusion about what the leaky bucket algorithm is and what its properties are. These give what appear to be two different algorithms, both of which are referred to as the leaky bucket algorithm and generally without reference to the other method. Two different methods of applying this leaky bucket analogy are described in the literature. The generic cell rate algorithm, or an equivalent, may also be used to shape transmissions by a network interface card onto an ATM network.Īt least some implementations of the leaky bucket are a mirror image of the token bucket algorithm and will, given equivalent parameters, determine exactly the same sequence of events to conform or not conform to the same limits. It is used in packet-switched computer networks and telecommunications networks in both the traffic policing, traffic shaping and scheduling of data transmissions, in the form of packets, to defined limits on bandwidth and burstiness (a measure of the variations in the traffic flow).Ī version of the leaky bucket, the generic cell rate algorithm, is recommended for Asynchronous Transfer Mode (ATM) networks in Usage/Network Parameter Control at user–network interfaces or inter-network interfaces or network-to-network interfaces to protect a network from excessive traffic levels on connections routed through it. It may also be used to check conformance or limit to an average rate alone, i.e. to limit the actions associated with these events to these rates or delay them until they do conform to the rates. It can be used to determine whether some sequence of discrete events conforms to defined limits on their average and peak rates or frequencies, e.g.
The leaky bucket is an algorithm based on an analogy of how a bucket with a constant leak will overflow if either the average rate at which water is poured in exceeds the rate at which the bucket leaks or if more water than the capacity of the bucket is poured in all at once.
0 kommentar(er)
