A Fair and Efficient Congestion Avoidance Scheme Based on the Minority Game
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we propose a new congestion control scheme for high-speed networks. The basic idea of our proposed scheme is to adopt a game theory called, “Minority Game” (MG), to realize a selective reduction of the transmission speed of senders. More concretely, upon detecting any congestion, the scheme starts a game among all senders who are participating in the communication. The losers of the game reduce the transmission speed by a multiplicative factor. MG is a game that has recently attracted considerable attention, and it is known to have a remarkable property so that the number of winners converges to a half the number of players in spite of the selfish behavior of the players to increase its own profit. By using this property of MG, we can realize a fair reduction of the transmission speed, which is more efficient than the previous schemes in which all senders uniformly reduce their transmission speed. The effect of the proposed scheme is evaluated by simulation. The result of simulations indicates that the proposed scheme certainly realizes a selective reduction of the transmission speed. It is sufficiently fair compared to other simple randomized schemes and is sufficiently efficient compared to other conventional schemes.
Abstract
In this paper, we propose a new congestion control scheme for high-speed networks. The basic idea of our proposed scheme is to adopt a game theory called, “Minority Game” (MG), to realize a selective reduction of the transmission speed of senders. More concretely, upon detecting any congestion, the scheme starts a game among all senders who are participating in the communication. The losers of the game reduce the transmission speed by a multiplicative factor. MG is a game that has recently attracted considerable attention, and it is known to have a remarkable property so that the number of winners converges to a half the number of players in spite of the selfish behavior of the players to increase its own profit. By using this property of MG, we can realize a fair reduction of the transmission speed, which is more efficient than the previous schemes in which all senders uniformly reduce their transmission speed. The effect of the proposed scheme is evaluated by simulation. The result of simulations indicates that the proposed scheme certainly realizes a selective reduction of the transmission speed. It is sufficiently fair compared to other simple randomized schemes and is sufficiently efficient compared to other conventional schemes.
참고문헌 (12)
- D. Challet, "Emergence of Cooperation and Organization in an Evolutionary Game", PhysicaA, pp.246~407 (1997)
- D. Chiu, "Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks", Journal of Computer Networks and ISDN, 17(1), pp.1~14 (1989)
- E. Moro, "The Minority Game: an introductory guide, In Advances in condensed matter and statistical physics" (2003), Nova Science Publishers
- J.Postel, "Transmission Control Protocol.RFC 793", ~ (1981)
- M. Paczuski, "Self-organized Networks of Competing Boolean Agents", Physical Review Letters, 84, pp.3185~3188 (2000)
- N. F. Johnson, "Self-Organized Segregation within an Evolving Population", Physical Review Letters, 82, pp.3360~3363 (1999)
- P.C.Attie, "A. Lahanas and V.Tsaoussidis. “Bimodal Congestion Avoidance and Control", Proceedings of IEEE, 2002, ~
- A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems, "R. Jain", ~, pp.DEC Research Report TR-301 (1984)
- S. Floyd, "HighSpeed TCP for Large Congestion Windows. Internet Draft <draft-floyd-tcp-highspeed- 01.txt>", ~ (2002)
- T. Kelly, "Scalable TCP: Improving Performance in High speed Wide Area Networks", ACM SIGCOMM Computer Communication Review, 33, pp.83~91 (2003)
- W. B. Arthur, "Inductive Reasoning and Bounded Rationality(The ElFarol Problem)", Proceedings of American Economic Review, 84, pp.406~411 (1994)