PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Multicommodity Auction Model for Indivisible Network Resource Allocation

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this paper we present the multicommodity auction model BCBT-I that allocates indivisible network resources among bidders. The approach can be considered as a generalization of the basic multicommodity model for balancing communication bandwidth trade (BCBT). The BCBT model assumes that offers concerning inter-node links and point-to-point bandwidth demands can be realized partially. However, in the real-world trade there might be a need to include capacity modularity in the market balancing process. Thus we state the model for balancing communication bandwidth trade that takes into account the indivisibility of traded bandwidth modules. This requires to solve a mixed integer problem and increases computational complexity. Furthermore, the pricing issue appears nontrivial, as the dual prices cannot be longer used to set fair, competitive market prices. For clearing the market, we examine the multicommodity pricing mechanizm based on differentiation of buy and sell market prices.
Rocznik
Tom
Strony
60--66
Opis fizyczny
Bibliogr. 13 poz., rys.
Twórcy
autor
autor
  • Institute of Control and Computation Engineering, Warsaw University of Technology, Nowowiejska st 15/19, 00-665 Warsaw, Poland, K.J.Koltys@elka.pw.edu.pl
Bibliografia
  • [1] G. Cheliotis, “Structure and dynamics of bandwidth markets”, Ph.D. thesis, N.T.U., Athens, 2001.
  • [2] S. Bessler and P. Reichl, A Network Provisioning Scheme Based on Decentralized Bandwidth Auctions. Operations Research/Computer Science Interfaces Series. New York: Springer, 2006.
  • [3] R. Rabbat and T. Hamada, “Revisiting bandwidth-on-demand enablers and challengers of a bandwidth market” in Netw. Oper. Manage. Symp. NOMS 2006, Vancouver, Canada, 2006, pp. 1–12.
  • [4] C. Courcoubetis, M. P. Dramitinos, and G. D Stamoulis, “An auction mechanism for bandwidth allocation over paths”, in Int. Teletraf. Congr. ITC-17, Salvador da Bahia, Brazil, 2001, pp. 1163–1174.
  • [5] M. Dramitinos, G. D. Stamoulis, and C. Courcoubetis, “An auction mechanism for allocating the bandwidth of networks to their users”, Comput. Netw., vol. 51, pp. 4979–4996, 2007.
  • [6] A. Lazar and N. Semret, “Design and analysis of the progressive second price auction for network bandwidth sharing”, Telecommun. Syst. (Special Issue on Network Economics), 1999.
  • [7] Ch. Kaskiris, R. Jain, R. Rajagopa, and P. Varaiya, “Combinatorial auction bandwidth trading: an experimental study”, in Developments on Experimental Economics. Lecture Notes in Economics and Mathematical Systems, vol. 590. Berlin: Springer, 2007, pp. 181–186.
  • [8] W. Stańczuk, J. Lubacz, and E. Toczyłowski, “Trading links and paths on a communication bandwidth markets”, J. Univer. Comput. Sci., vol. 14, no. 5, pp. 642–652, 2008.
  • [9] R. Jain and P. Varaiya, “Combinatorial bandwidth exchange: mechanism design and analysis”, Commun. Inform. Sci., vol. 4, no. 3, pp. 305–324, 2004.
  • [10] P. Pałka, K. Kołtyś, E. Toczyłowski, and I. Żołtowska, “Model for balancing aggregated communication bandwidth resources”, in 7th Int. Conf. Decis. Supp. Telecommun. Inform. Soc. DSTIS 2008, Warsaw, Poland, 2008 (J. Telecommun. Inform. Technol., 2009 – to appear).
  • [11] P. Klemperer, Auctions: Theory and Practice. Princeton: Princeton University Press, 2004.
  • [12] R. B. Myerson and M. A. Satterthwaite, “Efficient mechanisms for bilateral trading”, J. Econom. Theory, vol. 28, pp. 265–281, 1983.
  • [13] E. Toczyłowski, Optymalizacja procesów rynkowych przy ograniczeniach. Warsaw: EXIT, 2003 (in Polish).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BATA-0004-0044
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.