✦ LIBER ✦

Leader election in oriented star graphs

✍ Scribed by Wei Shi; A. Bouabdallah; Pradip K Srimani

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 177 KB
Volume: 45
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Self-Stabilizing Leader Election Algor

A Self-Stabilizing Leader Election Algorithm for Tree Graphs

✍ Gheorghe Antonoiu; Pradip K. Srimani 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.

Time-optimal leader election in general

Time-optimal leader election in general networks

✍ David Peleg 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Expected connectivity and leader electio

Expected connectivity and leader election in unreliable networks

✍ Suresh Singh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The Leader Election Protocol of IEEE 139

The Leader Election Protocol of IEEE 1394 in Maude

✍ Alberto Verdejo; Isabel Pita; Narciso Martí-Oliet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 198 KB

An exercise in fault-containment: Self-s

An exercise in fault-containment: Self-stabilizing leader election

✍ Sukumar Ghosh; Arobinda Gupta 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 848 KB

Pre-electing a Leader in Distributed Net

Pre-electing a Leader in Distributed Networks

✍ Tai Woo Kim; Tai Yun Kim 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 719 KB