Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 25, 2001 | Submitted
Report Open

Designing Directories in Distributed Systems: A Systematic Framework

Abstract

This paper proposes a framework for the systematic design of directory-based distributed applications. We evaluate a space of directory designs using our framework. We present a case study consisting of design, implementation and analysis of directories for a multicast application. Our framework is based on a model that extends the formal concept of process knowledge in distributed systems. This concept is used informally in phrases such as "process p knows when it is in state s that process q is active." We show that this definition of knowledge is too strong for many distributed applications, including directory design. We propose a weaker concept: estimation. We define the meaning of phrases of the form: "process p in state s estimates with probability 0.9 that process q is active." We specify directory design as an optimization problem with the objective function of maximizing estimation probabilities, and with constraints on the amount of bandwidth, computation and storage used. We show how this specification helps in a systematic analysis of alternative directory designs.

Additional Information

© 1996 California Institute of Technology. This research was supported in part by the National Science Foundation grants CCR-912008 and CCR-9527130. This work is part of the Caltech Infospheres Project, which described more completely at http:/www.cs.caltech.edu/~adam/CALTECH/infospheres.html

Attached Files

Submitted - postscript.pdf

Submitted - postscript.ps

Files

postscript.pdf
Files (353.7 kB)
Name Size Download all
md5:e841ef009a3334ad1f9f4de79215697a
150.2 kB Download
md5:d63013de9055d85b49301290859f6ff7
203.5 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023