DocumentCode
3209530
Title
Combinatorial Auctions Based Network Resource Allocation Mechanism with High Welfare
Author
Wang, Tingting ; Xie, Jinkui ; Jin, Bei ; Yang, Zongyuan
Author_Institution
Dept. of Comput. Sci. & Technol., East China Normal Univ., Shanghai, China
fYear
2009
fDate
17-19 Dec. 2009
Firstpage
213
Lastpage
218
Abstract
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.
Keywords
combinatorial mathematics; distributed processing; game theory; resource allocation; combinatorial auctions; network resource allocation mechanism; network service; social welfare; user welfare function; Computer science; Data analysis; Information technology; Marketing and sales; Peer to peer computing; Pricing; Resource management; Utility theory; Video sharing; Videoconference; combinatorial auctions; network resource; resource allocation; social welfare;
fLanguage
English
Publisher
ieee
Conference_Titel
Frontier of Computer Science and Technology, 2009. FCST '09. Fourth International Conference on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3932-4
Electronic_ISBN
978-1-4244-5467-9
Type
conf
DOI
10.1109/FCST.2009.85
Filename
5392914
Link To Document