Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-29T08:51:44.697Z Has data issue: false hasContentIssue false
  • English
  • Français

Searching for searchers

Part of: Theory of data Markov processes Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Colin L. Mallows  and
Jean Meloche
Colin L. Mallows*
Affiliation:
Avaya Labs
Jean Meloche*
Affiliation:
Avaya Labs
*
∗Postal address: Avaya Labs, 233 Mt. Airy Road, Basking Ridge, NJ 07920, USA.
∗Postal address: Avaya Labs, 233 Mt. Airy Road, Basking Ridge, NJ 07920, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We describe a search problem that has arisen in the context of network monitoring. Abstractly, a known (very large) region may contain one or more ‘agents’. Starting with just one agent, we search until another agent is found; this new agent can assist in the remaining search, and so on recursively.

Keywords

Searchexplorationfunctional equation

MSC classification

Primary: 68P10: Searching and sorting 60J85: Applications of branching processes
Secondary: 90B40: Search theory 39B99: None of the above, but in this section
Type
Research Article
Information
Journal of Applied Probability , Volume 43 , Issue 3 , September 2006 , pp. 899 - 904
Copyright
© Applied Probability Trust 2006 

References

Knuth, D. E. (1998). The Art of Computer Programming, Vol. 3, Sorting and Searching. Addison-Wesley, Reading, MA.Google Scholar
Mallows, C. and Shepp, L. (2005). B-stability. J. Appl. Prob. 42, 581–586.Google Scholar