By Topic

Auction-based bandwidth assignment for multi-path routing in selfish networks

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
$33 $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)
Chaoping Guo ; State Key Lab of Integrated Services Network, Xidian Univ, Xi'an, CO 710071 China ; Kun Han ; Hailin Zhang ; Yongzhao Li

The paper considers the problem of joint assignment of bandwidth and route in multi-path selfish networks. We model this problem as auction game and make mechanism design. The model is a convex optimization problem, and large computation overhead is needed to resolve it. We make theoretical analysis and present two algorithms to resolve the model. One is hybrid water filling assignment algorithm for non-linear cost function, and the other is Least-Cost-Path-based assignment algorithm for linear cost function. Extensive evaluations show that these two algorithm can decrease computation overhead and the second also decrease the total cost of participant nodes.

Published in:

2011 Third International Conference on Ubiquitous and Future Networks (ICUFN)

Date of Conference:

15-17 June 2011