A measure of information reuse to compare distributed protocols

Authors:
F.Arcelli Fontana;F Formato;Remo Pareschi
Affiliations:
University of Salerno, Dept. di Ingegneria, I-84084, Fisciano, Italy;University of Salerno, Dept. di Ingegneria, I-84084, Fisciano, Italy;Rank Zerox Research Centre, Grenoble, France
Venue:
Computer Communications
Year:
1998

Citing 5
Cited 0

Linear logic

Theoretical Computer Science
Evaluating research in cooperative distributed problem solving

Distributed artificial intelligence: vol. 2
Communication as fair distribution of knowledge

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Constraint-based protocols for distributed problem solving

Science of Computer Programming - Special issue on concurrent constraint programming
Trends in Cooperative Distributed Problem Solving

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.24

Visualization

Abstract

In the framework of distributed problem solving we introduce two communication protocols, the request-subrequest protocol and the local-caching protocol, which are based on the hypothesis of minimal and maximal reuse of available information, respectively. The optimal solution of a distributed problem can be reached according to different protocols. The notion of measure of reuse related to each protocol has been formally introduced to provide a criterion to compare and to choose the right protocol.