Locality and priority in Auction-based resource allocation in blockchain network
Seyed Amir Hossein Ahmadi, Naser Yazdani · 2022
Blockchain is very popular as a decentralized and secure platform. Blockchains usually use a proof-of-work mechanism and cryptographic puzzle to verify network transactions. This operation is called block mining. Due to limited local computing resources, likes smartphones, miners load computational tasks into resources available on cloud/fog servers. Therefore, we can consider it as a market that includes computational resources and miners. Then, it is natural to looking for an efficient resource allocation policy through an auction-based mechanism. In this paper, we introduce the issue of priority and locality to algorithms in this realm using an efficient resource allocation algorithm. The idea of implemented priority algorithms is allocating resources to VIP customers, which have more priority than other customers. In addition, the goal of implemented locality algorithms is to reduce the time delay of information exchange in the data transmission network by bringing resources closer to customers. We also discuss the issue of social welfare and time complexity. Our evaluations indicate that our method does a better job compared to the similar work in the literature.