Decentralized Caching for Content Delivery Based on Blockchain: A Game Theoretic Perspective
Decentralized Caching for Content Delivery Based on Blockchain: A Game Theoretic Perspective
复制标题
DOI：
10.1109/icc.2018.8422547
复制
发表时间：
2018-01
期刊：
影响因子：
--
通讯作者：
Wenbo Wang;D. Niyato;Ping Wang;Amir Leshem
中科院分区：
文献类型：
--
作者：
Wenbo Wang;D. Niyato;Ping Wang;Amir Leshem
区块链通过开放访问、覆盖对等网络，以分散的方式实现交易数据的防篡改、有序记录。在本文中，我们提出了一个分散的框架，主动缓存在分层无线网络的基础上区块链。我们采用基于区块链的智能合约来构建一个自治的内容缓存市场。在市场上，该高速缓存助手能够根据从区块链获得的市场统计数据自主调整其缓存策略，而不可信节点的真实性则通过智能合约条款在财务上强制执行。此外，我们提出了一个激励兼容的共识机制的基础上证明的权益，以财政鼓励该高速缓存助手保持活跃的服务。我们将该高速缓存助手和内容提供者之间的交互建模为中餐馆游戏。在对博弈纳什均衡进行理论分析的基础上，提出了一种基于序贯最佳对策的分散策略搜索算法。仿真结果表明了该算法的有效性和可靠性。
Blockchains enable tamper-proof, ordered logging for transactional data in a decentralized manner over open-access, overlay peer-to-peer networks. In this paper, we propose a decentralized framework of proactive caching in a hierarchical wireless network based on blockchains. We employ the blockchain-based smart contracts to construct an autonomous content caching market. In the market, the cache helpers are able to autonomously adapt their caching strategies according to the market statistics obtained from the blockchain, and the truthfulness of trustless nodes are financially enforced by smart contract terms. Further, we propose an incentive-compatible consensus mechanism based on proof-of-stake to financially encourage the cache helpers to stay active in service. We model the interaction between the cache helpers and the content providers as a Chinese restaurant game. Based on the theoretical analysis regarding the Nash equilibrium of the game, we propose a decentralized strategy-searching algorithm using sequential best response. The simulation results demonstrate both the efficiency and reliability of the proposed equilibrium searching algorithm.