Temat: combinatorial auction - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Bandwidth Trading: A Comparison of the Combinatorial and Multicommodity Approach
Autorzy:: Kołtyś, K.
Pałka, P.
Toczyłowski, E.
Żółtowska, I.
Powiązania:: https://bibliotekanauki.pl/articles/309152.pdf
Data publikacji:: 2010
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: bandwidth allocation
combinatorial auction
computational efficiency
ndivisible resources
multicommodity trade
Opis:: 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.
Źródło:: Journal of Telecommunications and Information Technology; 2010, 2; 67-72
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing
Autorzy:: Li, Shiyong
Zhang, Yanan
Sun, Wei
Liu, Jia
Powiązania:: https://bibliotekanauki.pl/articles/15548021.pdf
Data publikacji:: 2023
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: fog computing
combinatorial auction
time varying multidimensional resource allocation
resource pricing
mgła obliczeniowa
aukcja kombinatoryczna
wycena zasobów
Opis:: It is a hot topic to investigate resource allocation in fog computing. However, currently resource allocation in fog computing mostly supports only fixed resources, that is, the resource requirements of users are satisfied with a fixed amount of resources during the usage time, which may result in low utility of resource providers and even cause a waste of resources. Therefore, we establish an integer programming model for the time-varying multidimensional resource allocation problem in fog computing to maximize the utility of the fog resource pool. We also design a heuristic algorithm to approximate the solution of the model. We apply a dominant-resource-based strategy for resource allocation to improve resource utilization as well as critical value theory for resource pricing to enhance the utility of the fog resource pool. We also prove that the algorithm satisfies truthful and individual rationality. Finally, we give some numerical examples to demonstrate the performance of the algorithm. Compared with existing studies, our approach can improve resource utilization and maximize the utility of the fog resource pool.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 327--339
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "combinatorial auction" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język