arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.2448cs.GTcs.NI
收藏

自管理网络容量分配博弈的Pareto最优纳什均衡

Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks

Dariusz Gcasior, Maciej Drwal

摘要:

本文介绍了一个容量分配博弈,该博弈从分布式非合作代理的角度模拟了网络效用最大化问题。出于自我管理的网络的想法,在开发的框架中,决策实体与各个传输链路相关联,决定它们在并发流之间分配容量的方式。给出了一个有效的分散算法来计算强Pareto最优策略,构成一个纯纳什均衡。随后,我们讨论了引入的博弈的性质有关的无政府代价和稳定的价格。本文最后进行了实验研究。

英文摘要:

In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed framework decision-making entities are associated with individual transmission links, deciding on the way they split capacity among concurrent flows. An efficient decentralized algorithm is given for computing strongly Pareto-optimal strategies, constituting a pure Nash equilibrium. Subsequently, we discuss the properties of the introduced game related to the Price of Anarchy and Price of Stability. The paper is concluded with an experimental study.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑