一种基于端系统竞价博弈的网络资源分配模型

Resource Allocation Model Based on End-system Bidding Game

随着网络流量以指数形式急剧增长,各种应用对网络资源的需求随之增加,特别是需要严格QoS保证的实时网络多媒体应用要求更多的网络资源。资源分配是QoS分配的最终实现,QoS分配目的是为了进行合理的资源分配,因而有效的资源分配十分重要。在描述资源分配问题的基础上,对资源分配博弈进行了深入研究,提出了能够反映供求关系的基于竞价的网络资源定价机制,并设计了端系统的效用函数,论证了资源分配博弈中Nash均衡点的存在性和唯一性以及实现Nash均衡解端系统的竞价策略。最后,为完善上述资源分配博弈模型,对该模型中的资源价格和相同竞价问题进行进一步讨论。该研究为基于竞价的资源分配算法的设计提供了理论上的支持。

Along with the exponentially rapidly increase in network traffic, the demands on the network resource from various applications grow. Especially, the network multimedia applications with strict QoS-guaranteed require more net- work resource. Network resource allocation is the final implementation of QoS allocation. The aim of QoS allocation is rational resource allocation. Therefore, efficient resource allocation is indispensable. After the problem resource allocation was discussed, we studied the resource game further. The mechanism of network resource pricing, which shows the relation of supply and demand, was presented based on bidding. Subsequently, we designed the utility function of end system and proved the existence and uniqueness of Nash Equilibrium in resource allocation game. Then, the end system＇s bidding strategy to reach Nash Equilibrium was discussed. At last,we further discussed the problem of resource price and the same bid in above model. The research in this paper provides the theoretic support for the coming design of resource allocation algorithm.