✦ LIBER ✦

A Distributed Election Protocol for Unreliable Networks

✍ Scribed by Junguk L. Kim; Geneva G. Belford

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 254 KB
Volume: 35
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1996.0065

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a broadcast-based election protocol for distributed systems implemented on unreliable networks. The protocol is highly robust, tolerating failures such as message loss and network partitioning. Our protocol is different from others in that it effectively detects events that may possibly make the election results inconsistent, aborts the election, and causes the nodes to execute another election round. When the election completes, there is guaranteed to be agreement on a single leader. When the network is partitioned, groups with a consistent view and a single leader are formed in each partition. Compared to other broadcast-based election protocols, which use a group-merging mechanism to fix the problem of several groups independently electing different leaders, the number of election rounds needed to arrive at a single leader is on average considerably fewer.

📜 SIMILAR VOLUMES

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

A Distributed Control Protocol for Wavel

A Distributed Control Protocol for Wavelength Routing with Fairness Improvement in WDM Networks

✍ Mohan, Curusamy ;Murthy, Chebiyyam Siva Ram 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 816 KB

## Abstract This paper considers the problem of distributed routing with fairness improvement in wavelength‐routed wavelength‐division multiplexed (WDM) networks with dynamic traffic conditions. The wavelength continuity constraint imposed by WDM networks causes increased blocking of connection req

Distributed MAC protocols and priority o

Distributed MAC protocols and priority oriented scheduling for a PLC access network

✍ S. Sundaresan; S. Anand; S. Srikanth; C. N. Krishnan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

A causal broadcast protocol for distribu

A causal broadcast protocol for distributed mobile systems

✍ Chikara Ohori; Michiko Inoue; Toshimitsu Masuzawa; Hideo Fujiwara 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 2 views

In this paper, we will propose a causal broadcast protocol for distributed mobile systems. Since the mobile hosts are in general unspecified majority, and the computational capability and communication capability are considerably inferior to the static hosts, an algorithm is desired whose computatio

A protocol standard for heterogeneous te

A protocol standard for heterogeneous telescope networks

✍ A. Allan; F. Hessman; K. Bischoff; M. Burgdorf; B. Cavanagh; D. Christian; N. Cl 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 1 views

## Abstract The scientific need for a standard protocol permitting the exchange of generic observing services is rapidly escalating as more observatories adopt service observing as a standard operating mode and as more remote or robotic telescopes are brought on‐line. To respond to this need, we pr

Multiple paths protocol for a cluster ty

Multiple paths protocol for a cluster type network

✍ Hiroshi Mineno; Susumu Ishihara; Ken Ohta; Masahiro Aono; Tetsuo Ideguchi; Tadan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 459 KB 👁 1 views

Nowadays we can access the Internet by carrying a portable computer and using wireless communication. The wireless network with personal handy phone system (PHS) and portable cellular telephone has only rates of tens of Kbps to a few Mbps. Compared with the cable network, the transfer rate cannot ge