Bandwidth Trading: A Comparison of the Combinatorial and Multicommodity Approach

• Autorzy: Kołtyś K. , Pałka P. , Toczyłowski E. , Żółtowska I.
• Języki publikacji: EN

Abstrakty

EN

Since the telecommunication market becomes more complex and dynamic, a strong need for a new, efficient and flexible bandwidth trading mechanisms appears. We believe that good mechanisms, that allow effective and fair allocation of bandwidth between market participants will help to develop the real competitive bandwidth market. In this paper we compare two different double-sided bandwidth auction mechanisms, that seem to be well suited approaches for trading indivisible units of bandwidth: combinatorial auction c-SeBiDA and multicommodity mechanism BACBR-I. The c-SeBiDA mechanism considers two types of commodities: inter-node links and paths consisting of particular links. Market participants may bid a single link, or a bundle of links, constituting a specific path. The BACBR-I mechanism is a multicommodity exchange model, that allows bidders to place buy offers not only for individual or bundled links, but rather for end-to-end connections. Therefore, it is the decision model that allocates the most efficient links to connections. We run a large set of experiments to test the allocation and computational efficiency obtained under both approaches.

Słowa kluczowe

EN

bandwidth allocation; combinatorial auction; computational efficiency; ndivisible resources; multicommodity trade

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2010
• Tom: nr 2
• Strony: 67--72
• Opis fizyczny: Bibliogr. 12 poz., rys., tab.

Twórcy

autor

Kołtyś K.

autor

Pałka P.

autor

Toczyłowski E.

autor

Żółtowska I.

• Institute of Control and Computation Engineering, Warsaw University of Technology, Nowowiejska st 15/19, 00-665 Warsaw, Poland,

Bibliografia

• [1] A. Iselt, A. Kirstadter, and R. Chahine, “Bandwidth trading – a business case for ASON?”, in Proc. 11th Int. Telecommun. Netw. Strat. Plann. Symp. Networks 2004, Vienna, Austria, 2004, pp. 63–68.
• [2] R. Rabbat and T. Hamada, “Revisiting bandwidth-on-demand enablers and challengers of a bandwidth market”, in Proc. Netw. Oper. Manage. Symp. NOMS 2006, Vancouver, Canada, 2006, pp. 1–12.
• [3] R. Jain and P. Varaiya, “Efficient market mechanisms for network resource allocation”, in Proc. Decis. Contr. Conf. CDC-ECC’05, Seville, Spain, 2005, pp. 1056– 1061.
• [4] P. Pałka, K. Kołtyś, E. Toczyłowski, and I. Żołtowska, “Model for balancing aggregated communication bandwidth resources”, J. Telecommun. Inform. Technol., no. 3, pp. 45–50, 2009.
• [5] J. Abrache, T. G. Crainic, M. Gendreau, and M. Rekik, “Combinatorial auctions”, Ann. OR, vol. 153, no. 1, pp. 131–164, 2007.
• [6] M. Dramitinos, G. D. Stamoulis, and C. Courcoubetis, “An auctionmechanism for allocating the bandwidth of networks to their users”,Comput. Netw., vol. 51, no. 18, pp. 4979–4996, 2007.
• [7] R. Jain and J. Walrand, “An efficient mechanism for network bandwidth auction”, in Proc. Netw. Oper. Manage. Symp. NOMS 2008 Worksh., Salvador, Brazil, 2008, pp. 227–234.
• [8] M. Pioro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. San Francisco: MorganKaufmann, 2004.
• [9] G. Cheliotis, “Structure and dynamics of bandwidth markets”, Ph.D. thesis, Athens, N.T.U., 2001.
• [10] W. Stańczuk, J. Lubacz, and E. Toczyłowski, “Trading links and paths on a communication bandwidth markets”, J. Univers. Comput. Sci., vol. 14, no. 5, pp. 642–652, 2008.
• [11] “Survivable network design library”, 2009 [Online]. Available: http://sndlib.zib.de/
• [12] “Open M3”, 2008 [Online]. Available: http://www.openm3.org/