About the book.Distributed ledgers and blockchains are much older than Bitcoin. A sizeable amount of work in distributed systems and cryptography is about storing transactions securely. The area is central in computer science, about half of all Turing Awards (known as the "Nobel Prize of Computing") of the last decade can be linked to distributed ledgers. This book will give a scientifically precise description of the most interesting approaches that have emerged, before Bitcoin and after. Whether you are interested in permissioned or permissionless blockchains, this book will help to get a deep understanding. This book introduces the basic techniques when building fault-tolerant distributed systems, discussing various protocols and algorithms that allow for fault-tolerant operation, and practical systems that implement these techniques. .About the third edition.Apart from many minor improvements, this third edition of the book contains a lot more content. In particular, the third edition includes new chapters and sections on broadcast, shared coins, selfish mining, DAG-blockchains, payment hubs, proof-of-stake, strong consistency and logical time. In addition, the book features an appendix, discussing some of the underlying fundamentals such as game theory, physical clocks, and Markov chains..About the author.Roger Wattenhofer is a professor at ETH Zurich. Before joining ETH Zurich, he was at Brown University and Microsoft Research. His research interests include fault-tolerant distributed systems, efficient network algorithms, and cryptocurrencies. He has published more than 300 scientific articles.
This book constitutes the refereed proceedings of the 10th International Conference on Distributed Computing and Networking, ICDCN 2009, held in Hyderabad, India, during January 3-6, 2009. The 20 papers and 32 short presentations presented together with 3 keynote talks and a memorial lecture on A.K. Choudhury were carefully reviewed and selected from 179 submissions. The topics addressed are sensor networks, multi-core and shared memory, peer-to-peer-computing, reliability and security, distributed computing, network algorithms, fault tolerance and models, fault tolerance and replication, wireless networks, and grid and cluster computing.
Surveys results from a newly emerging line of research that targets algorithm analysis in the physical interference model. The focus is on wireless scheduling and it looks at the difficulty of this problem and examines algorithms for wireless scheduling with provable performance guarantees
Surveys results from a newly emerging line of research that targets algorithm analysis in the physical interference model. The focus is on wireless scheduling and it looks at the difficulty of this problem and examines algorithms for wireless scheduling with provable performance guarantees
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.