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.
ARCELLI FONTANA, F., Formato, F., Pareschi, R. (1998). A measure of information reuse to compare distributed protocols. COMPUTER COMMUNICATIONS, 21(10), 924-929 [10.1016/S0140-3664(98)00154-6].
A measure of information reuse to compare distributed protocols
ARCELLI FONTANA, FRANCESCA;
1998
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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
