메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Jung-Won, Lee (Keimyung University) Sejin Park (Keimyung University)
저널정보
한국통신학회 한국통신학회 APNOMS 한국통신학회 APNOMS 2020
발행연도
2020.9
수록면
259 - 262 (4page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
This paper is to improve the performance of Hyperledger Fabric that is one of the private blockchain open-source projects. The decentralization of data management, which has recently become important, is realized as a blockchain. Blockchain is a technology used in various fields such as data verification, storage, and banking, but performance is one of the important problems and is always mentioned. This is because a transaction must be agreed quickly and recorded in the ledger so that it can be used smoothly in systems that generate tens of thousands of transactions per second, such as banking and card use. Hyperledger fabric sends transactions generated by clients to peer nodes on the network. The transactions are hashed with the previous block in the distributed ledger. Peer nodes collect transactions received from multiple clients and execute chain code for verification, which is then sent to the orderer node and made into blocks. The block created at this time compares hash values to several peer nodes to verify the integrity of the data after verifying the block. Orderer node collects the transactions and is ordering them into the block. In this paper, we proposed to improve the performance of the hyperledger fabric by reducing network latency and the number of transfers by batch processing the process of sending and receiving chain code messages in the process of delivering transactions generated by clients for verification. The results of the performance are expressed in transactions per second(TPS), with the experiment showing that send rate(TPS) nearly doubling to 2302→4244, and throughput(TPS) increasing by about 1.5 times to 1677→2244. As a result of the experiment, send rate and throughput increased by a large margin, the batch processing of chain code messages can perform much higher performance.

목차

Abstract
I. INTRODUCTION
II. DESIGN
Ⅲ. EXPERIMENT
Ⅳ. RELATED WORK
Ⅴ. CONCLUSION AND FUTURE WORK
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2021-567-001678555