Online Network Resource Allocation Mechanism with the Continuous High Satisfaction
The article is mainly about how to allocate the limited network resources timely and effectively meanwhile improving the overall satisfaction after the allocation. In this paper, a general resource allocation model is established which integrates the typical characteristic of the actual access/supply restricted network resources, considering user credit, waiting time and other factors. The user satisfaction function was designed in the article, and according to this function, the unit satisfaction based allocation mechanism and combinatorial auction based allocation mechanism are also designed. The experiment here is designed to simulate the effects of resources allocation when using different allocation mechanisms. Treating the overall satisfaction from unit-based allocation mechanism as a base of comparison, and considering the satisfaction proportion to analyze the performance of different allocation mechanisms, it is concluded that combinatorial auction based allocation mechanisM could get a more effective and stable network resource allocation and achieve a higher overall satisfaction.
Combinatorial auction Mechanism design Online Resource allocation Satisfaction
Bei Jin Jinkui Xie Tingting Wang Zongyuan Yang
Department of Computer Science & Technology East China Normal University Shanghai 200241, P.R.China
国际会议
Second International Symposium on Information Science and Engineering(第二届信息科学与工程国际会议)
上海
英文
254-258
2009-12-26（万方平台首次上网日期，不代表论文的发表时间）