Network Bandwidth Allocation via Distributed Auctions with Time Reservations

This paper studies the problem of allocating network capacity through periodic auctions. We impose the following conditions: fully distributed solutions over an arbitrary network topology, and the requirement that resources allocated in a given auction are reserved for the entire duration of the connection, not subject to future contention. Under these conditions, we study the problem of selling capacity to optimize revenue for the operator. We first study optimal revenue for a single distributed auction in a general network. Next, the periodic auctions case is considered for a single link, modelling the optimal revenue problem as a Markov decision process (MDP); we develop a sequence of receding horizon approximations to its solution. Combining the two approaches we formulate a receding horizon optimization of revenue over a general network topology, that yields a distributed implementation. The proposal is demonstrated through simulations.

[1]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[2]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[3]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[4]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[5]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[6]  Aurel A. Lazar,et al.  Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing , 1999 .

[7]  Eitan Altman,et al.  Applications of Markov Decision Processes in Communication Networks , 2000 .

[8]  Asuman E. Ozdaglar,et al.  Routing and wavelength assignment in optical networks , 2003, TNET.

[9]  Costas Courcoubetis,et al.  Pricing communication networks - economics, technology and modelling , 2003, Wiley-Interscience series in systems and optimization.

[10]  Costas Courcoubetis,et al.  Pricing Communication Networks , 2003 .

[11]  Pravin Varaiya,et al.  Pricing network services , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS, and bandwidth provisioning , 2003, TNET.

[13]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[14]  Peter Reichl,et al.  Equilibrium Market Prices for Multi-Period Auctions of Internet Resources , 2004, MMB.

[15]  Paul Klemperer,et al.  Auctions: Theory and Practice , 2004 .

[16]  George D. Stamoulis,et al.  Auction-Based Resource Reservation in 2.5/3G Networks , 2004, Mob. Networks Appl..

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

[18]  Patrick Maillé,et al.  Pricing the Internet With Multibid Auctions , 2006, IEEE/ACM Transactions on Networking.

[19]  George D. Stamoulis,et al.  An auction mechanism for allocating the bandwidth of networks to their users , 2007, Comput. Networks.

[20]  P. Maille,et al.  Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks , 2007, 2007 Next Generation Internet Networks.

[21]  Fernando Paganini,et al.  Auctions for Resource Allocation in Overlay Networks , 2009, NET-COOP.

[22]  U. Rieder,et al.  Markov Decision Processes , 2010 .