Learning Centre

Auction-based Cache Trading for Scalable Videos in Multi-Provider Heterogeneous Networks

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Jedari, Behrouz
dc.contributor.author Di Francesco, Mario
dc.date.accessioned 2019-07-30T07:21:58Z
dc.date.available 2019-07-30T07:21:58Z
dc.date.issued 2019-04-01
dc.identifier.citation Jedari , B & Di Francesco , M 2019 , Auction-based Cache Trading for Scalable Videos in Multi-Provider Heterogeneous Networks . in INFOCOM 2019 - IEEE Conference on Computer Communications . , 8737433 , Proceedings - IEEE INFOCOM , vol. 2019-April , IEEE , pp. 1864-1872 , IEEE Conference on Computer Communications , Paris , France , 29/04/2019 . https://doi.org/10.1109/INFOCOM.2019.8737433 en
dc.identifier.isbn 9781728105154
dc.identifier.issn 0743-166X
dc.identifier.other PURE UUID: fc21aeb9-e0d6-4d3d-bcc0-feef10821b5a
dc.identifier.other PURE ITEMURL: https://research.aalto.fi/en/publications/fc21aeb9-e0d6-4d3d-bcc0-feef10821b5a
dc.identifier.other PURE LINK: http://www.scopus.com/inward/record.url?scp=85068225482&partnerID=8YFLogxK
dc.identifier.other PURE FILEURL: https://research.aalto.fi/files/35329438/SCI_Jedari_Di_Francesco_Auction_based_Cache_infocom_2019_jedari_camera_ready.pdf
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/39533
dc.description.abstract Content providers (CPs) are keen to cache their popular contents in small-cell base stations (SBSs) provided by mobile network operators (MNOs). In fact, they can serve the requests of their subscribers with low latency, thereby increasing user satisfaction. Employing advanced video encoding techniques, such as scalable video coding (SVC), improves the utilization of wireless resources and the network infrastructure. However, the cache trading policies for SVC videos in multi-provider networks have not been studied yet. In this article, we design a commercial trading system in which multiple CPs, each owning SVC videos, compete over renting the cache in multiple SBSs provided by an MNO. We model cache trading between the MNO and CPs as a social welfare maximization problem, whose objective is to maximize the trading profit while achieving the economic properties of rationality, balanced budget, and truthfulness. Since optimal allocation of random-size caches to multiple CPs is NP-hard, we devise an iterative trading mechanism based on double auction called DOCAT, wherein the cache of SBSs is segmented and traded in multiple rounds. In each round of the auction, the MNO and CPs price the cache segments based on their profit, then submit their asking and buying bids, respectively. Next, a many-to-one matching algorithm is run to efficiently find perfect matches between the cache segments and winning CPs. Numerical results based on a real video dataset show that DOCAT increases the social welfare of the system while satisfying the desired economic properties. en
dc.format.extent 9
dc.format.extent 1864-1872
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartof IEEE Conference on Computer Communications en
dc.relation.ispartofseries INFOCOM 2019 - IEEE Conference on Computer Communications en
dc.relation.ispartofseries Proceedings - IEEE INFOCOM en
dc.relation.ispartofseries Volume 2019-April en
dc.rights openAccess en
dc.title Auction-based Cache Trading for Scalable Videos in Multi-Provider Heterogeneous Networks en
dc.type A4 Artikkeli konferenssijulkaisussa fi
dc.description.version Peer reviewed en
dc.contributor.department Professorship Di Francesco Mario
dc.contributor.department Department of Computer Science en
dc.subject.keyword auction
dc.subject.keyword edge caching
dc.subject.keyword game theory
dc.subject.keyword Heterogeneous networks
dc.subject.keyword network economics
dc.subject.keyword scalable video coding
dc.identifier.urn URN:NBN:fi:aalto-201907304588
dc.identifier.doi 10.1109/INFOCOM.2019.8737433
dc.type.version acceptedVersion

Files in this item

Files Size Format View

There are no open access files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive

Advanced Search

article-iconSubmit a publication