Mitigating bitcoin node storage size by DHT

Ryosuke Abe, Shigeya Suzuki, Jun Murai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A type of Bitcoin node called “Full Node” has to hold the entire of historical transaction data called “Blockchain” to verify that new transactions are correct or not. To operate nodes as Full Nodes, the required storage size will be too large for resource-constrained devices. In this paper, to mitigate storage size, we propose a storage load balancing scheme by distributed storage based on Distributed Hash Table (DHT). By our scheme, nodes in a DHT cluster can behave like Full Nodes without holding the entire of the blockchain.

Original languageEnglish
Title of host publicationAsian Internet Engineering Conference, AINTEC 2018
PublisherAssociation for Computing Machinery, Inc
Pages17-23
Number of pages7
ISBN (Electronic)9781450361316
DOIs
Publication statusPublished - 2018 Nov 12
Event14th Asian Internet Engineering Conference, AINTEC 2018 - Bangkok, Thailand
Duration: 2018 Nov 122018 Nov 14

Other

Other14th Asian Internet Engineering Conference, AINTEC 2018
CountryThailand
CityBangkok
Period18/11/1218/11/14

Fingerprint

Resource allocation

Keywords

  • Bitcoin
  • Blockchain
  • Distributed Hash Table
  • Storage

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Cite this

Abe, R., Suzuki, S., & Murai, J. (2018). Mitigating bitcoin node storage size by DHT. In Asian Internet Engineering Conference, AINTEC 2018 (pp. 17-23). Association for Computing Machinery, Inc. https://doi.org/10.1145/3289166.3289169

Mitigating bitcoin node storage size by DHT. / Abe, Ryosuke; Suzuki, Shigeya; Murai, Jun.

Asian Internet Engineering Conference, AINTEC 2018. Association for Computing Machinery, Inc, 2018. p. 17-23.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abe, R, Suzuki, S & Murai, J 2018, Mitigating bitcoin node storage size by DHT. in Asian Internet Engineering Conference, AINTEC 2018. Association for Computing Machinery, Inc, pp. 17-23, 14th Asian Internet Engineering Conference, AINTEC 2018, Bangkok, Thailand, 18/11/12. https://doi.org/10.1145/3289166.3289169
Abe R, Suzuki S, Murai J. Mitigating bitcoin node storage size by DHT. In Asian Internet Engineering Conference, AINTEC 2018. Association for Computing Machinery, Inc. 2018. p. 17-23 https://doi.org/10.1145/3289166.3289169
Abe, Ryosuke ; Suzuki, Shigeya ; Murai, Jun. / Mitigating bitcoin node storage size by DHT. Asian Internet Engineering Conference, AINTEC 2018. Association for Computing Machinery, Inc, 2018. pp. 17-23
@inproceedings{3548d8c483a044e2a9f58741136d1c8c,
title = "Mitigating bitcoin node storage size by DHT",
abstract = "A type of Bitcoin node called “Full Node” has to hold the entire of historical transaction data called “Blockchain” to verify that new transactions are correct or not. To operate nodes as Full Nodes, the required storage size will be too large for resource-constrained devices. In this paper, to mitigate storage size, we propose a storage load balancing scheme by distributed storage based on Distributed Hash Table (DHT). By our scheme, nodes in a DHT cluster can behave like Full Nodes without holding the entire of the blockchain.",
keywords = "Bitcoin, Blockchain, Distributed Hash Table, Storage",
author = "Ryosuke Abe and Shigeya Suzuki and Jun Murai",
year = "2018",
month = "11",
day = "12",
doi = "10.1145/3289166.3289169",
language = "English",
pages = "17--23",
booktitle = "Asian Internet Engineering Conference, AINTEC 2018",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - Mitigating bitcoin node storage size by DHT

AU - Abe, Ryosuke

AU - Suzuki, Shigeya

AU - Murai, Jun

PY - 2018/11/12

Y1 - 2018/11/12

N2 - A type of Bitcoin node called “Full Node” has to hold the entire of historical transaction data called “Blockchain” to verify that new transactions are correct or not. To operate nodes as Full Nodes, the required storage size will be too large for resource-constrained devices. In this paper, to mitigate storage size, we propose a storage load balancing scheme by distributed storage based on Distributed Hash Table (DHT). By our scheme, nodes in a DHT cluster can behave like Full Nodes without holding the entire of the blockchain.

AB - A type of Bitcoin node called “Full Node” has to hold the entire of historical transaction data called “Blockchain” to verify that new transactions are correct or not. To operate nodes as Full Nodes, the required storage size will be too large for resource-constrained devices. In this paper, to mitigate storage size, we propose a storage load balancing scheme by distributed storage based on Distributed Hash Table (DHT). By our scheme, nodes in a DHT cluster can behave like Full Nodes without holding the entire of the blockchain.

KW - Bitcoin

KW - Blockchain

KW - Distributed Hash Table

KW - Storage

UR - http://www.scopus.com/inward/record.url?scp=85059007471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059007471&partnerID=8YFLogxK

U2 - 10.1145/3289166.3289169

DO - 10.1145/3289166.3289169

M3 - Conference contribution

AN - SCOPUS:85059007471

SP - 17

EP - 23

BT - Asian Internet Engineering Conference, AINTEC 2018

PB - Association for Computing Machinery, Inc

ER -