Mobile Agent-Based Search for Service Discovery on Dynamic Peer-to-Peer Networks

Evan A. Sultanik

No fixed memory deterministic algorithm can locate a service in a network in a fixed amount of time. We propose a fixed-memory randomized method for approximating the location of a service in a dynamic network with a probabilistic certainty in a fixed amount of time.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.