Combinatorial Recurrent Multi-Unit Auctions for Fog Services

Maria Barbara Safianowska, Robert Gdowski, Ching-Yao Huang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

An emerging Fog Computing paradigm aims at reducing overall latency and end-to-end data transfer costs between IoT devices and analytic entity as in comparison to purely Cloud based solutions. In the near future, Fog services will be offered on virtual marketplaces by Fog Node owners. To facilitate the exchange in such volatile markets, we devise a recurrent, multiunit, combinatorial auction with bidder drop and resource waste control and a two-step winner determination algorithm. Proposed solution extends on Participation Incentive Optimal Recurring Auction (PI-ORA) algorithm, which separately solves bidder drop problem for single-unit, non combinatorial auction, to include the case of multi-unit combinatorial auction which is necessary for Fog service markets. The results show stability and efficiency of the proposed algorithm.

Original languageEnglish
Title of host publicationProceedings - 2016 International Computer Symposium, ICS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages736-741
Number of pages6
ISBN (Electronic)9781509034383
DOIs
StatePublished - 16 Feb 2017
Event2016 International Computer Symposium, ICS 2016 - Chiayi, Taiwan
Duration: 15 Dec 201617 Dec 2016

Publication series

NameProceedings - 2016 International Computer Symposium, ICS 2016

Conference

Conference2016 International Computer Symposium, ICS 2016
CountryTaiwan
CityChiayi
Period15/12/1617/12/16

Keywords

  • Combinatorial auctions
  • Fog computing

Fingerprint Dive into the research topics of 'Combinatorial Recurrent Multi-Unit Auctions for Fog Services'. Together they form a unique fingerprint.

Cite this