Peer-to-peer data lookup for multi-agent systems

  • Authors:
  • Michael Thomas;William Regli

  • Affiliations:
  • Department of Computer Science, College of Engineering, Drexel University, Philadelphia, PA;Department of Computer Science, College of Engineering, Drexel University, Philadelphia, PA

  • Venue:
  • AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.