Towards bidirectional distributed matchmaking

ABSTRACT

Matchmaking is the process of introducing two or more agents to each other. Current matchmaking techniques are unidirectional and fail to address large-scale and highly dynamic systems with time constraints. We propose a new distributed technique which scales well, and still maintains relatively low matchmaking time and communication overhead. Our technique introduces very low storage and computational overhead to the agents. We suggest using a matching cache which can take advantage of the multidirectional nature of the matchmaking problem. We empirically evaluate the proposed technique on bilateral matchmaking and show that it out-performs the existing techniques.

REFERENCES

• 1: Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
• 2: Vassilios V. Dimakopoulos , Evaggelia Pitoura, On the Performance of Flooding-Based Resource Discovery, IEEE Transactions on Parallel and Distributed Systems, v.17 n.11, p.1242-1252, November 2006 [doi>10.1109/TPDS.2006.161]
• 3: Farnoush Banaei-Kashani , Cyrus Shahabi, Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems", Proceedings of the 3st International Symposium on Cluster Computing and the Grid, p.351, May 12-15, 2003
• 4: M. Koubarakis. Multi-agent systems and peer-to-peer computing: Methods, systems, and challenges. In M. Klusch, S. Ossowski, A. Omicini, and H. Laamanen, editors, CIA, volume 2782 of Lecture Notes in Computer Science, pages 46--61. Springer, 2003.
• 5: Elth Ogston , Stamatis Vassiliadis, Matchmaking among minimal agents without a facilitator, Proceedings of the fifth international conference on Autonomous agents, p.608-615, May 2001, Montreal, Quebec, Canada [doi>10.1145/375735.376467]
• 6: Onn Shehory, A Scalable Agent Location Mechanism, 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),, p.162-172, July 15-17, 1999
• 7: Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.149-160, August 2001, San Diego, California, United States

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.1 Applications and Expert Systems

General Terms:
Algorithms, Experimentation, Performance

Keywords:
distributed, evaluation, matchmaking, peer to peer