Jongho Seol, Abhilash Kancharla, N. Park, N. Park, Indy Park
{"title":"后端区块链分析引擎中加密链脱链文件系统的可靠性","authors":"Jongho Seol, Abhilash Kancharla, N. Park, N. Park, Indy Park","doi":"10.2991/IJNDC.2018.6.4.3","DOIUrl":null,"url":null,"abstract":"A P2P file sharing system, namely Interplanetary File Systems (IPFS) [2,3], provides a service to store huge files in off-chain local storage and partition them into pieces, for each of which with a hash code created and assigned to be posted back in blockchain for reference, referred to as crypto link. IPFS manages hash codes on blockchain in a versioned manner based on the contentaddressed distributed P2P model [4]. It is investigated in this research how to assure the efficacy of managing crypto links along with the performance of the processes with respect to the dependability of blockchain. The dependability [5] in this research is defined with reference to crypto links in a proportional manner and its performance, as referred to as the crypto speed, in an inversely proportional manner, respectively. Also note that the dependability is proportional to the cost such that the more the number of crypto links come in place, the higher its cost is. It is a standard and intuitive practice to partition a large output file into smaller pieces at a certain threshold size provided in the blockchain analytics engine (e.g., 250 KB/partition in IPFS/Hadoop). Crypto link (CL) is defined by the hash address (i.e., a pointer link) stored in the blockchain for a partition of an output file off from a backend blockchain analytics engine. Note that IPFS manages a crypto link to every partition of a file of interest whereas the proposed crypto link scheme is at a reduced number in order to address the cost and performance issue such that one crypto link to the entire file and the links between partitions within a file are maintained by local chains of links. Crypto speed (CS) is defined by the rate of the number of crypto links over the total turnaround time to encrypt all the crypto links (hash addressing) per file. Thus, notice that without loss of generality, the crypto speed increases inverselinearly along with the number of crypto links. A binomial-based [6] dependability model can be expressed as a rather straightforward function of the total number of partitions and the number of crypto links as proposed in this research. At the same time a cost model can be expressed as a function of the ratio of the number of A RT I C L E I N F O","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":" 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"The Dependability of Crypto Linked Off-chain File Systems in Backend Blockchain Analytics Engine\",\"authors\":\"Jongho Seol, Abhilash Kancharla, N. Park, N. Park, Indy Park\",\"doi\":\"10.2991/IJNDC.2018.6.4.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A P2P file sharing system, namely Interplanetary File Systems (IPFS) [2,3], provides a service to store huge files in off-chain local storage and partition them into pieces, for each of which with a hash code created and assigned to be posted back in blockchain for reference, referred to as crypto link. IPFS manages hash codes on blockchain in a versioned manner based on the contentaddressed distributed P2P model [4]. It is investigated in this research how to assure the efficacy of managing crypto links along with the performance of the processes with respect to the dependability of blockchain. The dependability [5] in this research is defined with reference to crypto links in a proportional manner and its performance, as referred to as the crypto speed, in an inversely proportional manner, respectively. Also note that the dependability is proportional to the cost such that the more the number of crypto links come in place, the higher its cost is. It is a standard and intuitive practice to partition a large output file into smaller pieces at a certain threshold size provided in the blockchain analytics engine (e.g., 250 KB/partition in IPFS/Hadoop). Crypto link (CL) is defined by the hash address (i.e., a pointer link) stored in the blockchain for a partition of an output file off from a backend blockchain analytics engine. Note that IPFS manages a crypto link to every partition of a file of interest whereas the proposed crypto link scheme is at a reduced number in order to address the cost and performance issue such that one crypto link to the entire file and the links between partitions within a file are maintained by local chains of links. Crypto speed (CS) is defined by the rate of the number of crypto links over the total turnaround time to encrypt all the crypto links (hash addressing) per file. Thus, notice that without loss of generality, the crypto speed increases inverselinearly along with the number of crypto links. A binomial-based [6] dependability model can be expressed as a rather straightforward function of the total number of partitions and the number of crypto links as proposed in this research. At the same time a cost model can be expressed as a function of the ratio of the number of A RT I C L E I N F O\",\"PeriodicalId\":318936,\"journal\":{\"name\":\"Int. J. Networked Distributed Comput.\",\"volume\":\" 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Networked Distributed Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2991/IJNDC.2018.6.4.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Networked Distributed Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2991/IJNDC.2018.6.4.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
P2P文件共享系统,即星际文件系统(IPFS)[2,3],提供了一种服务,将巨大的文件存储在链下本地存储中,并将其划分为多个部分,每个部分都有一个创建并分配的哈希码,以发布回区块链中以供参考,称为加密链接。IPFS基于内容寻址的分布式P2P模型,以版本化的方式管理区块链上的哈希码[4]。本研究探讨了如何确保管理加密链接的有效性以及与区块链可靠性相关的流程性能。在本研究中,可靠性[5]分别以加密链路成比例和其性能(即加密速度)成反比来定义。还要注意,可靠性与成本成正比,因此加密链接的数量越多,其成本就越高。在区块链分析引擎中,按照一定的阈值大小(例如,IPFS/Hadoop中的250 KB/分区)将一个大的输出文件分割成更小的文件是一种标准和直观的做法。加密链接(CL)是由存储在区块链中的哈希地址(即指针链接)定义的,用于从后端区块链分析引擎输出文件的分区。请注意,IPFS管理到感兴趣的文件的每个分区的加密链接,而提议的加密链接方案的数量减少,以解决成本和性能问题,以便一个加密链接到整个文件,文件内分区之间的链接由本地链接链维护。加密速度(CS)由加密链接的数量与每个文件加密所有加密链接(散列寻址)的总周转时间的比率定义。因此,请注意,在不损失通用性的情况下,加密速度随着加密链路的数量呈反比增长。基于二项[6]的可靠性模型可以表示为本研究提出的分区总数和加密链接数的一个相当简单的函数。同时,成本模型可以表示为a / RT / C / L / E / N / F / O数量之比的函数
The Dependability of Crypto Linked Off-chain File Systems in Backend Blockchain Analytics Engine
A P2P file sharing system, namely Interplanetary File Systems (IPFS) [2,3], provides a service to store huge files in off-chain local storage and partition them into pieces, for each of which with a hash code created and assigned to be posted back in blockchain for reference, referred to as crypto link. IPFS manages hash codes on blockchain in a versioned manner based on the contentaddressed distributed P2P model [4]. It is investigated in this research how to assure the efficacy of managing crypto links along with the performance of the processes with respect to the dependability of blockchain. The dependability [5] in this research is defined with reference to crypto links in a proportional manner and its performance, as referred to as the crypto speed, in an inversely proportional manner, respectively. Also note that the dependability is proportional to the cost such that the more the number of crypto links come in place, the higher its cost is. It is a standard and intuitive practice to partition a large output file into smaller pieces at a certain threshold size provided in the blockchain analytics engine (e.g., 250 KB/partition in IPFS/Hadoop). Crypto link (CL) is defined by the hash address (i.e., a pointer link) stored in the blockchain for a partition of an output file off from a backend blockchain analytics engine. Note that IPFS manages a crypto link to every partition of a file of interest whereas the proposed crypto link scheme is at a reduced number in order to address the cost and performance issue such that one crypto link to the entire file and the links between partitions within a file are maintained by local chains of links. Crypto speed (CS) is defined by the rate of the number of crypto links over the total turnaround time to encrypt all the crypto links (hash addressing) per file. Thus, notice that without loss of generality, the crypto speed increases inverselinearly along with the number of crypto links. A binomial-based [6] dependability model can be expressed as a rather straightforward function of the total number of partitions and the number of crypto links as proposed in this research. At the same time a cost model can be expressed as a function of the ratio of the number of A RT I C L E I N F O