## Design and Analysis of Distributed AlgorithmsThis text is based on a simple and fully reactive computational model that allows for intuitive comprehension and logical designs. The principles and techniques presented can be applied to any distributed computing environment (e.g., distributed systems, communication networks, data networks, grid networks, internet, etc.). The text provides a wealth of unique material for learning how to design algorithms and protocols perform tasks efficiently in a distributed computing environment. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

29 | |

3 Election | 99 |

4 Message Routing and Shortest Paths | 225 |

5 Distributed Set Operations | 277 |

6 Synchronous Computations | 333 |

7 Computing in Presence of Faults | 408 |

8 Detecting Stable Properties | 500 |

9 Continuous Computations | 541 |

577 | |

584 | |

AUTHOR INDEX | 586 |

### Common terms and phrases

achieve Answer to Exercise assume bidirectional broadcast Byzantine candidate clock complete graph complete networks configuration Consider construct correct entity crash critical operation data items deadlock denote depth-first traversal determine distance distributed algorithm distributed computing distributed computing environment efficient elect a leader election protocol end FIGURE endif end entity x example execution fact failure faults finite global termination Hence hypercube id(x imin labels Lemma logn lower bound message costs messages sent minimum neighbors Nicola Santoro nlogn nonfaulty entities notify number of messages optimal perform problem Property Prove reply request requires restrictions result ring ring networks rooted routing tables sender sends a message sequence shortest path shown in Figure smallest solution protocol solve sorting spanning tree stage starts strategy strongly connected component synchronous ring Theorem token total number transmission transmitted wake-up words worst

### Popular passages

Page 3 - Given a directed graph G = (V, E) where, V is the set of vertices and E is the set of edges...