*Preface;

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. Wave 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. Fault Tolerance:

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. Appendix A: pseudocode conventions;

Appendix B: graphs and networks;

References;

Index.

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 courses. The two new chapters on sense of direction and failure detectors will provide an entry to these still-developing topics.