A study on efficient information searches with agents for large-scale networks

We discuss an efficient method for information searching by the aids of agents, in a super-distributed information space like the Internet. First, we classify the information searching models according to the number and mobility of agents. Second, we propose the optimum searching method which minimizes communication and time costs for a simple model. Third, we propose the searching methods for another model by modifying the optimum method and show that the proposed method can decrease the communication and time cost compared with the conventional searching method