Cache Updates in a Peer-to-Peer Network of Mobile Agents
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Confidence-based grid service discovery
International Journal of Web and Grid Services
Fluctuated peer selection policy and its performance in large-scale multi-agent systems
Web Intelligence and Agent Systems
Creating and maintaining replicas in unstructured peer-to-peer systems
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 0.00 |
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem are based on a central directory that maintains a mapping between agents and resources. However, such solutions do not scale well since the central directory becomes a bottleneck in terms of both performance and reliability. In this paper, we introduce a different approach: each agent maintains a limited size local cache in which it keeps information about \kappa different resources, that is, for each of \kappa resources, it stores the contact information of one agent that provides it. This creates a directed network of caches. We address the following fundamental problem: how can an agent that needs a particular resource find an agent that provides it by navigating through this network of caches? We propose and analytically compare the performance of three different algorithms for this problem, flooding,teeming and random paths, in terms of three performance measures: the probability to locate the resource, the number of steps and the number of messages to do so. Our analysis is also applicable to distributed search in unstructured peer-to-peer networks.