DMCA
Analysis of X.500 Distributed Directory Refresh Strategies
BibTeX
@MISC{Teorey_analysisof,
author = {Toby J. Teorey and Guy A. Fasulo and Guy A. Fasulo and Kevin H. Klinge and Kevin H. Klinge and Sailesh Makkapati and Sailesh Makkapati and David W. Bachmann and David W. Bachmann and Michael H. Kamlet and Michael H. Kamlet and Professor Toby and J. Teorey and Michael A. Bauer and Michael A. Bauer and J. Michael Bennett and J. Michael Bennett},
title = {Analysis of X.500 Distributed Directory Refresh Strategies},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Distributed database directory refresh strategies, commonly recommended for the X.500 standard, are defined and analytically modeled for variations on push/pull and total/differential under idealistic asynchronous control conditions. The models are implemented in a HyperCard-based tool called DirMod (for "directory model"). Experimental test results show important elapsed time performance tradeoff among the different strategies, and live test data contribute to the verification of the models. 1. Introduction Overview In distributed systems, one major concern is the mapping of names to services. A directory provides this mechanism. The problem of replicating directory information and maintaining the data (updating...) is still being addressed. We choose to study the emerging X.500 standard for directories since Quipu (an implementation of X.500) is readily available [Kille89, KRRT90], and this would be ideal for experimentation to discover the good, the bad and the ugly about directorie...
Keyphrases
distributed directory refresh strategy different strategy important elapsed time performance tradeoff hypercard-based tool directory information push pull idealistic asynchronous control condition experimental test result major concern available kille89 database directory refresh strategy introduction overview directory model live test data contribute distributed system
