A One-Round Algorithm for Virtually Synchronous Group Communication in Wide Are Networks (2002)
| Citations: | 2 - 2 self |
BibTeX
@MISC{Khazan02aone-round,
author = {Roger I Khazan},
title = {A One-Round Algorithm for Virtually Synchronous Group Communication in Wide Are Networks },
year = {2002}
}
OpenURL
Abstract
Group communication services, and especially those that implement Virtual Synchrony semantics, are powerful middleware systems that facilitate the development of fault-tolerant distributed applications. In this thesis, we present a high quality, theoretical design of a group communication service that implements Virtual Synchrony semantics and is aimed for deployment in wide-area networks (WANs). The design features a novel algorithm for implementing Virtual Synchrony semantics; the algorithm is more appropriate for WANs than the existing solutions because it involves fewer rounds of communication and operates in a scalable WAN-oriented architecture. The high quality of the design refers to the level of formality and rigor at which it is done: The design includes formal and precise specifications, algorithms, correctness







