✦ LIBER ✦

Leader election in hierarchical star network

✍ Scribed by Wei Shi; Pradip K Srimani

Book ID: 108191880
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 171 KB
Volume: 65
Category: Article
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2005.05.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Leader election in oriented star graphs

✍ Wei Shi; A. Bouabdallah; Pradip K Srimani 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

Leader Election in Complete Networks

✍ Singh, Gurdip 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 272 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

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

A large hierarchical network star-star t

A large hierarchical network star-star topology design algorithm

✍ Petrek, Jozef ;Sledt, Volker 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 958 KB

## Abstract The hierarchical communication network design includes solving problems like the concentrator quantity problem, the concentrator location problem and the assignment problem. Many algorithms have been proposed to solve these particular problems. The two latter problems are NP—hard and no