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

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.

[1]  Fernando Paganini,et al.  Network Bandwidth Allocation via Distributed Auctions with Time Reservations , 2009, IEEE INFOCOM 2009.

[2]  K. J. Ray Liu,et al.  A game theoretical framework for dynamic pricing-based routing in self-organized MANETs , 2008, IEEE Journal on Selected Areas in Communications.

[3]  J. Walrand,et al.  An Efficient Mechanism for Network Bandwidth Auction , 2008, NOMS Workshops 2008 - IEEE Network Operations and Management Symposium Workshops.

[4]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[5]  Sammy Chan,et al.  Auction in multi-path multi-hop routing , 2009, IEEE Communications Letters.

[6]  Fan Wu,et al.  Cost-Effective Traffic Assignment for Multipath Routing in Selfish Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[7]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[8]  Patrick Maillé,et al.  Multibid auctions for bandwidth allocation in communication networks , 2004, IEEE INFOCOM 2004.

[9]  E. Bretagne.  Multi-Bid Auctions for Bandwidth Allocation in Communication Networks , 2005 .