Performance Comparison among Bandwidth Allocation Schemes using Cooperative Game Theory


The KIPS Transactions:PartC, Vol. 18, No. 2, pp. 97-102, Apr. 2011
10.3745/KIPSTC.2011.18.2.97,   PDF Download:

Abstract

Since the game theory provides a theoretical ground to distribute a shared resource between demanding users in a fair and efficient manner, it has been used for the bandwidth allocation problem in a network. However, the bandwidth allocation schemes with different game theory assign different amount of bandwidth in the same operational environments. However, only the mathematical framework is adopted when a bandwidth allocation scheme is devised without quantitatively comparing the results when they applied to the bandwidth allocation problem. Thus, in this paper, we compare the characteristics of the bandwidth allocation schemes using the bankrupt game theory and the bargaining game theory when they applied to the situation where nodes are competing for the bandwidth in a network. Based on the numerical results, we suggest the future research direction.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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. S. Park and Y. J. Lim, "Performance Comparison among Bandwidth Allocation Schemes using Cooperative Game Theory," The KIPS Transactions:PartC, vol. 18, no. 2, pp. 97-102, 2011. DOI: 10.3745/KIPSTC.2011.18.2.97.

[ACM Style]
Jae Sung Park and Yu Jin Lim. 2011. Performance Comparison among Bandwidth Allocation Schemes using Cooperative Game Theory. The KIPS Transactions:PartC, 18, 2, (2011), 97-102. DOI: 10.3745/KIPSTC.2011.18.2.97.