Introduction to Distributed Algorithms, 2/e

Gerard Tel






The second edition of this successful textbook provides an up-to-date introduction both to distributed algorithms and to the theory behind them. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, while the coverage is sufficiently deep to make it useful for practicing engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model and includes algorithms for the implementation of computer communication networks. Two new chapters on sense of direction and failure detectors are state of the art and will provide an entry to research in these still-developing topics.


Table of Contents:

1. Introduction: distributed systems
Part I. Protocols: 2. The model
3. Communication protocols
4. Routing algorithms
5. Deadlock-free packet switching
Part II. Fundamental Algorithms: 6. Waves and traversal algorithms
7. Election algorithms
8. Termination detection
9. Anonymous networks
10. Snapshots
11. Sense of direction and orientation
12. Synchrony in networks
Part III: 13. Fault tolerance in distributed systems
14. Fault tolerance in asynchronous systems
15. Fault tolerance in synchronous systems
16. Failure detection
17. Stabilization
Part IV. Appendices: A. Pseudocode conventions
B. Graphs and networks