Given an n-nodes network and an assertion G expressing its correctness, it is shown that G can be decomposed into collection of n local assertions and n.(n-1) “communication” assertions. The special case of a 2-nodes network is first examined, and it is shown how the notion of Galois connections in lattice theory is a basic tool for the… (More)
X.509 certificates can be used to store attributes about its owner, and so can on-line directory systems such as LDAP. In this paper we explore the option of putting little or no data in the certificate itself, and all data in LDAP databases. We show how this approach completely changes the role of the Registration Authority, resulting in a more flexible… (More)
This paper describes the design and implementation of a dynamic threshold policy (to be used to classify local node availability, for load-balancing purpose). The experiments were built upon the Extended Gradient algorithm, running over Linux/X86 computing nodes. Results validating the usefulness of the dynamic threshold policy are presented.