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 / sup...

Full description

Saved in:
Bibliographic Details
Main Authors: Bei Jin, Jinkui Xie, Tingting Wang, Zongyuan Yang
Format: Conference Proceeding
Language:English
Subjects:
Channel allocation
Combinatorial auction
Computer science
Data analysis
Information science
Mechanism design
Monopoly
Online
Performance analysis
Pricing
Resource allocation
Resource management
Road transportation
Satisfaction
Supply chain management
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2160-1283
DOI:10.1109/ISISE.2009.32