Logo image
Back
Peer-to-Peer Data Lookup for Multi-agent Systems
Book chapter   Peer reviewed

Peer-to-Peer Data Lookup for Multi-agent Systems

Michael Thomas, William Regli and Martin Russell Thomas
Agents and Peer-to-Peer Computing, pp 201-212
2005
DOI: https://doi.org/10.1007/11574781_19

Abstract

Agent Framework Distribute Hash Table Intelligent Agent Mobile Agent Network Node
Systems such as Napster and Gnutella demonstrated the potential of peer-to-peer data sharing. Similar schemes have been used to provide solutions that ensure information availability, survivability and reliability. Current techniques based on Distributed Hash Tables (DHTs) promise scalable solutions for efficient lookup when data is distributed across large networks. This paper considers how to adapt DHTs for use with multi-agent systems, with a goal of supporting distributed data storage and lookup on resource- constrained devices operating on dynamic networks. In existing DHTs, the network and the data are assumed to be static. In our context, sets of mobile agents manage the data. We present a multi-agent approach for building CAN-based DHTs. DHT access is provided through a DHT Agent Service. An extension of the standard CAN lookup algorithm is presented which allows more efficient index maintenance for highly mobile agents. Empirical results verify that the agent-based CAN achieves the expected scalability.

Metrics

12 Record Views
1 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Artificial Intelligence
Computer Science, Information Systems
Computer Science, Theory & Methods
Logo image