Search results
Results From The WOW.Com Content Network
The leaky bucket algorithm is sometimes contrasted with the token bucket algorithm. However, the above concept of operation for the leaky bucket as a meter may be directly compared with the token bucket algorithm, the description of which is given as the following: A token is added to the bucket every 1/r seconds.
The leaky bucket as a queue is therefore applicable only to traffic shaping, and does not, in general, allow the output packet stream to be bursty, i.e. it is jitter free. It is therefore significantly different from the token bucket algorithm. These two versions of the leaky bucket algorithm have both been described in the literature under the ...
Metering may be implemented with, for example, the leaky bucket or token bucket algorithms (the former typically in ATM and the latter in IP networks). Metered packets or cells are then stored in a FIFO buffer, one for each separately shaped class, until they can be transmitted in compliance with the associated traffic contract.
However, comparison of the leaky bucket and token bucket algorithms shows that they are simply mirror images of one another, one adding bucket content where the other takes it away and taking away bucket content where the other adds it. Hence, given equivalent parameters, implementations of both algorithms will see exactly the same traffic as ...
The section titled Traffic shaping algorithms (leaky bucket versus token bucket) needs to be addressed. Its discussion of the leaky bucket algorithm makes it clear that it refers only to the leaky bucket as a queue rather than the more general leaky bucket as a meter.
The reference model given by the ITU-T and ATM Forum for UPC and NPC is the generic cell rate algorithm (GCRA), [17] [18] which is a version of the leaky bucket algorithm. CBR traffic will normally be policed to a PCR and CDVT alone, whereas VBR traffic will normally be policed using a dual leaky bucket controller to a PCR and CDVT and an SCR ...
A leaky bucket IS equivalent to a token bucket in the sense that it would find exactly the same packets conforming and non conforming of a traffic stream. This case is met when the filling rate of the token bucket is equal to the draining rate of the leaky bucket; when their burst tolerances are the same; and when at time zero the leaky bucket ...
The model applies the leaky bucket algorithm to a stochastic source. The model was first introduced by Pat Moran in 1954 where a discrete-time model was considered. [7] [8] [9] Fluid queues allow arrivals to be continuous rather than discrete, as in models like the M/M/1 and M/G/1 queues.