Searcharxiv⌕ Search

arXiv subjects

Vahid Heidaripour Lakhani

Publications and source records attributed to Vahid Heidaripour Lakhani.

2 recordsLinked to original sources

Tit-for-Token: Understanding Fairness when Forwarding Data by Incentivized Peers in Decentralized Storage Networks

Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. The challenge is to conceive incentives that are fair in regard to the income distribution among peers. Despite many systems using tokens to incentivize forwarding data, like Swarm, little is known about the interplay between incentives, storage-, and network-parameters. This paper aims to help fill this gap by developing Tit-for-Token (Tit4Tok), a framework to understand fairness. Tit4Tok realizes a triad of altruism (acts of kindness such as debt forgiveness), reciprocity (Tit-for-Tat's mirroring cooperation), and monetary rewards as desired in the free market. Tit4Tok sheds light on incentives across the accounting and settlement layers. We present a comprehensive exploration of different factors when incentivized peers share bandwidth in a libp2p-based network, including uneven distributions emerging when gateways provide data to users outside the network. We quantified the Income-Fairness with the Gini coefficient, using multiple model instantiations and diverse approaches for debt cancellation. We propose regular changes to the gateway neighborhood and show that our shuffling method improves the Income-Fairness from 0.66 to 0.16. We quantified the non-negligible cost of tolerating free-riding (altruism). The performance is evaluated by extensive computer simulations and using an IPFS workload to study the effects of caching.

cs.NI↗

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this contribution must be rewarded. Peers across the network may share computation power, storage capacity, and bandwidth. This paper looks at how bandwidth incentive encourages peers to share bandwidth and rewards them for their contribution. With the advent of blockchain technology, many p2p networks attempt to reward contributions by crypto-assets. We conduct simulations to better understand current incentive mechanisms, assess the fairness of these mechanisms, and to look for ways to make those incentives more equitable. The following are the primary contributions of this study: (i) We investigate and simulate bandwidth incentives within Swarm, a cutting-edge p2p storage network; (ii) We demonstrate one approach to make the current bandwidth incentives more equitable; (iii) We use the Gini coefficient to define two quantifiable fairness characteristics to evaluate reward sharing in a decentralized p2p storage network.

cs.NI↗