DocumentCode
2674015
Title
Properties of membership services
Author
Hiltunen, Matti A. ; Schlichting, Richard D.
Author_Institution
Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA
fYear
1995
fDate
25-27 Apr 1995
Firstpage
200
Lastpage
207
Abstract
A membership service is used in a distributed system to maintain information about which sites are functioning and which have failed at any given time. Such services have proven to be fundamental for constructing distributed applications, with many example services and algorithms defined in the literature. Despite these efforts, however, little has been done on examining the abstract properties important to membership independent of a given service. Here, these properties are identified and characterized. Message ordering graphs are used to specify the effect of each property on the message flow as seen by the application, and dependency graphs are used to characterize the relationship between properties. These graphs help differentiate existing services, as well as facilitate the design of new services in which only those properties actually required by an application are included
Keywords
distributed processing; fault tolerant computing; graph theory; message passing; system recovery; abstract properties; application; dependency graphs; distributed system; failed sites; functioning sites; information; membership services; message flow; message ordering graphs; new service design; Application software; Communication networks; Computer architecture; Computer networks; Computer science; Degradation; Intersymbol interference; Protocols; Software maintenance; Software standards;
fLanguage
English
Publisher
ieee
Conference_Titel
Autonomous Decentralized Systems, 1995. Proceedings. ISADS 95., Second International Symposium on
Conference_Location
Phoenix, AZ
Print_ISBN
0-8186-7087-8
Type
conf
DOI
10.1109/ISADS.1995.398973
Filename
398973
Link To Document