• 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 Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1116-1125
• /
• 1997

In this paper, the modified UPC(Usage Parameter Control) algorithm is proposed. The proposed UPC algorithm is based on Leakey Bucket algorithm and adds the characteristics of the jumping window algorithm for monitoring the average bit rate. The proposed algorithm let a cell, which is tagged by Leaky Bucket algorithm, pass through the network, if the network does not violate the average bit rate. The measuring method of window mechanism like jumping window. This paper supposes On/Off traffic source model of rthe performance evaluation and analysis of the proposed algorithm. Therefore, as simulation results, the proposed algorithm acquires more reduced results of the cell loss rate and bucket size than the Leaky Bucket algorithm.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.50-53
• /
• 1998

In this paper, the modified Usage Parameter Control(UPC) method based on Dual Leaky Bucket algorithm is proposed to improve the perfor mance of multimedia synchronization and to control burst traffic. In the proposed algorithm, Synchronous cells are by passed to the 2nd stage Leaky Bucket (LB) of the DLB. for overloaded traffic condition, the violated cells are saved in a temporary buffer and they are retransmitted when the 2nd stage bucket is empty.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.520-528
• /
• 2002

The ATM Forum recently introduced the Guaranteed Frame Rate(GFR) service category GFR service has been designed to support classical best effort traffic such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput, but also supports fair distribution of available bandwidth to completing VCs. In this paper, we proposed a new buffer management algorithm based on leaky bucket to provide minimum cell rate guarantee and improve fairness. The proposed algorithm reduces complexity and processing overhead of leaky-bucket algorithm to implement easily.

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.45-65
• /
• 1997

We build a queueing model for buffered leaky bucket system. First, we set up system equations and them calculate the steady-state probabilities at an arbitrary time epoch by recursive method. We derive the mean waiting time and the mean number of cells in the input buffer, and evaluate the performance of the buffered leaky bucket system to find the optimal queue capacity and token generation rate that meet the quality of service(QoS).

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.78-87
• /
• 2004

This paper presents deterministic, worst-case analysis of a queueing system whose multiple homogeneous input streams are regulated by the associated leaky buckets and the queueing system that has a single stream regulated by the jumping-window. Queueing delay averaged over all items is used for performance measure, and the worst-case input traffic and the worst-case performance are identified for both queueing systems. For the former queueing system, the analysis explores different phase relations among leaky-bucket token generations. This paper observes how the phase differences among the leaky buckets affect the worst-case queueing performance. Then, this paper relates the worst-case performance of the former queueing system with that of the latter (the single stream case, as in the aggregate streams from many users, whose item arrivals are regulated by one jumping-window). It is shown that the worst-case performance of the latter is identical to that of the former in which all leaky buckets have the same phase and have particular leaky bucket parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.1
• /
• pp.125-148
• /
• 1998

The use of shaping mechanism, realized by means of a leaky bucket based algorithm on input traffic of an ATM network allows to achieve higher utilization of network resources, and to guarantee the quality of service requested by the users. The functionalities of the shaping mechanism based on leaky bucket, are characterized by the token pool sire and by input queue size. In this paper we have analyzed, using simulations, the effect on the quality of service in ATM network of leaky bucket algorithm when shaper parameters described above are changed.

• 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.

• 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.