Fairness Improvement Leaky Bucket Algorithm for Group Connections in ATM Network 


Vol. 30,  No. 9, pp. 591-595, Sep.  2005


PDF
  Abstract

In this paper, we propose the fairness improvement leaky bucket (FILB) algorithm as a traffic policing mechanism. In the proposed algorithm, there is a cell buffer for every ATM connection in order to store date cells. Network decides whether an ATM connection obeys the contracted traffic parameter, and stores data cells in the cell buffer if the connection obeys but is considered as violated the contract due to temporary lack of network resource. By using the proposed algorithm, we can obtain the statistical multiplexing gain that is the superiority of packet switching network. Moreover, when a connection tries to transmit more data cells by violating the contracted traffic parameters, the connection is prevented from using excess network resource, which incurs all connections sharing network resource fairly. The performance of the proposed FILB algorithm is investigated by using the simulation. The result shows that the proposed algorithm provides superior performance and all connections within a group share network resource fairly. The proposed algorithm can be applied not only the ATM network but also IP network.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Lee, "Fairness Improvement Leaky Bucket Algorithm for Group Connections in ATM Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 9, pp. 591-595, 2005. DOI: .

[ACM Style]

Jae-hwoon Lee. 2005. Fairness Improvement Leaky Bucket Algorithm for Group Connections in ATM Network. The Journal of Korean Institute of Communications and Information Sciences, 30, 9, (2005), 591-595. DOI: .

[KICS Style]

Jae-hwoon Lee, "Fairness Improvement Leaky Bucket Algorithm for Group Connections in ATM Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 9, pp. 591-595, 9. 2005.