학술논문

A Wide Area Network Simulation of Single-Round Group Membership Algorithms
Document Type
Conference
Source
Fourth IEEE International Symposium on Network Computing and Applications Network Computing and Applications, Fourth IEEE International Symposium on. :159-170 2005
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Wide area networks
Protocols
Delay
Laboratories
Communication systems
Resumes
Contracts
US Government
Computer applications
Computer networks
Language
Abstract
A recent theoretical result proposed Sigma, a novel GM protocol that forms views using a singleround of message exchange. Prior GM protocols have required more rounds in the worst-case. In this paper, we investigate how well Sigma performs in practice. We simulate Sigma using WAN connectivity traces and compare its performance to two leading GM protocols, Moshe and Ensemble. Our simulations show, consistently with theoretical results, that Sigma always terminates within one round of message exchange, faster than Moshe and Ensemble. Moreover, Sigma has less message overhead and produces virtually the same quality of views. We also observe that view-oriented GM in dynamic WAN-like environments is practical only in applications where GM need not respond to every disconnect immediately when detected. These applications are able, and prefer, to delay GM response and ignore transient disconnects, avoiding frequent futile view changes and associated overhead. We reference some applications in this category.