# [1]陶军,吴家皋,刘业.无限重复流速与拥塞控制博弈实例的应用[J].东南大学学报(自然科学版),2005,35(6):853-857.[doi:10.3969/j.issn.1001-0505.2005.06.005] 　Tao Jun,Wu Jiagao,Liu Ye.Application of examples of infinite repeated flow and congestion control game[J].Journal of Southeast University (Natural Science Edition),2005,35(6):853-857.[doi:10.3969/j.issn.1001-0505.2005.06.005] 点击复制 无限重复流速与拥塞控制博弈实例的应用() 分享到： var jiathis_config = { data_track_clickback: true };

35

2005年第6期

853-857

2005-11-20

## 文章信息/Info

Title:
Application of examples of infinite repeated flow and congestion control game

Author(s):
Key Laboratory of Computer Networks and Information Integration of Ministry of Education, Southeast University, Nanjing 210096, China
Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China

Keywords:

TP393
DOI:
10.3969/j.issn.1001-0505.2005.06.005

Abstract:
After the one-shot game model and flow equilibrium solution are discussed, the behaviors of flow and congestion control based on infinite repeated game model further is studied. Subsequently, repeated and infinite repeated flow and congestion control game model is presented. The existence and optimization of the Nash equilibrium point is proved. The discount factor in repeated game is discussed. Finally, through two examples of repeated flow control game with two users and N users, this article explains how to regularize or restrict the users’ behaviors in non-cooperative flow and congestion control respectively to optimize the utility of whole system.

## 参考文献/References:

[1] Altman E.Flow control using the theory of zero sum Markov games [J].IEEE Transactions on Automatic Control,1994,39(4):814-818.
[2] Friedmn E J,Shenker S.Learning and implemention on the Internet [D].Department of Economics,Rutgers University,1998.16-20.
[3] Rapoport A,Chammah A.Prisoner’s dilemma [M].Michigan:University of Michigan Press,1965.12-31.
[4] Basar T,Srikant R.Revenue-maximizing pricing and capacity expansion in a many-users regime [A].In: Proc IEEE INFOCOM’02[C].New York,2002.1556-1563.
[5] Bertsekas D P.Nonlinear programming [M].Belmont,MA:Athena Scientific,1995.169-177.
[6] 张维迎.博弈论与信息经济学 [M].上海:上海人民出版社,2002.56-60.
[7] Richard J,Venkat A.Optimal routing control:repeated game approach [J].IEEE Transactions on Automatic Control,2002,47(3):437-450.
[8] Douligeris C,Mazumdar R R.On pareto-optimal flow control in an integrated environment [A].In: Proc of the 25th Allerton Conference[C].Urbana,IL,1986.383-402.
[9] Douligeris C,Mazumdar R R.More on pareto-optimal flow control [A].In: Proc of the 26th Allerton Conference[C].Urbana,IL,1987.553-574.
[10] Douligeris C,Mazumdar R R.User optimal flow control in an integrated environment [A].In: Proc of the Indo-US Workshop on Signals and Systems[C].Bangalore,India,1988.383-402.

## 相似文献/References:

[1]陶军,林辉.非合作流速与拥塞控制博弈的应用[J].东南大学学报(自然科学版),2006,36(1):52.[doi:10.3969/j.issn.1001-0505.2006.01.011]
Tao Jun,Lin Hui.Application and research on non-cooperative flow and congestion control game[J].Journal of Southeast University (Natural Science Edition),2006,36(6):52.[doi:10.3969/j.issn.1001-0505.2006.01.011]
[2]黄园高,周晶.收费公路和公共交通之间的定价博弈分析[J].东南大学学报(自然科学版),2004,34(2):268.[doi:10.3969/j.issn.1001-0505.2004.02.030]
Huang Yuangao,Zhou Jing.Fare competition between highway and public transport[J].Journal of Southeast University (Natural Science Edition),2004,34(6):268.[doi:10.3969/j.issn.1001-0505.2004.02.030]
[3]林辉,陈行,陶军.基于静态非合作博弈的网络报文取样模型[J].东南大学学报(自然科学版),2010,40(3):481.[doi:10.3969/j.issn.1001-0505.2010.03.009]
Lin Hui,Chen Hang,Tao Jun.Network packets sampling modeling based on static non-cooperative game[J].Journal of Southeast University (Natural Science Edition),2010,40(6):481.[doi:10.3969/j.issn.1001-0505.2010.03.009]