FLOCK: Fast, Lightweight, and Scalable Allocation for Decentralized Services on Blockchain

Navin V. Keizer, Onur Ascigil, I. Psaras, G. Pavlou
{"title":"FLOCK: Fast, Lightweight, and Scalable Allocation for Decentralized Services on Blockchain","authors":"Navin V. Keizer, Onur Ascigil, I. Psaras, G. Pavlou","doi":"10.1109/ICBC51069.2021.9461079","DOIUrl":null,"url":null,"abstract":"Many decentralized services have recently emerged on top of blockchain, offering benefits like privacy, and allowing any node in the network to share its resources. In order to be a competitive alternative to their central counterparts, their performance needs to match up. Specifically, service allocation remains a performance bottleneck for many decentralized services.In this paper we present FLOCK, an allocation system which is highly scalable, fast, and lightweight. Furthermore, it allows nodes to indicate their preference for clients/sellers without needing to submit bids by using stable matching algorithms. We decouple the price discovery and outsource this function to a smart contract on the blockchain.Additionally, another smart contract is used to orchestrate the allocation and take care of service discovery, while trusted execution environments securely compute allocation solutions, and off-chain payment networks are used to send rewards.Evaluation of FLOCK shows that gas costs are manageable and improve upon other solutions which leverage auctions, and that our instance of the stable matching algorithm greatly improves run-time and throughput over auction counterparts. Finally, our discussion outlines practical improvements to further increase performance.","PeriodicalId":302436,"journal":{"name":"2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBC51069.2021.9461079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Many decentralized services have recently emerged on top of blockchain, offering benefits like privacy, and allowing any node in the network to share its resources. In order to be a competitive alternative to their central counterparts, their performance needs to match up. Specifically, service allocation remains a performance bottleneck for many decentralized services.In this paper we present FLOCK, an allocation system which is highly scalable, fast, and lightweight. Furthermore, it allows nodes to indicate their preference for clients/sellers without needing to submit bids by using stable matching algorithms. We decouple the price discovery and outsource this function to a smart contract on the blockchain.Additionally, another smart contract is used to orchestrate the allocation and take care of service discovery, while trusted execution environments securely compute allocation solutions, and off-chain payment networks are used to send rewards.Evaluation of FLOCK shows that gas costs are manageable and improve upon other solutions which leverage auctions, and that our instance of the stable matching algorithm greatly improves run-time and throughput over auction counterparts. Finally, our discussion outlines practical improvements to further increase performance.
FLOCK:区块链上分散服务的快速、轻量级和可扩展分配
最近在区块链之上出现了许多分散的服务,提供隐私等好处,并允许网络中的任何节点共享其资源。为了成为中央对手的竞争对手,他们的表现需要匹配。具体来说,服务分配仍然是许多分散服务的性能瓶颈。本文提出了一种高可扩展性、快速、轻量级的分配系统FLOCK。此外,它允许节点通过使用稳定的匹配算法来指示他们对客户/卖家的偏好,而无需提交投标。我们将价格发现解耦,并将此功能外包给区块链上的智能合约。此外,另一个智能合约用于协调分配并负责服务发现,而可信的执行环境安全地计算分配解决方案,并且链下支付网络用于发送奖励。FLOCK的评估表明,天然气成本是可控的,并且比其他利用拍卖的解决方案有所改进,并且我们的稳定匹配算法实例大大提高了拍卖对手的运行时间和吞吐量。最后,我们的讨论概述了进一步提高性能的实际改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书