A Peer-to-Peer Approach to Resource Discovery in Multi-agent Systems

  • Vassilios V. Dimakopoulos
  • Evaggelia Pitoura
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2782)


A multi-agent system is a network of software agents that cooperate to solve problems. In open multi-agent systems, the agents that need resources provided by other agents are not aware of which agents provide the particular resources. We propose a fully distributed approach to this resource discovery problem. Each agent A maintains a limited size local cache in which it keeps information about k different resources, that is, for each of the k resources, it stores the contact information of one agent that provides it. The agents in the cache of agent A are called A’s neighbors. An agent searching for a resource contacts its local cache and if there is no information for the resource, it contacts its neighbors, which in turn contact their neighbors and so on until the resource is found in some cache. We consider variations of this flooding-based search and develop and verify by simulation analytical models of their performance for both uniformly random resource requests and for requests in the case of hot spots. Finally, we introduce two approaches to the problem of updating the caches: one that uses flooding to propagate the updates and one that builds on the notion of an inverted cache.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bauer, M.A., Wang, T.: Strategies for Distributed Search. In: CSC 1992, ACM Conference on Computer Science (1992)Google Scholar
  2. 2.
    Dimakopoulos, V.V., Pitoura, E.: A Peer-to-Peer Approach to Resource Discovery in Multi-Agent Systems (Extended Vesrion). Technical Report TR2003, Univ. of Ioannina, Dept. of Computer Science (June 2003), Also available at http://www.cs.uoi.gr/~pitoura/pub.html
  3. 3.
    Dimakopoulosand, V.V., Pitoura, E.: Performance Analysis of Distributed Search in Open Agent System. In: IPDPS 2003, International Parallel and Distributed Processing Symposium (2003)Google Scholar
  4. 4.
    Gnutella website. Technical report, http://gnutella.wego.com
  5. 5.
    Haas, Z., Halpern, J.Y., Li, L.: Gossip-Based Ad Hoc Routing. In: IEEE Proc. of INFOCOM 2002, pp. 1707–1716 (2002)Google Scholar
  6. 6.
    Harchol-Balter, M., Leighton, T., Lewin, D.: Resource Discovery in Distributed Networks. In: PODC 1999, Principles of Distributed Computing, pp. 229–337 (1999)Google Scholar
  7. 7.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. ICS 2002, 16th ACM Int’l Conf. on Supercomputing, pp. 84–95 (2002)Google Scholar
  8. 8.
    Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-Peer Computing. Technical Report HPL 2002-57, HP Technical Report (2002)Google Scholar
  9. 9.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM, pp. 161–172 (2001)Google Scholar
  10. 10.
    Rowstron, A., Druschel, P.: Storage Management and Caching in PAST, a Large-scale, Persistent Peer-to-Peer Storage Utility. In: Proc. of SOSP 2001, 18th ACM Symp. on Operating System Priciples, pp. 188–201 (2001)Google Scholar
  11. 11.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Proc. MMCN 2002, Multimedia Computing and Networking 2002(2002)Google Scholar
  12. 12.
    Shehory, O.: A scalable agent location mechanism. In: Jennings, N.R. (ed.) ATAL 1999. LNCS, vol. 1757, pp. 162–172. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  13. 13.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. of ACM SIGCOMM, pp. 149–160 (2001)Google Scholar
  14. 14.
    Sycara, K., Klusch, M., Widoff, S., Lu, J.: Dynamic Service Matchmaking Among Agents in Open Information Environments. SIGMOD Record 28(1), 47–53 (1999)CrossRefGoogle Scholar
  15. 15.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report UCB/CSD-01- 1141, U. C. Berkeley (April 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vassilios V. Dimakopoulos
    • 1
  • Evaggelia Pitoura
    • 1
  1. 1.Department of Computer ScienceUniversity of IoanninaIoanninaGreece

Personalised recommendations