• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.603-627
• /
• 1998

The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.39-46
• /
• 2004

In this paper, we carry out a performance study related to the Broadband Network. For this network, it has been proposed to use the leaky bucket as a way of controlling congestion within the network. On the top of leaky bucket type rate based congestion control scheme for high speed networks, a user will typically operate an error control scheme for retransmitting lost and erroneous packets. We propose a performance model in order to study the interaction between a user's error control scheme and the leaky bucket congestion control scheme for high speed networks. Simulation results show that parameters such as the window size and the token generation rate in the leaky bucket are key factors affecting the end-to-end delay.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.9-12
• /
• 2000

In this paper, we carry out a performance study related to the Advanced Peer-to-Peer Network(APPN). For this particular network, it has been proposed to use the leaky bucket as a way of controlling congestion within the network. On the top of leaky bucket type rate based congestion control scheme for high speed networks, a user will typically operate an error control scheme for retransmitting lost and erroneous packets. We propose a Perform ance model in order to study the Interaction between a user's error control scheme and the leaky bucket congestion control scheme for high speed networks. Simulation results show that parameters such as the window size and the token generation rate in the leaky bucket are key factors affecting the end-to-end delay.

• Journal of Digital Contents Society
• /
• v.8 no.4
• /
• pp.573-579
• /
• 2007

The Leaky Bucket mechanism has been studied in many areas. There has been much interest in flow control in High Speed Networks using the Leaky Bucket. In this paper, We propose the Burst Tokens Fill method that performs well in Leaky Bucket to control the average rate, peak rate, and burst size. This scheme show the improvement of performance. However, This method does not apply all area of applications. Especially application of on-off shape is appropriate and the other area must need to care for appling this scheme.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.7 no.1
• /
• pp.15-23
• /
• 2003

ATM networks provide the various kinds of service which require the different Quality of Services(QoS) such as loss and delay. By statistically multiplexing of traffics and the uncertainty and fluctuation of source traffic pattern, the congestion may occur. The leaky bucket scheme is a representative policing mechanism for preventive congestion control. In this paper, we analyze the HOL(Head-of-Line) priority leaky bucket scheme. That is, traffics are classified into real-time and nonreal-time traffic. The real-time traffic has priority over nonreal-time traffic for transmission. For proposed mechanism, we obtain the system state distribution, finally the loss probability and the mean waiting time of real-time and nonreal-time traffic. The simple numerical examples also are presented.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.2
• /
• pp.274-279
• /
• 1998

We investigate a Leaky Bucket(LB) scheme with a threshold in the data buffer, where leaky rate changes depending on the contents of data buffer. We use the fluid flow model for the analysis of the LB scheme with a threshold. We model the bursty input source as markov modulated fluid flow(MMFF) As performance measures we obtain loss probability and mean delay. We present some numerical results to show the effects of the level of a threshold, the rate of token generation, the size of token pool, and the size the data buffer on the performances of the LB scheme with a threshold.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.553-568
• /
• 1999

This paper is of concern to queueing analysis of the dynamic rate leaky bucket(LB) scheme in which the token generation interval changes according to the buffer state at a token generation epoch. Cell arrivals are assumed to follow a Markovian arrival process (MAP) which is weakly dense in the class of the stationary point processes. By using the embedded Markov chain method we obtain the probability distribution of the system state at a token generation epoch and an arbitrary time. Some simple numerical examples also are provided to show the effects of the proposed LB scheme.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.657-669
• /
• 2006

In this paper, we analyze a leaky bucket (LB) scheme with queue length dependent arrival rates. In other words, if the queue length exceeds an appropriate threshold value on buffer, the arrivals need to be controlled. In ATM networks, if the congestion occurs, the input traffics must be controlled (reduced) for congestion resolution. By the bursty and correlated properties of traffics, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the loss probability and the waiting time distribution for arbitrary cell. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effects of our proposed LB scheme.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.404-410
• /
• 1999

A scheme of more exact overflow probability analysis is proposed for traffic regulated by dual leaky bucket. To each regulated traffic stream is allocated bandwidth and buffer independent of other traffic stream and overflow occurs when total bandwidth or buffer allocated to each traffic exceed link capacity or physical buffer size. Ratio of buffer and bandwidth allocated to each traffic stream is assumed to be constant, and this ratio is larger than the ratio of physical buffer and bandwidth due to buffer sharing effect. Numerical experiments show that this sharing effect have significant influence on overflow probability and effective bandwidth.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.2
• /
• pp.103-113
• /
• 2013

We analyze the queueing model for leaky bucket (LB) scheme with dynamic arrivals and token rates. In other words, in our LB scheme the arrivals and token rates are changed according to the buffer occupancy. In telecommunication networks, the LB scheme has been used as a policing function to prevent congestion. By considering bursty and correlated properties of input traffic, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the distribution of system state, and obtain the loss probability and the mean waiting time. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effect of our proposed model.