Name
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. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0140-3664(98)00154-6 | Computer Communications |
Keywords | Field | DocType |
Request-subrequest protocol,Local-caching protocol,Lemma-caching | Two-phase commit protocol,Computer science,Computer network,General Inter-ORB Protocol,Interior gateway protocol,Internet Protocol Control Protocol,Internetwork protocol,Distributed computing,Zone Routing Protocol,Universal composability,Communications protocol | Journal |
Volume | Issue | ISSN |
21 | 10 | Computer Communications |
Citations | PageRank | References |
1 | 0.37 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| F.Arcelli Fontana | 1 | 1 | 0.37 |
| F Formato | 2 | 1 | 0.37 |
| Remo Pareschi | 3 | 601 | 162.52 |