By Topic

Combinatorial Auctions Based Network Resource Allocation Mechanism with High Welfare

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tingting Wang ; Dept. of Comput. Sci. & Technol., East China Normal Univ., Shanghai, China ; Jinkui Xie ; Bei Jin ; Zongyuan Yang

This article is mainly about how to allocate scarce resources efficiently in network service, to enable network resources meeting the demand as far as possible, and improving the social welfare of user groups. Considering the user's credit and waiting time for allocating resources, we propose a user welfare function and establish a common network resource allocation mechanism which integrates combinatorial auctions algorithm and welfare function. With the experimental data analyzed, the user welfare function based combinatorial auctions mechanism can achieve a high social welfare and acts effectively and stably.

Published in:

Frontier of Computer Science and Technology, 2009. FCST '09. Fourth International Conference on

Date of Conference:

17-19 Dec. 2009