Auctions for Resource Allocation in Overlay Networks

  • Pablo Belzarena
  • Andrés Ferragut
  • Fernando Paganini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5425)


The paper studies the problem of allocating bandwidth resources of a Service Overlay Network, to optimize revenue. Clients bid for network capacity in periodically held auctions, under the condition that resources allocated in an auction are reserved for the entire duration of the connection, not subject to future contention. This makes the optimal allocation coupled over time, which we formulate as a Markov Decision Process (MDP). Studying first the single resource case, we develop a receding horizon approximation to the optimal MDP policy, using current revenue and the expected revenue in the next step to make bandwidth assignments. A second approximation is then found, suitable for generalization to the network case, where bids for different routes compete for shared resources. In that case we develop a distributed implementation of the auction, and demonstrate its performance through simulations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Altman, E.: Applications of Markov Decision Processes in Communication Networks: a Survey. In: Feinberg, E., Shwartz, A. (eds.) Markov Decision Processes, Models, Methods, Directions, and Open Problems, pp. 488–536. Kluwer, Dordrecht (2001)Google Scholar
  2. 2.
    Bertsekas, D.P.: Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, Englewood Cliffs (1987)zbMATHGoogle Scholar
  3. 3.
    Dramitinos, M., Stamoulis, G.D., Courcoubetis, C.: An auction mechanism for allocating the bandwidth of networks to their users. Computer Networks 51 (2007)Google Scholar
  4. 4.
    Chads, I., Cros, M.-J., Garcia, F., Sabbadin, R.: Markov Decision Process Toolbox for MATLAB,
  5. 5.
    Dramitinos, M., Stamoulis, G., Courcoubetis, C.: Auction-based resource reservation in 2.5/3G Networks. Mobile Networks and Apps. 9, 557–566 (2004)CrossRefGoogle Scholar
  6. 6.
    Duan, Z., Zhang, Z.-L., Hou, Y.T.: Service Overlay Networks: SLAs, QoS and Bandwidth Provisioning. IEEE/ACM Trans. on Networking, 870–883 (2003)Google Scholar
  7. 7.
    Lazar, A.A., Semret, N.: Design and Analysis of the Progressive Second Price auction for Network Bandwidth Sharing. Telecommunications Systems (2000)Google Scholar
  8. 8.
    Maillé, P., Tuffin, B.: Pricing the internet with multibid auctions. IEEE/ACM Trans. Netw. 14(5), 992–1004 (2006)CrossRefGoogle Scholar
  9. 9.
    Puterman, M.L.: Markov Decision Processes. Wiley, New Jersey (2005)zbMATHGoogle Scholar
  10. 10.
    Reichl, P., Wrzaczek, S.: Equilibrium Market Prices for Multi-Period Auctions of Internet Resources. In: MMB 2004, pp. 25–34 (2004)Google Scholar
  11. 11.
    Srikant, R.: The Mathematics of Internet Congestion Control. Birkhäuser, Basel (2004)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Pablo Belzarena
    • 1
  • Andrés Ferragut
    • 1
    • 2
  • Fernando Paganini
    • 2
  1. 1.Universidad de la RepúblicaUruguay
  2. 2.Universidad ORTMontevideoUruguay

Personalised recommendations