Query restart strategies for web agents

Prasad Chalasani, Somesh Jha, Onn Shehory and Katia Sycara
Conference Paper, Autonomous Agents, pp. 124-131, May, 1998

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


With the explosive growth of the internet, autonomous agents will increasingly need strategies for efficiently retrieving information. The time an agent (or server) takes to answer a query issued to it is often a random variable, whose distribution can be estimated by collecting statistics. When an agent A sends a query to another agent B and the query has not completed in some period of time, agent A faces the dilemma of whether to continue waiting or reissue the query (to agent B or to a different one). When some information is available about the probability distribution of the query completion time of the agents, it is possible to devise schemes for agents to reissue queries in such a way that the expected query completion time is reduced significantly. We design such schemes for various models of query-answering agents. Where meaningful, we take into account the cost of sending a query to an agent.

author = {Prasad Chalasani and Somesh Jha and Onn Shehory and Katia Sycara},
title = {Query restart strategies for web agents},
booktitle = {Autonomous Agents},
year = {1998},
month = {May},
pages = {124-131},
} 2017-09-13T10:49:33-04:00