Abstract
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.
Original language | English |
---|---|
Pages | 124-131 |
Number of pages | 8 |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 2nd International Conference on Autonomous Agents - Minneapolis, MN, USA Duration: 9 May 1998 → 13 May 1998 |
Conference
Conference | Proceedings of the 1998 2nd International Conference on Autonomous Agents |
---|---|
City | Minneapolis, MN, USA |
Period | 9/05/98 → 13/05/98 |