請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/7203完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 劉志文(Chih-Wen Liu) | |
| dc.contributor.author | Jhan-Jia Lin | en |
| dc.contributor.author | 林展嘉 | zh_TW |
| dc.date.accessioned | 2021-05-19T17:40:12Z | - |
| dc.date.available | 2024-08-16 | |
| dc.date.available | 2021-05-19T17:40:12Z | - |
| dc.date.copyright | 2019-08-16 | |
| dc.date.issued | 2019 | |
| dc.date.submitted | 2019-08-13 | |
| dc.identifier.citation | [1] S. Nakamoto, ”Bitcoin: A Peer-to-Peer Electronic Cash System,”31 October 2008.[Online] https://bitcoin.org/bitcoin.pdf
[2] V. Buterin, ”Ethereum: a next generation smart contract and decentralized applica- tion platform,”2013.[Online] https://github.com/ethereum/wiki/wiki/White-Paper [3] Hemant K. Bhargava, ”Incentives for Selling Two-Sided Markets” [4] A Chakraborty, ”Fair Sharing for Sharing Economy Platforms”,August 2017 [5] E. Androulaki, A. Barger, V. Bortnikov, C. Cachin, K. Christidis, A. D. Caro et al. ” Hyperledger fabric: A distributed operating system for permissioned blockchains,” Proceedings of the 13th ACM SIGOPS European Conference on Computer Systems, 2018. [6] M. Akbarpour,”Thickness and Information in Dynamic Matching Markets”, Decem- ber 2018 [7] Itai Ashlagi, ”On Matching and Thickness in Dynamic Markets”,20 January 2016 [8] Itai Ashlagi, ”Matching in Dynamic Imbalanced Markets”,9 March 2019 [9] Morimitsu Kurino, House allocation with overlapping agents: A dynamic mecha- nism design approach. Jena economic research papers, 2009. [10] Francis Bloch and Nicolas Houy, Optimal assignment of durable objects to succes- sive agents. Economic Theory, September 2012. [11] D. Gale and L. S. Shapley, College Admissions and the Stability of Marriage, Amer. Math. Monthly 1962. [12] K. Iwama, ”A Survey of the Stable Marriage Problem and Its Variants”, 2008 IEEE Informatics Education and Research for Knowledge-Circulating Society | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/7203 | - |
| dc.description.abstract | 本文基於厚度動態匹配市場算法,提出了一種區塊鏈上時間銀行(Time Bank) 的實現方法。論文由兩部分組成,其一是在 Hyperledger Fabric(Fabric)平台上實現 Time Bank 系統,Fabric 是眾多許可式 (Permissioned) 區塊鏈平台之一。提供身份證書機制和可擴展的網絡結構是 Fabric 區塊鏈平台的特色。時間銀行系統的成員需要進行身份審查,以使系統更加安全。通過時間銀行交換服務也會增強社區成員之間的互動。故 Fabric 被視為是實現時間銀行系統適合的區塊鏈平台。其次,我們認為利用等待時間可以加厚動態匹配市場,並利⽤這一概念設計出動態調整策略(Dynamic Tuning Strategy: DTS)。根據市場規模,DTS 將決定每次匹配應執行或等待。實驗證實較厚的交易市場可使節點具有更多鏈接並且更容易匹配。 | zh_TW |
| dc.description.abstract | This thesis presents a blockchain based Time Bank realization using thickness dynamic matching algorithm. This work consists of the following two parts: (1) A realization of the Time Bank System on the Hyperledger Fabric (or simply called Fabric) platform. Fabric is one of the well-known permissioned blockchain platforms. Fabric provides the identity certification mechanism and has an extendable network structure under the blockchain. Members of a Time Bank system have to go through an identity checking process for making the personnel of the system more secure. The exchange of services through Time Bank systems also warms the members’communities. (2) On the basis of using waiting time to thicken the dynamic matching market, a Dynamic Tuning Strategy (DTS) for enhancing matching performance, is proposed. According to the market size, DTS helps decide to do a match or to wait for a later chance in each run. Experimental results show that thicker market makes on-chain nodes have more links and is easier to find a match. | en |
| dc.description.provenance | Made available in DSpace on 2021-05-19T17:40:12Z (GMT). No. of bitstreams: 1 ntu-108-R05921060-1.pdf: 10592765 bytes, checksum: 9350f6540a0cf26ddaf13ae59af4f858 (MD5) Previous issue date: 2019 | en |
| dc.description.tableofcontents | ⼝試委員會審定書 ii
誌謝 iii Acknowledgements iv 摘要 v Abstract vi 1 Introduction 1 1.1 Contributions 4 2 Background and Related Work 5 2.1 Blockchain 5 2.2 Hyperledger Fabric 6 2.3 Dynamic Matching 7 2.4 Stable Marriage Problem 7 3 System Overview 9 3.1 Application Overview 9 3.2 Network Structure 11 3.3 System Assumption 12 4 Functional Modules of the Proposed System 14 4.1 User Registration Module 14 4.2 Service Inquiry Posting Module 15 4.3 Service Inquiry Evoking Module 16 4.4 Matching Process 18 4.4.1 Match Flow Chart 18 4.4.2 The Double Spending Problem 19 4.5 Service Exchange Process 20 5 Dynamic Matching in Two-sided Markets 21 5.1 The Model 21 5.2 Timing and Structure 22 5.3 The Greedy and the Patient Matching Strategies 24 5.3.1 Greedy Algorithm 24 5.3.2 Patient Algorithm 26 5.3.3 Comparison 29 5.4 Dynamic Matching strategy 29 5.4.1 Voting Mechanism 31 5.4.2 Match Decision Function 33 6 Experiment 35 6.1 Service Posting 35 6.2 Matching 36 6.3 DTS-based Matching Simulation 38 7 Conclusion and Future Work 40 References 41 | |
| dc.language.iso | en | |
| dc.title | ⼀個基於超級帳本區塊鏈之時間銀⾏系統及其動態加厚信息配對⽅法 | zh_TW |
| dc.title | A Hyperledger Fabric based Time Bank and Its Thickness Dynamic Matching Method | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 107-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.coadvisor | 吳家麟(Ja-Ling Wu) | |
| dc.contributor.oralexamcommittee | 許永真(Yung-Jen Hsu),傅立成(Li-Chen Fu) | |
| dc.subject.keyword | 時間銀行,區塊鏈,超級帳本,動態配對,信息加厚, | zh_TW |
| dc.subject.keyword | Time Bank,Blockchain,Hyperledger Fabric,Dynamic Matching,Thickness, | en |
| dc.relation.page | 42 | |
| dc.identifier.doi | 10.6342/NTU201902682 | |
| dc.rights.note | 同意授權(全球公開) | |
| dc.date.accepted | 2019-08-13 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| dc.date.embargo-lift | 2024-08-16 | - |
| 顯示於系所單位: | 電機工程學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-108-1.pdf | 10.34 MB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
