Content ................................................................................................................................................. I

Leveraging Distributed Ledger Technology for Decentralized Mobility-as-a-Service Ticket Systems

This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. Whereas previous algorithms assumed a synchronous system or were too slow to be used in practice, the algorithm described in this paper is practical: it works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. We implemented a Byzantine-fault-tolerant NFS service using our algorithm and measured its performance. The results show that our service is only 3% slower than a standard unreplicated NFS.

/pdf/practical-byzantine-fault-tolerance-58gb0de0hd.pdf

Practical Byzantine fault tolerance

The state machine approach is a general method for implementing fault-tolerant services in distributed systems. This paper reviews the approach and describes protocols for two different failure models—Byzantine and fail stop. Systems reconfiguration techniques for removing faulty components and integrating repaired components are also discussed.

/pdf/implementing-fault-tolerant-services-using-the-state-machine-16diye054a.pdf

Implementing fault-tolerant services using the state machine approach: a tutorial

The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of information that must be communicated to each other nonfaulty processor. Nonfaulty processors always communicate honestly, whereas faulty processors may lie. The problem is to devise an algorithm in which processors communicate their own values and relay values received from others that allows each nonfaulty processor to infer a value for each other processor. The value inferred for a nonfaulty processor must be that processor's private value, and the value inferred for a faulty one must be consistent with the corresponding value inferred by each other nonfaulty processor.It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number. It is also shown that if faulty processors can refuse to pass on information but cannot falsely relay information, the problem is solvable for arbitrary n ≥ m ≥ 0. This weaker assumption can be approximated in practice using cryptographic methods.

/pdf/reaching-agreement-in-the-presence-of-faults-2optz6t1lz.pdf

Reaching Agreement in the Presence of Faults

Blockchain technologies are taking the world by storm. Public blockchains, such as Bitcoin and Ethereum, enable secure peer-to-peer applications like crypto-currency or smart contracts. Their security and performance are well studied. This paper concerns recent private blockchain systems designed with stronger security (trust) assumption and performance requirement. These systems target and aim to disrupt applications which have so far been implemented on top of database systems, for example banking, finance and trading applications. Multiple platforms for private blockchains are being actively developed and fine tuned. However, there is a clear lack of a systematic framework with which different systems can be analyzed and compared against each other. Such a framework can be used to assess blockchains' viability as another distributed data processing platform, while helping developers to identify bottlenecks and accordingly improve their platforms. In this paper, we first describe BLOCKBENCH, the first evaluation framework for analyzing private blockchains. It serves as a fair means of comparison for different platforms and enables deeper understanding of different system design choices. Any private blockchain can be integrated to BLOCKBENCH via simple APIs and benchmarked against workloads that are based on real and synthetic smart contracts. BLOCKBENCH measures overall and component-wise performance in terms of throughput, latency, scalability and fault-tolerance. Next, we use BLOCKBENCH to conduct comprehensive evaluation of three major private blockchains: Ethereum, Parity and Hyperledger Fabric. The results demonstrate that these systems are still far from displacing current database systems in traditional data processing workloads. Furthermore, there are gaps in performance among the three systems which are attributed to the design choices at different layers of the blockchain's software stack. We have released BLOCKBENCH for public use.

BLOCKBENCH: A Framework for Analyzing Private Blockchains

Mobility as a Service (MaaS) is a recent innovative transport concept, anticipated to induce significant changes in the current transport practices. However, there is ambiguity surrounding the concept; it is uncertain what are the core characteristics of MaaS and in which way they can be addressed. Further, there is a lack of an assessment framework to classify their unique characteristics in a systematic manner, even though several MaaS schemes have been implemented around the world. In this study, we define this set of attributes through a literature review, which is then used to describe selected MaaS schemes and existing applications. We also examine the potential implications of the identified core characteristics of the service on the following three areas of transport practices: travel demand modelling, a supply-side analysis, and designing business model. Finally, we propose the necessary enhancements needed to deliver such an innovative service like MaaS, by establishing the state of art in those fields.

/pdf/mobility-as-a-service-a-critical-review-of-definitions-hz9opsh6rf.pdf

Leveraging Distributed Ledger Technology for Decentralized Mobility-as-a-Service Ticket Systems

References

Practical Byzantine fault tolerance

Implementing fault-tolerant services using the state machine approach: a tutorial

Reaching Agreement in the Presence of Faults

BLOCKBENCH: A Framework for Analyzing Private Blockchains

Mobility as a Service: A Critical Review of Definitions, Assessments of Schemes, and Key Challenges