Table of contents for Introduction to distributed algorithms / Gerard Tel.


Bibliographic record and links to related information available from the Library of Congress catalog


Information from electronic data provided by the publisher. May be incomplete or contain other coding.


Counter
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. 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
References
Index.


Library of Congress subject headings for this publication: Electronic data processing Distributed processing Congresses, Computer algorithms Congresses